Skip to content
Shadow Theory

Chapter 14SPC-2 · Version 2

Why a manifestation law is additional

Reading position 19 of 37

The preceding parts describe source/readout relations and capabilities of physically realized systems. This part supplies the proposed laws of manifestation. Its first task is to identify which choices the physical results leave open, so that the later constitution makes those choices explicitly. The underdetermination examples below explain why a constitutive law is needed; they do not replace the positive argument for the particular law adopted.

14.1 Common source does not determine a bridge

The physical results establish structures that a vessel can realize. They do not yet determine an experiential assignment. Let S={0,1}2S=\{0,1\}^2, with p(s1,s2)=s1p(s_1,s_2)=s_1 and ϕ(s1,s2)=s2\phi(s_1,s_2)=s_2. Both are descriptions of the same source, but no function ff satisfies ϕ=fp\phi=f\circ p. A common-source ontology alone does not imply the desired fibre compatibility.

Adding a constant awareness argument imposes no further mathematical restriction. For every M:XΦM:X\to\Phi and fixed aa_*, the map M~(a,x)=M(x)\widetilde M(a_*,x)=M(x) is a possible assignment on {a}×X\{a_*\}\times X. Primitive awareness can be a legitimate ontological commitment while leaving the entire manifestation map unspecified. Its introduction must therefore be followed by actual laws rather than treated as the completion of the theory.

14.2 Regularity and symmetry leave genuine freedom

Fix X=Φ=[0,1]X=\Phi=[0,1], its ordinary metric and orientation, and landmarks 0,1/2,10,1/2,1. For ε<1|\varepsilon|<1, set

Mε(x)=x+εx(1x)(x1/2). M_\varepsilon(x)=x+\varepsilon x(1-x)(x-1/2). (14.1)

These maps preserve the landmarks and obey Mε(1x)=1Mε(x)M_\varepsilon(1-x)=1-M_\varepsilon(x). Their derivatives are

1+ε(3x2+3x1/2), 1+\varepsilon(-3x^2+3x-1/2),

which are bounded between 1ε/21-|\varepsilon|/2 and 1+ε/21+|\varepsilon|/2. Thus they are monotone bi-Lipschitz homeomorphisms. Coordinatewise extension respects Cartesian product composition. Repairs that preserve xx preserve every such assignment.

Distinct values of ε\varepsilon nevertheless give different maps. The orientation-preserving isometry group of the fixed interval with its landmarks is trivial. Hence these alternatives are not removed by that declared gauge. The example refutes uniqueness under the specific regularity, symmetry, and composition conditions just stated. It does not refute every richer naturality law on an independently specified category.

A naturality condition can relocate rather than remove the ambiguity. If both a phenomenal functor and its bridge are unknown, conjugating every phenomenal morphism by an invertible change of representation gives another natural pair. Likewise, replacing a manifestation map and compensating its decoder can preserve all outputs. The unknown target-side structure must be independently constrained or explicitly fixed by a constitutive law.

14.3 Report laws and latent descriptions

A general latent model writes

R(rx,k)=Q(rϕ,x,k)μ(dϕx). R(r\mid x,k)=\int Q(r\mid\phi,x,k)\,\mu(\dd\phi\mid x). (14.2)

If both μ\mu and QQ are unrestricted, invertible changes of latent coordinates leave RR unchanged after the corresponding decoder transformation. More general inequivalent latent spaces can also induce the same report law. Thus a fitted report distribution is not automatically a unique phenomenal law.

An independently specified physical descriptor and experience-facing measurement map define a conditional factorization problem [33]. This formulation permits the target to constrain the descriptor rather than be defined by it. The stronger constitutive proposal below makes a different move: it identifies phenomenal relational organization with a canonical physical predictive object. This excludes alternative organizations by a declared law, not by claiming that generic regularity or report agreement has already ruled them out.

14.4 Quantitative aperture adequacy

Let SS be finite, p:SX=p(S)p:S\to X=p(S) a proposed descriptor, and r:SRr:S\to\R an independently nominated target. Define

oscp(r)=maxxX(maxp(s)=xr(s)minp(s)=xr(s)). \osc_p(r)=\max_{x\in X}\left(\max_{p(s)=x}r(s)-\min_{p(s)=x}r(s)\right).
Theorem 14.1 (Sharp scalar bridge error)

The best deterministic bridge through pp has exact uniform error

inff:XRmaxsSr(s)f(p(s))=12oscp(r). \inf_{f:X\to\R}\max_{s\in S}|r(s)-f(p(s))| =\frac12\osc_p(r). (14.3)
Proof

On a fixed fibre let a,ba,b be the minimum and maximum target values. Every single number approximating both has maximum error at least (ba)/2(b-a)/2. Choosing their midpoint attains the bound on that fibre. Make this choice independently on each fibre and take the largest error.

Exact factorization is the zero-error case. Refining a descriptor subdivides its fibres and cannot increase the optimal error. If rr^ϵ\norm{r-\widehat r}_\infty\le\epsilon, the two optimal errors differ by at most ϵ\epsilon. Consequently a same-descriptor contrast larger than 2δ+2ϵ2\delta+2\epsilon rejects every bridge with uniform modeling error at most δ\delta, provided the equality of descriptors and the measurement bounds are independently justified.

This assesses descriptor adequacy. For a distribution-valued target, the corresponding problem is a minimum enclosing radius in a declared probability metric; half the diameter need not be optimal. The scalar formula therefore does not establish the general metric case or detect awareness.