Skip to content
Shadow Theory

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

Representative selection is not reconstruction

Jeremy RodgersSection 6 of 15Original PDF ↗Publication DOI ↗

Representative selection is not reconstruction

Noninjectivity of pp excludes recovery of the realized source state by a map of readout data. It does not, by itself, exclude the weaker operation of choosing, for each readout value, some source state that would have produced it. The two are routinely conflated, and the distinction matters.

Definition 5.1 (Section).

A section of pp is a map σ ⁣:T⟶Swithp∘σ=idT.(15) \sigma\colon T\longrightarrow S \qquad\text{with}\qquad p\circ\sigma=\mathop{\mathrm{id}}_{T}.\tag{15}

Equivalently, σ(t)∈Ft\sigma(t)\in F_{t} for every t∈Tt\in T: a section picks one element from each fiber. When TT is a set with no further structure and no admissibility conditions are imposed, a section exists whenever a choice function for the family {Ft}t∈T\{F_{t}\}_{t\in T} of nonempty sets exists; the axiom of choice for that family supplies one, and for finite or countable TT weaker principles suffice. Mere existence in this sense therefore conveys no information about pp at all. The substantive question is never whether some section exists, but whether one exists that is compatible with the structure the problem carries: equivariance, continuity, smoothness, measurability, locality, covariance. Section 6, Section 9 take up two such conditions.

What a section is not, in any case, is an inverse.

Proposition 5.2 (Selection is not reconstruction).

Let σ\sigma be a section of pp. Then σ∘p=idS(16) \sigma\circ p=\mathop{\mathrm{id}}_{S}\tag{16} holds if and only if pp is bijective. In that case σ=p−1\sigma=p^{-1}.

Proof. Suppose (16) holds and p(s)=p(s′)p(s)=p(s'). Applying σ\sigma, s=σ(p(s))=σ(p(s′))=s′,s=\sigma\bigl(p(s)\bigr)=\sigma\bigl(p(s')\bigr)=s', so pp is injective; it is surjective by (3), hence bijective. Moreover (15) and (16) then identify σ\sigma as the two-sided inverse of pp.

Conversely, if pp is bijective then p−1p^{-1} exists, satisfies p∘p−1=idTp\circ p^{-1}=\mathop{\mathrm{id}}_{T}, and is therefore a section; and any section σ\sigma satisfies, for each s∈Ss\in S, that σ(p(s))\sigma(p(s)) lies in Fp(s)={s}F_{p(s)}=\{s\}, so σ∘p=idS\sigma\circ p=\mathop{\mathrm{id}}_{S}. ◻

The asymmetry of the two identities (15) and (16) is the whole point. The first says: whatever source state σ\sigma nominates, it does produce the observed readout. The second says: the source state σ\sigma nominates is the one that was actually there. The first is a consistency condition on a convention; the second is a claim of recovery. A section supplies a representative convention; only a two-sided inverse supplies source reconstruction, and by Proposition 5.2 a two-sided inverse exists precisely in the degenerate case in which nothing was lost.

Nor can the gap be closed by refining the convention. If ∣Ft∣>1|F_{t}|>1, then for every section σ\sigma there exists s∈Fts\in F_{t} with σ(p(s))=σ(t)≠s\sigma(p(s))=\sigma(t)\neq s: the section misidentifies at least one source state in that fiber, and no amount of cleverness in choosing σ\sigma changes this, because the readout data available to σ\sigma is identical for all elements of FtF_{t}.

Back to top ↑