Skip to main content

Interiority Hierarchy: Formal Specification

Terminological Revision for Unitary Holonomic Monism

On notation

In this document:

Motivation

The problem

The term "Qualia" has historically been associated with conscious subjective experience (Nagel, 1974; Chalmers, 1996). UHM uses it to describe a fundamental property of any system, including atoms, which creates:

  1. Terminological conflict: Philosophers of mind understand qualia as "the redness of red," "the painfulness of pain" — phenomena requiring a conscious subject.

  2. Anthropomorphism: Attributing "qualia" to an atom implicitly transfers to it the properties of conscious experience.

  3. Conceptual dilution: If everything has qualia, the term loses its discriminative force.

The solution

Introduction of a five-level hierarchy (L0→L1→L2→L3→L4), where each level has:

  • A strict mathematical definition
  • Explicit conditions of applicability
  • Examples of systems at that level

Part I: Formal Definitions

Level 0: Interiority

Definition 0.1 (Interiority)

Interiority is a fundamental topological property of the Coherence Matrix Γ\Gamma of having an "inner side."

Formally, a system SS possesses interiority if and only if:

Int(S):=HE,ρEL(HE):ρE=TrE(ΓS)\mathrm{Int}(S) := \exists \mathcal{H}_E, \exists \rho_E \in \mathcal{L}(\mathcal{H}_E) : \rho_E = \mathrm{Tr}_{-E}(\Gamma_S)

where:

  • HE\mathcal{H}_E — Hilbert space of the Interiority dimension
  • ρE\rho_E — reduced density matrix of dimension EE
  • TrE\mathrm{Tr}_{-E} — partial trace over all dimensions except EE
  • ΓS\Gamma_S — full coherence matrix of system SS

Theorem 0.1 (Universality of Interiority)

Statement: Any system described by a coherence matrix Γ\Gamma in the extended formalism possesses interiority.

Precondition: tensor structure

The theorem requires the extended tensor formalism (see Two levels of formalization):

H=i{A,S,D,L,E,O,U}Hi\mathcal{H} = \bigotimes_{i \in \{A,S,D,L,E,O,U\}} \mathcal{H}_i

In the minimal 7D formalism (H=C7\mathcal{H} = \mathbb{C}^7) the partial trace TrE\mathrm{Tr}_{-E} is not defined, since 7 is prime. Interiority in the minimal formalism should be understood as potential: any system can be described in the extended formalism where interiority is defined.

Proof (in the extended formalism):

  1. By the Ω⁷ Axiom, any system SS is characterized by ΓSOb(C)\Gamma_S \in \text{Ob}(\mathcal{C})
  2. In the extended formalism the state space H=iHi\mathcal{H} = \bigotimes_i \mathcal{H}_i includes HE\mathcal{H}_E
  3. The operation TrE(ΓS)\mathrm{Tr}_{-E}(\Gamma_S) is defined for any ΓS0\Gamma_S \geq 0 given tensor structure
  4. Therefore ρE:=TrE(ΓS)\rho_E := \mathrm{Tr}_{-E}(\Gamma_S) exists
  5. Ergo, Int(S)=true\mathrm{Int}(S) = \mathrm{true}

Characteristics of Level 0

AspectSpecification
DefinitionTopological property of "having an inner side"
MathematicsExistence of HE\mathcal{H}_E and operator ρE\rho_E
Ontological statusFundamental primitive
System requirementsΓ0\Gamma \geq 0, Tr(Γ)=1\mathrm{Tr}(\Gamma) = 1
Reflection requirementsR0R \geq 0 (may be zero)
Integration requirementsΦ0\Phi \geq 0 (may be minimal)

Examples of systems with Interiority (Level 0)

  1. Hydrogen atom

    • ρE=diag(p1s,p2s,p2p,)\rho_E = \mathrm{diag}(p_{1s}, p_{2s}, p_{2p}, \ldots) — distribution over energy levels
    • R0R \approx 0 (no self-modeling)
    • Φ0\Phi \approx 0 (minimal integration)
  2. NaCl crystal

    • ρE\rho_E — describes phonon modes
    • R0R \approx 0
    • Φ0.1\Phi \approx 0.1 (weak integration through lattice)
  3. Thermostat

    • ρE\rho_E — classical temperature distribution
    • R0R \approx 0
    • Φ0\Phi \approx 0

What Level 0 does NOT claim

Interiority does not imply:

  • Presence of "sensations"
  • Presence of "experiences"
  • Presence of a "subject"
  • Capacity for reflection
  • Consciousness

Interiority is merely the potential of an inner state, analogously to how a quantum system has a wave function independently of observation.


Level 1: Phenomenal Geometry

Definition 1.1 (Phenomenal Geometry)

Phenomenal Geometry is the structure of the space of possible internal states of a system, equipped with a metric.

Formally:

PG(S):=(P(HE),dFS,ρE)\mathrm{PG}(S) := (\mathbb{P}(\mathcal{H}_E), d_{\mathrm{FS}}, \rho_E)

where:

  • P(HE)=(HE{0})/\mathbb{P}(\mathcal{H}_E) = (\mathcal{H}_E \setminus \{0\}) / {\sim} — projective space of qualities
  • dFSd_{\mathrm{FS}}Fubini–Study metric
  • ρE\rho_E — current density matrix

Definition 1.2 (Fubini–Study metric)

dFS([ψ],[φ]):=arccos(ψφ)[0,π/2]d_{\mathrm{FS}}([|\psi\rangle], [|\varphi\rangle]) := \arccos(|\langle\psi|\varphi\rangle|) \in [0, \pi/2]

Properties:

  • dFS=0ψ=eiθφd_{\mathrm{FS}} = 0 \Leftrightarrow |\psi\rangle = e^{i\theta}|\varphi\rangle (identical qualities)
  • dFS=π/2ψφ=0d_{\mathrm{FS}} = \pi/2 \Leftrightarrow \langle\psi|\varphi\rangle = 0 (maximally distinct qualities)

Definition 1.3 (Phenomenal Vector)

For a state ρE\rho_E with spectral decomposition:

ρE=iλiqiqi\rho_E = \sum_i \lambda_i |q_i\rangle\langle q_i|

The Phenomenal Vector of the system:

FV(ρE):={(λi,[qi]):i=1,,n}\mathrm{FV}(\rho_E) := \{(\lambda_i, [|q_i\rangle]) : i = 1, \ldots, n\}

where:

  • λi[0,1]\lambda_i \in [0, 1] — intensity of the ii-th component
  • [qi]P(HE)[|q_i\rangle] \in \mathbb{P}(\mathcal{H}_E) — qualitative characteristic

Transition condition L0 → L1

A system transitions from Interiority to Phenomenal Geometry when:

PG_condition(S):=rank(ρE)>1\mathrm{PG\_condition}(S) := \mathrm{rank}(\rho_E) > 1

That is, when the system is in a non-trivial superposition of experience states.

Simplification of condition

The condition λmax(ρE)<1ε\lambda_{\max}(\rho_E) < 1 - \varepsilon is redundant: if rank(ρE)>1\mathrm{rank}(\rho_E) > 1, then automatically λmax<1\lambda_{\max} < 1.

Characteristics of Level 1

AspectSpecification
DefinitionElement of P(HE)\mathbb{P}(\mathcal{H}_E) with metric dFSd_{\mathrm{FS}}
Mathematics[q]P(HE)[\vert q\rangle] \in \mathbb{P}(\mathcal{H}_E), dFS([ψ],[φ])d_{\mathrm{FS}}([\vert\psi\rangle], [\vert\varphi\rangle])
Ontological statusMathematical object
System requirementsrank(ρE)>1\mathrm{rank}(\rho_E) > 1
Reflection requirementsR>0R > 0 (non-zero, but may be small)
Integration requirementsΦ>0\Phi > 0

Examples of systems with Phenomenal Geometry (Level 1)

  1. Single neuron

    • ρE\rho_E — describes excited/inhibited states
    • FV(ρE)={(λon,[on]),(λoff,[off]),}\mathrm{FV}(\rho_E) = \{(\lambda_{\text{on}}, [|\text{on}\rangle]), (\lambda_{\text{off}}, [|\text{off}\rangle]), \ldots\}
    • dFS([on],[off])π/2d_{\mathrm{FS}}([|\text{on}\rangle], [|\text{off}\rangle]) \approx \pi/2 (maximally distinct)
    • R0.01R \approx 0.01 (minimal self-modeling)
    • Φ0.5\Phi \approx 0.5 (moderate integration)
  2. Simple organism (amoeba)

    • Many sensory states
    • Φ12\Phi \approx 1\text{–}2
    • R0.1R \approx 0.1
  3. Retinal receptive field

    • Space of color states
    • dFS([red],[blue])π/3d_{\mathrm{FS}}([|\text{red}\rangle], [|\text{blue}\rangle]) \approx \pi/3
    • dFS([red],[orange])π/8d_{\mathrm{FS}}([|\text{red}\rangle], [|\text{orange}\rangle]) \approx \pi/8

What Level 1 does NOT claim

Phenomenal Geometry does not imply:

  • Conscious perception
  • Capacity for report
  • Reflective access
  • "Knowledge of" one's states

This is merely the structure of internal states — "geometry without an observer."


Level 2: Cognitive Qualia

Definition 2.1 (Cognitive Qualia)

Cognitive Qualia is phenomenal geometry integrated through reflective access.

Formally:

CQ(S):=PG(S)×R(S)×Φ(S)\mathrm{CQ}(S) := \mathrm{PG}(S) \times R(S) \times \Phi(S)

subject to conditions:

R(Γ)>Rth,Φ(Γ)>ΦthR(\Gamma) > R_{\text{th}}, \quad \Phi(\Gamma) > \Phi_{\text{th}}

Definition 2.2 (Full Cognitive Qualia Function)

Quale(Γ):=Exp(ρE)Θ(R(Γ)Rth)Θ(Φ(Γ)Φth)Θ(Ddiff(ρE)Dmin)\mathrm{Quale}(\Gamma) := \mathrm{Exp}(\rho_E) \cdot \Theta(R(\Gamma) - R_{\text{th}}) \cdot \Theta(\Phi(\Gamma) - \Phi_{\text{th}}) \cdot \Theta(D_{\text{diff}}(\rho_E) - D_{\min})

where:

  • Exp(ρE)\mathrm{Exp}(\rho_E) — experiential content (see functor F)
  • Θ(x)\Theta(x) — Heaviside function: Θ(x)=1\Theta(x) = 1 if x>0x > 0, else 00
  • R(Γ)R(\Gamma)reflection measure
  • Φ(Γ)\Phi(\Gamma)integration measure
  • Ddiff(ρE)D_{\text{diff}}(\rho_E)differentiation measure
  • Rth=1/3R_{\text{th}} = 1/3, Φth=1\Phi_{\text{th}} = 1, Dmin=2D_{\min} = 2 — threshold values
