Skip to main content

Substrate-independent closure

Result scope

Conditional constructions for injection, section–retraction, channel validation and feasible learning. Mathematical validity is distinguished from empirical identification and phenomenal interpretation.


§1. T-148: conditional genesis with a specified injection​

For an unital L0\mathcal L_0 and a gate with gV(1/7)=0g_V(1/7)=0, the isolated initial state I/7I/7 is stationary. This concerns that initial state and model, not the absence of living states for all isolated self-models.

Fix a state σ\sigma, 0<β<10<\beta<1, and a depolarizing propagator Eη(Γ)=ηΓ+(1−η)I/7\mathcal E_\eta(\Gamma)=\eta\Gamma+(1-\eta)I/7 with 0≤η≤10\le\eta\le1. For the declared update

Γn+1=βEη(Γn)+(1−β)σ,Γ0=I/7,\Gamma_{n+1}=\beta\mathcal E_\eta(\Gamma_n)+(1-\beta)\sigma,\qquad\Gamma_0=I/7,

let r=βηr=\beta\eta and w=(1−β)/(1−βη)w=(1-\beta)/(1-\beta\eta). Direct substitution gives

Γn=(1−un)I/7+unσ,un=w(1−rn),Pn=1/7+un2(P(σ)−1/7).\Gamma_n=(1-u_n)I/7+u_n\sigma,\qquad u_n=w(1-r^n),\qquad P_n=1/7+u_n^2(P(\sigma)-1/7).

If P(σ)>2/7P(\sigma)>2/7, put h=1/7P(σ)−1h=1/\sqrt{7P(\sigma)-1}. The strict purity cut is reached in finite time iff w>hw>h. For 0<r<10<r<1 its first tick is

nmin⁡=⌊log⁡(1−h/w)log⁡r⌋+1.n_{\min}=\left\lfloor\frac{\log(1-h/w)}{\log r}\right\rfloor+1.

For r=0r=0, it is the first tick when w>hw>h; otherwise it is never reached. The special undamped case η=1\eta=1 has w=1w=1 and un=1−βnu_n=1-\beta^n.

Proof. The affine coefficient obeys un+1=run+1−βu_{n+1}=ru_n+1-\beta; solve this scalar recurrence and use Tr⁡(σ−I/7)=0\operatorname{Tr}(\sigma-I/7)=0. Crossing is un>hu_n>h, giving the displayed strict inequality and integer bound. ■\blacksquare

The former universal bound was false: its logarithm could give a negative tick count, and convexity was incorrectly used as a monotone purity lower bound. Purity of a mixture is the exact expression β2P(A)+(1−β)2P(B)+2β(1−β)Tr⁡(AB)\beta^2P(A)+(1-\beta)^2P(B)+2\beta(1-\beta)\operatorname{Tr}(AB); it need not exceed either input purity. Even a pure input with β=0.9\beta=0.9, η=0\eta=0 gives w=0.1w=0.1 and Pn=53/350<2/7P_n=53/350<2/7 for every n≥1n\ge1.

Scope of embodiment​

External injection is one way to leave I/7I/7 under the closed-gate model. It does not prove that every conscious system requires this exact backbone or that all embodied systems cross the threshold. Alternative isolated self-models already have living attractors for other initial states; see evolution.

Pred 13: a conditional, testable recurrence​

The tick formula tests this registered constant-input, depolarizing model. Changing the input, rates, self-model or noise changes the prediction. Crossing purity alone does not establish the full capability gate or its phenomenal interpretation.


§2. T-149: conditions for an embodied stationary state​

Embodiment, P(σ)>2/7P(\sigma)>2/7 and 0<β<10<\beta<1 do not imply an above-threshold attractor, as T-148's explicit counterexample shows. For that affine model the fixed state is (1−w)I/7+wσ(1-w)I/7+w\sigma, and it is structurally viable exactly when w>1/7P(σ)−1w>1/\sqrt{7P(\sigma)-1}. A continuous model with depolarizing rate γ\gamma and injection rate μ\mu has the same result with w=μ/(μ+γ)w=\mu/(\mu+\gamma).

For isotropic Fano dephasing, state-dependent regeneration and another input field BB, a stationary state satisfies

