Canonical Minimal Source Completion: The Coarsest Readout Extension on which a Nominated Family of Source Relations Becomes Well Defined
Reduced source, readout, and the nominated relation family
Reduced source, readout, and the nominated relation family
The reduced source
We assume, as in Paper 1, that has already been reduced: all declared gauge redundancy and all coordinate-labelling redundancy have been quotiented out. Concretely, one begins with a raw configuration space carrying an equivalence relation of physical indistinguishability, gauge equivalence, diffeomorphism relabelling, choice of chart, and forms The order of operations matters and is not a convention we are free to reverse: reduction precedes completion. Section 9 states the consequence precisely.
Definition 2.1 (Eligible relation).
A raw quantity is eligible for source completion when it is invariant on physical-equivalence classes, so that there is a unique with . All relations nominated below are assumed eligible, i.e. genuinely defined on the reduced source .
Eligibility is exactly the condition under which the raw quantity is a function of the physical state rather than of a representative of it. A quantity failing (2.2), a gauge potential, a component in a chosen frame, a coordinate label, is not a candidate relation, and no completion of the readout can make it one.
External nomination
Fix a set and a family of eligible relations We stress the epistemic status of the family, because the mathematics below is only as meaningful as the nomination that feeds it. The relations are nominated externally: each is selected because it enters an independently specified mathematical or physical target, an amplitude, a spectrum, a transport law, an interference pattern. Physical relevance is not inferred from fiber variation. That a function happens to be nonconstant on shows only that the readout does not determine it; it does not show that the distinctions it makes are physical. Confusing the two would convert every artifact of a redundant description into a physical observable. The theorems below are therefore conditional in exactly one place, and it is the right place: they take the family as given and tell one, completely, what follows from it.
The completion problem
Write
Definition 2.2 (The family completion problem).
An extension of the readout sufficient for the family (2.3) is a space through which maps onto, such that
the original readout is retained: factors through ; and
every nominated relation becomes a well-defined function of the completed state: each factors through .
The problem is to construct the coarsest such extension: one that makes no distinction between source states beyond those forced by requirements (1) and (2), and to prove it canonical.
A sufficient extension is emphatically not required to distinguish source states on which both the readout and every selected relation agree. This is the entire content of minimality, and it is what separates completion from reconstruction.
Remark 3 (The empty family).
If , the ordinary set-theoretic convention gives , the singleton empty product, and , so that and is a bijection. Nominating nothing completes nothing: the completion of the readout relative to the empty family is the readout. This is the degenerate boundary case of every theorem below, and we will not comment on it again.