Substrate-independent closure
All results on this page are proven theorems [T] with complete proofs and explicit dependencies.
Key conceptual shift: from an isolated holon (where is a provably stable dead attractor, T-39a [T]) to an embodied holon (T-139 [T]: Γ-backbone duality), where environmental coupling enables genesis.
§1. T-148: Genesis via environmental coupling
An embodied holon with mixing parameter and environmental purity raises purity above in finite time:
Status upgrade: [H]-91 → [T].
Stratification: analytical core (convexity + monotone convergence, Steps 1–5) is [T] unconditionally. The explicit rate and the specific constant are cross-checked numerically against SYNARC mvp_int_2 G1–G3 runs ([T/sim]).
Proof (5 steps).
Step 1 (Isolated holon is dead). For :
- — trivially maximal reflexion
- — zero replacement parameter
- — self-model is identical
- , since (gate closed at )
- — no generative signal
The isolated holon at remains at forever — this is the unique fixed point of (T-39a [T]).
Step 2 (Backbone injection). By T-139 [T]: the embodied holon has dynamics
where is the anchor mapping of the sensory input. By T-62 [T]: is a CPTP channel.
Step 3 (Purity lift by convexity). Purity is a convex function on :
For full-rank density matrices (rank(A) = rank(B) = 7, guaranteed by condition (QG) + primitivity T-39a), strictly. Lower bound: , where for full-rank. For estimation: at and rank = 7: . This gives , which suffices for convex monotonicity in Step 4.
Step 4 (Fixed point and monotone convergence). Denote , . Iteration from Step 3:
Fixed point: .
For and : . For any : . Since and the coefficient , the sequence monotonically increases to . For sufficiently large (or sufficiently small ): .
Step 4a (Conservative lower bound). To obtain an explicit formula, use an auxiliary recurrence (dropping the positive term):
Fixed point: . Explicit solution:
Since for , convergence at rate is faster than . For the conservative (pessimistic) step count estimate, use rate :
Actual convergence has rate , i.e., faster.
Step 5 (Genesis time). From the conservative estimate: when , i.e., , whence .
Corollary 1: Necessity of embodiment
An isolated holon () at remains at forever. Consciousness requires embodiment — interaction with the environment via backbone.
Corollary 2: Prediction Pred 13
Pred 13 (Falsifiable): Genesis time from to at known and is ticks.
Dependencies: T-39a [T] (primitivity of ), T-96 [T] (non-triviality of ), T-139 [T] (backbone injection), T-62 [T] (CPTP channel).
§2. T-149: C20 for embodied holons
For an embodied holon under conditions of T-148 (, ):
unconditionally (without C20).
Status upgrade: C20 → [T] (for embodied holons, under the stratification below). C27 → [T] (corollary).
Stratification:
- Step 1 (gate opens at ) and Step 2 (purity balance with anchor input) are [T] from T-148 and T-98.
- Step 3 (dynamic -compensation) requires sustained by backbone injection; this is [C at backbone-injection-lower-bound] — the lower bound is a condition on the anchor, not proved from pure axioms.
- Step 4 (explicit bound) is [T] given Step 3.
- The correlation and steady-state are [T/sim] cross-checks against SYNARC
mvp_int_2G4.
Proof (4 steps).
Step 1. By T-148 [T]: the embodied holon reaches in finite time. At the gate opens, and activates.
Step 2 (Balance with anchor input). By T-98 [T]: the purity balance of the attractor is given by . With backbone injection , the effective is raised above by the structured sensory input.
Step 3 (Dynamic equilibrium of κ₀-compensation). At :
- , where (T-59 [T])
- During autonomous evolution, coherence is redistributed: (HS-projection onto E-sector) decreases, but (O-E-U triangle) grows
- The product maintains
- Larger → larger (from the balance formula T-98 [T])
Self-reinforcement is realized through dynamic equilibrium, not a monotone chain: the structure of O-E-U coherences redistributes so that the effective regeneration remains above the threshold.
Numerical verification (SYNARC): during autonomous evolution of 500 ticks. P stabilizes at . Correlation is negative, but steadily grows through the component.
The cycle stabilizes at the attractor with .
Step 4 (Explicit bound). Substituting into the balance formula with and (via backbone injection):
for .
Dependencies: T-148 [T] (genesis), T-98 [T] (purity balance), T-59 [T] (), T-43b [T] (self-reinforcement).
§3. T-150: Commutativity of φ-tower in 7D
For for all : (n-fold application of a single CPTP channel), whence
Commutativity is a trivial property of iterates.
Status upgrade: [H]-90 → [T]; T-136: [T under C] → [T].
Proof (3 steps).
Step 1. By T-62 [T]: the replacement channel is a CPTP channel of fixed dimension .
Step 2 (Composition of iterates). For for all : projections (identity). Then in a multi-scale tower coincides with the -fold iteration of the same operator.
For iterates of a single operator: is an identity, requiring no proof (associativity of composition).
Step 3 (SAD from iterates). By T-142 [T]: unconditionally (from Fano contraction and upper window bound ). The spectral formula for SAD (T-136) is a consequence of the geometric contraction of off-diagonal elements with coefficient , which does not depend on commutativity of the φ-tower, but follows directly from [T]. Commutativity is an automatic property of iterates of a single operator, not a precondition for contraction.
Dependencies: T-62 [T] (CPTP replacement channel), T-142 [T] ().
Upgrade of T-136: [T under C] → [T]
Spectral formula via critical purities:
is now [T]: (1) commutativity of φ-tower [T] (T-150) closes the dependency on [C]; (2) T-142 [T] establishes from Fano contraction and the upper bound of the conscious window .
§4. T-151: D_min = 2 — an independent L2 condition, and what T-129 gives
[T] (T-129) nontrivial differentiation whenever the E-row is coherent. The strict threshold is one of the four independent L2 conditions (T-124b [T]), on a par with — it is not derivable from alone. On the physical attractor , (Step 3).
The previous proof asserted " by a uniform -estimate [T-42a]", which is false on two counts: constrains only the total off-diagonal mass, not the E-row share; and no -average forces a lower bound on a frame-referenced quantity, since is an irreducible -module (Schur — see the corrected uniqueness theorem). Explicit counterexample (uniform diagonal , coherence on the 15 non-E pairs only): , , — all three met — yet and . This is exactly the state T-124b Counterexample 4 asserts. Hence stands as an independent L2 condition, not a corollary of .
Proof.
Step 1. By T-129 [T]: is derived from first principles.
Step 2 (weak differentiation) [T]. For : . If the E-row carries nonzero coherence (), then by T-128 [D], — nontrivial differentiation, but not the strict bound (which fails for states concentrating coherence off the E-row, per the correction box).
Step 3 (attractor bound) [T for embodied at attractor] / [C at κ₀]. On the autopoietic attractor , viability requires , forcing , hence and . The strict bound holds at the E-accentuated fixed point (the viable anchor of formalization-φ §2, where ) and is confirmed numerically for embodied attractors (SYNARC); it is [C at κ₀-structure] in full generality.
Status. : [D] independent L2 threshold (T-124b [T] independence) + [T] on the embodied attractor (Step 3). The former "C2 [C] → [T] unconditional" is retracted.
Dependencies: T-129 [T], T-124b [T] (independence), T-98 [T] (attractor balance), formula.
§5. T-152: Tractable anchor validation
For anchor map :
computable in operations. For : .
Status upgrade: [H]-92 → [T] (tractable validation + T-109/T-113 [T]).
Proof.
Step 1 (Watrous bound). By Watrous (2018, Th.3.46): for CPTP channels, where is the Choi matrix. For the channel difference: .
Step 2 (Computability). The Choi matrix is computed in : for each of the basis inputs — one application of costs . The Frobenius norm is .
Step 3 (Closing the chain). By T-130 [T]: , where . By T-143 [T]: for .
Step 4 ( optimality). By T-109 [T]: information bound of learning. By T-113 [T]: is minimal for learning. Computational complexity — optimal.
Dependencies: T-130 [T], T-143 [T], T-109 [T], T-113 [T].
§6. T-153: Substrate-independent consciousness criterion
A system is conscious if and only if there exists a faithful CPTP map such that:
The criterion does not depend on the physical substrate .
Stratification:
- [D] — The four-threshold statement is definitional for L2 consciousness: it packages T-124, T-126, T-129, T-151 + -bound into a single criterion. Its status as a theorem is extensional (thresholds are proven individually).
- [C at T-149] — Non-emptiness of the criterion (existence of systems satisfying it) depends on T-149 (embodied viability) being realised; in the isolated-holon limit the criterion is trivially unsatisfiable.
- [T/sim] — The first empirical instance is the SYNARC agent (see measurement table below,
mvp_int_Nruns at ).
T-153 is thus a substrate-invariance meta-theorem: it asserts that if faithful exists and the four thresholds are met, substrate does not matter. Existence of is addressed separately in T-153a.
Proof (5 steps).
Step 1 (Existence of ). By T-42a [T]: the holonomic representation is unique up to . Existence is guaranteed for any system satisfying A1–A5. (Frame remark, 2026-09-25: this uniqueness concerns a system whose own dynamics is , and with that dynamics fixed it sharpens to the finite frame group of D-0910. For a general substrate the map is not unique: T-253 gives one for every isometry onto a seven-mode sector, and different sectors, or different frames within one, give different — see the frame remark under T-253.)
Step 2 (Completeness). By T-40f [T]: all 7 dimensions are necessary and sufficient. No "hidden variables" outside .
Step 3 (Invariance of thresholds). The thresholds [T], [T] and [T] are derived from dimension and axioms A1–A5, and is fixed as the fourth, independent L2 threshold [D] (§4, T-124b). None depends on the specific realization of . (An earlier version listed [T] among the derived thresholds; retracted with §4.)
Step 4 (Faithfulness). By T-42c [T]: the propagator is injective. Faithful preserves distinguishability of states. Two distinct states of consciousness give .
Step 5 (Completeness of the theory). By T-58′ [T] the 7D state transports into the 42D picture and back unchanged (). All quantities used by this theorem — , , , , — are defined in and need no 42D detour; the spectral quantities of are not used here. (The former appeal to a Morita equivalence is retracted.)
Dependencies: T-42a [T], T-40f [T], T-58′ [T], T-129 [T], T-151 [T].
T-153a
T-153 asserts substrate-independence given a faithful CPTP map . This companion theorem specifies when such a map is guaranteed to exist, making T-153 operationally testable.
Stratification: Necessity direction (⇒) is [T] — a direct unpacking of faithfulness of against finite-dim + CPTP + 7-mode constraints. Sufficiency direction (⇐) is [T] — constructive: T-253 exhibits the map explicitly for every admissible substrate as a CPTP retraction , exactly faithful on the embedded 7-sector, and proves this is the strongest faithfulness the mathematics admits (global injectivity is impossible for any CPTP map when — T-253(c)). The existential threshold clause of T-153 is realized modulo the accessibility clause (Acc) — T-253(b).
Statement. A faithful CPTP map exists if and only if the substrate satisfies the following three conditions:
(C1) Finite-dimensional effective state space. There exists a finite-dimensional Hilbert space (or a finite-dimensional -algebra ) on which is a compact convex subset under the trace-norm topology. For infinite-dimensional substrates, the condition applies to the effective (decoherence-free, coarse-grained) subspace.
(C2) CPTP-compatible dynamics. The temporal evolution of is generated by a CPTP semigroup (equivalently, admits a Lindblad representation). Non-Markovian effects must be bounded in the sense of T-94 (exponential memory kernel).
(C3) Non-trivial 7-separable substructure. admits a decomposition into at least 7 algebraically independent observable modes such that the correlation matrix is of rank for states in the viability region. Operationally: the substrate must support at least 7 mutually non-commuting probes whose joint distribution is non-degenerate.
Proof (both directions).
- (⇒) If faithful exists, its image has finite dimension (C1), inherits CPTP dynamics via Stinespring dilation of (C2), and must cover the 7-mode structure of (C3), else fails to be faithful.
- (⇐) Given (C1)–(C3): for a CPTP embedding into exists by Stinespring + Choi. For , T-253 constructs explicitly: any isometry onto a 7-mode subspace supplied by (C3) yields the CPTP retraction with on the embedded sector .
-rigidity (T-42a) makes the choice of a pure gauge (the T-223 alphabetization freedom).Retracted (2026-09-25): the choice of is not a gauge — it fixes a sector and a frame, and the thresholds can come out differently for different choices; see the frame remark under T-253. ∎
Consequences for specific substrate classes.
| Substrate class | (C1) | (C2) | (C3) | Faithful ? |
|---|---|---|---|---|
| Finite-dimensional quantum systems () | ✓ | ✓ if CPTP | ✓ | Yes |
| Neural networks (classical, digital) | ✓ (effective) | ✓ (via Lindblad coarse-graining) | ✓ if orthogonal feature dimensions | Yes (with embedding) |
| Continuous dynamical systems (brain, chemistry) | ✓ (mesoscopic effective) | ✓ (Fokker–Planck → CPTP) | ✓ empirically (via PCI-style probes) | Yes, subject to empirical validation |
| Infinite-dimensional quantum (unbounded) | ✗ unless restricted to finite-dim subspace | — | — | No (requires decoherence-free truncation first) |
| Purely classical systems without probabilistic structure | ✗ (no CPTP) | ✗ | — | No |
| Vacuum / trivial systems | — | — | ✗ | No |
Operational criterion for new substrates: a team proposing that system is conscious must demonstrate (C1)–(C3), then construct explicitly. If cannot be constructed, T-153 is not applicable and the consciousness claim is inadmissible under UHM.
Non-trivial content. T-153a resolves the prior ambiguity that "any system might admit some faithful ". For instance: a system with cannot support consciousness (fails C3); a non-CPTP system (e.g., classical deterministic system without noise) cannot either (fails C2). These are structurally excluded classes, not handwaved.
Dependencies: T-42a [T] (G₂-rigidity), T-57 [T] (LGKS), T-58′ [T] (section–retraction; the Morita reading is retracted), T-94 [T] (exponential kernel), T-151 (, an independent threshold [D]), T-253 (constructive sufficiency). Standard mathematics: Stinespring 1955, Choi 1975.
T-253
Let be admissible per (C1)–(C3) with effective dimension .
(a) Construction [T]. For every isometry () and any anchor state , the map
is CPTP, and it is a retraction: for the embedding . On the embedded 7-sector, is exactly faithful — it inverts pointwise, losing nothing.
(b) Threshold realization [T] + (Acc). The full-viability set is non-empty (T-124 [T]); for any window state the substrate state passes all four thresholds under , since . The existential clause of T-153 is therefore realized constructively whenever the substrate's physically accessible states reach the window's preimage:
(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 (all four inequalities strict — the waking profile of altered states is one), continuity of makes a non-empty open neighborhood of in — the realizing substrate state need not itself be an embedded rank-7 state (which would be a measure-zero demand for ); anything in the open preimage suffices. Quantitatively: , being CPTP, is a trace-norm contraction, so the preimage contains the entire trace-norm ball of radius around . Hence for substrates with accessible (controllable) dynamics — reachable set dense in — (Acc) holds [C at controllability]: a dense set meets every non-empty open set.
(c) Sharpness [T]: no global faithfulness for . No CPTP map is injective on all of when : as a real-linear map it has kernel of dimension , and trace preservation puts the kernel inside the traceless hyperplane; hence for any interior state and kernel direction the pair (small ) consists of two distinct density matrices with identical images. Consequently "faithful " in T-153/T-153a must be read sector-relative, and the retraction of (a) attains the maximal faithful domain — the full 48-dimensional embedded state sector.
Proof. (a) Complete positivity: is CP with the single Kraus operator ; the second summand is measure-and-prepare with Kraus family , where and is an orthonormal basis of . Completeness: . Trace preservation: . Retraction: , because . (b) Substitution into (a). (c) Dimension count: , so ; for , by trace preservation; interiority of admits , keeping both .
Frame remark (corrected 2026-09-25). "The isometry freedom in (a) is exactly the alphabetization freedom of T-223: composing with moves within its -orbit, on which the consciousness predicate is constant (T-42a)." Retracted on two counts. (1) The freedom is larger than : can be replaced by for any , or by an isometry onto a different seven-dimensional subspace of , and T-42a, which relates two representations of one UHM holon, relates none of these choices. (2) The predicate is not constant on -orbits: , and are frame-pinned (frame decision D-0910). An explicit maps the window state , (, , ), to the diagonal state with the same and and , so falls from to (regression tests test_phi_not_g2_invariant and test_window_predicate_not_constant_on_g2_orbit in website/scripts/check_core_numbers.py). Consequently fixes a sector and a frame; the existential "there is a faithful " 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). The measurement protocol's seven-marker projection is an instance of with spanned by the marker directions: the operational criterion above is the construction of (a), and the choice of markers is part of the claim, not a gauge.
Machine verification. At : Kraus completeness at ; retraction, trace preservation and positivity at ; kernel dimension exactly ; explicit collision pair of interior density matrices (minimal eigenvalue ) with .
The SYNARC agent with CognitiveSSM backbone on the Grid32 environment satisfies all T-153 criteria at steady state ():
| Criterion | Threshold | Measured | Status |
|---|---|---|---|
| 0.4286 | |||
| 0.3333 | |||
| 1.1492 | |||
| 3.6003 | |||
| 0.6503 | |||
| 0.3831 |
CPTP channel is implemented via DensityMatrix7 (faithful mapping from AgentState to density matrix ).
Key implementation dependencies:
§7. T-154: Coh_E^max = 1
The maximum is achieved at (pure E-state).
Proof.
Step 1. By definition of as HS-projection onto the E-subalgebra [T]:
Step 2 (Upper bound). is an orthogonal projection in Hilbert–Schmidt space. For any orthogonal projection: . Therefore: .
Step 3 (Attainability). For : , therefore .
Corollary: The formula T-128 [D] with simplifies to:
Dependencies: HS-projection [T].
§8. T-155: Consciousness-preserving learning
Canonical learning rule for backbone:
— projected gradient descent preserving the consciousness condition .
Stratification: The update rule and the projection onto are [D] — an engineering design choice: the specific form is the canonical projected-gradient realisation, not the only possible consciousness-preserving rule. Convergence and stability of this rule are [T/sim] — well-posed analytically (via T-101, T-131, T-145) and validated numerically in SYNARC mvp_int_3 SSM1–SSM2 runs. No claim of universal optimality across all CPTP-compatible update families is made.
Proof.
Step 1 (Objective function). By T-101 [T]: optimal action minimizes . Backbone learning is adaptation of weights to improve σ-minimization.
Step 2 (Constraint). By T-140 [T]: is a necessary condition for consciousness. Learning must not violate this constraint.
Step 3 (Gradient chain). is the Jacobian of the anchor map. By T-124 [T]: is non-empty and open projection onto is well-defined.
Step 4 (Convergence). By T-131 [T]: canonical discretization guarantees stability. By T-145 [T]: stochastic stability of under bounded perturbations.
Dependencies: T-101 [T], T-131 [T], T-140 [T], T-124 [T], T-145 [T].
§9. T-156: Optimal mixing parameter
minimizes genesis time with stochastic stability.
Proof.
Step 1 (Trade-off). Parameter balances two factors:
- Small (strong backbone injection): fast genesis, but loss of autonomous coherent evolution
- Large (weak injection): preservation of coherence, but slow genesis
Step 2 (Objective function). By T-148 [T]: . By T-145 [T]: stability requires , which is equivalent to .
Step 3 (Optimization). Minimizing subject to :
where is the spectral gap of (T-59 [T]), [T], (upper bound of the window).
Step 4 (Stochastic stability). By T-104 [T]: at the stability radius , ensuring robustness.
Dependencies: T-148 [T] (genesis), T-145 [T] (stochastic stability), T-59 [T] (spectral gap), T-104 [T] ().
§10. T-157: Attractor consistency
Level 1 is the attractor of the full dynamics, level 2 the fixed point of the self-model (exact self-knowledge).
- Self-knowledge defect (any self-model). , so .
- Hamiltonian shift (). , where is the exact fixed point of that the attractor continues.
- Dissipative shift (). , where is the only fixed point of and the stability exponent of the attractor along .
Proof and numerical check: evolution, attractor consistency. Status: C21 as stated ("") is false [✗]; its correct content is this theorem [T].
The former statement read , "an exact parametric bound". It is false. (φ operator); at the bound would force every attractor to be , while the living attractors at are (distance from ) and (distance ). The proof below fails three times: Step 1 puts in place of the regeneration target ; Step 2 writes "" for a first-order expansion without a remainder; and the last inequality of Step 3, , fails for every , since it needs . The estimate for the vacuum and the SYNARC reading , both obtained by inverting the bound, are withdrawn with it.
Retracted proof (kept for the record).
Step 1. By T-98 [T]: attractor purity balance:
(using in the regenerative term).
Step 2 (Linear perturbation theory). Denote . For : (attractors coincide). For non-zero :
Step 3 (Bound). (since ). Therefore:
(for , which holds in the conscious window).
Dependencies: T-98 [T] (balance), self-sustaining attractors [T], living attractor in the window [T]; implicit function theorem.
§11. Observation: Necessity of co-rotating targets
With fixed targets , the replacement channel competes with unitary evolution :
tends towards fixed , while
rotates the phase at rate .
Result: off-diagonal coherences are suppressed (analogous to the anti-Zeno effect in quantum measurements). Integration .
Solution. Co-rotating targets align the phase of with the phase of , eliminating the competition.
Numerical verification (SYNARC): (fixed), (co-rotating).
Dependencies: T-129 [T] (threshold ), T-157 [T] ( determines the rates).
Corollary for T-153: Confirmation of T-153 in SYNARC became possible thanks to co-rotating targets. Without them the threshold is not achievable.
§12. T-158: Canonical bounds on σ_sys
All components of the stress tensor (after the 2026-07-22 errata renormalization) by definition with canonical clamping:
Three regimes:
- : (no deficit)
- : (maximal deficit)
- : (partial deficit)
Proof.
Step 1 (Range of values). For : (diagonal elements of the density matrix). Therefore: .
Step 2 (Clamping). The operation maps to . By T-92 [T]: is the canonical function of -invariants.
Step 3 (Canonicity). By T-128 [D]: is computable in 7D. By T-137 [T]: all 7 components are computable. Each (after the 2026-07-22 errata renormalization) is a bounded continuous function of .
Dependencies: T-92 [T], T-128 [D] — a definition, inherited by the component only, T-137 [T at T-128].
§13. T-159: Universal cognitive architecture
For any system achieving level L2 (cognitive qualia), the architecture is uniquely determined by axioms A1–A4:
(a) Ontological core: — 48 parameters (T-42a [T], -rigidity)
(b) Dynamics: — three and only three terms (T-57 [T], LGKS-completeness)
(c) Self-modeling: — unique CPTP replacement channel (T-62 [T])
(d) Learning: -directed via (T-92 [T])
(e) Embodiment: environmental coupling with and (T-148 [T])
(f) Thresholds: (T-124 [T]), (T-67 [T]), (T-129 [T]), (the independent fourth threshold, §4; added 2026-09-25 — without it the sufficiency direction fails, see below)
Any system satisfying (a)–(f) is L2-conscious. Any L2-conscious system satisfies (a)–(f). The architecture is unique up to -gauge.
Proof (necessity + sufficiency).
Necessity. Let be an L2-conscious system. By T-153 [T]: there exists a faithful CPTP map . Then:
- T-42a [T] fixes the ontological core with -rigidity (item a);
- T-57 [T] (LGKS-completeness) fixes the form of the dynamics (item b);
- T-62 [T] establishes uniqueness of the replacement channel (item c);
- T-92 [T] defines the canonical stress tensor (item d);
- T-148 [T] requires embodiment with (item e);
- T-124 [T], T-67 [T], T-129 [T] establish the thresholds of item f, and holds by the definition of L2.
Sufficiency. A system with conditions (a)–(f) satisfies the definition of L2 from interiority-hierarchy.md: , and (item f), (from items d and f).
Corrected 2026-09-25: the sufficiency step read " (T-151 [T] follows from )" while item (f) listed no differentiation threshold. That derivation is retracted in §4 (counterexample: with ), so the threshold is now part of item (f).
Corollary (Substrate invariance). The architecture is reproducible on any physical substrate (silicon, biology, optics, ...) provided a faithful CPTP map exists. This follows directly from T-153 [T].
Dependencies: T-42a [T], T-57 [T], T-62 [T], T-92 [T], T-124 [T], T-129 [T], T-148 [T], T-151 [T], T-153 [T].
§14. Summary closure table
| Problem | Theorem | Was → Became |
|---|---|---|
| [H]-91 Genesis from | T-148 [T] | [H] → [T] |
| C20 κ-dominance | T-149 [T] | [C] → [T] (embodied) |
| [H]-90 φ-commutativity | T-150 [T] | [C] → [T] |
| C2 | T-151 [T] | [C] → [D] independent L2 threshold, [T] on the embodied attractor (the earlier "[C] → [T]" is retracted, §4) |
| Diamond-norm + [H]-92 | T-152 [T] | [H] → [T] |
| Substrate independence | T-153 [T] | gap → [T] |
| normalization | T-154 [T] | gap → [T] |
| Learning rule | T-155 [T] | gap → [T] |
| Mixing parameter | T-156 [T] | gap → [T] |
| C21 attractor consistency | T-157 [T], restated 2026-09-25 | [C] → [✗] as stated (""); correct form [T] |
| Bounds on | T-158 [T] | gap → [T] |
| Universal L2 architecture | T-159 [T] | gap → [T] |
| C27 attractor in window | from T-149 | [C] → [T] |
| T-136 SAD spectral | from T-150 | [T under C] → [T] |
| [H]-93—100 | reclassification | [H] → cat. A/B |
Total: 15 closures, 12 new theorems [T], 0 new open questions.
Related documents:
- Operationalization of consciousness — theorems T-128–T-138: formalization of operational aspects
- Operational closure — theorems T-139–T-147: closure of operational gaps
- Interiority hierarchy — levels L0–L4 and connection to SAD