P∗=αDPdiag+af∗+qBαD+a,a=κgV,qB=Tr⁡Γ∗B(Γ∗),αD=2/3.P_* = \frac{\alpha_D P_{\mathrm{diag}}+a f^*+q_B}{\alpha_D+a},\qquad a=\kappa g_V,\quad q_B=\operatorname{Tr}\Gamma_* B(\Gamma_*),\quad\alpha_D=2/3.

Hence P∗>2/7P_*>2/7 iff the numerator exceeds (2/7)(αD+a)(2/7)(\alpha_D+a). The actual overlap f∗f^* and input flux qBq_B must be evaluated; a larger nominal rate and positive input purity alone give no automatic compensation. This exact balance is necessary at a stationary point, not proof of existence or stability. A contraction criterion such as strict backbone dominance or a verified Hurwitz Jacobian supplies those separate properties.

The previous unconditional T-149, the claimed universal O–E–U compensation and automatic closure of C20/C27 are withdrawn. Simulation correlations describe a specific run and do not prove a lower bound for every embodied holon. The upper cut, integration, differentiation and stress remain separate checks.


§3. T-150: iteration identity and tower compatibility​

For any specified self-map M:D7→D7M:\mathcal D_7\to\mathcal D_7, linear or nonlinear, Mn∘Mm=Mn+mM^n\circ M^m=M^{n+m} by associativity. Equal dimensions alone do not identify distinct operators, readouts or projections in a heterogeneous tower. That tower needs the separately verified diagrams πkMk+1=Mkπk\pi_kM_{k+1}=M_k\pi_k.

Scope of the former T-136 upgrade​

The iteration identity does not prove a universal cognitive-depth ceiling or identify purity scores with metacognitive certification. The former upgrade is withdrawn. Exact Fano attenuation and the arithmetic of a stipulated score are given in T-142; certified depth requires the declared meta-observation probes.


§4. T-151: differentiation requires its own realization​

The cut Ddiff≥2D_{\mathrm{diff}}\ge2 is a model selection [D]. If Ddiff=eS(ρE)D_{\mathrm{diff}}=e^{S(\rho_E)}, the map or lift defining ρE\rho_E must be specified. The scalar integration condition satisfies only Φ≥1⇒P≥2/7\Phi\ge1\Rightarrow P\ge2/7, and places no universal bound on an E-row coherence or the entropy of an arbitrary reduced experiential state.

If instead ρE=Γ\rho_E=\Gamma, then eS(Γ)≥1/P≥7/3>2e^{S(\Gamma)}\ge1/P\ge7/3>2 whenever R≥1/3R\ge1/3; in this particular realization the differentiation cut is redundant. For another readout it need not be. A seven-dimensional prime Hilbert space has no nontrivial tensor factor singled out merely by naming an E-coordinate; a normalized E-row HS proxy is another defined quantity, not reduced entropy. See the corrected dependence analysis.


§5. T-152: correctly typed anchor validation​

A feature estimator π:RD→DN\pi:\mathbb R^D\to\mathcal D_N is tested with an observation model and held-out data; it has no Choi matrix or diamond norm by that type alone. There is no unique canonical comparator from T-123. A reference encoder must be separately declared and its targets identifiable.

For linear channels A,B:Md→MN\mathcal A,\mathcal B:M_d\to M_N, let J(Δ)J(\Delta) be the unnormalized Choi matrix of Δ=A−B\Delta=\mathcal A-\mathcal B. Then

1d∥J(Δ)∥1≤∥Δ∥⋄≤∥J(Δ)∥1≤dN∥J(Δ)∥F.\frac1d\|J(\Delta)\|_1\le\|\Delta\|_\diamond \le\|J(\Delta)\|_1\le\sqrt{dN}\|J(\Delta)\|_F.

The lower bound evaluates the normalized maximally entangled input. For the upper bound write any pure input with an ancilla of dimension dd as a bounded sandwich of the unnormalized maximally entangled vector; the sandwich operator has norm at most one, so its output trace norm is at most ∥J(Δ)∥1\|J(\Delta)\|_1. The final inequality is the Schatten norm bound. See Watrous, Chapter 3.

A channel is CPTP iff J⪰0J\succeq0 and Tr⁡outJ=Id\operatorname{Tr}_{\mathrm{out}}J=I_d. Constructing a general JJ requires d2d^2 basis-operator evaluations and d2N2d^2N^2 entries; costs depend on the evaluation oracle, numerical precision and positivity certification. The previous feature-dimension bound O(49D)O(49D) and unique optimality claim do not follow. Output state error transfers threshold verdicts only with separately verified observable bounds and strict margins, as in T-143.


