Source–Readout Non-Equivalence: Descent and Equivariant Reconstruction Obstructions
Descent of source relations
Descent of source relations
Nontriviality of a fiber is a statement about the map . To convert it into a statement about lost physics, one must exhibit a physically meaningful quantity that varies across a fiber. This section makes that precise.
Relations and descent
Let be a set of values and let be a source relation: a map assigning to each reduced source state a value that the theory regards as physically meaningful. Because the domain of is rather than , the relation is automatically invariant under physical equivalence; this is the payoff of having performed the reduction first. Concrete instances that arise in practice include a global transport class, a boundary relation, a correlation functional, a spectral invariant, or a source property required as an input by some further construction. Nothing in what follows depends on which; is an arbitrary map out of .
Definition 4.1 (Descent).
The relation descends through the readout if there exists a map
If descends, then is a function of the readout value alone, and an agent with access only to public data can evaluate . If does not descend, no such evaluation is possible, however the agent proceeds. It is only after descent has been established that it is legitimate to call an observable of the readout; a source relation is not observable at the readout level merely because it is physically meaningful at the source level.
Theorem 4.2 (Fiber–descent theorem).
Let . The following are equivalent.
There exists with .
is constant on every fiber of ; that is,
When these hold, is unique.
21. Suppose is constant on fibers. Fix . By surjectivity of the fiber is nonempty, so we may pick and set This prescription is independent of the choice of : any two elements of have the same image under , namely , so (12) forces them to have the same -value. Hence is a well-defined map . For arbitrary , applying (13) at with the representative itself gives , that is, .
Uniqueness. If then, since is surjective, every is of the form , and . Hence . ◻
Note that the proof of 21 requires only a choice of one representative per fiber for the purpose of evaluating a constant, and the constancy hypothesis makes the choice immaterial. No choice principle is needed, and no representative survives into the conclusion. This is in sharp contrast to the selection problems of Section 5, Section 6, where the chosen representative is the output.
Corollary 4.3 (Descent obstruction).
Suppose there exist with Then does not descend through : there is no map with . Consequently no function of the readout alone reproduces on all of .
Proof. Condition (14) exhibits a fiber on which is not constant, so 2 of Theorem 4.2 fails, and therefore 1 fails. ◻
The content of Corollary 4.3 should not be mistaken for a restatement of noninjectivity of . Noninjectivity says that the fibers are not all singletons. Corollary 4.3 says something further and more specific: that a nominated physically meaningful quantity, one the theory actually cares about, is not among the quantities the readout carries. The hypothesis (14) is a statement one must earn by producing the relation ; it does not follow from coarseness of the readout by itself, since a noninjective readout may perfectly well transmit every relation the theory needs. This is the difference between observing that a map forgets something and identifying what it forgets.
Relative completeness
The preceding suggests grading the readout not absolutely but against a nominated family of relations.
Definition 4.4 (Relative source completeness; separation).
Let be a family of source relations on (with values in possibly different value sets). The readout is complete relative to if every descends through .
The family separates the points of if for all in there exists with .
Theorem 4.5 (Separating-family criterion).
Let separate the points of . Then the readout is complete relative to if and only if is bijective.
Proof. () If is bijective, then for any the map satisfies . Hence every relation whatsoever descends, in particular every member of .
() Suppose every descends, and let satisfy . By Theorem 4.2, each is constant on the fibers of , so for every . Since separates the points of , this forces . Hence is injective, and it is surjective by (3). ◻
Theorem 4.5 gives relative completeness an operational reading, but the reading is conditional and the condition must be checked. The theorem says that a readout is source-complete exactly when it carries a family of relations that separates source states. Whether that reading is operational depends entirely on whether the separating family has been identified as physically meaningful. An arbitrary separating family always exists , take to be all maps , or all indicator functions of points , and its existence tells one nothing, since its members need not correspond to anything a theory recognizes or an experiment can access. The theorem earns its interpretation only when is supplied by the physics.