Interiority Hierarchy: Rigorous Specification
This specification proves finite-dimensional consequences of the canonical typed hierarchy. The identification of an operational capability with phenomenal consciousness is a separate [I]/[H] bridge. Definitions are [D]; verified implications under stated assumptions are [T]. The revision of 2026-10-03 replaces unsupported universal threshold, topology and phase claims with exact propositions and counterexamples.
1. State, frame and experiential data
A record is with . The semantic frame is fixed when computing diagonal, E and phase quantities. Write
These are functions of a matrix. A specified empirical reconstruction and implemented model are extra data, not consequences of trace one or positivity.
L0 and the existence of a reduction
Definition [D]. means that the matrix is a valid state. The universality of this predicate is tautological inside the model. Its “inner aspect” is the ontological interpretation [I].
Proposition [T]. If an extension and its factorisation are supplied, then is a density matrix. Positivity follows by testing vectors against the partial trace; trace one follows from the defining trace identity. This proposition does not infer a preferred extension or an experiential factor from the seven basis axes.
In the 42D Page–Wootters factorisation , the E-axis is a summand of the system factor. Its clock block
is positive with trace . If , use ; if , this conditional state is undefined. It is not a partial trace onto a seven-dimensional E tensor factor. Choice of lift and conditioning is recorded explicitly.
L1 and the distinction between a proxy and a spectrum
In extension mode define and . In proxy mode define
with
These are distinct definitions [D]. Endpoint conventions do not prove equality of the intermediate values or of threshold decisions.
Proposition [T]. For positive , . Indeed positivity of each principal minor gives . If , the E-row and column vanish; if it is positive, the numerator contains its positive square. Thus the proxy does not detect off-diagonal coupling by itself. has and ; the pure E-state has and . Neither value is a literal entropy calculation of a one-dimensional E-axis.
For a normalised extension of rank ,
with the upper equality exactly for a uniform nonzero spectrum. Rank greater than one implies , not : eigenvalues have rank two and . The differentiation gate is therefore a separate condition.
Fubini–Study metric
For normalised representatives of rays, one conventional normalisation is
with line element . The finite pair statistic equals , not the line element. In a degenerate eigenspace of , individual eigenvectors are not canonical. The invariant spectral data are eigenvalues with their spectral projectors ; a selected basis of “qualities” needs additional structure.
2. L2: exact algebra and explicit bridges
Define
The differentiation mode must be declared. In either mode already implies its corresponding , but retaining makes the cumulative typing visible.
Proposition: scalar bounds [T]
For every seven-dimensional state,
Proof. Positivity gives nonnegative diagonal entries summing to one. Cauchy–Schwarz yields . Hermiticity yields . Its eigenvalues are probabilities, hence . Substitution gives the other inequalities.
For , necessarily
Also obeys
The reverse implication is false: a uniform real pure state has and fails .
Status of thresholds
The HS identity is exact. An adopted majority criterion yields . An adopted criterion yields . Neither algebra proves that these quantities are universal physical viability or reflective competence. In particular compares to , whereas
compares to a chosen model and may even be negative; they must not be interchanged. Metric-classification theorems do not uniquely select this scalar ratio or supply a Bayesian probability interpretation. Counting dynamical summands does not count independent information channels.
is an explicit choice of HS weight balance. The inequality does not force a universal conscious threshold: at it gives , with equality only for uniform diagonal. For extension mode, is exact; choosing one bit as a phenomenal threshold remains a bridge. Calibration and biological universality of all gates are [H].
Proposition: impossible Boolean profiles [T]
The formal product of three purity bins with two integration and two differentiation outcomes has twelve labels. If , however, necessarily. At , forces and uniform diagonal, while the strict viability gate still fails. Thus the twelve labels are not twelve independent nonempty state regions. The old below-threshold “flooded/white-out” regions are retracted [✗].
Proposition: conservative gate stability [T]
If are density matrices and , then
For the canonical E-projection, , and the proxy differentiation error is at most . These bounds are conservative; ranges of the statistics can tighten them.
Proof. since state HS norms are at most one. The diagonal projection is an HS contraction, giving the same bound for . Use in the reciprocal and quotient differences. For , the two terms are bounded by and . For the E numerator , and the two terms in sum to at most .
A gate is certified robustly only if its uncertainty interval stays on the required side of every boundary. A partial record reports unknown tests rather than guessing them. Literal extension entropy is not covered by the proxy bound.
3. Experience and the scope of No-Zombie claims
Experiential record
A typed content record can be written
It is mathematically defined only after the experiential realisation and its normalised state are supplied. Calling this record experience is [I]. A hard gate multiplies or selects this record by [D]. A sigmoid supplies a graded surrogate with declared smoothing parameters; it is not evidence that a sharp physical bifurcation exists.
Base No-Zombie statement
Every valid state has by definition, so every viable state represented by the model also has . This logical implication is [T] and has no independent empirical content concerning phenomenal consciousness. A stronger no-zombie implication must state the viability class, dynamics and experiential bridge separately.
The former argument “more than seven contexts forces a self-model and ” is retracted [✗]. A seven-dimensional density-matrix space has continuous parameters, not seven classical memory slots. Capacity depends on precision, noise, allowed measurements and resources; context-dependent control does not logically force a model of oneself. Task-specific necessity can only follow from an explicit policy class and resource/error bound, followed by a proved relation to the proposed reflection statistic.
4. Metamodel certificates and the cumulative hierarchy
L3 [D]
For a declared finite or modelled probe family and an implemented metamodel, define
The certificate is and . Targets represent independently observed first-model responses under the declared probes. Training and testing must not define targets by the metamodel's own output. The choice of probes, tolerances and identification with reflective depth is an operational proposal [D]/[Pr], not a universal categorical derivation.
Proposition (nonvacuity) [T]. A constant prediction cannot satisfy this certificate. If it did, the triangle inequality would give for all pairs, contradicting .
The old T-67 quadratic-component proof is retracted [✗]. A nonzero derivative can have a kernel; a CPTP channel may be a replacement channel with zero derivative. A choice of three generator terms plus one modification does not imply four statistically independent channels or a universal prediction threshold.
Metastability requires dynamics
The former universal metastability theorem is retracted [✗]. Conditional local stability [C]. For a smooth finite-dimensional flow at an interior equilibrium, if its tangent Jacobian has all eigenvalues with negative real part, the equilibrium is locally asymptotically stable. To infer retention of , require the equilibrium's certificate to have a positive margin and the perturbations to remain in its neighbourhood. Escape times with noise require a specified stochastic process. A fidelity score alone supplies neither a Jacobian nor a lifetime.
L4 [D]
Define certificates for every on declared output spaces and probe families. Supply forgetting maps between successive outputs and maps between probe families such that
in the ideal model, with the analogous target compatibility. If approximate compatibility is intended, its error budget is part of the certificate. Then . This definition ensures nesting. It does not prove physical realisability or unreachability.
The old condition and its “stability proof” are retracted [✗]: inherits from . Finite-dimensionality does not identify a purity threshold with a homotopy degree.
5. What model iteration actually proves
Use root fidelity
The square convention is recorded to prevent threshold ambiguity. These are standard state metrics, not the canonical .
Corrected convergence statement [T]
If a state map has an orbit converging to a state , then by continuity. A sufficient condition is a uniform contraction with on a complete invariant metric state space; Banach's theorem then yields convergence. CPTP gives nonexpansiveness in appropriate metrics, not strict contraction or a unique fixed point.
For the canonical model
where preserves the diagonal and multiplies off-diagonals by , , there is the exact estimate
Proof. , , and the diagonal/off-diagonal splitting makes an HS contraction. Iterate the estimate. Thus every orbit converges to , and successive fidelities tend to one although this attractor fails the L2 gate. This estimate relative to the fixed point does not assert contraction between every pair of states.
For the Fano case and nonzero initial off-diagonal part, the actual canonical-model coherence survival is
The equality holds for iteration of the bare linear Fano channel, not for the full state-dependent canonical model. Fidelity tending to one and coherence tending to zero are compatible and do not establish deeper cognition.
At , every successive fidelity is already one at finite order. For a unitary CPTP channel swapping two orthogonal pure states, consecutive fidelities are zero. Hence neither finite-order nonattainability of fidelity one nor universal positivity follows from the CPTP property.
Withdrawn purity/topology argument
The former universal L4 stability and proof are retracted [✗]. Concentration of eigenvalues can bound matrix distances. It does not make of a separately assigned experiential object vanish, stabilise a Postnikov tower, or force the state-valued self-model to avoid fixed points.
6. Categorical structure: precise scope
A Postnikov tower applies to an object of an -topos:
There is a comparison ; its being an equivalence is the relevant objectwise convergence assumption. No canonical forward-colimit reconstruction or Bures norm between categories is supplied by this notation. Standard references: Kerodon §3.5 and definition of a Postnikov tower; Lurie, Higher Topos Theory §§5.5.6, 7.2.1.
Counterexamples [T]. A discrete set is zero-truncated, and its tower stabilises immediately. A representable presheaf on an ordinary category is set-valued, hence zero-truncated; truncation does not recover different scalar L-gates. The entire density-matrix space is convex and therefore contractible. Nontrivial topology may appear in a separately chosen ray space or constraint subspace, but that choice and its relation to operational certificates need a bridge. A claim “every level has ” does not follow from truncation.
No theorem that five labels exhaust physical depth
The present taxonomy has five labels by definition. Between L3 and its ideal all-order L4 limit one can retain finite certified depths as an auxiliary statistic. There is no theorem that all systems have at most three metamodel orders. A bounded score obtained by repeating a Fano channel and comparing with chosen thresholds is a bound on that score, not on every possible implementation of reflective depth.
Associator hierarchy
Composition laws and coherence axioms must be specified for the chosen higher category. Nonassociativity of octonions, bicategorical associators, and statistical dependence of channels are different structures. Counting their cells does not determine calibrated Bayes priors or a metacognition threshold. An experiential higher-category model may be proposed [Pr]; its operational realisation requires a functor and a correspondence theorem.
7. Gap: the correct theorem
For , a classification descends through exactly when it is constant on its fibres. Proof [T]: implies fibre constancy; conversely define , well-defined precisely under fibre constancy. This is a factorisation criterion, not an injection from levels into profiles.
Let and . Every Gap equals zero, but
At all three scalar gates pass; at the reflection gate fails. With the explicitly declared proxy,
and both states pass and . Thus the defined 7D-proxy L2 predicate itself differs despite identical phase profiles. This stronger algebraic counterexample does not establish physical consciousness in either state. In literal extension mode, differentiation and lift are additional data.
For a genuine matrix self-model error and a nonzero amplitude floor , the per-channel phase error is bounded by . Without the floor it is discontinuous at zero. Exact proof, even-rank correction and the withdrawn Hamming-opacity bridge: Gap identifiability.
8. Thresholds are not automatically bifurcations
A scalar gate crossing need not change an attractor's stability. A one-dimensional gradient reduction has an potential singularity only under the appropriate degeneracy and transverse unfolding. In the potential convention:
| Type | Germ | Essential control parameters |
|---|---|---|
| Fold | 1 | |
| Cusp | 2 | |
| Swallowtail | 3 |
For , require , at the critical point, a valid smooth reduction, and transversality of the three unfolding directions. Merely possessing three parameters is insufficient; an approximate symmetry or a quartic potential does not establish these conditions. The relation between the resulting branches and is another explicit step. Reference for the corresponding vector-field normal forms: Ghrist, Applied Dynamical Systems, bifurcation chapter.
9. Stratification and marginal locality
L-labels do not turn a nonlinear term on or off by themselves. Its gate and extension are specified by the evolution equation. In particular L0 is universal and can have any allowed , including at .
Marginal identity [T]. For a fixed trace-preserving local channel ,
The identity also holds pointwise if the channel is selected from the unconditioned local state, provided a valid local channel extension is given at each point. It is not a theorem about a generic nonlinear state map acting on tensor factors. For nonlinear dynamics, averaging selectively conditioned branches can differ from evolving the unconditioned state; the measurement prescription matters. Current scope: Physics correspondence §8.
10. Classification algorithm
Require a valid density matrix and declared experiential mode.
P = sum_ij |gamma_ij|^2; Q = sum_i gamma_ii^2
R = 1/(7*P); Phi = (P-Q)/Q
Proxy mode: Coh_E = (gamma_EE^2 + 2*sum_i!=E |gamma_Ei|^2)/P
A1 = Coh_E > 0; D = 1 + 6*Coh_E
Extension mode: require a normalised declared rho_E
A1 = rank(rho_E) > 1; D = exp(-Tr(rho_E log rho_E))
A2 = A1 and P > 2/7 and R >= 1/3 and Phi >= 1 and D >= 2
A3 = A2 and verified MetaCert_2
A4 = A3 and verified compatible certificates at every higher order
Return the greatest verified A_k and all unknown/margin-dependent tests.
Squared norms are used consistently. State validation, extension entropy and metamodel certificates are distinct operations. The scalar computations are ; positivity checks and spectral operations generally require dense linear algebra. The all-order predicate is not certified merely by numerically iterating a map a finite number of times.
11. Dependency and withdrawal ledger
| Former claim | Current scope |
|---|---|
| Different L-levels force different Gap profiles | [✗]; replaced by fibre criterion and explicit counterexample |
| Three check bits require three nonzero pairwise Gaps | [✗]; code-to-observable bridge open [Pr] |
| T-67: categorical count forces and L3 fidelity threshold | [✗]; calibrated metamodel certificate [D]/[Pr] |
| T-86: universal L4 unreachability from Postnikov + incompleteness | [✗]; inverse tower and conditional resource bound |
| defines nested L4 | [✗]; incompatible with inherited L2 window |
| CPTP alone forces strict contraction and positive consecutive fidelity | [✗]; stated contraction/convergence assumptions |
| Twelve Boolean gate labels are twelve nonempty regions | [✗]; feasibility bound [T] |
| Three controls force an transition | [✗]; see the normal-form conditions |
| Adaptive generalisation universally forces canonical | [✗]; explicit task/resource bridge needed |
The valid inequalities remain available as mathematical tools. Their physical interpretation and measurement bridge are separate obligations; none is supplied by changing a status label.