§6. T-153: a declared substrate readout​

Fix a physical state domain, readout/encoder GθG_\theta, its calibration, functional frame, experiential realization and observation model before evaluating the system. Define Cap2,S(s):=Cap2(Gθ(s))\mathrm{Cap}_{2,S}(s):=\mathrm{Cap}_2(G_\theta(s)), with a separate stress condition if required. This is a model predicate [D]; identifying it with experience is an empirical/ontological bridge [H/I]. Its numerical cuts can be used across substrates within that declared model.

A freely chosen existential encoder is not a diagnostic: a constant replacement channel can send every input to a selected window state. Faithfulness must state the actual domain, and existence of a state-valid map does not establish a biologically correct or identifiable encoder. Symmetry of D7\mathcal D_7, seven functional names and a section–retraction do not prove universal completeness of Γ\Gamma, the absence of hidden variables or a phenomenal equivalence. Reconstructions use observation fibers.

T-153a: constructive scope and dynamics​

For the full quantum state space D(Cd)\mathcal D(\mathbb C^d), when d≤7d\le7 an isometry W:Cd→C7W:\mathbb C^d\to\mathbb C^7 gives the injective CPTP embedding ρ↦WρW†\rho\mapsto W\rho W^\dagger. When d>7d>7, no globally injective linear CPTP readout into D7\mathcal D_7 exists; T-253 proves the dimension obstruction and an exactly faithful embedded-sector retraction. These are static facts. They imply neither a CPTP reduced dynamics nor seven necessary noncommuting biological probes.

To obtain a closed reduced deterministic dynamics, states in the same GG-fiber must have the same reduced future: G(s1)=G(s2)⇒G(Tts1)=G(Tts2)G(s_1)=G(s_2)\Rightarrow G(T_ts_1)=G(T_ts_2). This condition is necessary and sufficient to define a well-defined reduced state map. Linearity and a CPTP extension are further requirements. For an invariant embedded sector EtιV=ιVFt\mathcal E_t\iota_V=\iota_V\mathcal F_t, the specified CPTP retraction gives CPTP reduced propagators Ft=GVEtιV\mathcal F_t=G_V\mathcal E_t\iota_V; invariance establishes their semigroup composition. Neither static Stinespring dilation of GG nor seven feature coordinates guarantees these conditions.

Classical feature spaces require their own probability/operator-algebra encoding and distinguishability analysis; their dimension is not a quantum Hilbert-space dimension by renaming it. The former necessity-and-sufficiency claim (C1)–(C3) is withdrawn. Accessibility and observational identifiability remain independent of algebraic existence.

T-253​

Theorem T-253 (Constructive sufficiency: the retraction, and its sharpness) [T] + [C at (Acc)]

Let HS\mathcal H_S be a specified finite-dimensional Hilbert space with d=dim⁡HS≥7d=\dim\mathcal H_S\ge7.

(a) Construction [T]. For every isometry V:C7→HSV: \mathbb C^7 \to \mathcal H_S (V†V=17V^\dagger V = \mathbb 1_7) and any anchor state σ0∈D(C7)\sigma_0 \in \mathcal D(\mathbb C^7), the map

GV(ρ)  :=  V†ρ V  +  Tr((1−VV†)ρ) σ0G_V(\rho) \;:=\; V^\dagger \rho\, V \;+\; \mathrm{Tr}\bigl((\mathbb 1 - VV^\dagger)\rho\bigr)\,\sigma_0

is CPTP, and it is a retraction: GV∘ιV=IdD(C7)G_V \circ \iota_V = \mathrm{Id}_{\mathcal D(\mathbb C^7)} for the embedding ιV(γ)=VγV†\iota_V(\gamma) = V\gamma V^\dagger. On the embedded 7-sector, GVG_V is exactly faithful — it inverts ιV\iota_V pointwise, losing nothing.

