Skip to content
Shadow Theory

Target-Relative Necessity of Completion: When Readout Loss Obstructs, and What a Sufficient Extension Must Retain

The joint target image and universal minimality

Jeremy RodgersSection 9 of 16Original PDF ↗Publication DOI ↗

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 EQ=Im⁡(p,aQ)E_Q=\operatorname{Im}(p,a_Q); 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 jQ ⁣:S⟶T×AQ,jQ(s):=(p(s),aQ(s)),(18) j_Q\colon S\longrightarrow T\times A_Q, \qquad j_Q(s):=\bigl(p(s),a_Q(s)\bigr),\tag{18} and let EQ:=Im⁡(jQ)={ (p(s),aQ(s)):s∈S }⊆T×AQ.(19) E_Q:=\operatorname{Im}(j_Q)=\bigl\{\,(p(s),a_Q(s)) : s\in S\,\bigr\}\subseteq T\times A_Q .\tag{19} We regard jQj_Q as a map onto its image, jQ ⁣:S→EQj_Q\colon S\to E_Q, and write πT ⁣:EQ→T\pi_T\colon E_Q\to T and πA ⁣:EQ→AQ\pi_A\colon E_Q\to A_Q for the restrictions to EQE_Q of the two coordinate projections of T×AQT\times A_Q.

Proposition 8.2 (EQE_Q is a QQ-sufficient readout extension).

The map jQ ⁣:S→EQj_Q\colon S\to E_Q is a surjective readout extension of pp, with structure map u=πTu=\pi_T, and it is sufficient for QQ, with b=πAb=\pi_A. Explicitly, p=πT∘jQ,aQ=πA∘jQ.(20) p=\pi_T\circ j_Q, \qquad\qquad a_Q=\pi_A\circ j_Q .\tag{20} Moreover the fibers of jQj_Q are exactly the sets Ft∩aQ−1(α)F_t\cap a_Q^{-1}(\alpha) for (t,α)∈EQ(t,\alpha)\in E_Q.

Proof. jQ ⁣:S→EQj_Q\colon S\to E_Q is surjective by construction, since EQE_Q was defined as the image of jQj_Q. No nonemptiness hypothesis is needed: if S=∅S=\emptyset then EQ=∅E_Q=\emptyset as well, and the identities below hold vacuously.

For (20), let s∈Ss\in S. Then jQ(s)=(p(s),aQ(s))∈EQj_Q(s)=(p(s),a_Q(s))\in E_Q, and applying the coordinate projections, πT(jQ(s))=πT(p(s),aQ(s))=p(s),πA(jQ(s))=πA(p(s),aQ(s))=aQ(s).\pi_T\bigl(j_Q(s)\bigr)=\pi_T\bigl(p(s),a_Q(s)\bigr)=p(s), \qquad \pi_A\bigl(j_Q(s)\bigr)=\pi_A\bigl(p(s),a_Q(s)\bigr)=a_Q(s). The first identity says p=πT∘jQp=\pi_T\circ j_Q, so (jQ,EQ,πT)(j_Q,E_Q,\pi_T) is a readout extension in the sense of Definition 6.1. The second says aQ=πA∘jQa_Q=\pi_A\circ j_Q, so jQj_Q is QQ-sufficient in the sense of Definition 6.3, with b=πAb=\pi_A.

For the fibers: jQ(s)=(t,α)j_Q(s)=(t,\alpha) iff p(s)=tp(s)=t and aQ(s)=αa_Q(s)=\alpha, i.e. iff s∈Ft∩aQ−1(α)s\in F_t\cap a_Q^{-1}(\alpha). ◻

We have thus verified directly, and not by appeal to any universal property, that EQE_Q 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: EQE_Q is the coarsest QQ-sufficient extension).

Let e ⁣:S→Ee\colon S\to E be any surjective readout extension of pp that is sufficient for QQ, with structure map u ⁣:E→Tu\colon E\to T satisfying p=u∘ep=u\circ e and solution map b ⁣:E→AQb\colon E\to A_Q satisfying aQ=b∘ea_Q=b\circ e. Then there is a unique map φE ⁣:E⟶EQsuch thatjQ=φE∘e,(21) \varphi_E\colon E\longrightarrow E_Q \qquad\text{such that}\qquad j_Q=\varphi_E\circ e,\tag{21} namely φE(x)=(u(x), b(x)),x∈E,(22) \varphi_E(x)=\bigl(u(x),\,b(x)\bigr), \qquad x\in E,\tag{22} and φE\varphi_E is surjective. Moreover φE\varphi_E intertwines the structure maps and the solution maps: πT∘φE=u,πA∘φE=b.(23) \pi_T\circ\varphi_E=u, \qquad\qquad \pi_A\circ\varphi_E=b .\tag{23}

