Skip to content
Shadow Theory

Source–Readout Non-Equivalence: Descent and Equivariant Reconstruction Obstructions

Descent of source relations

Jeremy RodgersSection 5 of 15Original PDF ↗Publication DOI ↗

Descent of source relations

Nontriviality of a fiber is a statement about the map pp. To convert it into a statement about lost physics, one must exhibit a physically meaningful quantity that varies across a fiber. This section makes that precise.

Relations and descent

Let VV be a set of values and let r ⁣:S⟶V(10) r\colon S\longrightarrow V\tag{10} be a source relation: a map assigning to each reduced source state a value that the theory regards as physically meaningful. Because the domain of rr is SS rather than Ω\Omega, the relation is automatically invariant under physical equivalence; this is the payoff of having performed the reduction first. Concrete instances that arise in practice include a global transport class, a boundary relation, a correlation functional, a spectral invariant, or a source property required as an input by some further construction. Nothing in what follows depends on which; rr is an arbitrary map out of SS.

Definition 4.1 (Descent).

The relation rr descends through the readout if there exists a map rˉ ⁣:T⟶Vwithr=rˉ∘p.(11) \bar r\colon T\longrightarrow V \qquad\text{with}\qquad r=\bar r\circ p .\tag{11}

If rr descends, then r(s)r(s) is a function of the readout value p(s)p(s) alone, and an agent with access only to public data can evaluate rr. If rr does not descend, no such evaluation is possible, however the agent proceeds. It is only after descent has been established that it is legitimate to call rr an observable of the readout; a source relation is not observable at the readout level merely because it is physically meaningful at the source level.

Theorem 4.2 (Fiber–descent theorem).

Let r ⁣:S→Vr\colon S\to V. The following are equivalent.

  1. There exists rˉ ⁣:T→V\bar r\colon T\to V with r=rˉ∘pr=\bar r\circ p.

  2. rr is constant on every fiber of pp; that is, p(s)=p(s′)⟹r(s)=r(s′)(s,s′∈S).(12) p(s)=p(s') \quad\Longrightarrow\quad r(s)=r(s') \qquad (s,s'\in S).\tag{12}

When these hold, rˉ\bar r is unique.

Proof. 1⇒\Rightarrow2. Suppose r=rˉ∘pr=\bar r\circ p and p(s)=p(s′)p(s)=p(s'). Then r(s)=rˉ(p(s))=rˉ(p(s′))=r(s′).r(s)=\bar r\bigl(p(s)\bigr)=\bar r\bigl(p(s')\bigr)=r(s').

2⇒\Rightarrow1. Suppose rr is constant on fibers. Fix t∈Tt\in T. By surjectivity of pp the fiber FtF_{t} is nonempty, so we may pick s∈Fts\in F_{t} and set rˉ(t):=r(s).(13) \bar r(t):=r(s).\tag{13} This prescription is independent of the choice of s∈Fts\in F_{t}: any two elements of FtF_{t} have the same image under pp, namely tt, so (12) forces them to have the same rr-value. Hence rˉ\bar r is a well-defined map T→VT\to V. For arbitrary s∈Ss\in S, applying (13) at t=p(s)t=p(s) with the representative ss itself gives rˉ(p(s))=r(s)\bar r(p(s))=r(s), that is, r=rˉ∘pr=\bar r\circ p.

Uniqueness. If rˉ1∘p=rˉ2∘p\bar r_{1}\circ p=\bar r_{2}\circ p then, since pp is surjective, every t∈Tt\in T is of the form p(s)p(s), and rˉ1(t)=r(s)=rˉ2(t)\bar r_{1}(t)=r(s)=\bar r_{2}(t). Hence rˉ1=rˉ2\bar r_{1}=\bar r_{2}. ◻

Note that the proof of 2⇒\Rightarrow1 requires only a choice of one representative per fiber for the purpose of evaluating a constant, and the constancy hypothesis makes the choice immaterial. No choice principle is needed, and no representative survives into the conclusion. This is in sharp contrast to the selection problems of Section 5, Section 6, where the chosen representative is the output.

Corollary 4.3 (Descent obstruction).

Suppose there exist s0,s1∈Ss_{0},s_{1}\in S with p(s0)=p(s1),r(s0)≠r(s1).(14) p(s_{0})=p(s_{1}), \qquad r(s_{0})\neq r(s_{1}).\tag{14} Then rr does not descend through pp: there is no map rˉ ⁣:T→V\bar r\colon T\to V with r=rˉ∘pr=\bar r\circ p. Consequently no function of the readout alone reproduces rr on all of SS.

Proof. Condition (14) exhibits a fiber on which rr is not constant, so 2 of Theorem 4.2 fails, and therefore 1 fails. ◻

The content of Corollary 4.3 should not be mistaken for a restatement of noninjectivity of pp. Noninjectivity says that the fibers are not all singletons. Corollary 4.3 says something further and more specific: that a nominated physically meaningful quantity, one the theory actually cares about, is not among the quantities the readout carries. The hypothesis (14) is a statement one must earn by producing the relation rr; it does not follow from coarseness of the readout by itself, since a noninjective readout may perfectly well transmit every relation the theory needs. This is the difference between observing that a map forgets something and identifying what it forgets.

Relative completeness

The preceding suggests grading the readout not absolutely but against a nominated family of relations.

Definition 4.4 (Relative source completeness; separation).

Let R\mathcal{R} be a family of source relations on SS (with values in possibly different value sets). The readout is complete relative to R\mathcal{R} if every r∈Rr\in\mathcal{R} descends through pp.

The family R\mathcal{R} separates the points of SS if for all s≠s′s\neq s' in SS there exists r∈Rr\in\mathcal{R} with r(s)≠r(s′)r(s)\neq r(s').

Theorem 4.5 (Separating-family criterion).

Let R\mathcal{R} separate the points of SS. Then the readout is complete relative to R\mathcal{R} if and only if pp is bijective.

Proof. (⇐\Leftarrow) If pp is bijective, then for any r ⁣:S→Vr\colon S\to V the map rˉ:=r∘p−1\bar r:=r\circ p^{-1} satisfies rˉ∘p=r\bar r\circ p=r. Hence every relation whatsoever descends, in particular every member of R\mathcal{R}.

(⇒\Rightarrow) Suppose every r∈Rr\in\mathcal{R} descends, and let s,s′∈Ss,s'\in S satisfy p(s)=p(s′)p(s)=p(s'). By Theorem 4.2, each r∈Rr\in\mathcal{R} is constant on the fibers of pp, so r(s)=r(s′)r(s)=r(s') for every r∈Rr\in\mathcal{R}. Since R\mathcal{R} separates the points of SS, this forces s=s′s=s'. Hence pp is injective, and it is surjective by (3). ◻

Theorem 4.5 gives relative completeness an operational reading, but the reading is conditional and the condition must be checked. The theorem says that a readout is source-complete exactly when it carries a family of relations that separates source states. Whether that reading is operational depends entirely on whether the separating family R\mathcal{R} has been identified as physically meaningful. An arbitrary separating family always exists , take R\mathcal{R} to be all maps S→{0,1}S\to\{0,1\}, or all indicator functions of points , and its existence tells one nothing, since its members need not correspond to anything a theory recognizes or an experiment can access. The theorem earns its interpretation only when R\mathcal{R} is supplied by the physics.

Back to top ↑