(b) Threshold realization [T] + (Acc). The full-viability set Vfull={Γ:P>2/7, R≥1/3, Φ≥1, Ddiff≥2}\mathcal V_{\mathrm{full}} = \{\Gamma : P > 2/7,\ R \geq 1/3,\ \Phi \geq 1,\ D_{\mathrm{diff}} \geq 2\} is non-empty (T-124 [T]); for any window state Γw∈Vfull\Gamma_w \in \mathcal V_{\mathrm{full}} the substrate state ιV(Γw)\iota_V(\Gamma_w) passes all four thresholds under GVG_V, since GV(ιV(Γw))=ΓwG_V(\iota_V(\Gamma_w)) = \Gamma_w. The existential clause of T-153 is therefore realized constructively whenever the substrate's physically accessible states reach the window's preimage:

(Acc)States(S)∩GV−1(Vfull)≠∅  for some isometry V.\textbf{(Acc)}\quad \mathrm{States}(S) \cap G_V^{-1}(\mathcal V_{\mathrm{full}}) \neq \varnothing \ \text{ for some isometry } V.

(Acc) is a definitional clause [D] — it names exactly what "the substrate can host a conscious state" means. Crucially, it is an open condition: for any interior window witness Γw\Gamma_w (all four inequalities strict — the waking profile of altered states is one), continuity of GVG_V makes GV−1(int Vfull)G_V^{-1}(\mathrm{int}\,\mathcal V_{\mathrm{full}}) a non-empty open neighborhood of ιV(Γw)\iota_V(\Gamma_w) in D(HS)\mathcal D(\mathcal H_S) — the realizing substrate state need not itself be an embedded rank-7 state (which would be a measure-zero demand for d>7d > 7); anything in the open preimage suffices. Quantitatively: GVG_V, being CPTP, is a trace-norm contraction, so the preimage contains the entire trace-norm ball of radius δw=dist1(Γw,∂Vfull)>0\delta_w = \mathrm{dist}_1(\Gamma_w, \partial\mathcal V_{\mathrm{full}}) > 0 around ιV(Γw)\iota_V(\Gamma_w). Hence for substrates with accessible (controllable) dynamics — reachable set dense in D(HS)\mathcal D(\mathcal H_S) — (Acc) holds [C at controllability]: a dense set meets every non-empty open set.

(c) Sharpness [T]: no global faithfulness for d>7d > 7. No CPTP map E:D(HS)→D(C7)\mathcal E: \mathcal D(\mathcal H_S) \to \mathcal D(\mathbb C^7) is injective on all of D(HS)\mathcal D(\mathcal H_S) when d>7d > 7: as a real-linear map Herm(HS)→Herm(C7)\mathrm{Herm}(\mathcal H_S) \to \mathrm{Herm}(\mathbb C^7) it has kernel of dimension ≥d2−49≥1\geq d^2 - 49 \geq 1, and trace preservation puts the kernel inside the traceless hyperplane; hence for any interior state ρ\rho and kernel direction K≠0K \neq 0 the pair ρ±εK\rho \pm \varepsilon K (small ε>0\varepsilon > 0) consists of two distinct density matrices with identical images. Consequently "faithful GG" in T-153/T-153a must be read sector-relative, and the retraction of (a) attains the maximal possible real dimension of a faithful smooth sector — 48 — through the embedded state space; this does not make that sector unique.

Proof. (a) Complete positivity: ρ↦V†ρV\rho \mapsto V^\dagger\rho V is CP with the single Kraus operator V†V^\dagger; the second summand is measure-and-prepare with Kraus family Bij=si ∣i⟩⟨qj∣B_{ij} = \sqrt{s_i}\,|i\rangle\langle q_j|, where σ0=∑isi∣i⟩⟨i∣\sigma_0 = \sum_i s_i |i\rangle\langle i| and {∣qj⟩}\{|q_j\rangle\} is an orthonormal basis of ran(1−VV†)\mathrm{ran}(\mathbb 1 - VV^\dagger). Completeness: VV†+∑ijBij†Bij=VV†+(1−VV†)=1dV V^\dagger + \sum_{ij} B_{ij}^\dagger B_{ij} = VV^\dagger + (\mathbb 1 - VV^\dagger) = \mathbb 1_d. Trace preservation: Tr GV(ρ)=Tr(VV†ρ)+Tr((1−VV†)ρ)=Tr ρ\mathrm{Tr}\,G_V(\rho) = \mathrm{Tr}(VV^\dagger\rho) + \mathrm{Tr}((\mathbb 1 - VV^\dagger)\rho) = \mathrm{Tr}\,\rho. Retraction: GV(VγV†)=(V†V)γ(V†V)+Tr((1−VV†)VγV†)σ0=γ+0G_V(V\gamma V^\dagger) = (V^\dagger V)\gamma(V^\dagger V) + \mathrm{Tr}\bigl((\mathbb 1 - VV^\dagger)V\gamma V^\dagger\bigr)\sigma_0 = \gamma + 0, because (1−VV†)V=0(\mathbb 1 - VV^\dagger)V = 0. (b) Substitution into (a). (c) Dimension count: dim⁡RHerm(HS)=d2>49=dim⁡RHerm(C7)\dim_{\mathbb R}\mathrm{Herm}(\mathcal H_S) = d^2 > 49 = \dim_{\mathbb R}\mathrm{Herm}(\mathbb C^7), so dim⁡ker⁡≥d2−49\dim\ker \geq d^2 - 49; for K∈ker⁡K \in \ker, Tr K=Tr E(K)=0\mathrm{Tr}\,K = \mathrm{Tr}\,\mathcal E(K) = 0 by trace preservation; interiority of ρ\rho admits ε≤λmin⁡(ρ)/∥K∥∞\varepsilon \leq \lambda_{\min}(\rho)/\lVert K\rVert_\infty, keeping both ρ±εK⪰0\rho \pm \varepsilon K \succeq 0. ■\blacksquare

Frame remark (corrected 2026-09-25). "The isometry freedom in (a) is exactly the alphabetization freedom of T-223: composing VV with U∈G2U \in G_2 moves Γ\Gamma within its G2G_2-orbit, on which the consciousness predicate is constant (T-42a)." Retracted on two counts. (1) The freedom is larger than G2G_2: VV can be replaced by VUVU for any U∈U(7)U \in U(7), or by an isometry onto a different seven-dimensional subspace of HS\mathcal{H}_S, and the withdrawn universal T-42a does not identify any of these choices. (2) The predicate is not constant on G2G_2-orbits: Φ\Phi, CohE\mathrm{Coh}_E and κ0\kappa_0 are frame-pinned (frame decision D-0910). An explicit g∈G2g \in G_2 maps the window state Γw=12∣u⟩⟨u∣+12⋅I/7\Gamma_w = \tfrac12 \lvert u\rangle\langle u\rvert + \tfrac12 \cdot I/7, u=(1,…,1)/7u = (1, \ldots, 1)/\sqrt7 (P=5/14P = 5/14, R=2/5R = 2/5, Φ=3/2\Phi = 3/2), to the diagonal state 12∣e1⟩⟨e1∣+12⋅I/7\tfrac12 \lvert e_1\rangle\langle e_1\rvert + \tfrac12 \cdot I/7 with the same PP and RR and Φ=0\Phi = 0, so CC falls from 3/53/5 to 00 (regression tests test_phi_not_g2_invariant and test_window_predicate_not_constant_on_g2_orbit in website/scripts/check_core_numbers.py). Consequently GVG_V fixes a sector and a frame; the existential "there is a faithful GG" of T-153 ranges over all of them, and the verdict can differ between sectors of one substrate — the boundary problem in UHM's own terms (analysis). A seven-marker feature estimator is not automatically this Hilbert-space retraction. Its observation model, state reconstruction and statistical calibration must be demonstrated independently; the fixed choice of markers is part of the claim.

Machine verification. At d=12d = 12: Kraus completeness at 10−1510^{-15}; retraction, trace preservation and positivity at 10−1610^{-16}; kernel dimension exactly d2−49=95d^2 - 49 = 95; explicit collision pair of interior density matrices (minimal eigenvalue 2⋅10−2>02 \cdot 10^{-2} > 0) with ∥G(ρ1)−G(ρ2)∥F∼10−17\lVert G(\rho_1) - G(\rho_2)\rVert_F \sim 10^{-17}.

Numerical illustration of a selected model (SYNARC, 2026)

For the reported CognitiveSSM/Grid32 run, the quoted values are P=0.4286P=0.4286, R=0.3333R=0.3333, Φ=1.1492\Phi=1.1492, Ddiff=3.6003D_{\mathrm{diff}}=3.6003 and σmax⁡=0.6503\sigma_{\max}=0.6503. These are rounded outputs of the selected readout. The number R=0.3333R=0.3333 alone does not certify the non-strict cut 1/31/3: the unrounded value and a numerical/measurement error bound are needed. The product C=0.3831C=0.3831 does not replace the conjunction.

