Interiority Hierarchy: L0 → L4
The hierarchy separates an ontological interpretation, an operational classification, and the mathematical consequences of that classification. A density matrix does not by itself establish phenomenal consciousness. The identification of the operational L2 predicate with cognitive qualia remains the two-aspect bridge [I].
This page is the canonical definition of the hierarchy. The revision of 2026-10-03 replaces incompatible definitions of L3/L4 and the false Gap-injection theorem. Definitions have status [D]; algebraic consequences [T]; statements about organisms or phenomenal access [H]/[I]. The detailed proofs and counterexamples are in Formal specification.
Typed input
Classification uses an augmented record
not merely a matrix. Here specifies the experiential realisation, the implemented self-model/readout, and the probes and calibration used to test higher-order predictions. Missing components are reported as unknown, rather than inferred from phase or purity.
Two experiential modes are kept distinct:
| Mode | L1 predicate | Differentiation |
|---|---|---|
| 7D proxy [D] | ||
| Specified extension |
The canonical normalisation is . The proxy is a stipulated statistic, not an equality to extension entropy. In the extension must be a normalised density matrix on a declared space. A genuine tensor factor permits a partial trace. The 42D Page–Wootters E-axis is a summand of the six-dimensional system factor: its clock block must be normalised by its trace when nonzero. The lift and conditioning are part of . See 7D/42D typing.
Because the canonical E-projection includes ,
is equivalent to for a positive matrix. It does not establish nonzero E coupling or a literal multidimensional experiential state. In particular passes this L1 proxy and has . Use the separate off-diagonal weight when the question concerns coupling.
Cumulative capability predicates
Write for possession of capability , and define the exclusive level as the greatest satisfied capability. The nesting is explicit:
| Capability | Operational definition | Interpretation |
|---|---|---|
| L0 | : a valid state | Interiority [I] |
| L1 | : the declared experiential test above | Phenomenal geometry/proxy [D/I] |
| L2 | ; is the four-gate predicate below | Cognitive qualia bridge [I] |
| L3 | Tested metamodel capability [D] | |
| L4 | Ideal coherent tower [D] |
The predicates organise the chosen model. They do not assign an electron, bacterium, mammal, meditator or network a measured level. Such assignments require independently calibrated data and retain status [H].
L0: Interiority
Definition L0 [D]. holds for every valid state in the model. Calling its inner aspect “interiority” is an ontological interpretation. Its universality is a definitional consequence, not a theorem establishing experience in every physical object. The matrix need not be close to , and L0 does not impose .
L1: Phenomenal geometry
Definition L1 [D]. Use exactly one of the typed tests in the input table. A one-dimensional basis axis of is not a tensor subsystem: is impossible. No equivalence between the literal rank test and is asserted.
For a declared experiential space , its pure-state rays form . With normalised representatives the Fubini–Study distance is
The bounded quantity is a squared chordal distinguishability, not the finite-distance formula for the line element. See metric definition.
L2: canonical capability gate
Define in the fixed semantic frame:
The canonical gate is
Theorem (scalar window) [T]. Given this gate,
Proof: ; gives .
The equality measures proximity to . It is not the accuracy of an implemented self-model. Keep separate from and from fidelity. Neither metric monotonicity nor a count of three dynamical terms establishes these identifications.
| Choice | Mathematical consequence | Additional bridge |
|---|---|---|
| HS majority criterion | Majority as physical viability [H] | |
| Canonical | as calibrated reflective competence [H/I] | |
| Off-diagonal HS weight at least diagonal weight | Cognitive integration interpretation [I] | |
| For the extension, | Minimal phenomenal differentiation [H/I] |
The thresholds are exact within these definitions. Their universal empirical interpretation requires independent tests; adopting them does not prove that every gated state has conscious experience. Additional full viability constraints, such as stress bounds or sustained dynamics, are recorded separately rather than silently added to this instantaneous gate.
L3: tested metamodel capability
Definition L3 [D]. L3 requires L2 and a second-order predictive certificate. For a preregistered probe family , compare the implemented metamodel prediction with an independently measured target describing the first model's response:
Both states must lie in the same declared output space. For empirical data the supremum is over the stated finite test set; generalisation beyond it requires a model or statistical guarantee. The parameters and probe family are calibration data, fixed independently of test outcomes. They are not universal constants derived from septicity. A constant prediction cannot pass both conditions by the triangle inequality.
Status of the former argument
The previous unconditional T-67 proof is retracted [✗]. Three summands in a generator and one coherence modification do not imply four independent information channels. A nonzero differential is not necessarily injective; being CPTP does not repair that inference. The diagnostic may be recorded, but does not certify L3: it equals at a trivial fixed point.
Metastability of a certified metamodel is a dynamical question. It requires an attractor, perturbation class, and spectral/escape estimates. The formula is not a universal retention time, and L2 itself is not automatically stable.
L4: ideal compatible tower
Definition L4 [D]. Require certificates at every order, using declared probe/target spaces and forgetting maps connecting successive models. means that predicting at order and forgetting gives the declared order- prediction, exactly in the ideal model or within a stated error budget in an approximation. Each order retains the nontrivial-response condition .
The former clause is retracted [✗]: it contradicts inherited from L2. A fixed point or a limit of successive fidelities equal to does not establish a nontrivial compatible tower.
Categorical typing and the Postnikov tower
The former universal T-86 proof is retracted [✗]. For an object of an -topos, the Postnikov tower is an inverse system
The comparison is , not a colimit along a canonical forward tower. Reconstruction requires the appropriate convergence hypothesis. A truncation permits homotopy through degree ; it does not force . An -truncated object already stabilises for .
L-levels are operational predicates; -truncations are categorical constructions. Identifying them requires an explicit experiential object and a bridge theorem. No Bures distance between a topos and its truncation is defined here. Standard references: Kerodon, Postnikov towers, Lurie, Higher Topos Theory, §§5.5.6, 7.2.1.
Finite resources and the ideal limit
Conditional resource bound [C]. If every independently implemented order consumes at least of a declared resource and the system has budget , at most such orders can be realised simultaneously. This follows from . The per-order cost and independence assumptions must be established for the proposed implementation. Finite-dimensional state space, incompleteness, or contraction alone do not supply them. A finite algorithm can describe an infinite family symbolically; finite experimental observations alone cannot certify all of it.
Feasible gate profiles
The four gate tests reduce to three scalar quantities , since is determined by . Their formal Boolean enumeration has twelve labels. They are not twelve guaranteed nonempty physical regions.
Theorem (feasibility restriction) [T]. . Thus:
| Purity range | Allowed integration |
|---|---|
| necessarily | |
| ; equality requires a uniform diagonal | |
| Both sides of can occur; the L2 scalar window | |
| Reflection gate fails; integration alone does not certify L2 |
The former “flooded” and “white-out” examples combining with are retracted [✗]. Naming gate failures does not measure a clinical or psychedelic state.
At the lower boundary , and at the upper boundary . These are algebraic facts. Their subjective interpretation requires empirical calibration.
A two-sided window in a neuroscience model is not quantitative confirmation of these thresholds. Neural signal entropy and require a validated measurement bridge. Even von Neumann entropy is not uniquely determined by purity in dimension seven.
Gap profiles and identifiability
The frame-referenced statistic is for nonzero coherences; zero at zero is a convention. Its interpretation as conscious “opacity” is [I]. A profile contains phases without amplitudes or calibration, so scalar gate thresholds do not force particular opaque channels.
Theorem (conditional readout stability) [T]. If a self-model approximates the actual matrix with , and every observed actual coherence has modulus at least , then the per-channel Gap error is at most . A bound on canonical alone is not a self-model error bound. Proof and the essential amplitude-floor condition: Gap characterisation.
At an exact fixed point actual and computed profiles coincide tautologically. This equality does not prove phenomenal access. No Hamming theorem forces three nonzero Gap channels; a code-to-observable bridge would be an additional premise.
Replacement for Gap injection
The former theorem “different L-levels imply different Gap profiles” is retracted [✗].
Theorem (factorisation criterion) [T]. A classification is computable from a statistic exactly when it is constant on every fibre of . Equivalently, a map with exists. Necessity follows by substitution; sufficiency defines using any representative of the fibre. This is factorisation, not an injection from levels into profiles.
Counterexample to phase-only gate identification [T]. Let and
All 21 pairwise Gaps are zero, while , , and .
| Purity/reflection/integration gates | ||||
|---|---|---|---|---|
| Pass | ||||
| Reflection fails |
This establishes failure to identify the scalar capability gate; it does not assert a full empirical L2 assignment without the differentiation/readout certificate. The joint record determines the defined hierarchy. The phase profile alone does not. General rotations do not preserve a frame-indexed pairwise profile, so quotienting it by does not repair the failure.
Threshold crossing versus bifurcation
A smooth trajectory may cross a threshold while the number and stability of attractors stay fixed. Three control parameters alone do not imply an singularity.
In the standard potential convention, has germ : is the fold, the cusp (), and the swallowtail (). A claimed normal form needs a smooth centre-manifold reduction, the appropriate degeneracy, parameter transversality and an explicit relation to the gate. See formal criteria.
Classification algorithm
Input: Gamma, mode E, declared self-models and certificates
Validate Hermiticity, positivity and trace = 1.
P = sum_ij abs(Gamma_ij)^2
Q = sum_i Gamma_ii^2
R = 1 / (7*P)
Phi = (P-Q) / Q
If mode is proxy: A1 = Coh_E > 0; D = 1 + 6*Coh_E.
If mode is extension: require a normalised rho_E; A1 = rank(rho_E) > 1;
D = exp(-Tr(rho_E log rho_E)).
If required data are missing: return the evaluated gates and UNKNOWN entries.
A2 = A1 and P > 2/7 and R >= 1/3 and Phi >= 1 and D >= 2.
A3 = A2 and independently verified MetaCert_2.
A4 = A3 and a proof/certificate of the compatible all-order tower.
Return the greatest satisfied A_k; retain uncertainty at unverified orders.
Computing costs . Positivity validation and extension eigendecomposition have their own costs; higher-order certificates are not obtained by a few matrix operations. With measurement uncertainty, report gate intervals and require a margin from each boundary. The L2 scalar certificate is a model classification; the phenomenal interpretation remains a separate claim.
Related documents
- Formal specification and proofs
- Gap identifiability, stability and rank
- Self-observation and distinct reflection measures
- Experiential realisation
- Depth tower: its channel-based score is not automatically an L-level certificate.