Manuscript X-F-ST@1 · X-F-ST.tex · section · e71f03ef

Installed evaluations are not acquired fields

Finite supplied evaluations and the complete Enter interface › Installed evaluations are not acquired fields · lines 2236–2256

Back to manuscript

A finite dictionary specifies fixed data, a tree label, and supplied smooth free inputs. Its values are, for example,

a_{i} = T_{mat, i} [u_{i}], a_{j} = T_{mix, j} [h_{j}; u_{j}, r_{j}], a_{l} = T_{self, l} [u_{l}, r_{l}] .

Polarized evaluations are also allowed. Theorem thm:continuity makes each finite evaluation continuous on its declared data stage.

The table stores rational reports or certified enclosures. Arbitrary smooth fields and arbitrary real numbers are not assumed to have finite exact descriptions. No detector coupling to these continuum functionals, field-to-qubit preparation, or unknown-field acquisition is supplied.

Displayed formulas in this passage

unlabeled · line 2241
$a_{i} = T_{mat, i} [u_{i}], a_{j} = T_{mix, j} [h_{j}; u_{j}, r_{j}], a_{l} = T_{self, l} [u_{l}, r_{l}] .$