Proof. We proceed in five steps.

Step 1: uu and bb are uniquely determined by ee. This is Lemma 6.2 (1) for uu, and Lemma 6.5 for bb; in both cases uniqueness follows from surjectivity of ee. We record the argument for bb once more, since it is used below: if b,b′b,b' both satisfy aQ=b∘e=b′∘ea_Q=b\circ e=b'\circ e and x∈Ex\in E, choose ss with e(s)=xe(s)=x; then b(x)=b(e(s))=aQ(s)=b′(e(s))=b′(x)b(x)=b(e(s))=a_Q(s)=b'(e(s))=b'(x). Hence the formula (22) is unambiguous.

Step 2: φE\varphi_E is well defined as a map into EQE_Q. Define ψ ⁣:E→T×AQ\psi\colon E\to T\times A_Q by ψ(x):=(u(x),b(x))\psi(x):=(u(x),b(x)); this is manifestly a well-defined map into the product. We must check that its values lie in the subset EQE_Q. Let x∈Ex\in E. By surjectivity of ee there is s∈Ss\in S with e(s)=xe(s)=x. Then ψ(x)=(u(e(s)), b(e(s)))=(p(s), aQ(s))=jQ(s)∈EQ,(24) \psi(x)=\bigl(u(e(s)),\,b(e(s))\bigr)=\bigl(p(s),\,a_Q(s)\bigr)=j_Q(s)\in E_Q,\tag{24} using p=u∘ep=u\circ e and aQ=b∘ea_Q=b\circ e. Hence ψ\psi takes values in EQE_Q, and we may define φE ⁣:E→EQ\varphi_E\colon E\to E_Q by φE:=ψ\varphi_E:=\psi, i.e. by (22). (Note that (24) did not require the choice of ss to be canonical: ψ(x)\psi(x) was already defined without reference to ss, and ss was used only to certify membership in EQE_Q. So no well-definedness issue arises from the choice of preimage.)

Step 3: the factorization jQ=φE∘ej_Q=\varphi_E\circ e. Let s∈Ss\in S. Then by (22) and the two factorizations through ee, φE(e(s))=(u(e(s)), b(e(s)))=(p(s), aQ(s))=jQ(s).\varphi_E\bigl(e(s)\bigr) =\bigl(u(e(s)),\,b(e(s))\bigr) =\bigl(p(s),\,a_Q(s)\bigr) =j_Q(s). Since ss was arbitrary, jQ=φE∘ej_Q=\varphi_E\circ e.

Step 4: φE\varphi_E is surjective. Let y∈EQy\in E_Q. By (19) there is s∈Ss\in S with jQ(s)=yj_Q(s)=y. Put x:=e(s)∈Ex:=e(s)\in E. By Step 3, φE(x)=φE(e(s))=jQ(s)=y\varphi_E(x)=\varphi_E(e(s))=j_Q(s)=y. Hence φE\varphi_E is onto EQE_Q.

Step 5: uniqueness of φE\varphi_E. Suppose φ,φ′ ⁣:E→EQ\varphi,\varphi'\colon E\to E_Q both satisfy jQ=φ∘e=φ′∘ej_Q=\varphi\circ e=\varphi'\circ e. Let x∈Ex\in E. By surjectivity of ee choose s∈Ss\in S with e(s)=xe(s)=x. Then φ(x)=φ(e(s))=jQ(s)=φ′(e(s))=φ′(x).\varphi(x)=\varphi\bigl(e(s)\bigr)=j_Q(s)=\varphi'\bigl(e(s)\bigr)=\varphi'(x). As xx was arbitrary, φ=φ′\varphi=\varphi'. This is precisely the point at which surjectivity of ee , part of Definition 6.1 , is essential: without it, φE\varphi_E would be unconstrained on E∖Im⁡(e)E\setminus\operatorname{Im}(e).