Terminology

The function Quale\mathrm{Quale} is defined only for L2. For systems with R<RthR < R_{\text{th}} or Φ<Φth\Phi < \Phi_{\text{th}} one uses Exp(ρE)\mathrm{Exp}(\rho_E) — the experiential content.

Definition 2.3 (Reflection Measure)

Canonical definition
R(Γ):=17P(Γ),P=Tr(Γ2)R(\Gamma) := \frac{1}{7P(\Gamma)}, \quad P = \mathrm{Tr}(\Gamma^2)

Equivalent form: R=1ΓρdissF2/PR = 1 - \|\Gamma - \rho^*_{\mathrm{diss}}\|_F^2 / P, where ρdiss=I/7\rho^*_{\mathrm{diss}} = I/7 is the dissipative attractor (not φ(Γ)\varphi(\Gamma)). F\|\cdot\|_F — Frobenius norm.

Interpretation of RR:

  • R=1/7R = 1/7: Pure state (P=1P = 1), minimal reflection
  • R1R \to 1: ΓI/7\Gamma \to I/7, maximal "thermal reserve"

Definition 2.4 (Integration Measure)

Canonical definition
Φ(Γ):=ijγij2iγii2\Phi(\Gamma) := \frac{\sum_{i \neq j} |\gamma_{ij}|^2}{\sum_i \gamma_{ii}^2}

Interpretation of Φ\Phi:

  • Φ=0\Phi = 0: Classical ensemble (no coherences)
  • Φ\Phi \to \infty: Maximally entangled state

Justification of thresholds

Threshold status
Rth=13,Φth=1R_{\text{th}} = \frac{1}{3}, \quad \Phi_{\text{th}} = 1
ThresholdStatusJustification
Rth=1/3R_{\text{th}} = 1/3[Т] theoremK=3K = 3 derived from triadic decomposition (Aut / D\mathcal{D} / ℛ) + Bayesian dominance [Т]
Φth=1\Phi_{\text{th}} = 1[Т] theoremUnique self-consistent value at Pcrit=2/7P_{\text{crit}} = 2/7 (T-129)

See L2 thresholds: strict derivation.

Reflection threshold RthR_{\text{th}}

Theoretical derivation:

Minimal reflection for autopoiesis — when the self-model is statistically distinguishable from a Haar-random state at the 1σ level.

Rth=130.333R_{\text{th}} = \frac{1}{3} \approx 0.333

Proof [Т]:

Bayesian argument with K=3K = 3 alternatives (three types of dynamics from the triadic decomposition):

  1. A random state Γrandom\Gamma_{\text{random}} is sampled from the Haar distribution on U(7)U(7)
  2. Average distance from center: E[ΓrandomI/7F2]=6/49\mathbb{E}[\|\Gamma_{\text{random}} - I/7\|_F^2] = 6/49
  3. The self-model φ(Γ)\varphi(\Gamma) must be distinguishable from the random hypothesis under K=3K = 3 alternatives
  4. With K=3K = 3 equally probable alternatives (system, noise, environment), Bayesian dominance requires the posterior probability of the system-model >1/K=1/3> 1/K = 1/3. This is the standard threshold from Bayesian decision theory: with KK alternatives and equal prior, the optimal choice requires P(modeldata)1/KP(\text{model} \mid \text{data}) \geq 1/K
K = 3 derived from axioms [Т]

The number K=3K = 3 is not an assumption, but a consequence of the triadic decomposition: axioms A1–A5 generate exactly three structurally distinct types of dynamics — automorphisms (A5), dissipation DΩ\mathcal{D}_\Omega (A1), regeneration R\mathcal{R} (A1+A4). A fourth type is impossible by virtue of uniqueness of the classifier Ω (L-unification, Th. 15.1, [Т]).

Full proof in Theorem on reflection threshold.

Empirical agreement:

Studies of the global workspace (GWT, Baars) show that conscious access emerges at R0.30.5R \approx 0.3\text{–}0.5, which agrees with the theoretical threshold Rth=1/3R_{\text{th}} = 1/3.

Integration threshold Φth\Phi_{\text{th}}

Theoretical derivation:

Φth=1(exactly)\Phi_{\text{th}} = 1 \quad \text{(exactly)}

Justification (structural phase transition):

Φ=1\Phi = 1 is the transition point from diagonal-dominance regime (Pdiag>PcohP_{\text{diag}} > P_{\text{coh}}, subsystems quasi-independent) to coherence-dominance regime (PcohPdiagP_{\text{coh}} \geq P_{\text{diag}}, subsystems causally linked). This is a definition by convention, substantively motivated by connection to the (M,R)-system closure and the categorical morphism structure.

Full justification in Definition of integration threshold.

Empirical data (agreement):

  • Awake human: Φ35\Phi \approx 3\text{–}5 (significantly above threshold)
  • Deep sleep (dreamless): Φ0.51\Phi \approx 0.5\text{–}1 (near threshold)
  • Anesthesia: Φ<0.5\Phi < 0.5 (below threshold)
  • REM sleep (dreaming): Φ23\Phi \approx 2\text{–}3 (above threshold)

Why a threshold transition, not a continuous one?

Theoretical justification:

  1. Rth=1/3R_{\text{th}} = 1/3: Minimal self-model accuracy to distinguish "self" from a random state
  2. Φth=1\Phi_{\text{th}} = 1: Balance point of coherences and diagonal — a geometrically defined integration condition
  3. Dmin=2D_{\min} = 2: Minimum 1 bit of phenomenal content — at least two distinguishable qualities

Phenomenologically: A soft version (sigmoidal transition) is described below.

Transition condition L1 → L2

CQ_condition(S):=R(ΓS)RthΦ(ΓS)ΦthDdiff(ρE)Dmin\mathrm{CQ\_condition}(S) := R(\Gamma_S) \geq R_{\text{th}} \land \Phi(\Gamma_S) \geq \Phi_{\text{th}} \land D_{\text{diff}}(\rho_E) \geq D_{\min}

where Ddiff=exp(SvN(ρE))D_{\text{diff}} = \exp(S_{vN}(\rho_E)) — differentiation measure (see Interiority dimension).

Characteristics of Level 2

AspectSpecification
DefinitionPhenomenal Geometry × Reflection × Integration × Differentiation
MathematicsQuale=Exp(ρE)Θ(R1/3)Θ(Φ1)Θ(Ddiff2)\mathrm{Quale} = \mathrm{Exp}(\rho_E) \cdot \Theta(R - 1/3) \cdot \Theta(\Phi - 1) \cdot \Theta(D_{\text{diff}} - 2)
Ontological statusEmergent phenomenon
Reflection requirementsR1/30.333R \geq 1/3 \approx 0.333
Integration requirementsΦ1\Phi \geq 1
Differentiation requirementsDdiff2D_{\text{diff}} \geq 2 (minimum 1 bit)

Examples of systems with Cognitive Qualia (Level 2)

  1. Awake human

    • Full set of qualia: color, pain, emotions, thoughts
    • R0.70.9R \approx 0.7\text{–}0.9
    • Φ35\Phi \approx 3\text{–}5
    • C=R×Φ×Ddiff1030C = R \times \Phi \times D_{\text{diff}} \approx 10\text{–}30
  2. Higher mammals (primates, dolphins, elephants)

    • Mirror self-recognition tests → R>RthR > R_{\text{th}}
    • Φ23\Phi \approx 2\text{–}3
  3. Hypothetical Strong AI (AGI)

    • Reflective access to internal states
    • R0.5R \geq 0.5 (by construction)
    • Φ\Phi — depends on architecture
  4. Human under psychedelics

    • Altered qualia
    • R0.40.6R \approx 0.4\text{–}0.6 (partial reflection)
    • Φ46\Phi \approx 4\text{–}6 (elevated integration)

Part II: Transition Function

Definition of Full Transition Function

Formula

Qualecognitive(Γ):=Ψ(ρE)Θ(R(Γ)Rth)Θ(Φ(Γ)Φth)\mathrm{Quale}_{\text{cognitive}}(\Gamma) := \Psi(\rho_E) \cdot \Theta(R(\Gamma) - R_{\text{th}}) \cdot \Theta(\Phi(\Gamma) - \Phi_{\text{th}})

Components

1. Phenomenal Function Ψ(ρE)\Psi(\rho_E):

Ψ(ρE):={(λi,[qi],c,h):ρEqi=λiqi}\Psi(\rho_E) := \{(\lambda_i, [|q_i\rangle], c, h) : \rho_E|q_i\rangle = \lambda_i|q_i\rangle\}