DensityMatrix7 transforms AgentState into a matrix; this does not establish injectivity, empirical faithfulness or a CPTP type for a feature map. A reproducible witness needs a code version, frozen calibration, differentiation realization, PSD/trace residuals, all threshold margins and stability verification. Co-rotating targets can help in a particular spectral regime but are not necessary for Φ≥1\Phi\ge1. T-98a and T-149 apply only under their purity-flux and stationary-state premises. A numerical model is not independent empirical confirmation of phenomenal consciousness.


§7. T-154: Coh_E^max = 1​

Theorem T-154 [T]: Normalization of Coh_E
max⁡Γ∈D(C7)CohE(Γ)=1\max_{\Gamma \in \mathcal{D}(\mathbb{C}^7)} \mathrm{Coh}_E(\Gamma) = 1

The maximum is achieved at Γ=∣E⟩⟨E∣\Gamma = |E\rangle\langle E| (pure E-state).

Proof.

Step 1. By definition of CohE\mathrm{Coh}_E as HS-projection onto the E-row/column operator subspace [T]:

CohE(Γ)=∥πE(Γ)∥HS2∥Γ∥HS2=γEE2+2∑i≠E∣γEi∣2Tr(Γ2)\mathrm{Coh}_E(\Gamma) = \frac{\|\pi_E(\Gamma)\|^2_{HS}}{\|\Gamma\|^2_{HS}} = \frac{\gamma_{EE}^2 + 2\sum_{i \neq E}|\gamma_{Ei}|^2}{\mathrm{Tr}(\Gamma^2)}

Step 2 (Upper bound). πE\pi_E is an orthogonal projection in Hilbert–Schmidt space. For any orthogonal projection: ∥πE(Γ)∥HS≤∥Γ∥HS\|\pi_E(\Gamma)\|_{HS} \leq \|\Gamma\|_{HS}. Therefore: CohE≤1\mathrm{Coh}_E \leq 1.

Step 3 (Attainability). For Γ=∣E⟩⟨E∣\Gamma = |E\rangle\langle E|: πE(∣E⟩⟨E∣)=∣E⟩⟨E∣\pi_E(|E\rangle\langle E|) = |E\rangle\langle E|, therefore CohE=∥∣E⟩⟨E∣∥HS2/∥∣E⟩⟨E∣∥HS2=1\mathrm{Coh}_E = \||E\rangle\langle E|\|^2_{HS} / \||E\rangle\langle E|\|^2_{HS} = 1. ■\blacksquare

Corollary: The formula T-128 [D] with CohEmax⁡=1\mathrm{Coh}_E^{\max} = 1 simplifies to:

Ddiff7D=1+CohE(Γ)⋅(N−1)D_{\mathrm{diff}}^{7D} = 1 + \mathrm{Coh}_E(\Gamma) \cdot (N - 1)

Dependencies: CohE\mathrm{Coh}_E HS-projection [T].


§8. T-155: feasible learning in a declared capability model​

A condition C≥1/3C\ge1/3 cannot replace Cap2\mathrm{Cap}_2. Nor does non-emptiness of an open set guarantee a nearest-point projection. Use a nonempty closed margin set with declared readouts, e.g.

Kε={Γ∈D7:P≥2/7+εP, R≥1/3+εR, Φ≥1+εΦ, D≥2+εD, σk≤1−εσ}.K_\varepsilon=\{\Gamma\in\mathcal D_7:P\ge2/7+\varepsilon_P,\ R\ge1/3+\varepsilon_R, \ \Phi\ge1+\varepsilon_\Phi,\ D\ge2+\varepsilon_D,\ \sigma_k\le1-\varepsilon_\sigma\}.

With continuous functions it is compact. For a continuous parameterized encoder Γ(B)\Gamma(B) and compact weight domain, its nonempty preimage KBK_B is compact. An exact projection of a proposed update B−ηgB-\eta g onto KBK_B therefore exists, may be nonunique and may be costly. Any selected projection preserves the complete margin predicate by definition; this is a conditional mathematical guarantee, not a convergence theorem.

