Substrate-independent closure
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 and a gate with , the isolated initial state is stationary. This concerns that initial state and model, not the absence of living states for all isolated self-models.
Fix a state , , and a depolarizing propagator with . For the declared update
let and . Direct substitution gives
If , put . The strict purity cut is reached in finite time iff . For its first tick is
For , it is the first tick when ; otherwise it is never reached. The special undamped case has and .
Proof. The affine coefficient obeys ; solve this scalar recurrence and use . Crossing is , giving the displayed strict inequality and integer bound.
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 ; it need not exceed either input purity. Even a pure input with , gives and for every .
Scope of embodiment
External injection is one way to leave 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, and do not imply an above-threshold attractor, as T-148's explicit counterexample shows. For that affine model the fixed state is , and it is structurally viable exactly when . A continuous model with depolarizing rate and injection rate has the same result with .
For isotropic Fano dephasing, state-dependent regeneration and another input field , a stationary state satisfies
Hence iff the numerator exceeds . The actual overlap and input flux 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 , linear or nonlinear, by associativity. Equal dimensions alone do not identify distinct operators, readouts or projections in a heterogeneous tower. That tower needs the separately verified diagrams .
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 is a model selection [D]. If , the map or lift defining must be specified. The scalar integration condition satisfies only , and places no universal bound on an E-row coherence or the entropy of an arbitrary reduced experiential state.
If instead , then whenever ; 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 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 , let be the unnormalized Choi matrix of . Then
The lower bound evaluates the normalized maximally entangled input. For the upper bound write any pure input with an ancilla of dimension 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 . The final inequality is the Schatten norm bound. See Watrous, Chapter 3.
A channel is CPTP iff and . Constructing a general requires basis-operator evaluations and entries; costs depend on the evaluation oracle, numerical precision and positivity certification. The previous feature-dimension bound 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 , its calibration, functional frame, experiential realization and observation model before evaluating the system. Define , 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 , seven functional names and a section–retraction do not prove universal completeness of , 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 , when an isometry gives the injective CPTP embedding . When , no globally injective linear CPTP readout into 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 -fiber must have the same reduced future: . 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 , the specified CPTP retraction gives CPTP reduced propagators ; invariance establishes their semigroup composition. Neither static Stinespring dilation of 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
Let be a specified finite-dimensional Hilbert space with .
(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 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: 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 the withdrawn universal T-42a does not identify any 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). 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 : Kraus completeness at ; retraction, trace preservation and positivity at ; kernel dimension exactly ; explicit collision pair of interior density matrices (minimal eigenvalue ) with .
For the reported CognitiveSSM/Grid32 run, the quoted values are , , , and . These are rounded outputs of the selected readout. The number alone does not certify the non-strict cut : the unrounded value and a numerical/measurement error bound are needed. The product 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 . 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
The maximum is achieved at (pure E-state).
Proof.
Step 1. By definition of as HS-projection onto the E-row/column operator subspace [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: feasible learning in a declared capability model
A condition cannot replace . Nor does non-emptiness of an open set guarantee a nearest-point projection. Use a nonempty closed margin set with declared readouts, e.g.
With continuous functions it is compact. For a continuous parameterized encoder and compact weight domain, its nonempty preimage is compact. An exact projection of a proposed update onto 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 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
is retained only as an unvalidated historical proposal [H], not an optimum theorem. It can leave the admissible interval: , , , gives . No objective or derivative in the former proof establishes the formula.
In T-148's undamped constant-input model, smaller 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
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].
§11. Fixed targets and rotating coherence
For the scalar model with fixed coefficients, and , the unique stationary coherence is
Rotation suppresses the magnitude relative to ; it does not universally force . At the fixed anchor already supports a window sink, and for sufficiently small 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
PSD and trace one give , hence and . The score is zero at , one at , and 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 uses a separately declared differentiation proxy. If , then . 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 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 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
| Result | Corrected status |
|---|---|
| T-148/T-149 | Exact genesis/stationarity in stated affine models; general claims conditional |
| T-150 | Iteration identity; tower compatibility separately specified |
| T-151 | Differentiation cut [D], readout-dependent |
| T-152 | Choi/diamond bounds for linear channels; feature estimators require statistical identification |
| T-153/T-153a/T-253 | Declared substrate predicate; faithful-sector construction and global dimension obstruction |
| T-155 | Closed-margin feasibility under exact projection or certified acceptance |
| T-156 | Universal optimal formula withdrawn; explicit constrained optimization required |
| T-157 | Existing conditional anchor/attractor perturbation formulas retained |
| ARCH-159 | Reference architecture [D/H]; universal uniqueness withdrawn |
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