Skip to content
Shadow Theory

Canonical Minimal Source Completion: The Coarsest Readout Extension on which a Nominated Family of Source Relations Becomes Well Defined

The joint-image construction and its quotient realization

Jeremy RodgersSection 4 of 16Original PDF ↗Publication DOI ↗

The joint-image construction and its quotient realization

Definition 3.1 (Minimal relation completion).

Define the joint map jA ⁣:S⟶T×VA,jA(s)=(p(s),RA(s)),(3.1) j_A\colon S\longrightarrow T\times V_A, \qquad j_A(s)=\bigl(p(s),R_A(s)\bigr),\tag{3.1} and define the minimal relation completion EA:=Im(jA) ⊆ T×VA.(3.2) E_A:=\mathop{\mathrm{Im}}(j_A)\ \subseteq\ T\times V_A .\tag{3.2} Let eA ⁣:S↠EAe_A\colon S\twoheadrightarrow E_A, eA(s):=jA(s)e_A(s):=j_A(s), be the induced surjection, and let uA ⁣:EA⟶T,ρα ⁣:EA⟶Vα(α∈A)(3.3) u_A\colon E_A\longrightarrow T, \qquad \rho_\alpha\colon E_A\longrightarrow V_\alpha \qquad(\alpha\in A)\tag{3.3} be the restrictions to EAE_A of the coordinate projections of T×VAT\times V_A.

Proposition 3.2 (Factorization).

The maps of Definition 3.1 satisfy p=uA∘eA,rα=ρα∘eA(α∈A),(3.4) p=u_A\circ e_A, \qquad r_\alpha=\rho_\alpha\circ e_A \qquad(\alpha\in A),\tag{3.4} and eAe_A is surjective. In particular every nominated relation descends to EAE_A.

Proof. Surjectivity of eAe_A is immediate, since EAE_A was defined as the image of jAj_A and eAe_A is jAj_A with codomain restricted to that image. For s∈Ss\in S we have eA(s)=(p(s),(rα(s))α∈A)e_A(s)=(p(s),(r_\alpha(s))_{\alpha\in A}). Applying the first coordinate projection gives uA(eA(s))=p(s)u_A(e_A(s))=p(s), and applying the projection onto the α\alpha-th factor of VAV_A gives ρα(eA(s))=rα(s)\rho_\alpha(e_A(s))=r_\alpha(s). As ss was arbitrary, (3.4) holds as an identity of functions on SS. ◻

Thus (EA,eA,uA,(ρα)α∈A)(E_A,e_A,u_A,(\rho_\alpha)_{\alpha\in A}) solves the existence half of Definition 2.2. The content of the paper is that it solves the minimality and uniqueness halves as well.

The induced equivalence relation

Definition 3.3.