A practical alternative proposes a gradient step, checks all margins (or the full observation confidence set) and accepts only a certified feasible candidate; retaining the previous feasible point is permitted. Progress requires separate assumptions. At smooth points the chain rule gives g=JΓT∇ΓJg=J_\Gamma^T\nabla_\Gamma J for a stated objective; max/clamp junctions require an appropriate generalized derivative. Lipschitz continuity, the clamp and a one-time noise variance do not establish global optimization or perpetual viability. The former unconditional learning proof is withdrawn.


§9. T-156: mixing is an optimization problem, not a derived constant​

The earlier expression

β∗=λgapλgap+αD(1−Penv/Ptarget)\beta^*=\frac{\lambda_{\mathrm{gap}}}{\lambda_{\mathrm{gap}}+\alpha_D(1-P_{\mathrm{env}}/P_{\mathrm{target}})}

is retained only as an unvalidated historical proposal [H], not an optimum theorem. It can leave the admissible interval: λgap=1\lambda_{\mathrm{gap}}=1, αD=2/3\alpha_D=2/3, Penv=1P_{\mathrm{env}}=1, Ptarget=3/7P_{\mathrm{target}}=3/7 gives β∗=9\beta^*=9. No objective or derivative in the former proof establishes the formula.

In T-148's undamped constant-input model, smaller β\beta gives a larger mixture weight at every tick and weakly earlier purity crossing. An interior optimum needs another explicit cost or constraint, such as autonomy, resource use or a certified finite-horizon exit probability. Declare these functions and a compact admissible set. Continuity gives existence of a minimizer; uniqueness and a closed formula require additional convexity or a direct analysis. No universal optimum follows from embodiment.


§10. T-157: Attractor consistency​

Theorem T-157 [T]: Attractor consistency

Level 1 is the attractor ρ∗\rho^* of the full dynamics, level 2 the fixed point of the self-model (exact self-knowledge).

  1. Self-knowledge defect (any self-model). κgV (φ(ρ∗)−ρ∗)=−L0[ρ∗]\kappa g_V\,(\varphi(\rho^*) - \rho^*) = -\mathcal{L}_0[\rho^*], so ∥φ(ρ∗)−ρ∗∥F≤(2∥H∥op∥ρ∗−I/7∥F+23Pcoh)/(κgV)\|\varphi(\rho^*) - \rho^*\|_F \leq \bigl(2\|H\|_{\mathrm{op}}\|\rho^* - I/7\|_F + \tfrac23\sqrt{P_{\mathrm{coh}}}\bigr)/(\kappa g_V).
  2. Hamiltonian shift (φs\varphi_s). ∥Γm(H)−em∥F=2 (∑j≠m∣Hjm∣2)1/2/(23+67κ(1−c))+O(∥H∥2)\|\Gamma_m(H) - e_m\|_F = \sqrt2\,\bigl(\sum_{j \neq m}\lvert H_{jm}\rvert^2\bigr)^{1/2}/\bigl(\tfrac23 + \tfrac67\kappa(1 - c)\bigr) + O(\|H\|^2), where eme_m is the exact fixed point of φs\varphi_s that the attractor Γm(H)\Gamma_m(H) continues.
  3. Dissipative shift (φJ\varphi_J). ∥Γη+−Γη∞∥F=6/7 (η∞−η+)≤6/7 (2η+/3)/∣λY∣=O(1/κ)\|\Gamma_{\eta_+} - \Gamma_{\eta_\infty}\|_F = \sqrt{6/7}\,(\eta_\infty - \eta_+) \leq \sqrt{6/7}\,(2\eta_+/3)/\lvert\lambda_Y\rvert = O(1/\kappa), where Γη∞\Gamma_{\eta_\infty} is the only fixed point of φJ\varphi_J and λY\lambda_Y the stability exponent of the attractor Γη+\Gamma_{\eta_+} along uu†−I/7uu^\dagger - I/7.

Proof and numerical check: evolution, attractor consistency. Status: C21 as stated ("ρΩ∗≈Γcoh∗\rho^*_\Omega \approx \Gamma^*_{\mathrm{coh}}") is false [✗]; its correct content is this theorem [T].


§11. Fixed targets and rotating coherence​

For the scalar model γ˙ij=−(d+a+iωij)γij+aρij∗\dot\gamma_{ij}=-(d+a+i\omega_{ij})\gamma_{ij}+a\rho^*_{ij} with fixed coefficients, d,a≥0d,a\ge0 and d+a>0d+a>0, the unique stationary coherence is