Finally, (23) is immediate from (22): for x∈Ex\in E, πT(φE(x))=πT(u(x),b(x))=u(x)\pi_T(\varphi_E(x))=\pi_T(u(x),b(x))=u(x) and πA(φE(x))=πA(u(x),b(x))=b(x)\pi_A(\varphi_E(x))=\pi_A(u(x),b(x))=b(x). ◻

Corollary 8.4 (Information ordering).

Every QQ-sufficient readout extension e ⁣:S→Ee\colon S\to E carries at least the distinctions encoded by the pair (p,aQ)(p,a_Q): for all s0,s1∈Ss_0,s_1\in S, jQ(s0)≠jQ(s1)⟹e(s0)≠e(s1).(25) j_Q(s_0)\neq j_Q(s_1) \qquad\Longrightarrow\qquad e(s_0)\neq e(s_1).\tag{25} Equivalently, ∼e  ⊆  ∼jQ\sim_e\;\subseteq\;\sim_{j_Q}: the partition induced by ee refines the partition induced by jQj_Q. Thus EQE_Q is the coarsest readout extension sufficient for QQ.

Proof. By Theorem 8.3, jQ=φE∘ej_Q=\varphi_E\circ e. If e(s0)=e(s1)e(s_0)=e(s_1) then jQ(s0)=φE(e(s0))=φE(e(s1))=jQ(s1)j_Q(s_0)=\varphi_E(e(s_0))=\varphi_E(e(s_1))=j_Q(s_1), which is the contrapositive of (25). Hence ∼e⊆∼jQ\sim_e\subseteq\sim_{j_Q}. Since jQj_Q is itself QQ-sufficient (Proposition 8.2), it is a QQ-sufficient extension whose partition is refined by that of every other, i.e. it is coarsest among QQ-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 E⟶EQ,E\longrightarrow E_Q, from an arbitrary sufficient extension to the joint target image , not from EQE_Q to EE. This direction is forced and is not a convention. A surjection E→EQE\to E_Q expresses that EE is at least as fine as EQE_Q, since it says the EE-value determines the EQE_Q-value. There is in general no map EQ→EE_Q\to E over SS: EE may retain distinctions that EQE_Q has discarded , distinctions irrelevant to QQ but possibly relevant to other targets , and no map out of EQE_Q could recover them. Reversing the arrow would assert the opposite of what is true, namely that EQE_Q is the finest rather than the coarsest sufficient extension.

EQE_Q does not reconstruct the source. The joint target image retains exactly two things: the readout value p(s)p(s), and the correct answer aQ(s)a_Q(s). 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 EQE_Q turns out to be a one-dimensional interval’s worth of data , the inversion quotient of holonomy , even though the source moduli space U(1)\mathrm{U}(1) 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 EQE_Q, because id⁡S\operatorname{id}_S is one of the sufficient extensions ee and the canonical map goes S→EQS\to E_Q, not back.

One target at a time. Theorem 8.3 is a statement about a single correct-answer map aQa_Q. 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 QQ,” 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 EQE_Q is the coarsest sufficient extension in the category of set-theoretic source quotients and readout extensions defined in this paper: among all QQ-sufficient extensions, it is the one carrying the fewest distinctions, and every other maps canonically onto it. Because the construction of EQ=Im⁡(p,aQ)E_Q=\operatorname{Im}(p,a_Q) refers explicitly to the correct-answer map aQa_Q, the theorem is an information-theoretic characterization of the least distinctions any sufficient extension must carry; it identifies the floor abstractly, from the data (p,aQ)(p,a_Q). It does not, however, furnish an operational procedure for extracting aQa_Q from the original readout pp , indeed Corollary 3.2, Proposition 3.4 show that no such extraction from pp alone exists when QQ is obstructed , and it does not by itself exhibit a physically measurable, experimentally accessible, or independently specified realization of EQE_Q. A concrete physical repair is a separate task: it must independently provide an extension e ⁣:S→Ee\colon S\to E and an answer map b ⁣:E→AQb\colon E\to A_Q through which aQa_Q factors, and must justify that ee and bb are available in the situation at hand. The universal property then locates any such repair relative to the floor , it certifies that ee carries at least the distinctions of EQE_Q , but the provision and justification of ee and bb 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.

Back to top ↑