Canonical Minimal Source Completion: The Coarsest Readout Extension on which a Nominated Family of Source Relations Becomes Well Defined
Completion determined by a family of target answers
Completion determined by a family of target answers
Paper 2 [2] works with a single target and its correct-answer map , and constructs the coarsest extension of the readout that determines that answer; we will denote that single-target object by , following Paper 2. We now treat a family of targets, and we choose notation that cannot collide with the single-target object.
Let be a set of targets, each equipped with a correct-answer map and define with induced surjection , projection , and structure maps . Write for the induced equivalence relation: iff and for every .
Proposition 8.1 (Target-family completion).
The data is the terminal object of the category of surjective extensions of the readout on which every answer map becomes well defined. In particular , and is the coarsest extension of the readout determining every answer in the family.
Proof. The answer maps form a set-indexed family of functions on , exactly as the do. Definition 3.1, Definition 4.1, Definition 4.2 and Proposition 3.2, Proposition 3.4, Theorem 5.1, Corollary 5.3 were stated and proved for an arbitrary such family and use no property of the beyond their being functions on . Substituting for , for , and for throughout yields the assertions verbatim. ◻
Mediation and the canonical surjection
Now suppose the nominated relation family is sufficient for the targets, in the precise sense that each answer is computable from the readout together with the relation values.
Definition 8.2 (Mediation).
The family mediates if for every there is a map
Theorem 8.3 (Relation completion versus target completion).
Suppose mediates . Then there is a unique map and is surjective; explicitly, for . Moreover, is a bijection if and only if that is, if and only if equality of the readout together with all target answers induces exactly the same equivalence relation on as equality of the readout together with all selected relation values. In general one has only so the target completion may be strictly coarser than the relation completion.
Proof. is sufficient for . Define (the restriction of to ). For , by (8.3). Together with the identity and the surjectivity of the map , this exhibits the tuple as an object of the category .
Existence, uniqueness, surjectivity of . By Proposition 8.1, is terminal in that category, so Theorem 5.1 supplies a unique morphism , necessarily satisfying and necessarily surjective; and by the explicit formula (5.3) it is given on by .
The ordering (8.6). Suppose . Then and , so by (8.3), for every . Hence . (This is Corollary 5.3 applied to the sufficient extension of the -problem.)
Injectivity criterion. By Proposition 3.4 applied to both families, is identified with the canonical map , , which is well defined by (8.6). Such a map is injective iff ; combined with (8.6) this is exactly (8.5). Since is always surjective, it is a bijection precisely under (8.5). ◻
Remark 31 (Two different things are being retained).
The distinction encoded in Theorem 8.3 is substantive and is easy to lose. The relation completion retains the nominated relation values themselves. The target completion retains only those distinctions among relation values that affect the nominated answers. If two source states carry different relation signatures but the mediating maps send both signatures to the same answers for every , then separates them and does not. Hence the strict-coarsening possibility in (8.6) is not an artifact; Section 11 exhibits it concretely, where the relation completion retains an orientation that no answer in the nominated spectral family can detect.