Canonical Minimal Source Completion: The Coarsest Readout Extension on which a Nominated Family of Source Relations Becomes Well Defined
Redundant and indispensable relation coordinates
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 and write
Definition 6.1 (Redundancy and indispensability).
The relation is redundant relative to and the remaining relations if it factors through their joint map, i.e. if there exists a function with It is indispensable if no such factorization exists.
Theorem 6.2 (Indispensability criterion).
The following are equivalent.
is indispensable.
There exist with
Proof. We prove the contrapositive equivalence: is redundant if and only if no pair (6.3) exists, i.e. if and only if is constant on every fiber of the joint map . This is the descent statement of Paper 1 [1] applied to ; we give the argument in full.
Redundant constant on fibers of . Suppose (6.2) holds and suppose , i.e. and for all . Applying to the equal values gives . Hence no pair as in (6.3) can exist.
Constant on fibers of redundant. Suppose that implies . Define on the image of by The prescription (6.4) is well defined on precisely by the assumed fiber-constancy: if then the two prescribed values and agree. Every point of is of the form , so is defined on all of . It remains to extend to the whole of , and we treat the two cases explicitly.
Case . Fix any and define for every . This is legitimate because is an element of , so and a value is available. The extension changes nothing on , where (6.4) already fixes .
Case . Then : the readout is surjective by standing hypothesis, and the image of the empty map is empty, so . Hence the product as well, and the unique map , the empty map, serves as . It satisfies vacuously as an identity of maps out of , both sides being the empty map. So is redundant in this case, which is consistent: no witness pair (6.3) can exist in an empty source, so 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 is defined on all of and satisfies , which is (6.2).
Finally, “no pair as in (6.3)” is by inspection the same statement as “ implies ”, since the first two clauses of (6.3) say and the third says . Negating both sides of the equivalence just proved yields . ◻
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 and be the equivalence relations (3.5) induced by the full family and by the family with deleted, and let be the canonical surjection of Proposition 7.1 below (with ). Then always , and the following are equivalent:
the inclusion is strict: ;
is not injective, i.e. deleting strictly coarsens the completion;
is indispensable.
Proof. The inclusion is immediate from (3.5), since the defining condition for is the condition for conjoined with the extra clause .
(1) (3). Strictness means: there exist with but not . Unwinding (3.5), this says and for all , while , which is exactly the witness (6.3). By Theorem 6.2 this holds iff is indispensable.
(1) (2). By Proposition 3.4, and , and under these identifications is the canonical map sending , which is well defined by the inclusion just proved. This map is injective iff implies , i.e. iff , 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 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 , the completion does carry canonical structure maps: the readout projection and the relation coordinates of (3.3), which are part of the data of the terminal object and are determined by it. What 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 together with its structure maps for the given nomination; the coordinates are a presentation relative to that nomination.