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
The joint-image construction and its quotient realization
Definition 3.1 (Minimal relation completion).
Define the joint map and define the minimal relation completion Let , , be the induced surjection, and let be the restrictions to of the coordinate projections of .
Proposition 3.2 (Factorization).
The maps of Definition 3.1 satisfy and is surjective. In particular every nominated relation descends to .
Proof. Surjectivity of is immediate, since was defined as the image of and is with codomain restricted to that image. For we have . Applying the first coordinate projection gives , and applying the projection onto the -th factor of gives . As was arbitrary, (3.4) holds as an identity of functions on . ◻
Thus 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 on by
This is an equivalence relation, being an intersection of pullbacks of equality relations along functions: reflexivity, symmetry, and transitivity for follow coordinatewise from the corresponding properties of equality in and in each .
Proposition 3.4 (Quotient realization).
The assignment is a well-defined bijection, and it satisfies , where is the canonical projection. Hence 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 earns its keep.
Well-definedness. Suppose , i.e. . By (3.5) this means and for every . Two elements of the product are equal precisely when all of their coordinates agree; and here the coordinates of and are in the -factor and in the -th factor of , respectively. All agree, so . Hence the value assigned by (3.6) does not depend on the chosen representative, and is a well-defined function.
Injectivity. Suppose , i.e. . Comparing coordinates in gives and for every , which is exactly (3.5). Hence and .
Surjectivity. Let . By Definition 3.1, , so there is with .
Finally, for every we have , so . ◻
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 , and consequently there is a factorization of the readout,
Proof. The first inclusion is reflexivity: for every , since and . The second holds because the defining condition (3.5) contains the clause as a conjunct; hence implies . 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 retains everything; retains at most that, and at least the readout; retains the least of the three. The completion 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 there is a canonical bijection
Proof. Consider the second-coordinate projection and restrict it to .
Its image is . An element lies in , so for some ; and forces , i.e. . Hence . Conversely, given with , the point lies in and satisfies , so is attained.
It is injective on . If have the same -coordinate, then they also share the -coordinate, namely ; being elements of a product with all coordinates equal, .
Thus restricts to a bijection , 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 in is not a preferred source state in , and not an arbitrary enrichment of by extra labels. It is the set of realized relation signatures over : the distinct values that the nominated family actually takes on the fiber. Two source states in that agree on every 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 uses no selection function on the fibers of , no section of , and no canonical representative of ; 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 -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 , by Proposition 3.4. Such a set is a noncanonical presentation of the completion. It carries no invariant information beyond what 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 is defined without any choice whatever, as an image; and terminality (Theorem 5.1) yields only the surjections onto the completion. It furnishes no inverse to , 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.