Source–Readout Non-Equivalence: Descent and Equivariant Reconstruction Obstructions
The source–readout non-equivalence theorem
The source–readout non-equivalence theorem
The threads can now be drawn together.
Theorem 10.1 (Source–readout non-equivalence).
Let be a realization space with declared physical equivalence , let be the reduced source space, and let be the induced surjective readout, as in Section 2. Suppose at least one of the following holds.
(Descent obstruction.) There is a physically meaningful source relation and a pair with
(Equivariant obstruction.) A group acts on and on , the map is equivariant, and some satisfies
Then is not injective, so in the sense of Definition 3.3. More precisely:
under (D), the relation does not descend to , and hence is not source-complete for ;
under (E), no -equivariant section exists;
in either case, continues to hold exactly.
Proof. Assume (D). Corollary 4.3 applied to shows that does not descend, giving conclusion (1). Moreover forces , while ; hence identifies two distinct points of and is not injective.
Assume (E). Corollary 6.6 excludes a -equivariant section, giving conclusion (2). For noninjectivity, observe that cannot be a singleton: if , then by (18) every maps into , forcing for every and hence , contradicting the hypothesis that this set is empty. So , and is not injective by Proposition 3.2.
Conclusion (3) is Proposition 3.1, whose proof uses nothing beyond surjectivity of and the definition (7) of , and is therefore unaffected by either hypothesis. ◻
Theorem 10.1 claims exactly what its hypotheses support, and it is worth being explicit about the division of labor among them, because each part is doing work that none of the others can do.
The declaration of determines which source distinctions are genuine. Without it there is no fact of the matter about whether a fiber contains physically distinct states or merely redundant descriptions of one state, and Remark 7.4 shows that the two possibilities give opposite verdicts on identical mathematics.
Hypothesis (D) determines which relations fail to descend. Coarseness of the readout alone does not identify anything as lost; a nominated relation , varying within a fiber, does.
Hypothesis (E) determines whether a symmetry-compatible representative can be selected at all. Coarseness alone does not exclude a section, and neither does noninjectivity; symmetry , or, in the topological setting of Proposition 9.3, characteristic-class data , does. Note what (E) does and does not deliver in the negative and positive cases respectively: its failure excludes every selector in the equivariant class, while its success certifies only that some equivariant selector exists, not that one is uniquely determined or canonical (Remark 6.5).
Conclusion (3) records what survives, and only that. The readout remains an exact, error-free presentation of the quotient : a bijection of sets, permitting transport of any structure already well defined on -classes. Whether the readout level is additionally lawful, self-consistent, or dynamically closed is not settled by conclusion (3) and would require separate descent or closure arguments. What is settled is that exactness of the presentation is compatible with, and says nothing against, the non-equivalence established by (1) and (2).
Finally, a boundary that the theorem does not cross. Theorem 10.1 is a theorem about a given , , , and (under (D) or (E)) a given or . It establishes non-equivalence relative to that identified lost relation or that reconstruction class. It does not establish, and cannot be used to establish, that any actual physical system possesses a source layer richer than its observed description; that would require producing the ingredients, not merely the theorem. Noninjectivity of a map is not by itself evidence of a physically real upstream source, and no abstract obstruction licenses an unrestricted ontological conclusion.