Skip to content
Shadow Theory

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

Redundant and indispensable relation coordinates

Jeremy RodgersSection 7 of 16Original PDF ↗Publication DOI ↗

Redundant and indispensable relation coordinates

The nominated family may be wasteful: one of its members may already be determined by the readout together with the others, in which case its presence in the list changes nothing. We characterize this exactly.

Throughout this section fix α∈A\alpha\in A and write A−α:=A∖{α},RA−α=(rβ)β∈A−α ⁣:S→VA−α.(6.1) A_{-\alpha}:=A\setminus\{\alpha\}, \qquad R_{A_{-\alpha}}=(r_\beta)_{\beta\in A_{-\alpha}}\colon S\to V_{A_{-\alpha}} .\tag{6.1}

Definition 6.1 (Redundancy and indispensability).

The relation rαr_\alpha is redundant relative to pp and the remaining relations if it factors through their joint map, i.e. if there exists a function fα ⁣:T×VA−α→Vαf_\alpha\colon T\times V_{A_{-\alpha}}\to V_\alpha with rα=fα∘(p, RA−α).(6.2) r_\alpha=f_\alpha\circ\bigl(p,\ R_{A_{-\alpha}}\bigr).\tag{6.2} It is indispensable if no such factorization exists.

Theorem 6.2 (Indispensability criterion).

The following are equivalent.

  1. rαr_\alpha is indispensable.

  2. There exist s,s′∈Ss,s'\in S with p(s)=p(s′),rβ(s)=rβ(s′)for every β∈A−α,rα(s)≠rα(s′).(6.3) p(s)=p(s'), \qquad r_\beta(s)=r_\beta(s')\quad\text{for every }\beta\in A_{-\alpha}, \qquad r_\alpha(s)\neq r_\alpha(s').\tag{6.3}

Proof. We prove the contrapositive equivalence: rαr_\alpha is redundant if and only if no pair (6.3) exists, i.e. if and only if rαr_\alpha is constant on every fiber of the joint map g:=(p,RA−α) ⁣:S→T×VA−αg:=(p,R_{A_{-\alpha}})\colon S\to T\times V_{A_{-\alpha}}. This is the descent statement of Paper 1 [1] applied to gg; we give the argument in full.