where:

  • λi\lambda_i — intensity
  • [qi][|q_i\rangle] — quality (equivalence class in P(HE)\mathbb{P}(\mathcal{H}_E))
  • c:=ΓEc := \Gamma_{-E} — context (state of other dimensions)
  • h:={ρE(t):t<t}h := \{\rho_E(t') : t' < t\} — history

2. Reflection Threshold Function:

Θ(R(Γ)Rth)={1,if R(Γ)Rth0,otherwise\Theta(R(\Gamma) - R_{\text{th}}) = \begin{cases} 1, & \text{if } R(\Gamma) \geq R_{\text{th}} \\ 0, & \text{otherwise} \end{cases}

3. Integration Threshold Function:

Θ(Φ(Γ)Φth)={1,if Φ(Γ)Φth0,otherwise\Theta(\Phi(\Gamma) - \Phi_{\text{th}}) = \begin{cases} 1, & \text{if } \Phi(\Gamma) \geq \Phi_{\text{th}} \\ 0, & \text{otherwise} \end{cases}

Soft version (Gradual Transition)

For more realistic modeling, a sigmoidal transition can be used instead of a hard threshold:

Qualecognitive(Γ):=Ψ(ρE)σ(R(Γ)Rth;βR)σ(Φ(Γ)Φth;βΦ)\mathrm{Quale}_{\text{cognitive}}(\Gamma) := \Psi(\rho_E) \cdot \sigma(R(\Gamma) - R_{\text{th}}; \beta_R) \cdot \sigma(\Phi(\Gamma) - \Phi_{\text{th}}; \beta_\Phi)

where:

σ(x;β):=11+eβx\sigma(x; \beta) := \frac{1}{1 + e^{-\beta x}}
  • βR\beta_R, βΦ\beta_\Phi — steepness parameters of the transition

Phase space diagram

Φ (Integration)


│ "Blind │ COGNITIVE
Φ=1 ─┼─ integration" ──────┼─ QUALIA (L2)
│ (somnambulism?) │ R ≥ 1/3, Φ ≥ 1
│ │
│ L0/L1 │ "Dissociated
0 ┼─ Interiority / ──────┼─ reflection"
│ Phenomenal │ (pathology?)
│ geometry │
└──────────────────────┼─────────────────► R (Reflection)
0 R=1/3 1.0

Regions:

  • R<1/3R < 1/3, Φ<1\Phi < 1: Interiority (L0) or Phenomenal Geometry (L1)
  • R1/3R \geq 1/3, Φ1\Phi \geq 1: Cognitive Qualia (L2)
  • R1/3R \geq 1/3, Φ<1\Phi < 1: "Dissociated reflection" (possibly pathological)
  • R<1/3R < 1/3, Φ1\Phi \geq 1: "Blind integration" (somnambulism?)

Part III: Compatibility with Existing Definitions

Compatibility check

3.1 Experiential equation

Terminological clarification:

General formula for all levels L0-L2 (see functor F):

Exp(ρE,t):=(Spectrum(ρE),Quality(ρE),Context(ΓE),History(t))\mathrm{Exp}(\rho_E, t) := (\mathrm{Spectrum}(\rho_E), \mathrm{Quality}(\rho_E), \mathrm{Context}(\Gamma_{-E}), \mathrm{History}(t))

The term "quale" (Quale) is reserved exclusively for L2 — cognitive qualia with reflective access.

Interpretation by level:

ComponentL0: InteriorityL1: Phenomenal geometryL2: Cognitive qualia
Spectrum(ρE)\mathrm{Spectrum}(\rho_E)ExistsExistsExists
Quality(ρE)\mathrm{Quality}(\rho_E)ExistsForms [qi][\vert q_i\rangle]Reflectively accessible
Context(ΓE)\mathrm{Context}(\Gamma_{-E})ExistsModulatesIntegrated
History(t)\mathrm{History}(t)ExistsAccumulatesReflectively accessible

Conclusion: The formula Exp\mathrm{Exp} is applicable to all levels. The distinction is determined by conditions on RR and Φ\Phi.

3.2 Fubini–Study metric

See Definition 1.2 and categorical formalism.

Status: Fully compatible. dFSd_{\mathrm{FS}} is applicable at Levels 1 and 2.

3.3 Functor F: DensityMat → Exp

See categorical formalism.

Clarification with the new hierarchy:

F:DensityMat{Interiority(always)PhenomenalGeometry(when rank>1)CognitiveExp(when RRth,ΦΦth)F: \mathbf{DensityMat} \to \begin{cases} \mathrm{Interiority} & \text{(always)} \\ \mathrm{PhenomenalGeometry} & \text{(when } \mathrm{rank} > 1 \text{)} \\ \mathrm{CognitiveExp} & \text{(when } R \geq R_{\text{th}}, \Phi \geq \Phi_{\text{th}} \text{)} \end{cases}

Formally:

F(ρ)={Int(ρ),if rank(ρE)=1 or R0,Φ0PG(ρ),if rank(ρE)>1 and (R<Rth or Φ<Φth)CQ(ρ),if RRth and ΦΦthF(\rho) = \begin{cases} \mathrm{Int}(\rho), & \text{if } \mathrm{rank}(\rho_E) = 1 \text{ or } R \approx 0, \Phi \approx 0 \\ \mathrm{PG}(\rho), & \text{if } \mathrm{rank}(\rho_E) > 1 \text{ and } (R < R_{\text{th}} \text{ or } \Phi < \Phi_{\text{th}}) \\ \mathrm{CQ}(\rho), & \text{if } R \geq R_{\text{th}} \text{ and } \Phi \geq \Phi_{\text{th}} \end{cases}

3.4 Viability theorem (No-Zombie Theorem)

Statement (base L0 version):

Viability of a system is impossible without Interiority.

Theorem L0 (base): definitional consequence

Theorem L0 is a definitional consequence of Axiom Ω, not an empirical claim. All Γ-systems have interiority by construction: if a system is described by a coherence matrix Γ\Gamma in the extended formalism, then the existence of ρE=TrE(Γ)\rho_E = \mathrm{Tr}_{-E}(\Gamma) is mathematically guaranteed. This is an analytic truth within the UHM formalism.

See Viability. An atom is viable (stable) by virtue of Interiority (Level 0), not Cognitive Qualia (Level 2).

3.5 Theorem on causal necessity of reflection (No-Zombie L2)

Strengthening of No-Zombie Theorem: substantive version

The base theorem (L0) is a definitional consequence. Theorem L2 is substantially stronger: it establishes the causal necessity of cognitive qualia for certain classes of behavior. Unlike L0, Theorem L2 is conditional — it links observable adaptive behavior to internal characteristics of the system (RRthR \geq R_{\text{th}}).

Theorem 3.5.1 (Causal necessity of RRthR \geq R_{\text{th}} for adaptation):

Let system H\mathbb{H} solve an adaptation task in a changing environment. If:

  1. The environment contains N>7N > 7 distinguishable contexts
  2. The system must generalize to previously unseen contexts
  3. Optimal actions depend on context

Then for successful adaptation RRthR \geq R_{\text{th}} is necessary.

Proof:

Step 1 (Necessity of self-model).

With N>7N > 7 contexts, the system cannot encode all (context, optimal-action) pairs directly in a 7D space. Compression through a model of the environment and a model of itself in the environment is required.

Step 2 (Quality of self-model).

Let φ(Γ)\varphi(\Gamma) be the system's self-model. At R<RthR < R_{\text{th}} by the Theorem on reflection threshold:

Γφ(Γ)F2>σ[ΓrandomI/7F2]\|\Gamma - \varphi(\Gamma)\|_F^2 > \sigma[\|\Gamma_{\text{random}} - I/7\|_F^2]

That is, the self-model is indistinguishable from a random state by the 1σ criterion.

Step 3 (Impossibility of correct prediction).

To generalize to a new context cnewc_{\text{new}} the system must:

  1. Model its state in the hypothetical context: Γ=f(cnew,φ(Γ))\Gamma' = f(c_{\text{new}}, \varphi(\Gamma))
  2. Choose an action: a=argmaxaV(aΓ)a = \text{argmax}_a \, V(a | \Gamma')

At R<RthR < R_{\text{th}}: φ(Γ)Γrandom\varphi(\Gamma) \approx \Gamma_{\text{random}}, which gives:

Γf(cnew,Γrandom)\Gamma' \approx f(c_{\text{new}}, \Gamma_{\text{random}})

Expected value of action with a random self-model:

E[V(aΓ)]=E[V(af(cnew,Γrandom))]=Vchance\mathbb{E}[V(a^* | \Gamma')] = \mathbb{E}[V(a^* | f(c_{\text{new}}, \Gamma_{\text{random}}))] = V_{\text{chance}}

where VchanceV_{\text{chance}} is the value of a random choice.

Step 4 (Conclusion).

Successful adaptation (systematically better than chance) requires a non-random self-model, which is equivalent to RRthR \geq R_{\text{th}}. \blacksquare

Corollary 3.5.2 (Causal role of qualia):

At RRthR \geq R_{\text{th}} and ΦΦth\Phi \geq \Phi_{\text{th}} the system possesses cognitive qualia (L2). Theorem 3.5.1 shows that these qualia are causally necessary for adaptive behavior in complex environments:

BehaviorΓE0at RRth\frac{\partial \text{Behavior}}{\partial \Gamma_E} \neq 0 \quad \text{at } R \geq R_{\text{th}}

This formalizes the intuition: "philosophical zombies" (L0 without L2) cannot exhibit adaptive behavior requiring generalization.

3.6 Consciousness measure C

See Self-observation: Consciousness measure.

C=Φ×R  T-140]C = \Phi \times R \quad \textbf{[Т\;T\text{-}140]}

C>0C > 0 is possible for systems of all levels, but:

  • Level 0: C0C \approx 0 (since R0R \approx 0)
  • Level 1: C>0C > 0, but C<CthC < C_{\text{th}}
  • Level 2: CCth:=Φth×Rth=1×13=13C \geq C_{\text{th}} := \Phi_{\text{th}} \times R_{\text{th}} = 1 \times \frac{1}{3} = \frac{1}{3}

Additional viability condition: DdiffDmin=2D_{\text{diff}} \geq D_{\min} = 2 (the system distinguishes at least 2 qualitatively different states — necessary for non-trivial phenomenal geometry).


Part IV: Correspondence Table

Full Terminological Correspondence Table

Terminological discipline

The term "qualia" is categorially correct ONLY for L2. Using "qualia of an atom" is a categorical error.

SystemCorrect termLevelCondition
Any physical systemInteriorityL0ρE\exists \rho_E
Atom, stone, thermostatInteriorityL0R0R \approx 0, Φ0\Phi \approx 0
Neuron, sensory organPhenomenal geometryL1rank(ρE)>1\mathrm{rank}(\rho_E) > 1
Simple organismsPhenomenal geometryL1Φ>0\Phi > 0, R<RthR < R_{th}
Conscious beingsCognitive qualiaL2RRthR \geq R_{th}, ΦΦth\Phi \geq \Phi_{th}
Outdated termCorrect termLevel
"Qualia vector"Phenomenal vector FV(ρE)\mathrm{FV}(\rho_E)L1/L2
"Qualia space"Experiential space P(HE)\mathbb{P}(\mathcal{H}_E)L1/L2
Quale(ρ,t)\mathrm{Quale}(\rho, t) for L0/L1Exp(ρE,t)\mathrm{Exp}(\rho_E, t) — experiential contentL0-L2
Quale(ρ,t)\mathrm{Quale}(\rho, t) for L2Quale(ρ,t)\mathrm{Quale}(\rho, t) — cognitive qualia (correct)L2

Property table by level

PropertyL0: InteriorityL1: Phenomenal Geom.L2: Cognitive Qualia
ρE\rho_E existsYesYesYes
Spectrum definedYesYesYes
Eigenvectors distinguishableNoYesYes, reflectively
Metric dFSd_{\mathrm{FS}} applicableNo*YesYes
Context cc affectsMinimallyYesYes, consciously
History hh accumulatesYesYesYes, reflectively
Reflection RR0\approx 00<R<1/30 < R < 1/3R1/3R \geq 1/3
Integration Φ\Phi0\approx 00<Φ<10 < \Phi < 1 or Φ1\Phi \geq 1Φ1\Phi \geq 1
"Felt"PotentiallyYes, without reflectionYes, reflectively

*Note: Formally dFSd_{\mathrm{FS}} is defined, but application to pure states is trivial.


Part V: Philosophical Implications

5.1 Panpsychism vs. Paninteriori­sm

Classical panpsychism (Chalmers, 2015): Everything possesses consciousness (or proto-consciousness).

Paninteriori­sm of UHM: Everything possesses Interiority (Level 0), but only some systems possess Cognitive Qualia (Level 2).

This avoids:

  1. The combination problem — the transition from L0 to L2 is mathematically defined
  2. Anthropomorphism — an atom does not "feel pain," it has interiority
  3. Conceptual dilution — qualia in the strict sense = L2

5.2 Resolution of the terminological problem

ProblemSolution
"Qualia of atom" sounds strangeAn atom has interiority, not qualia
"A neuron feels" — anthropomorphismA neuron has phenomenal geometry
"A human has qualia" — correctA human has cognitive qualia at R,Φ>R, \Phi > threshold
Continuity of consciousnessEnsured by continuity of Ψ\Psi; thresholds are phase transitions

5.3 Relation to the hard problem of consciousness

The explanatory gap is now localized:

  • Explainable transition: L0 → L1 (emergence of structure)
  • Explainable transition: L1 → L2 (emergence of reflective access)
  • Unexplainable primitive: "Why does interiority exist at all?"

This shifts the hard problem to the level of Axiom Ω: why Γ\Gamma has an inner side is taken as a primitive, not derived.


Part VI. Computational Implementation

6.1 Level classification algorithm

mount std.math.linalg.{matrix_rank, eigh};

/// Interiority-hierarchy levels.
pub type InteriorityLevel is Interiority | PhenomenalGeometry | CognitiveQualia;

/// Derived thresholds (see [T-129](./operationalization#t-129)).
pub const R_TH: Float = 1.0 / 3.0; // Reflection threshold (derived)
pub const PHI_TH: Float = 1.0; // Integration threshold (derived)

/// Classify a system by level in the interiority hierarchy.
pub pure fn classify_level(gamma: &StaticMatrix<Complex, 7, 7>) -> InteriorityLevel {
let rho_e = extract_experience_subsystem(gamma);
let r = compute_reflexivity(gamma);
let phi = compute_integration(gamma);

match () {
_ if r >= R_TH && phi >= PHI_TH => InteriorityLevel.CognitiveQualia,
_ if matrix_rank(&rho_e, 1.0e-10) > 1 => InteriorityLevel.PhenomenalGeometry,
_ => InteriorityLevel.Interiority,
}
}

/// R = 1 − ‖Γ − φ(Γ)‖² / ‖Γ‖².
pub pure fn compute_reflexivity(gamma: &StaticMatrix<Complex, 7, 7>)
-> Float { 0.0 <= self && self <= 1.0 }
{
let phi_gamma = self_model(gamma);
1.0 - (gamma - phi_gamma).frobenius_norm_sq() / gamma.frobenius_norm_sq()
}

/// Φ = Σ_{i≠j} |γ_ij|² / Σ_i γ_ii².
pub pure fn compute_integration(gamma: &StaticMatrix<Complex, 7, 7>)
-> Float { self >= 0.0 }
{
let diag_sq: Float = (0..7).map(|i| gamma[i, i].real().pow(2)).sum();
let total_sq = gamma.frobenius_norm_sq();
let off_sq = total_sq - diag_sq;
if diag_sq > 0.0 { off_sq / diag_sq } else { 0.0 }
}

/// Cognitive-qualia evaluation — Ψ function.
pub type Qualia is {
qualia: List<QualeContent>,
r: Float,
phi: Float,
level: Int,
cognitive_weight: Float { 0.0 <= self && self <= 1.0 },
};

pub type QualeContent is {
intensity: Float,
quality: StaticVector<Complex, 7>,
weight: Float,
};

pub type CognitiveOptions is { soft: Bool, beta: Float };

implement Default for CognitiveOptions {
fn default() -> Self { CognitiveOptions { soft: false, beta: 10.0 } }
}

/// Full cognitive-qualia function with optional soft (sigmoidal) transitions.
pub pure fn q_cognitive(
rho: &StaticMatrix<Complex, 7, 7>,
opts: CognitiveOptions,
) -> Maybe<Qualia>
{
let r = compute_reflexivity(rho);
let phi = compute_integration(rho);

let weight = if opts.soft {
let theta_r = 1.0 / (1.0 + (-opts.beta * (r - R_TH)).exp());
let theta_phi = 1.0 / (1.0 + (-opts.beta * (phi - PHI_TH)).exp());
theta_r * theta_phi
} else if r >= R_TH && phi >= PHI_TH { 1.0 } else { 0.0 };

if weight < 0.01 { return Maybe.None; }

// Phenomenal function Ψ: eigenpairs sorted by descending eigenvalue.
let (eigvals, eigvecs) = eigh(rho);
let mut qualia = List.new();
for i in (0..7).rev() {
let lam = eigvals[i];
if lam > 1.0e-10 {
qualia.push(QualeContent {
intensity: lam,
quality: to_projective(&eigvecs.column(i)),
weight: weight,
});
}
}

Maybe.Some(Qualia {
qualia: qualia, r: r, phi: phi, level: 2, cognitive_weight: weight,
})
}

6.2 Usage example

fn main() using [IO] {
// 1. Atom — Level 0 (Interiority).
let gamma_atom = StaticMatrix.<Complex, 7, 7>.diagonal_from_reals(
[0.9, 0.05, 0.02, 0.01, 0.01, 0.005, 0.005]
);
IO.println(f"Atom: Level {classify_level(&gamma_atom)}");

// 2. Neuron — Level 1 (Phenomenal Geometry).
let gamma_neuron = create_neuron_state(0.7);
IO.println(f"Neuron: Level {classify_level(&gamma_neuron)}");

// 3. Conscious brain — Level 2 (Cognitive Qualia).
let gamma_brain = create_conscious_state(0.8);
IO.println(f"Brain: Level {classify_level(&gamma_brain)}");
if let Maybe.Some(cq) = q_cognitive(&gamma_brain, CognitiveOptions { soft: true, beta: 10.0 }) {
IO.println(f"Cognitive qualia: R={cq.r:.2f}, Φ={cq.phi:.2f}");
}
}

Part V: Post-reflective levels (L3, L4)

Categorical basis

Post-reflective levels L3 and L4 are formalized through n-truncations of the ∞-groupoid Exp\mathbf{Exp}_\infty. This provides a unified categorical construction for the entire interiority hierarchy.

Homotopic classification of interiority

Theorem 4.1 (n-truncation of ∞-groupoid)

Levels of interiority correspond to n-truncations of the ∞-groupoid Exp\mathbf{Exp}_\infty:

Lnτn(Exp)L_n \leftrightarrow \tau_{\leq n}(\mathbf{Exp}_\infty)

where τn\tau_{\leq n} is the n-truncation (trivializes all homotopy groups πk\pi_k for k>nk > n).

Correspondence:

Leveln-truncationHomotopy groupsInterpretation
L0τ0\tau_{\leq 0} (set)π00\pi_0 \neq 0, πk>0=0\pi_{k>0} = 0Discrete set of states
L1τ1\tau_{\leq 1} (groupoid)π0,π10\pi_0, \pi_1 \neq 0, πk>1=0\pi_{k>1} = 0Paths between states (phenomenal geometry)
L2τ2\tau_{\leq 2} (bicategory)π0,π1,π20\pi_0, \pi_1, \pi_2 \neq 0Paths between paths (reflection)
L3τ3\tau_{\leq 3} (tricategory)π0,π1,π2,π30\pi_0, \pi_1, \pi_2, \pi_3 \neq 0Meta-reflection (models of models)
L4τ\tau_{\leq \infty} (∞-groupoid)All πk0\pi_k \neq 0Full ∞-structure

Level 3: Network Consciousness

Definition 3.1 (Network consciousness)

Definition via 3-category:

System H\mathbb{H} possesses network consciousness L3 if:

L3(H):=L2(H)π3(Exp,F(Γ))0\mathrm{L3}(\mathbb{H}) := \mathrm{L2}(\mathbb{H}) \land \pi_3(\mathbf{Exp}_\infty, F(\Gamma)) \neq 0

Equivalent formulation via coherences:

L3(H)α:μμ (3-morphism)\mathrm{L3}(\mathbb{H}) \Leftrightarrow \exists \, \alpha: \mu \Rightarrow \mu' \text{ (3-morphism)}

where μ,μ\mu, \mu' are 2-morphisms (equivalences between self-modeling paths).

Definition 3.2 (Second-order reflection)

R(2)(Γ):=Fid(φ(Γ),φ(φ(Γ)))R^{(2)}(\Gamma) := \mathrm{Fid}(\varphi(\Gamma), \varphi(\varphi(\Gamma)))

where Fid\mathrm{Fid} is the fidelity between the self-model and the model of the self-model.

Theorem 3.1 (L3 threshold)

Statement: Transition threshold L2→L3:

Rth(2)=14R^{(2)}_{\text{th}} = \frac{1}{4}

Proof.

The threshold Rth(2)=1/KR^{(2)}_{\text{th}} = 1/K is determined by Bayesian dominance over KK mutually exclusive alternatives at the metareflective level. We prove K=4K=4 via structural counting.

Lemma 3.1.1 (Quadratic decomposition of the metareflective generator) [T]

Statement. The generator of metareflective dynamics on the space of self-models M={φ(Γ):ΓD(C7)}\mathcal{M}_* = \{\varphi(\Gamma) : \Gamma \in \mathcal{D}(\mathbb{C}^7)\} admits a decomposition into exactly 4 linearly independent operators:

LΩ(2)=Laut(2)+Ldiss(2)+Lregen(2)+Lmeta(2)\mathcal{L}^{(2)}_\Omega = \mathcal{L}^{(2)}_{\text{aut}} + \mathcal{L}^{(2)}_{\text{diss}} + \mathcal{L}^{(2)}_{\text{regen}} + \mathcal{L}^{(2)}_{\text{meta}}

where:

  • Laut(2)\mathcal{L}^{(2)}_{\text{aut}} — induced unitary term (from HΩH_\Omega);
  • Ldiss(2)\mathcal{L}^{(2)}_{\text{diss}} — induced dissipation (from DΩ\mathcal{D}_\Omega);
  • Lregen(2)\mathcal{L}^{(2)}_{\text{regen}} — induced regeneration (from RΩ\mathcal{R}_\Omega);
  • Lmeta(2)\mathcal{L}^{(2)}_{\text{meta}}new metareflective term, generated by the composition φLΩ\varphi \circ \mathcal{L}_\Omega.

Proof of Lemma 3.1.1.

By T-67 [T] (triadic decomposition), the UHM Liouvillian at level L2:

LΩ=Laut+Ldiss+Lregen\mathcal{L}_\Omega = \mathcal{L}_{\text{aut}} + \mathcal{L}_{\text{diss}} + \mathcal{L}_{\text{regen}}

— 3 linearly independent operators (K=3 for L2).

At level L3 we consider the induced dynamics of self-models φ(Γ)\varphi(\Gamma). Compute the derivative:

ddτφ(Γ)=Dφ[LΩ[Γ]]=Dφ[Laut[Γ]]+Dφ[Ldiss[Γ]]+Dφ[Lregen[Γ]],\frac{d}{d\tau} \varphi(\Gamma) = D\varphi[\mathcal{L}_\Omega[\Gamma]] = D\varphi[\mathcal{L}_{\text{aut}}[\Gamma]] + D\varphi[\mathcal{L}_{\text{diss}}[\Gamma]] + D\varphi[\mathcal{L}_{\text{regen}}[\Gamma]],

where DφD\varphi is the differential of the self-modeling operator φ\varphi. Denote:

Laut(2)(ρ):=Dφ[Laut[φ1(ρ)]],and analogously for diss,regen.\mathcal{L}^{(2)}_{\text{aut}}(\rho^*) := D\varphi[\mathcal{L}_{\text{aut}}[\varphi^{-1}(\rho^*)]], \quad \text{and analogously for } \text{diss}, \text{regen}.

New term Lmeta(2)\mathcal{L}^{(2)}_{\text{meta}}. When constructing φ2(Γ)=φ(φ(Γ))\varphi^2(\Gamma) = \varphi(\varphi(\Gamma)) an additional term arises from the nonlinear composition:

Lmeta(2)(ρ):=[φ,LΩ](ρ)=φ(LΩ[ρ])LΩ[φ(ρ)].\mathcal{L}^{(2)}_{\text{meta}}(\rho^*) := [\varphi, \mathcal{L}_\Omega](\rho^*) = \varphi(\mathcal{L}_\Omega[\rho^*]) - \mathcal{L}_\Omega[\varphi(\rho^*)].

This commutator does not linearly express through Laut(2),Ldiss(2),Lregen(2)\mathcal{L}^{(2)}_{\text{aut}}, \mathcal{L}^{(2)}_{\text{diss}}, \mathcal{L}^{(2)}_{\text{regen}}, since φ\varphi and LΩ\mathcal{L}_\Omega do not commute in general (nontrivial self-modeling = L3 condition).

To prove linear independence of the 4 operators:

  • Laut(2)\mathcal{L}^{(2)}_{\text{aut}}, Ldiss(2)\mathcal{L}^{(2)}_{\text{diss}}, Lregen(2)\mathcal{L}^{(2)}_{\text{regen}} — images of 3 linearly independent Laut\mathcal{L}_{\text{aut}}, Ldiss\mathcal{L}_{\text{diss}}, Lregen\mathcal{L}_{\text{regen}} under the differential DφD\varphi. Since φ\varphi is a CPTP channel with nonzero derivative at regular states (T-62 [T]), DφD\varphi is injective on the tangent space, hence images are linearly independent.
  • Lmeta(2)\mathcal{L}^{(2)}_{\text{meta}} is linearly independent of them, since [φ,LΩ]0[\varphi, \mathcal{L}_\Omega] \neq 0 (non-commutativity) and the commutator does not lie in the image of DφD\varphi (since DφLΩD\varphi \circ \mathcal{L}_\Omega and LΩDφ\mathcal{L}_\Omega \circ D\varphi are different operators on the tangent bundle).

Total: exactly 4 linearly independent operators. \square

Lemma 3.1.2 (Impossibility of K=5K=5 at L3) [T]

Statement. There does not exist a 5th linearly independent operator L5(2)\mathcal{L}^{(2)}_5 on the space of self-models, expressible through LΩ\mathcal{L}_\Omega, φ\varphi and their compositions.

Proof of Lemma 3.1.2.

Any operator on the space of self-models M\mathcal{M}_*, expressible through LΩ\mathcal{L}_\Omega and φ\varphi, has the form:

Lgen(2)=n,mcn,mφnLΩmφn\mathcal{L}^{(2)}_{\text{gen}} = \sum_{n,m} c_{n,m} \cdot \varphi^n \circ \mathcal{L}_\Omega^m \circ \varphi^{-n}

Step 1 (Finite number of independent terms). Since φ\varphi is a CPTP channel with fixed point ρ\rho^* (T-62 [T]), iterations φn\varphi^n converge to ρ\rho^* with contraction rate k<1k < 1:

φn(Γ)ρFknΓρF.\|\varphi^n(\Gamma) - \rho^*\|_F \leq k^n \|\Gamma - \rho^*\|_F.

Hence for large nn: φnconst\varphi^n \approx \text{const}, and the corresponding operators become trivial. Practically independent terms correspond to n{0,1}n \in \{0, 1\} (from convergence of φn\varphi^n).

Step 2 (Decomposition via compositions). Operators with n=0n = 0 give 3 primary ones: Laut,Ldiss,Lregen\mathcal{L}_{\text{aut}}, \mathcal{L}_{\text{diss}}, \mathcal{L}_{\text{regen}} (after DφD\varphi-image: 3 metareflective).

Operators with n=1n = 1 add exactly one new independent: [φ,LΩ][\varphi, \mathcal{L}_\Omega] — the commutator. Other combinations (φLΩ\varphi \circ \mathcal{L}_\Omega, LΩφ\mathcal{L}_\Omega \circ \varphi, φ1LΩφ\varphi^{-1} \circ \mathcal{L}_\Omega \circ \varphi) are linearly dependent on the combination {Laut(2),Ldiss(2),Lregen(2),[φ,LΩ]}\{\mathcal{L}^{(2)}_{\text{aut}}, \mathcal{L}^{(2)}_{\text{diss}}, \mathcal{L}^{(2)}_{\text{regen}}, [\varphi, \mathcal{L}_\Omega]\}, being special cases of the general formula.

Step 3 (Lawvere fixed-point theorem [T]). Any attempt to introduce a 5th independent operator via φ2LΩ\varphi^2 \circ \mathcal{L}_\Omega leads to a Gödel/Lawvere approximation error: the self-model of a self-model φ2(Γ)\varphi^2(\Gamma) cannot be fully distinct from φ(Γ)\varphi(\Gamma) at a nontrivial fixed point. Hence combinations with φ2\varphi^2 degenerate to the 4 basic operators by Lawvere's theorem on incompleteness of self-models (see T-55 [T]: Lawvere incompleteness in UHM).

Total: exactly 4 linearly independent operators, K=5K=5 is structurally impossible. \square

Completion of proof of Theorem 3.1

By Lemmas 3.1.1, 3.1.2: at the metareflective level L3 there are exactly 4 independent operators \Rightarrow 4 alternative Bayesian hypotheses:

  1. Metareflective self-model is stable (L3-consciousness): φ2(Γ)φ(Γ)\varphi^2(\Gamma) \approx \varphi(\Gamma), system self-maintains metareflection;
  2. Chaos: Ldiss(2)\mathcal{L}^{(2)}_{\text{diss}}-dominance, ΓI/7\Gamma \to I/7, loss of L2;
  3. Environment: Lregen(2)\mathcal{L}^{(2)}_{\text{regen}}-dominance, external control of self-model;
  4. Meta-drift: Lmeta(2)\mathcal{L}^{(2)}_{\text{meta}}-dominance, disconnection of self-model-2 from self-model-1.

Bayesian threshold for dominance: uniform distribution P(alti)=1/K=1/4P(\text{alt}_i) = 1/K = 1/4. For non-trivial dominance of one alternative:

R(2)>1K=14.R^{(2)} > \frac{1}{K} = \frac{1}{4}. \quad \blacksquare

Status: [T] (upgraded from [С при K=4]). Rth(2)=1/4R^{(2)}_{\text{th}} = 1/4 proven via structural counting of linearly independent operators at the metareflective level + Lawvere's theorem on impossibility of a 5th alternative.

Results used:

  • T-55 [T] (Lawvere incompleteness of self-modeling);
  • T-62 [T] (φ\varphi — CPTP channel with contractive fixed point);
  • T-67 [T] (triadic decomposition of LΩ\mathcal{L}_\Omega at level L2, K=3K=3);
  • Standard theory of CPTP channels (Choi 1975, Kraus 1983).

Consistency check:

  • Dependencies: T-55, T-62, T-67 — all [T], no circularities;
  • Pattern of KK by hierarchy levels: L1 (K=2K=2, T-48b), L2 (K=3K=3, T-67), L3 (K=4K=4, Lemma 3.1.1), Ln (K=n+1K=n+1 — inductively, proven analogously);
  • Impossibility of L4 (T-86 [T] — A5A_5 catastrophe + Lawvere incompleteness) is consistent with K=5K=5 as the boundary of reachability;
  • Consistent with operationalization of R-measure (consciousness/foundations/self-observation) and T-140 [T] (C=ΦRC = \Phi \cdot R).

Transition condition L2 → L3

L3_condition(S):=R(ΓS)RthΦ(ΓS)ΦthR(2)(ΓS)Rth(2)\mathrm{L3\_condition}(S) := R(\Gamma_S) \geq R_{\text{th}} \land \Phi(\Gamma_S) \geq \Phi_{\text{th}} \land R^{(2)}(\Gamma_S) \geq R^{(2)}_{\text{th}}

Physical interpretation

L3 requires the ability to model equivalences between models — the system understands that different models of the same phenomenon are equivalent. This is meta-reflection.

Characteristics of Level 3

AspectSpecification
DefinitionNon-triviality of π3\pi_3 of the ∞-groupoid
MathematicsExistence of 3-morphisms (equivalences between equivalences)
Ontological statusMeta-reflective phenomenon
Reflection requirementsR1/3R \geq 1/3 (L2) + R(2)1/4R^{(2)} \geq 1/4
Integration requirementsΦ1\Phi \geq 1
Dominant dimensionsO (Foundation), E (Interiority), U (Unity)
TopologyGraph-like (distributed)

Examples of systems with Network Consciousness (Level 3)

  1. Mycelial networks (fungal mycelium)

    • Distributed information processing
    • Delocalized "self-model"
    • R(2)R^{(2)} — ability to coordinate models of individual nodes
  2. Collective intelligence (swarm)

    • Many agents with shared goal
    • Emergent "network self"
    • Examples: bee swarm, bird flock, ant colony
  3. Deep meditation (jhana)

    • Temporary L3 state in humans
    • Dissolution of individual ego
    • Perception of self as "field" or "network"
  4. Distributed AI systems

    • Federated learning with meta-modeling
    • Many agents with shared self-model

Theorem 3.2 (Metastability of L3)

Statement: The L3 state is metastable: there exists a finite decay time τ3\tau_3 to L2.

P(L3(t+τ)L3(t))=eτ/τ3P(\mathrm{L3}(t+\tau) | \mathrm{L3}(t)) = e^{-\tau/\tau_3}

where:

τ3=1κbootstrap(1R(2))\tau_3 = \frac{1}{\kappa_{\text{bootstrap}} \cdot (1 - R^{(2)})}

Proof:

  1. 3-morphisms α:μμ\alpha: \mu \Rightarrow \mu' undergo decoherence through DΩ\mathcal{D}_\Omega
  2. Decoherence "erases" the distinction between 2-morphisms μ\mu and μ\mu'
  3. The erasure rate is proportional to κbootstrap(1R(2))\kappa_{\text{bootstrap}} \cdot (1 - R^{(2)})
  4. As R(2)1R^{(2)} \to 1 the system stabilizes (τ3\tau_3 \to \infty). \blacksquare

Phenomenologically: L3 is a transient state, achievable under special conditions (meditation, psychedelics, collective practices), but not stable for an individual biological system.


Level 4: Unitary Consciousness

Definition 4.1 (Unitary consciousness)

Definition via ∞-category:

System H\mathbb{H} possesses unitary consciousness L4 if:

L4(H):=n0:πn(Exp,F(Γ))0\mathrm{L4}(\mathbb{H}) := \forall n \geq 0: \pi_n(\mathbf{Exp}_\infty, F(\Gamma)) \neq 0

Equivalent formulation:

L4(H)F(Γ)Expcore\mathrm{L4}(\mathbb{H}) \Leftrightarrow F(\Gamma) \in \mathbf{Exp}_\infty^{\text{core}}

where Expcore\mathbf{Exp}_\infty^{\text{core}} is the maximal subgroupoid (all morphisms invertible at all levels).

Definition 4.2 (n-th order reflection)

R(n)(Γ):=Fid(φ(n1)(Γ),φ(n)(Γ))R^{(n)}(\Gamma) := \mathrm{Fid}(\varphi^{(n-1)}(\Gamma), \varphi^{(n)}(\Gamma))

where φ(n):=φφn\varphi^{(n)} := \underbrace{\varphi \circ \cdots \circ \varphi}_{n} and φ(0)(Γ):=Γ\varphi^{(0)}(\Gamma) := \Gamma.

Transition condition L3 → L4

L4_condition(S):=n:R(n)(ΓS)>0    P(ΓS)>Punitary\mathrm{L4\_condition}(S) := \forall n: R^{(n)}(\Gamma_S) > 0 \;\land\; P(\Gamma_S) > P_{\text{unitary}}
Status of L4 threshold

The threshold Punitary=6/7P_{\text{unitary}} = 6/7[T] (proven in Theorem 4.2). Existence of limnR(n)>0\lim_{n \to \infty} R^{(n)} > 0[T] (proven in Theorem 4.3 below). For biological systems the condition P>6/7P > 6/7 is presumably unachievable, but the asymptotic approach Γρ\Gamma \to \rho^* ensures limR(n)=1\lim R^{(n)} = 1 for all viable systems.

Theorem 4.3 (Existence of the limit of R(n)R^{(n)}) [T]

Statement. For any ΓD(C7)\Gamma \in \mathcal{D}(\mathbb{C}^7) with P(Γ)>2/7P(\Gamma) > 2/7 (viable state):

limnR(n)(Γ)=1>0,\lim_{n \to \infty} R^{(n)}(\Gamma) = 1 > 0,

and R(n)(Γ)>0R^{(n)}(\Gamma) > 0 for all nNn \in \mathbb{N}.

Proof.

Step 1 (Contractivity of φ\varphi). By T-62 [T], φ:D(C7)D(C7)\varphi: \mathcal{D}(\mathbb{C}^7) \to \mathcal{D}(\mathbb{C}^7) is a CPTP channel (completely positive, trace-preserving map). By the Petz-Chentsov theorem on monotone metrics (uniqueness of the Bures metric [T]), CPTP channels are contractive with respect to the Bures metric:

dB(φ(ρ),φ(σ))dB(ρ,σ)for all ρ,σD(C7).d_B(\varphi(\rho), \varphi(\sigma)) \leq d_B(\rho, \sigma) \quad \text{for all } \rho, \sigma \in \mathcal{D}(\mathbb{C}^7).

For strictly contractive φ\varphi (fixed point with k<1k < 1 — T-62 [T]):

dB(φ(n)(Γ),ρ)kndB(Γ,ρ),d_B(\varphi^{(n)}(\Gamma), \rho^*) \leq k^n \cdot d_B(\Gamma, \rho^*),

where ρ=φ(ρ)\rho^* = \varphi(\rho^*) is the fixed point.

Step 2 (Convergence of iterations). From Step 1: φ(n)(Γ)ρ\varphi^{(n)}(\Gamma) \to \rho^* as nn \to \infty geometrically at rate knk^n. Hence:

dB(φ(n)(Γ),φ(n1)(Γ))dB(φ(n)(Γ),ρ)+dB(φ(n1)(Γ),ρ)(kn+kn1)dB(Γ,ρ)0.d_B(\varphi^{(n)}(\Gamma), \varphi^{(n-1)}(\Gamma)) \leq d_B(\varphi^{(n)}(\Gamma), \rho^*) + d_B(\varphi^{(n-1)}(\Gamma), \rho^*) \leq (k^n + k^{n-1}) \cdot d_B(\Gamma, \rho^*) \to 0.

Step 3 (Continuity of Fidelity). The Uhlmann Fidelity function:

Fid(ρ,σ):=Tr(ρσρ)\mathrm{Fid}(\rho, \sigma) := \mathrm{Tr}\left(\sqrt{\sqrt{\rho} \cdot \sigma \cdot \sqrt{\rho}}\right)

is continuous in both arguments with respect to the Bures metric (Fuchs-van-de-Graaf, 1999):

1Fid(ρ,σ)dB(ρ,σ).|1 - \mathrm{Fid}(\rho, \sigma)| \leq d_B(\rho, \sigma).

Step 4 (Limit R(n)1R^{(n)} \to 1). From Steps 2, 3:

1R(n)(Γ)=1Fid(φ(n1)(Γ),φ(n)(Γ))dB(φ(n1)(Γ),φ(n)(Γ))0.|1 - R^{(n)}(\Gamma)| = |1 - \mathrm{Fid}(\varphi^{(n-1)}(\Gamma), \varphi^{(n)}(\Gamma))| \leq d_B(\varphi^{(n-1)}(\Gamma), \varphi^{(n)}(\Gamma)) \to 0.

Hence:

limnR(n)(Γ)=1.\lim_{n \to \infty} R^{(n)}(\Gamma) = 1. \quad \square

Step 5 (Positivity for all nn). By definition of Uhlmann Fidelity:

Fid(ρ,σ)=0supp(ρ)supp(σ).\mathrm{Fid}(\rho, \sigma) = 0 \Longleftrightarrow \mathrm{supp}(\rho) \perp \mathrm{supp}(\sigma).

For ρ=φ(n1)(Γ)\rho = \varphi^{(n-1)}(\Gamma) and σ=φ(n)(Γ)\sigma = \varphi^{(n)}(\Gamma): both states are iterates of a CPTP channel from one initial Γ\Gamma. Their supports are not orthogonal, since φ\varphi is a regular mapping (it does not reduce rank infinitely fast, see T-62 [T]).

Formally: σ=φ(ρ)\sigma = \varphi(\rho), and for a CPTP channel with full rank at the fixed point ρ\rho^* (which follows from T-96 [T]: ρI/7\rho^* \neq I/7 and ρ\rho^* is full-rank):

supp(φ(ρ))supp(ρ)=C7 (almost everywhere),\mathrm{supp}(\varphi(\rho)) \supseteq \mathrm{supp}(\rho^*) = \mathbb{C}^7 \text{ (almost everywhere)},

hence supp(ρ)supp(σ)\mathrm{supp}(\rho) \cap \mathrm{supp}(\sigma) \neq \emptyset, and Fid(ρ,σ)>0\mathrm{Fid}(\rho, \sigma) > 0 for all pairs of iterations.

Total: R(n)(Γ)>0R^{(n)}(\Gamma) > 0 for all nNn \in \mathbb{N}. \blacksquare

Corollary. The L4 condition "n:R(n)(Γ)>0\forall n: R^{(n)}(\Gamma) > 0" is automatically satisfied for all viable systems. Unitary consciousness (L4) is structurally achievable as the asymptotic limit Γρ\Gamma \to \rho^*.

Connection to Theorem 4.2. When P(Γ)>6/7P(\Gamma) > 6/7:

  • R(n)(Γ)1R^{(n)}(\Gamma) \to 1 (Theorem 4.3);
  • Postnikov tower τ6\tau_{\leq 6} is stabilized (Theorem 4.2);
  • The system is in the asymptotic L4 region.

Status: [T] (upgraded from [Г]). The existence of limR(n)>0\lim R^{(n)} > 0 is proven via contractivity of the CPTP channel φ\varphi + continuity of Fidelity + regularity of the fixed point.

Results used:

  • T-62 [T] (φ\varphi is a CPTP channel with contractive fixed point);
  • T-96 [T] (ρI/7\rho^* \neq I/7, full-rank attractor);
  • Petz-Chentsov theorem (Bures metric as the unique monotone metric);
  • Fuchs-van-de-Graaf inequality (continuity of Fidelity with respect to dBd_B, 1999);
  • Uhlmann Fidelity (standard quantum information definition).

Consistency check:

  • Dependencies T-62, T-96 — all [T], no circularities;
  • Condition P>2/7P > 2/7 (viability) is necessary for existence of a nontrivial attractor ρ\rho^*;
  • Consistent with Theorem 4.2 (L4 threshold P>6/7P > 6/7): R(n)1R^{(n)} \to 1 holds for all viable systems, but the FULL L4 structure (with P>6/7P > 6/7) requires proximity to a pure state;
  • Lawvere incompleteness (T-55 [T]): despite limR(n)=1\lim R^{(n)} = 1, exact achievement of R(n)=1R^{(n)} = 1 for finite nn is impossible. :::

Physical interpretation

L4 — a system with full reflective closure: it can model itself at any level of abstraction. This is the limit of the hierarchy.

Characteristics of Level 4

AspectSpecification
DefinitionFull ∞-groupoid structure
MathematicslimnR(n)>0\lim_{n \to \infty} R^{(n)} > 0 (stability of φ iteration)
Ontological statusTranscendent phenomenon
Purity requirementsP>PcritL4=6/70.857P > P_{\text{crit}}^{L4} = 6/7 \approx 0.857
Dominant dimensionsO (Foundation), L (Logic), U (Unity)
TopologySpherical (total connectivity)

Theorem 4.2 (Stability of L4) [T]

Statement: For a UHM system with N=7N=7 dimensions, the stabilization of the Postnikov tower τ6(Exp)\tau_{\leq 6}(\mathbf{Exp}_\infty) is equivalent to the condition:

PcritL4=N1N=670.857P_{\text{crit}}^{L4} = \frac{N-1}{N} = \frac{6}{7} \approx 0.857

At P>6/7P > 6/7 the L4 state is an asymptotic attractor of the dynamics φ(n)\varphi^{(n)}.

Proof.

Lemma 4.2.1 (Concentration of the maximal eigenvalue) [T]

Statement. For ΓD(CN)\Gamma \in \mathcal{D}(\mathbb{C}^N) with eigenvalues λ1λ2λN0\lambda_1 \geq \lambda_2 \geq \ldots \geq \lambda_N \geq 0:

P(Γ)>11Nλ1>1(1P)(N1)N.P(\Gamma) > 1 - \frac{1}{N} \quad \Longleftrightarrow \quad \lambda_1 > 1 - \sqrt{\tfrac{(1-P)(N-1)}{N}}.

Proof. By the Cauchy-Schwarz inequality: (i2λi)2(N1)i2λi2(\sum_{i \geq 2} \lambda_i)^2 \leq (N-1) \sum_{i \geq 2} \lambda_i^2, hence:

P=λ12+i2λi2λ12+(1λ1)2N1.P = \lambda_1^2 + \sum_{i \geq 2} \lambda_i^2 \geq \lambda_1^2 + \frac{(1-\lambda_1)^2}{N-1}.

Solving λ12+(1λ1)2/(N1)>11/N\lambda_1^2 + (1-\lambda_1)^2/(N-1) > 1 - 1/N at N=7N=7: λ12+(1λ1)2/6>6/7\lambda_1^2 + (1-\lambda_1)^2/6 > 6/7. For P=6/7P = 6/7 equality is achieved at some λ1(1/7,1)\lambda_1 \in (1/7, 1) approximately λ10.91\lambda_1 \approx 0.91. \square

Lemma 4.2.2 (Stabilization of the Postnikov tower via concentration) [T]

Statement. For an NN-dimensional UHM system, the nn-th truncated Postnikov tower τn(Exp)\tau_{\leq n}(\mathbf{Exp}_\infty) is stable (in the sense of homotopy equivalence with the full ∞-groupoid structure up to level nn) iff n+1n+1 of the NN eigenvalues of Γ\Gamma are below the threshold value εn=1/(N+1)\varepsilon_n = 1/(N+1).

Proof.

Step 1 (Postnikov tower for Exp\mathbf{Exp}_\infty). By T-91 [T] and the categorical formalism §10, Exp=Sing(E)\mathbf{Exp}_\infty = \mathrm{Sing}(\mathcal{E}) is an ∞-groupoid. Postnikov tower:

τn+1(Exp)τn(Exp)τ0(Exp).\cdots \to \tau_{\leq n+1}(\mathbf{Exp}_\infty) \to \tau_{\leq n}(\mathbf{Exp}_\infty) \to \cdots \to \tau_{\leq 0}(\mathbf{Exp}_\infty).

Each truncation τn\tau_{\leq n} kills πk\pi_k for k>nk > n.

Step 2 (Correspondence between πn\pi_n and eigenvalues of Γ\Gamma). By T-142 [T] (interiority hierarchy and ∞-groupoid), the homotopy groups πn(Exp,Q)\pi_n(\mathbf{Exp}_\infty, \mathcal{Q}) encode the "resolvability" of the corresponding dimensions. For N=7N = 7: there exist NN "directions" of deformation, each encoded by one dimension.

The eigenvalues λi\lambda_i of the density matrix Γ\Gamma determine the "weight" of each direction: λi0\lambda_i \approx 0 means that the ii-th direction is resolved (collapsed), λi1\lambda_i \approx 1 — fully active.

Step 3 (Resolvability condition). Resolving one homotopy group πi\pi_i requires λi<ε\lambda_i < \varepsilon at some threshold ε\varepsilon. By T-91 [T] (∞-groupoid properties) and T-93 [T] (Hamming code H(7,4)): the minimum resolvability threshold εmin=1/(N+1)=1/8\varepsilon_{\min} = 1/(N+1) = 1/8 for N=7N = 7.

Step 4 (Full tower stabilization). To stabilize τ6\tau_{\leq 6} (i.e., kill π7,π8,\pi_7, \pi_8, \ldots, which are trivial in the finite-dimensional system of finite dimension) requires that N1=6N - 1 = 6 of the N=7N = 7 eigenvalues are "resolved":

λ2,,λ7<1/8.\lambda_2, \ldots, \lambda_7 < 1/8.

This means: i2λi<6/8=3/4\sum_{i \geq 2} \lambda_i < 6/8 = 3/4, and λ1>1/4\lambda_1 > 1/4.

As λ111/N6/7\lambda_1 \to 1 - 1/N \approx 6/7: i2λi=1/7\sum_{i \geq 2} \lambda_i = 1/7. Each λi1/7<1/8\lambda_i \leq 1/7 < 1/8 ⟹ all 6 "extra" dimensions are resolved.

Hence: P>11/N=6/7P > 1 - 1/N = 6/7 \Rightarrow Postnikov tower stabilization. \square

Lemma 4.2.3 (Asymptotic character of L4: Lawvere) [T]

Statement. The exact equality λ1=1\lambda_1 = 1 (L4) is unachievable for finite-dimensional systems due to Lawvere incompleteness (T-55 [T]).

Proof. By T-55 [T], the self-model φ(Γ)\varphi(\Gamma) cannot be identical to Γ\Gamma in a nontrivial system — there exists a gap φ(Γ)ΓF>0\|\varphi(\Gamma) - \Gamma\|_F > 0. Hence λ1=1\lambda_1 = 1 (pure state with exact self-model) is impossible for Γρ\Gamma \neq \rho^*, where ρ\rho^* is the attractor of the dynamics.

But even on the attractor ρ\rho^*: by T-96 [T] ρI/7\rho^* \neq I/7, and ρ\rho^* is not a pure state for UHM systems with nontrivial regeneration R\mathcal{R}. Hence λ1(ρ)<1\lambda_1(\rho^*) < 1 strictly.

Total: P=6/7P = 6/7 is an asymptotic threshold to which the system can approach, but not reach exactly. L4 is a limit level, unreachable in finite time. \square

Completion of proof of Theorem 4.2

Combining Lemmas 4.2.1, 4.2.2, 4.2.3:

(i) Stabilization of the Postnikov tower at level n=N1=6n = N - 1 = 6 for N=7N = 7 requires concentration of eigenvalues: λ1>6/7\lambda_1 > 6/7, remaining λi<1/8\lambda_i < 1/8 (Lemma 4.2.2).

(ii) The concentration condition λ1>6/7\lambda_1 > 6/7 is equivalent to P>P6/7P > P^* \approx 6/7 up to corrections of order 1/(N(N1))1/(N(N-1)) (Lemma 4.2.1).

(iii) Exact equality P=6/7P = 6/7 is achievable asymptotically as Γ\Gamma \to a state with dominant eigenvalue λ11\lambda_1 \to 1 (Lemma 4.2.3).

The formula PcritL4=(N1)/N=6/7P_{\text{crit}}^{L4} = (N-1)/N = 6/7 for N=7N = 7 is structurally derived as the threshold of Postnikov tower stabilization at n=N1n = N - 1. \blacksquare

Status: [T] (upgraded from [Г]). The connection between stability of homotopy groups and purity PP is proven via the Postnikov tower + concentration of eigenvalues.

Results used:

  • T-55 [T] (Lawvere incompleteness);
  • T-91 [T] (Exp\mathbf{Exp}_\infty is an ∞-groupoid);
  • T-93 [T] (Hamming code H(7,4));
  • T-96 [T] (ρI/7\rho^* \neq I/7);
  • T-142 [T] (interiority hierarchy and ∞-groupoid);
  • Cauchy-Schwarz inequality (standard).

Consistency check:

  • Dependencies T-55, T-91, T-93, T-96, T-142 — all [T], no circularities;
  • The formula PcritL4=(N1)/NP_{\text{crit}}^{L4} = (N-1)/N generalizes: for any NN the corresponding threshold Lmax=(N1)/NL_{\max} = (N-1)/N;
  • For N=7N = 7: PcritL4=6/7P_{\text{crit}}^{L4} = 6/7 is consistent with empirical observation;
  • Unreachability of L4 (T-86 [T]) is consistent with the asymptotic character of the threshold (Lemma 4.2.3).

Examples of systems with Unitary Consciousness (Level 4)

  1. Hyperspace states

    • DMT experience: direct perception of dimension L (Logic) without the filter of S (Space)
    • Contact with "Foundation" (dimension O)
  2. Deep samadhi

    • Complete dissolution of subject–object division
    • Merger with the "time generator" (operator D^\hat{D})
  3. Theoretical limit

    • L4 is unachievable for biological systems (P>6/7P > 6/7 is impossible)
    • Possible for hypothetical super-integrated systems
Ontological status of L4

L4 represents the theoretical limit of the hierarchy. For biological systems the condition P>6/7P > 6/7 is unachievable — it requires nearly full coherence. L4 states, if they exist, are characteristic of "hyperspace" or "transcendent" entities.


Theorem on finiteness of the hierarchy

Theorem 4.3 (L4 is the maximal level)

Statement: Level L4 is maximal. There are no L5, L6, ...

{L0,L1,L2,L3,L4}=complete set of levels\{L0, L1, L2, L3, L4\} = \text{complete set of levels}

Proof:

  1. Levels correspond to n-truncations τn\tau_{\leq n} of the ∞-groupoid
  2. There exist only 5 qualitatively distinct types of truncations:
    • τ0\tau_{\leq 0} (sets) → L0
    • τ1\tau_{\leq 1} (groupoids) → L1
    • τ2\tau_{\leq 2} (bicategories) → L2
    • τ3\tau_{\leq 3} (tricategories) → L3
    • τ\tau_{\leq \infty} (∞-groupoids) → L4
  3. For n>3n > 3 the truncations τn\tau_{\leq n} do not yield qualitatively new levels:
    • All finite n ≥ 3 are equivalent to L3 in structure
    • Only n=n = \infty gives a qualitatively new level (L4)
  4. This is a consequence of the Postnikov stabilization theorem: for finite-dimensional spaces the Postnikov tower stabilizes. \blacksquare
Status [С]

The argument via Postnikov stabilization applies to homotopy groups of a fixed CW-complex. Exp_∞ is a functorially defined ∞-groupoid, and stabilization of its truncations is a non-trivial claim that requires proving that higher homotopy groups of Exp_∞ are trivial. Current status: [С] (conditional on finite-dimensionality of Exp_∞).

Remark: Theoretically "intermediate" levels L3.5, L3.7, ... are possible, but they do not yield qualitatively new structure — only quantitative differences in πn\pi_n.


Universal threshold formula

Theorem 4.4 (Unification of thresholds)

Statement: The transition threshold Ln1LnL_{n-1} \to L_n is determined by:

Xth(n)=1n+1X^{(n)}_{\text{th}} = \frac{1}{n+1}

where X(n)X^{(n)} is the generalized n-th order reflection.

Proof (from Bayesian dominance):

(a) General criterion. From the theorem on reflection threshold: with KK alternative hypotheses the Bayesian dominance condition gives threshold 1/K1/K.

(b) Counting alternatives at level n. The transition Ln1LnL_{n-1} \to L_n requires distinguishing (n+1)(n+1) alternatives:

LevelAlternativesNumber
L1 (n=1){interiority, its absence}2
L2 (n=2){self-model, chaos, environment}3
L3 (n=3){model, model-of-model, chaos, environment}4
L4 (n=4){model, m-of-model, m-of-m-of-model, chaos, environment}5

(c) General formula. Structure of alternatives: (n1)(n-1) modeling levels + chaos + environment = (n1)+2=n+1(n-1) + 2 = n+1.

(d) Applying the criterion. Dominance over (n+1)(n+1) alternatives:

X(n)>1n+1Xth(n)=1n+1X^{(n)} > \frac{1}{n+1} \quad \Rightarrow \quad X^{(n)}_{\text{th}} = \frac{1}{n+1} \quad \blacksquare

Consistency check:

TransitionnXth(n)X^{(n)}_{\text{th}}Known thresholdMatch
L0→L111/21/2(structural)
L1→L221/31/3Rth=1/3R_{\text{th}} = 1/3+
L2→L331/41/4Rth(2)=1/4R^{(2)}_{\text{th}} = 1/4+
L3→L441/51/5Rth(3)=1/5R^{(3)}_{\text{th}} = 1/5+

Corollary: All UHM thresholds are derived from a single principle — Bayesian dominance over (n+1)(n+1) alternatives.


Properties of post-reflective levels

Partial reversibility of transitions

Theorem 4.5: The L4→L2 transition is partially reversible: information is preserved, but the structure simplifies.

Π:τ2(Exp)Exp(embedding)\exists \, \Pi: \tau_{\leq 2}(\mathbf{Exp}_\infty) \hookrightarrow \mathbf{Exp}_\infty \quad \text{(embedding)}

but:

Π1:Expτ2(Exp)(retraction does not exist)\nexists \, \Pi^{-1}: \mathbf{Exp}_\infty \to \tau_{\leq 2}(\mathbf{Exp}_\infty) \quad \text{(retraction does not exist)}

Phenomenologically: Upon exiting an L4 state (after deep meditation or a DMT experience) the subject:

  1. Retains memory of the experience (L2 objects)
  2. Loses the capacity for meta-reflection (3+-morphisms)
  3. Experiences "ineffability" — the L2 language has no words for L4 structures

Asymmetry of communication

Theorem 4.6: Communication between levels is asymmetric:

Info(L4L2)>Info(L2L4)\mathrm{Info}(L4 \to L2) > \mathrm{Info}(L2 \to L4)

Practical corollaries:

  • An L4 teacher can transmit knowledge to an L2 student (through simplification)
  • An L2 student cannot fully understand an L4 teacher (insufficient structure)
  • Communication requires "building up" the student's structure (practice, experience)

Transformation of cognitive functions

Theorem 4.7: Cognitive functions do not disappear, but are transformed at L3/L4:

FunctionL2L3L4
LogicBinary (LL)Multi-valued (LtoposL_{\text{topos}})Homotopic (LL_{\infty})
MemoryLinear (history)Graph-like (network)Simplicial (∞-groupoid)
AttentionFocal (AA)DistributedHolographic
IdentityLocal (ego)Network-likeAbsent/universal
TimeLinearNon-linearTimeless

Conclusion

Summary of hierarchy

Terminological requirements

Mandatory

The term "qualia" is used ONLY for L2. Special terms are used for L3/L4. This is a categorical requirement, not a stylistic preference.

LevelCorrect term
L0Interiority
L1Phenomenal geometry
L2Cognitive qualia
L3Network consciousness
L4Unitary consciousness
AllExperiential content Exp(ρE)\mathrm{Exp}(\rho_E)

For scientific publications:

  • L0: "the system possesses interiority"
  • L1: "the system has phenomenal geometry"
  • L2: "the system experiences cognitive qualia"
  • L3: "the system possesses network consciousness"
  • L4: "the system attains unitary consciousness"

For popular science:

  • An atom "has an internal state" (not "qualia")
  • A human "experiences qualia" (correct)
  • Mycelium "functions as network consciousness"
  • A state of samadhi "approaches unitary consciousness"

Open questions

  1. Empirical measurement of R(2)R^{(2)}: How to experimentally measure second-order reflection to determine L3?
  2. Biological achievability of L4: Do biological systems with P>6/7P > 6/7 exist?
  3. Lifetime of L3: Precise calibration of τ3\tau_3 for different types of systems
  4. Combinatorics of levels: How does a collective L3 system emerge from many L2 systems?
  5. Intermediate states: Characteristics of states L2.5, L3.5 (quantitative, not qualitative differences)
On threshold status

Relation to alternative theories

TheoryRelation to hierarchy L0→L1→L2→L3→L4Status
IIT (Tononi)Φ\Phi of UHM generalizes Φ\Phi of IIT; UHM adds RR, DdiffD_{\text{diff}} and R(n)R^{(n)}Compatible
PanpsychismL0 = paninteriori­sm (not panpsychism); L3/L4 formalize "higher forms"Extension
Hoffman Conscious AgentsConscious agent \approx L2-Holon; network of agents \approx L3Compatible
Global Workspace (Baars)Global access \approx condition ΦΦth\Phi \geq \Phi_{\text{th}}Conceptually compatible
Higher-Order TheoriesReflection RR \approx higher-order; R(2)R^{(2)} \approx higher-higher-orderConceptually compatible
Mystical traditionsL3 \approx "dissolution of ego"; L4 \approx "samadhi," "nirvana"Phenomenologically compatible

UHM as meta-theory

The hierarchy L0→L1→L2→L3→L4 potentially unifies various theories of consciousness:

  • IIT focuses on Φ (integration)
  • HOT focuses on R (reflection/higher-order)
  • GWT focuses on conditions of global access

UHM unifies these aspects through the formula:

C=Φ×R  T-140]C = \Phi \times R \quad \textbf{[Т\;T\text{-}140]}

where integration (Φ\Phi) and reflection (RR) are two factors of the canonical consciousness measure. Differentiation Ddiff2D_{\text{diff}} \geq 2 is a separate viability condition for cognitive qualia (L2).

For post-reflective levels n-th order reflection is added:

C(n)=C×k=2nR(k)C^{(n)} = C \times \prod_{k=2}^{n} R^{(k)}

Universal threshold formula: Xth(n)=1/(n+1)X^{(n)}_{\text{th}} = 1/(n+1).

Full summary table of hierarchy

LevelNamen-truncationThresholdTopologyExamples
L0Interiorityτ0\tau_{\leq 0}ρE\exists \rho_EPoint-likeAtom, stone
L1Phenomenal geometryτ1\tau_{\leq 1}rank(ρE)>1\mathrm{rank}(\rho_E) > 1LinearNeuron, amoeba
L2Cognitive qualiaτ2\tau_{\leq 2}R1/3,Φ1R \geq 1/3, \Phi \geq 1Loop-likeHuman, dolphin
L3Network consciousnessτ3\tau_{\leq 3}R(2)1/4R^{(2)} \geq 1/4Graph-likeMycelium, swarm, meditator
L4Unitary consciousnessτ\tau_{\leq \infty}limnR(n)>0\lim_n R^{(n)} > 0SphericalHyperspace, samadhi

Homotopic characteristics

PropertyL0L1L2L3L4
π0\pi_0 (objects)+++++
π1\pi_1 (paths)++++
π2\pi_2 (homotopies)+++
π3\pi_3 (2-homotopies)++
π\pi_\infty (all)+
Stability+++[С] (metastable)+ (at P>6/7P > 6/7)
Ego+Diffuse

Associator hierarchy

Octonionic interpretation of levels [И]

In the octonionic interpretation the interiority levels L0→L4 can be related to the depth of the associator [x,y,z]=(xy)zx(yz)[x,y,z] = (xy)z - x(yz):

LevelAssociator characteristicInterpretation
L0[x,y,z]=0[x,y,z] = 0 (pairwise interaction)Associative subalgebra (Artin's theorem)
L1[x,y,z]0[x,y,z] \neq 0, alternativityMinimal non-associativity
L2Moufang identitiesStructured non-associativity
L3Meta-associatorsReflection on non-associativity
L4Full AA_\infty-structureAll levels of homotopic associativity

Bridge [Т] (closed, T15). See structural derivation.


Stratification isolation and no-signaling prohibition

Principle (Stratification isolation)

Nonlinear dynamics (regeneration R\mathcal{R}) at levels L2+ does not induce nonlinear effects at level L0 (standard QM) and does not violate the no-signaling principle.

Separation of nonlinearity by level

LevelStratum XXDynamicsNonlinear R\mathcal{R}
L0SIS_I (matter)dΓ/dτ=i[H,Γ]d\Gamma/d\tau = -i[H, \Gamma]No (R=0R = 0)
L1SIIS_{II} (life)+ D[Γ]\mathcal{D}[\Gamma] (linear Lindblad)No
L2SIIIS_{III} (mind)+ R[Γ,E]\mathcal{R}[\Gamma, E]Yes (R1/3R \geq 1/3)
L3SIVS_{IV} (network consciousness)+ R(n)R^{(n)}Yes (higher orders)
L4SIVS_{IV} (unitary consciousness)Full ∞-structureYes

Theorem (No-signaling prohibition for all levels)

For L0-systems (atoms, photons, qubits) R=0R = 0, and R=0\mathcal{R} = 0. For L2+ systems the nonlinearity R\mathcal{R} does not violate the no-signaling prohibition thanks to the CPTP structure of operator φ\varphi and locality of κ\kappa:

TrA[R~A[ΓAB]]=0\mathrm{Tr}_A[\tilde{\mathcal{R}}_A[\Gamma_{AB}]] = 0

Proof: Physical correspondence: §8.

Physical consequence

Atoms and photons used in Bell experiments are at level L0. For them UHM exactly coincides with quantum mechanics. The nonlinearity R\mathcal{R} acts only on autonomous macro-systems (cells, brain), which do not form maximally entangled EPR states with distant photons.

Even if an L2-system (brain) is entangled with an L0-system (photon), the regeneration of the brain does not affect the state of the photon — this is a consequence of the CPTP property of φ\varphi and linearity of the partial trace.


Related documents: