Self-Observation and Capability
The chapter distinguishes three typed constructions: a logical support reflector, a numerical state model, and an operational test of metamodel predictions. The mathematical kernel fixes their types. Calling a represented inner aspect experience is an interpretive bridge [I]; neither contraction nor state similarity proves that identification.
Self-Modelling Operator φ
In an -topos , with a fixed object , the support reflector is
left adjoint to inclusion, taking a map to its -truncated image [T]. It is not a density-matrix channel and has no Kraus representation by this definition.
A numerical model is separately specified as , where . A fixed linear CPTP map admits
This preserves states, including when extended by an identity channel. It models a state transformation, not simultaneous production of independent copies of an unknown state. Interpreting it as an internal self-model requires an observation protocol [D/H]. A nonlinear state-selected map is not automatically a quantum channel.
Frozen replacement channel
Conditional realisation theorem [T]
For fixed and , define
This is CPTP. Indeed, if , the replacement part has Kraus operators ; adding and scaling those operators by gives completeness. On trace-one states, the formula reduces to .
If or , this proof applies only with that input's parameters frozen. It does not prove that is linear, CPTP, or contractive. A logical image does not select a unique numerical anchor without an additional bridge.
For a local fixed channel and joint ,
[T]. Proof: the adjoint fixes , so every expectation of is unchanged. Selective conditioning and nonlinear joint dynamics require their own no-signalling analysis.
Fixed point of the frozen channel [T]
For , iff . For , every state is fixed. This conclusion is about the fixed channel, not all numerical self-models.
Attractor hierarchy
| Object | Exact role |
|---|---|
| Chosen reference for canonical ; purity | |
| Fixed | Unique fixed state of for |
| -fixed states | Solve for the specified map |
| Stationary states of a flow | Solve the actual vector-field equation; their stability requires its Jacobian/basin |
A state different from has [T], by the HS identity below. This does not establish the existence of such an attractor. The canonical numerical with anchor has that centre as its fixed state; alternative anchors and maps have separately stated assumptions. See the numerical formalisation.
Coupling convention for k [D]
The rule is a chosen state-dependent coupling. It lies in . The replacement-channel formula alone does not derive it, and uniqueness of a logical reflector does not force it. Other choices of give equally valid frozen channels.
At , and ; at a pure state, and . These are mathematical proximity values, not levels of self-knowledge.
Conditional Fixed-Point Results
For fixed and fixed ,
in any norm on the trace-one affine hull [T]. The state space is complete, so contraction gives the unique fixed point and convergence. A CPTP map need not be a strict contraction: identity and unitary channels are counterexamples. State-dependent parameters invalidate this constant-factor calculation unless separately controlled.
Closure and phenomenality
A fixed-point equation expresses stability of a specified model. The identity fixes every state, including a pure basis state with . The replacement channel anchored at converges to a state failing . Hence a fixed point, convergence or “self-reference” cannot by themselves certify L2, higher-order knowledge or experience. Lawvere's fixed-point theorem also requires its actual categorical hypotheses, not merely the existence of a self-map.
Canonical Reflection Coordinate R
Define and
This definition uses a fixed reference and is independent of . Calling a thermodynamic equilibrium needs actual dynamics; the definition itself only singles out the maximally mixed state.
Algebraic identity [T]
Write , . HS orthogonality gives
Thus is a decreasing reparameterisation of , invariant under every unitary conjugation; it carries no independent information about model accuracy. is impossible. occurs at , where , not at a maximally capable self-knower.
Distinct diagnostics
| Quantity | Definition | Interpretation/status |
|---|---|---|
| Canonical | HS proximity coordinate [D/T] | |
| Reconstruction score (also written ) | Specified-map error score [D]; can be negative | |
| Iteration fidelity | State similarity [D], | |
| Forecast skill | Centred empirical score [D]; can be negative, undefined at zero variance |
For a fixed replacement map, . If , this is ; substituting the convention gives . This is a statement about this particular map. For including Fano dephasing, the expression is different; use its defined formula. No universal closed relation with exists for arbitrary .
The cutoff is a selected component of [D]. Its equivalence to is exact [T]. Counting three generator terms does not prove that is a Bayesian classification accuracy: that would require a labelled task, priors, likelihoods and a calibration connecting the score to decisions.
Centred forecast skill
A forecast of the sample mean gives when the denominator is nonzero; a perfect forecast gives ; worse forecasts may have . For illustrative deterministic predictions , one gets exactly . Dividing by instead can reward predicting a nonzero baseline. For a prospective task, estimate the baseline on training data and evaluate held-out errors; report missing/zero-variance data. A chosen minimum of five matched days is an instrument rule [D], not a mathematical identifiability theorem. A diary forecast is not automatically a measurement of a density-matrix self-model.
Whole-state versus diagonal reconstruction
Let . Then
A diagonal-only test misses the second term. With , the diagonal share of state HS mass is and the off-diagonal share is [T]. Report the measured component and its denominator; this identity alone does not validate a questionnaire-to-matrix bridge.
If is differentiable along a trajectory, the exact derivative is
State dependence of model parameters belongs in . Fixed-parameter CPTP structure does not eliminate those terms.
Higher-Order Iteration Diagnostics
Use a specified numerical self-map ; the logical support reflector is a different typed construction. Define and the squared-fidelity diagnostic
The root fidelity is , and . is a similarity of consecutive iterates [D], not independently measured accuracy of a model of a model. It is distinct from canonical and the HS reconstruction score .
Conditional monotonicity [T]. For a fixed linear CPTP channel , fidelity data processing gives , hence . See Watrous, Theorem 3.27. The inequality need not be strict; a unitary preserves fidelity. A nonlinear state-selected map does not automatically satisfy this channel theorem.
Conditional convergence [T]. If , continuity of fidelity gives . At a fixed point, from the start; the identity channel gives this for every state. Canonical with anchor converges to , whose capability gate fails. Thus convergence to high similarity cannot certify cognitive depth or phenomenal access.
The former universal inequality connecting to canonical via Fuchs–van de Graaf is withdrawn [✗]: the measures compare different pairs. A pure state with has and , directly refuting the displayed lower bound on . The valid inequalities for the same pair are
They do not identify canonical proximity to with model fidelity. Source: Fuchs–van de Graaf (1997).
No universal sequence or follows from counting generator terms or categorical cells. One may declare calibrated diagnostic thresholds [D]; the canonical hierarchy instead tests nonconstant predictions against independent metamodel targets. L3 inherits L2 and adds ; L4 requires compatible certificates at every higher order. Their biological/phenomenal interpretation remains a separate bridge.
Finite-iterate spectral formulas apply to a specified linear channel, with eigenvalue powers and possible Jordan terms. The stationary projection of a relaxing semigroup is an asymptotic construction, not every . A support reflector or generic nonlinear model has no channel spectrum simply by being called .
Retro-completion of a process category
For a specified map , the forward-orbit category has arrows labelled by with ; composition adds labels. Its nerve is a Kan complex iff this ordinary category is a groupoid [T]. A noninvertible positive-time arrow therefore prevents the nerve itself from being Kan. The singular complex of its geometric realisation is Kan regardless of this directed obstruction, as explained in T-218.
Limits of the retrospection bridge
The one-object monoid category admits group completion to ; the latter is a groupoid with Kan nerve [T]. Extending a particular forward state action to a -action requires invertibility; merely storing a past state does not supply a two-sided inverse to a dissipative channel. Formal localisation can add inverse arrows, but their physical implementation is an extra bridge [D/H]. A refusal count on a selected finite grid depends on its sampling measure and is not a universal proportion of impossible thoughts. Canonical does not determine group completion, horn fillers or memory access.
Interiority Hierarchy
The cumulative predicates follow the canonical typed definition, not an iteration-fidelity threshold.
| Capability | Required data and test |
|---|---|
| L0 | Valid state; calling an inner aspect interiority is [I] |
| L1 | Declared proxy , or normalised extension with rank greater than one |
| L2 | |
| L3 | L2 plus an independent nonconstant metamodel-prediction certificate |
| L4 | L3 plus compatible nontrivial certificates at all higher orders |
A named basis axis is not a tensor subsystem. Extension entropy needs a specified lift/factorisation or conditioned block. The 7D proxy is separately stipulated, not equal to every extension entropy. Unknown data are reported as unknown rather than supplied by a self-map iteration.
The old derivation of the universal fidelity threshold , fixed-point criterion for L4, L3 retention-time formula and stable L4 clause are withdrawn [✗]. The last clause contradicts L2's inherited . Stability needs the specified flow, basin, Jacobian and noise/escape conditions; a level label alone does not give it.
A depth-tower score may have a ceiling of three under its own arithmetic definition. It is not equivalent to L3 or a universal bound on self-awareness. Predictions and biological assignments require independent calibration [Pr/H]. Passing the definitions does not mathematically prove consciousness; the phenomenal bridge is [I/H].
Conditional Grounding Monotonicity
Let be a specified differentiable loss with an -Lipschitz gradient, and define with fixed [D]. Gradient descent satisfies
for [T]. Thus is nondecreasing, strictly increasing only when the gradient is nonzero. A positive loss can have zero gradient, and sensorimotor input may change the loss between steps. CPTP structure alone guarantees neither smoothness in weights, nonzero gradients nor monotone learning. Identifying with semantic grounding requires an independent behavioural test [H]. The former unconditional C23 statement is restricted to these hypotheses.
Integration–Reflection Summary C
Set and in the declared frame. Define
Since , one obtains and . Under , necessarily and [T]. Thus is a necessary scalar consequence of the chosen gate, not sufficient: a uniform real pure state has and fails .
The complete gate remains
The entropy-derived requires a specified normalised experiential extension. The 7D score is separately defined, not an entropy identity. Clinical or diary values cannot be substituted for either without a validated measurement bridge. The old waking example violates , and the old sleeping violates ; both are withdrawn.
Operational use
An implementation must declare the state estimator, frame, numerical map, differentiation construction and metamodel test. Compute canonical from , retain all four gate inequalities, and record missing quantities as unknown. In code the numerical gate is P > 2/7 and R >= 1/3 and Phi >= 1 and D_diff >= 2; additional level predicates remain cumulative.
Metacognition and introspection are hypotheses about independently measured task performance. They are not automatically synonyms for , or a fixed point. Static scalar values alone do not establish alexithymia, dissociation, sleep, meditation or a clinical diagnosis. Any such assignment needs labelled observations and out-of-sample validation [H].
CRL — a proposed reflexive language
A proposed compile map sends a declared symbolic instruction to a state perturbation with and [D]. This is a tangent vector in the trace-one affine hull, not an endomorphism of the state space. The update also needs positivity; an implemented CPTP action or a verified state-preserving update is a safer executable type.
The engineering cycle is estimate state → select instruction → compile action → apply → measure. To claim reflective capability, evaluate nonconstant predictions against independent targets. A rule enabling CRL only after is a design choice [D], not a theorem that symbols or self-modification are impossible at lower scores. The phase diagram, code geometry and cutoff alone do not prove semantic grounding or therapeutic efficacy.
The valid mathematical backbone is the HS identity, fixed-parameter channel theorem, conditional contraction and same-pair fidelity estimates. The capability hierarchy adds independently testable operational certificates; its phenomenal reading remains a separate bridge.
Related: typed kernel, numerical φ formalisation, canonical hierarchy, depth tower, measurement identifiability.