Target-Relative Necessity of Completion: When Readout Loss Obstructs, and What a Sufficient Extension Must Retain
The joint target image and universal minimality
The joint target image and universal minimality
Theorem 7.1 gives a lower bound on the distinctions a completion must carry. We now show that the bound is attained within the category of readout extensions defined above: there is a completion carrying exactly those distinctions and no others, and it receives a canonical map from every other completion. Attainment here is a statement about the abstract construction ; whether a given physical situation supplies an operational realization of that completion is a separate matter, taken up after Theorem 8.3.
Definition 8.1 (Joint target image).
Define and let We regard as a map onto its image, , and write and for the restrictions to of the two coordinate projections of .
Proposition 8.2 ( is a -sufficient readout extension).
The map is a surjective readout extension of , with structure map , and it is sufficient for , with . Explicitly, Moreover the fibers of are exactly the sets for .
Proof. is surjective by construction, since was defined as the image of . No nonemptiness hypothesis is needed: if then as well, and the identities below hold vacuously.
For (20), let . Then , and applying the coordinate projections, The first identity says , so is a readout extension in the sense of Definition 6.1. The second says , so is -sufficient in the sense of Definition 6.3, with .
For the fibers: iff and , i.e. iff . ◻
We have thus verified directly, and not by appeal to any universal property, that does the job: it determines the readout value and it determines the correct answer. The next theorem says it does nothing more.
Theorem 8.3 (Universal factorization: is the coarsest -sufficient extension).
Let be any surjective readout extension of that is sufficient for , with structure map satisfying and solution map satisfying . Then there is a unique map namely and is surjective. Moreover intertwines the structure maps and the solution maps:
Proof. We proceed in five steps.
Step 1: and are uniquely determined by . This is Lemma 6.2 (1) for , and Lemma 6.5 for ; in both cases uniqueness follows from surjectivity of . We record the argument for once more, since it is used below: if both satisfy and , choose with ; then . Hence the formula (22) is unambiguous.
Step 2: is well defined as a map into . Define by ; this is manifestly a well-defined map into the product. We must check that its values lie in the subset . Let . By surjectivity of there is with . Then using and . Hence takes values in , and we may define by , i.e. by (22). (Note that (24) did not require the choice of to be canonical: was already defined without reference to , and was used only to certify membership in . So no well-definedness issue arises from the choice of preimage.)
Step 3: the factorization . Let . Then by (22) and the two factorizations through , Since was arbitrary, .
Step 4: is surjective. Let . By (19) there is with . Put . By Step 3, . Hence is onto .
Step 5: uniqueness of . Suppose both satisfy . Let . By surjectivity of choose with . Then As was arbitrary, . This is precisely the point at which surjectivity of , part of Definition 6.1 , is essential: without it, would be unconstrained on .
Corollary 8.4 (Information ordering).
Every -sufficient readout extension carries at least the distinctions encoded by the pair : for all , Equivalently, : the partition induced by refines the partition induced by . Thus is the coarsest readout extension sufficient for .
Proof. By Theorem 8.3, . If then , which is the contrapositive of (25). Hence . Since is itself -sufficient (Proposition 8.2), it is a -sufficient extension whose partition is refined by that of every other, i.e. it is coarsest among -sufficient extensions. ◻
Several points about Theorem 8.3 and Corollary 8.4 require care, and we state them explicitly.
The direction of the universal map. The canonical map runs from an arbitrary sufficient extension to the joint target image , not from to . This direction is forced and is not a convention. A surjection expresses that is at least as fine as , since it says the -value determines the -value. There is in general no map over : may retain distinctions that has discarded , distinctions irrelevant to but possibly relevant to other targets , and no map out of could recover them. Reversing the arrow would assert the opposite of what is true, namely that is the finest rather than the coarsest sufficient extension.
does not reconstruct the source. The joint target image retains exactly two things: the readout value , and the correct answer . It discards everything else, and in particular it identifies any two source states that agree on both. This is usually a massive collapse. In Section 11 the target is the spectrum of a charged Laplacian, and turns out to be a one-dimensional interval’s worth of data , the inversion quotient of holonomy , even though the source moduli space is strictly finer and the raw connections finer still. Nothing in Theorem 8.3 says or implies that the source is recoverable; on the contrary, Corollary 8.4 says the source is generally not recoverable from , because is one of the sufficient extensions and the canonical map goes , not back.
One target at a time. Theorem 8.3 is a statement about a single correct-answer map . If one nominates a family of targets, the coarsest extension sufficient for all of them simultaneously must, by Theorem 7.1 applied to each member, separate every pair of source states on which some member’s answer differs. It is therefore at least as fine as the completion required by each individual member, and it may be strictly finer. It need not be: should the remaining members contribute no distinctions beyond those already forced by one of them, the family completion coincides with that member’s individual completion. Which case obtains depends on the family, and the construction in general requires machinery we do not develop here; that is the subject of [9]. Within the present paper, “minimal” always means “minimal for the nominated ,” and we will see in Section 11 that the minimal completion for the spectral target is strictly insufficient for a transport target on the same source space.
What the universal property does and does not supply. Theorem 8.3 establishes that is the coarsest sufficient extension in the category of set-theoretic source quotients and readout extensions defined in this paper: among all -sufficient extensions, it is the one carrying the fewest distinctions, and every other maps canonically onto it. Because the construction of refers explicitly to the correct-answer map , the theorem is an information-theoretic characterization of the least distinctions any sufficient extension must carry; it identifies the floor abstractly, from the data . It does not, however, furnish an operational procedure for extracting from the original readout , indeed Corollary 3.2, Proposition 3.4 show that no such extraction from alone exists when is obstructed , and it does not by itself exhibit a physically measurable, experimentally accessible, or independently specified realization of . A concrete physical repair is a separate task: it must independently provide an extension and an answer map through which factors, and must justify that and are available in the situation at hand. The universal property then locates any such repair relative to the floor , it certifies that carries at least the distinctions of , but the provision and justification of and lie outside what the abstract quotient construction delivers. The flat-connection example of Section 9, Section 11 supplies exactly such an independently specified extension, the charged spectrum, and it is that concrete construction, not Theorem 8.3 alone, that makes the repair physical.