Redundant ⇒\Rightarrow constant on fibers of gg. Suppose (6.2) holds and suppose g(s)=g(s′)g(s)=g(s'), i.e. p(s)=p(s′)p(s)=p(s') and rβ(s)=rβ(s′)r_\beta(s)=r_\beta(s') for all β≠α\beta\neq\alpha. Applying fαf_\alpha to the equal values g(s)=g(s′)g(s)=g(s') gives rα(s)=fα(g(s))=fα(g(s′))=rα(s′)r_\alpha(s)=f_\alpha(g(s))=f_\alpha(g(s'))=r_\alpha(s'). Hence no pair as in (6.3) can exist.

Constant on fibers of gg ⇒\Rightarrow redundant. Suppose that g(s)=g(s′)g(s)=g(s') implies rα(s)=rα(s′)r_\alpha(s)=r_\alpha(s'). Define fαf_\alpha on the image of gg by fα(g(s)):=rα(s)(s∈S),(6.4) f_\alpha\bigl(g(s)\bigr):=r_\alpha(s)\qquad(s\in S),\tag{6.4} The prescription (6.4) is well defined on Im(g)\mathop{\mathrm{Im}}(g) precisely by the assumed fiber-constancy: if g(s)=g(s′)g(s)=g(s') then the two prescribed values rα(s)r_\alpha(s) and rα(s′)r_\alpha(s') agree. Every point of Im(g)\mathop{\mathrm{Im}}(g) is of the form g(s)g(s), so fαf_\alpha is defined on all of Im(g)\mathop{\mathrm{Im}}(g). It remains to extend fαf_\alpha to the whole of T×VA−αT\times V_{A_{-\alpha}}, and we treat the two cases explicitly.

Case S≠∅S\neq\varnothing. Fix any s0∈Ss_0\in S and define fα(y):=rα(s0)f_\alpha(y):=r_\alpha(s_0) for every y∈(T×VA−α)∖Im(g)y\in\bigl(T\times V_{A_{-\alpha}}\bigr)\setminus\mathop{\mathrm{Im}}(g). This is legitimate because rα(s0)r_\alpha(s_0) is an element of VαV_\alpha, so Vα≠∅V_\alpha\neq\varnothing and a value is available. The extension changes nothing on Im(g)\mathop{\mathrm{Im}}(g), where (6.4) already fixes fαf_\alpha.

Case S=∅S=\varnothing. Then T=∅T=\varnothing: the readout p ⁣:S→Tp\colon S\to T is surjective by standing hypothesis, and the image of the empty map is empty, so T=p(S)=∅T=p(S)=\varnothing. Hence the product T×VA−α=∅T\times V_{A_{-\alpha}}=\varnothing as well, and the unique map ∅→Vα\varnothing\to V_\alpha, the empty map, serves as fαf_\alpha. It satisfies rα=fα∘gr_\alpha=f_\alpha\circ g vacuously as an identity of maps out of S=∅S=\varnothing, both sides being the empty map. So rαr_\alpha is redundant in this case, which is consistent: no witness pair (6.3) can exist in an empty source, so rαr_\alpha is not indispensable, exactly as the equivalence requires. (The two sides of the criterion agree here; the case is not merely set aside.)

In either case fαf_\alpha is defined on all of T×VA−αT\times V_{A_{-\alpha}} and satisfies rα=fα∘gr_\alpha=f_\alpha\circ g, which is (6.2).

Finally, “no pair as in (6.3)” is by inspection the same statement as “g(s)=g(s′)g(s)=g(s') implies rα(s)=rα(s′)r_\alpha(s)=r_\alpha(s')”, since the first two clauses of (6.3) say g(s)=g(s′)g(s)=g(s') and the third says rα(s)≠rα(s′)r_\alpha(s)\neq r_\alpha(s'). Negating both sides of the equivalence just proved yields ⇔\Leftrightarrow. ◻

The criterion is a genuine separation test, and it is the reason a long list of nominated relations is not thereby an economical one. A coordinate earns its place only by separating some pair of source states that the readout and all the other coordinates identify.

Corollary 6.3 (Strict coarsening on deletion).

Let ∼A\sim_A and ∼A−α\sim_{A_{-\alpha}} be the equivalence relations (3.5) induced by the full family and by the family with rαr_\alpha deleted, and let π ⁣:EA→EA−α\pi\colon E_A\to E_{A_{-\alpha}} be the canonical surjection of Proposition 7.1 below (with B=AB=A). Then always ∼A ⊆ ∼A−α\sim_A\ \subseteq\ \sim_{A_{-\alpha}}, and the following are equivalent:

  1. the inclusion is strict: ∼A ⊊ ∼A−α\sim_A\ \subsetneq\ \sim_{A_{-\alpha}};

  2. π\pi is not injective, i.e. deleting rαr_\alpha strictly coarsens the completion;

  3. rαr_\alpha is indispensable.

Proof. The inclusion ∼A⊆∼A−α\sim_A\subseteq\sim_{A_{-\alpha}} is immediate from (3.5), since the defining condition for ∼A\sim_A is the condition for ∼A−α\sim_{A_{-\alpha}} conjoined with the extra clause rα(s)=rα(s′)r_\alpha(s)=r_\alpha(s').

(1) ⇔\Leftrightarrow (3). Strictness means: there exist s,s′s,s' with s∼A−αs′s\sim_{A_{-\alpha}}s' but not s∼As′s\sim_A s'. Unwinding (3.5), this says p(s)=p(s′)p(s)=p(s') and rβ(s)=rβ(s′)r_\beta(s)=r_\beta(s') for all β≠α\beta\neq\alpha, while rα(s)≠rα(s′)r_\alpha(s)\neq r_\alpha(s'), which is exactly the witness (6.3). By Theorem 6.2 this holds iff rαr_\alpha is indispensable.

(1) ⇔\Leftrightarrow (2). By Proposition 3.4, EA≅S/ ⁣∼AE_A\cong S/\!\sim_A and EA−α≅S/ ⁣∼A−αE_{A_{-\alpha}}\cong S/\!\sim_{A_{-\alpha}}, and under these identifications π\pi is the canonical map S/ ⁣∼A → S/ ⁣∼A−αS/\!\sim_A\ \to\ S/\!\sim_{A_{-\alpha}} sending [s]A↦[s]A−α[s]_A\mapsto[s]_{A_{-\alpha}}, which is well defined by the inclusion just proved. This map is injective iff [s]A−α=[s′]A−α[s]_{A_{-\alpha}}=[s']_{A_{-\alpha}} implies [s]A=[s′]A[s]_A=[s']_A, i.e. iff ∼A−α ⊆ ∼A\sim_{A_{-\alpha}}\ \subseteq\ \sim_A, i.e. (given the reverse inclusion) iff the two relations are equal. Its failure is precisely strictness. ◻

Remark 23 (Irredundancy is not uniqueness of coordinates).

A family in which every member is indispensable is irredundant relative to the nomination. This is a statement about the given list, and it confers no uniqueness on the list. Different irredundant families may induce the very same equivalence relation ∼A\sim_A and hence, by Proposition 3.4, the very same completion, Proposition 7.3 below exhibits an entire class of such rewritings. An irredundant list of relation coordinates must therefore not be confused with a preferred coordinate system on the completion.

The correct statement of the coordinate situation is a relative one, and we make it precisely. Relative to the fixed nominated family {rα}α∈A\{r_\alpha\}_{\alpha\in A}, the completion EAE_A does carry canonical structure maps: the readout projection uA ⁣:EA→Tu_A\colon E_A\to T and the relation coordinates ρα ⁣:EA→Vα\rho_\alpha\colon E_A\to V_\alpha of (3.3), which are part of the data of the terminal object and are determined by it. What EAE_A does not possess is a family-independent, intrinsically unique coordinate presentation: a system of coordinates singled out by the quotient alone, without reference to a nomination. Faithful reparameterizations (Proposition 7.3) and distinct irredundant families may present one and the same quotient in different coordinates, and the quotient does not choose among them. The invariant is EAE_A together with its structure maps for the given nomination; the coordinates are a presentation relative to that nomination.

Back to top ↑