Define a relation ∼A\sim_A on SS by s∼As′:⟺[ p(s)=p(s′)  and  rα(s)=rα(s′)  for every α∈A ].(3.5) s\sim_A s' \quad:\Longleftrightarrow\quad \bigl[\,p(s)=p(s')\ \text{ and }\ r_\alpha(s)=r_\alpha(s')\ \text{ for every }\alpha\in A\,\bigr].\tag{3.5}

This is an equivalence relation, being an intersection of pullbacks of equality relations along functions: reflexivity, symmetry, and transitivity for ∼A\sim_A follow coordinatewise from the corresponding properties of equality in TT and in each VαV_\alpha.

Proposition 3.4 (Quotient realization).

The assignment κ ⁣:S/ ⁣∼A ⟶ EA,κ([s]A):=jA(s)(3.6) \kappa\colon S/\!\sim_A\ \longrightarrow\ E_A, \qquad \kappa\bigl([s]_A\bigr):=j_A(s)\tag{3.6} is a well-defined bijection, and it satisfies κ∘πA=eA\kappa\circ\pi_A=e_A, where πA ⁣:S→S/ ⁣∼A\pi_A\colon S\to S/\!\sim_A is the canonical projection. Hence EA ≅ S/ ⁣∼A(3.7) E_A\ \cong\ S/\!\sim_A\tag{3.7} canonically.

Proof. We verify the three assertions separately, rather than invoking a generic isomorphism principle for quotients, since the well-definedness step is precisely where the definition of the relation ∼A\sim_A earns its keep.

Well-definedness. Suppose [s]A=[s′]A[s]_A=[s']_A, i.e. s∼As′s\sim_A s'. By (3.5) this means p(s)=p(s′)p(s)=p(s') and rα(s)=rα(s′)r_\alpha(s)=r_\alpha(s') for every α∈A\alpha\in A. Two elements of the product T×VAT\times V_A are equal precisely when all of their coordinates agree; and here the coordinates of jA(s)j_A(s) and jA(s′)j_A(s') are p(s),p(s′)p(s),p(s') in the TT-factor and rα(s),rα(s′)r_\alpha(s),r_\alpha(s') in the α\alpha-th factor of VAV_A, respectively. All agree, so jA(s)=jA(s′)j_A(s)=j_A(s'). Hence the value assigned by (3.6) does not depend on the chosen representative, and κ\kappa is a well-defined function.

Injectivity. Suppose κ([s]A)=κ([s′]A)\kappa([s]_A)=\kappa([s']_A), i.e. jA(s)=jA(s′)j_A(s)=j_A(s'). Comparing coordinates in T×VAT\times V_A gives p(s)=p(s′)p(s)=p(s') and rα(s)=rα(s′)r_\alpha(s)=r_\alpha(s') for every α∈A\alpha\in A, which is exactly (3.5). Hence s∼As′s\sim_A s' and [s]A=[s′]A[s]_A=[s']_A.

Surjectivity. Let x∈EAx\in E_A. By Definition 3.1, EA=Im(jA)E_A=\mathop{\mathrm{Im}}(j_A), so there is s∈Ss\in S with x=jA(s)=κ([s]A)x=j_A(s)=\kappa([s]_A).

Finally, for every s∈Ss\in S we have κ(πA(s))=κ([s]A)=jA(s)=eA(s)\kappa(\pi_A(s))=\kappa([s]_A)=j_A(s)=e_A(s), so κ∘πA=eA\kappa\circ\pi_A=e_A. ◻

So the joint image and the quotient by “agreement of the readout and of every nominated relation” are the same object, viewed extensionally and intensionally. The first description makes existence manifest; the second makes minimality manifest.

The information ordering

Proposition 3.5 (Information ordering).

As relations on SS, ΔS ⊆ ∼A ⊆ ∼p,(3.8) \Delta_S\ \subseteq\ \sim_A\ \subseteq\ \sim_p ,\tag{3.8} and consequently there is a factorization of the readout, S → eA  EA → uA  T.(3.9) S\ \xrightarrow{\ e_A\ }\ E_A\ \xrightarrow{\ u_A\ }\ T .\tag{3.9}

Proof. The first inclusion is reflexivity: s∼Ass\sim_A s for every ss, since p(s)=p(s)p(s)=p(s) and rα(s)=rα(s)r_\alpha(s)=r_\alpha(s). The second holds because the defining condition (3.5) contains the clause p(s)=p(s′)p(s)=p(s') as a conjunct; hence s∼As′s\sim_A s' implies s∼ps′s\sim_p s'. The factorization (3.9) is (3.4). ◻

The reading of (3.8) must be got right, because the direction of the inclusions encodes the direction of every universal arrow in the paper. A smaller equivalence relation identifies fewer pairs, hence corresponds to a finer partition and to more retained information. Thus (3.8) says: equality on SS retains everything; ∼A\sim_A retains at most that, and at least the readout; ∼p\sim_p retains the least of the three. The completion EAE_A refines the readout partition, but, this is the whole point of minimality, it need not refine it all the way down to individual source states.

What completion adds above a readout value

Proposition 3.6 (Completed fibers).

For every t∈Tt\in T there is a canonical bijection uA−1(t) ≅ RA(Ft)={ RA(s) : s∈Ft=p−1(t) } ⊆ VA.(3.10) u_A^{-1}(t)\ \cong\ R_A(F_t)=\{\,R_A(s)\ :\ s\in F_t=p^{-1}(t)\,\}\ \subseteq\ V_A .\tag{3.10}

Proof. Consider the second-coordinate projection prVA ⁣:T×VA→VA\mathrm{pr}_{V_A}\colon T\times V_A\to V_A and restrict it to uA−1(t)u_A^{-1}(t).

Its image is RA(Ft)R_A(F_t). An element x∈uA−1(t)x\in u_A^{-1}(t) lies in EA=Im(jA)E_A=\mathop{\mathrm{Im}}(j_A), so x=(p(s),RA(s))x=(p(s),R_A(s)) for some s∈Ss\in S; and uA(x)=tu_A(x)=t forces p(s)=tp(s)=t, i.e. s∈Fts\in F_t. Hence prVA(x)=RA(s)∈RA(Ft)\mathrm{pr}_{V_A}(x)=R_A(s)\in R_A(F_t). Conversely, given v=RA(s)v=R_A(s) with s∈Fts\in F_t, the point x=(t,v)=jA(s)x=(t,v)=j_A(s) lies in EAE_A and satisfies uA(x)=tu_A(x)=t, so vv is attained.

It is injective on uA−1(t)u_A^{-1}(t). If x,x′∈uA−1(t)x,x'\in u_A^{-1}(t) have the same VAV_A-coordinate, then they also share the TT-coordinate, namely tt; being elements of a product with all coordinates equal, x=x′x=x'.

Thus prVA\mathrm{pr}_{V_A} restricts to a bijection uA−1(t)→RA(Ft)u_A^{-1}(t)\to R_A(F_t), and this bijection was constructed without any choice. ◻

Proposition 3.6 answers exactly the question that “completion” invites one to ask badly. What sits above a readout value tt in EAE_A is not a preferred source state in FtF_t, and not an arbitrary enrichment of tt by extra labels. It is the set of realized relation signatures over tt: the distinct values that the nominated family actually takes on the fiber. Two source states in FtF_t that agree on every rαr_\alpha contribute the same completed state; nothing in the construction selects between them, and nothing in the construction can. We record this as a standing prohibition, because it is the failure mode that a naive completion invites.

Remark 10 (No selector, no section, no representative).

The construction of EAE_A uses no selection function on the fibers of pp, no section of pp, and no canonical representative of FtF_t; it requires no choice principle beyond forming the image of a function, and it produces none of these objects either. This should be stated precisely, since the point is about what the construction supplies, not about what is set-theoretically possible.

If one separately chooses a representative of each ∼A\sim_A-class, a choice that in general requires an appeal to a choice principle, and which is available when such a choice can be made, then the resulting set of chosen representatives is in bijection with EAE_A, by Proposition 3.4. Such a set is a noncanonical presentation of the completion. It carries no invariant information beyond what EAE_A already carries: the bijection depends on the choice, different choices give different presentations of the same quotient, and nothing in the completion distinguishes one of them. Crucially, no such presentation is supplied or privileged by the universal construction. The object EAE_A is defined without any choice whatever, as an image; and terminality (Theorem 5.1) yields only the surjections ϕE ⁣:E→EA\phi_{\mathcal E}\colon E\to E_A onto the completion. It furnishes no inverse to eAe_A, no canonical splitting, and no canonical representative selector. Whatever a representative-based presentation may be used for, it is extra structure imposed from outside, not a consequence of the theorem.

Back to top ↑