γijstat=aρij∗d+a+iωij,∣γijstat∣=a∣ρij∗∣(d+a)2+ωij2.\gamma_{ij}^{\mathrm{stat}}=\frac{a\rho^*_{ij}}{d+a+i\omega_{ij}},\qquad |\gamma_{ij}^{\mathrm{stat}}|=\frac{a|\rho^*_{ij}|}{\sqrt{(d+a)^2+\omega_{ij}^2}}.

Rotation suppresses the magnitude relative to ωij=0\omega_{ij}=0; it does not universally force Φ<1\Phi<1. At H=0H=0 the fixed φJ\varphi_J anchor already supports a window sink, and for sufficiently small HH it persists. Co-rotating targets are one model option, not a necessary condition for integration. With state-dependent targets/rates the stationary expression becomes a self-consistency relation and needs a separate existence/stability analysis.


§12. T-158: declared stress scores [D]​

One selected diagonal score [D] is

σkdiag=clamp(1−7γkk,0,1).\sigma_k^{\mathrm{diag}}=\mathrm{clamp}(1-7\gamma_{kk},0,1).

PSD and trace one give 0≤γkk≤10\le\gamma_{kk}\le1, hence −6≤1−7γkk≤1-6\le1-7\gamma_{kk}\le1 and 0≤σkdiag≤10\le\sigma_k^{\mathrm{diag}}\le1. The score is zero at γkk≥1/7\gamma_{kk}\ge1/7, one at γkk=0\gamma_{kk}=0, and 1−7γkk1-7\gamma_{kk} between them. It is continuous and piecewise smooth in the fixed frame. This follows exactly from the chosen function; it does not uniquely derive a stress measurement.

The different T-128 score σEdiff=(7−Ddiff7D)/5\sigma_E^{\mathrm{diff}}=(7-D_{\mathrm{diff}}^{7D})/5 uses a separately declared differentiation proxy. If Ddiff7D∈[1,7]D_{\mathrm{diff}}^{7D}\in[1,7], then σEdiff∈[0,6/5]\sigma_E^{\mathrm{diff}}\in[0,6/5]. These definitions generally differ; one cannot assign the first function's range to the second or equate it with reduced entropy without a realization map. Each variant needs its own normalization and cut.

Computability from a matrix does not prove identifiability from incomplete data or establish clinical stress. Biological validation and its action bridge remain hypotheses. T-158 names the readout choices [D]; the stated bounds [T] are conditional on those precise definitions.


§13. ARCH-159: a reference architecture, not a uniqueness theorem​

A reference implementation may choose a seven-dimensional state, a specified GKSL linear part with regular nonlinear feedback, a state-valued self-model, a declared stress/action objective, an external input policy and the full Cap2\mathrm{Cap}_2 gate. These are a reproducible architecture specification [D]; physical realization and experience identification remain [H/I].

Different anchors, encoders, feedback laws, gates and learning procedures can satisfy the same structural constraints. T-123 and the universal functional-minimality argument do not select one implementation. GKSL classifies linear Markovian generators; it does not derive a unique nonlinear regenerator or force “three and only three” causal mechanisms. A fixed-target replacement channel is one CPTP option, and state-dependent mixing is generally nonlinear. External injection can enable genesis in its parameter regime, but embodiment alone does not imply the full gate.

The previous necessity/sufficiency claim for every conscious substrate and uniqueness up to G2G_2 are withdrawn. A fixed observational model can be tested on different substrates using the same declared readouts and criteria; this is conditional comparability, not a universal consciousness theorem.


§14. Result scope​

ResultCorrected status
T-148/T-149Exact genesis/stationarity in stated affine models; general claims conditional
T-150Iteration identity; tower compatibility separately specified
T-151Differentiation cut [D], readout-dependent
T-152Choi/diamond bounds for linear channels; feature estimators require statistical identification
T-153/T-153a/T-253Declared substrate predicate; faithful-sector construction and global dimension obstruction
T-155Closed-margin feasibility under exact projection or certified acceptance
T-156Universal optimal formula withdrawn; explicit constrained optimization required
T-157Existing conditional anchor/attractor perturbation formulas retained
ARCH-159Reference architecture [D/H]; universal uniqueness withdrawn

Related documents: