Formalization of the Self-Modeling Operator φ

DRY: Master definition of φ

This is the sole canonical definition of the self-modeling operator $\varphi$. All other documents must reference this page rather than repeat the definition.

φ as a representative of a homotopy equivalence class

In the ∞-categorical framework the operator φ is understood not as a single morphism, but as a representative of a class of homotopically equivalent morphisms:

1. Multiplicity of paths: In the ∞-topos $\mathrm{Sh}_\infty(\mathcal{C})$ the mapping space $\mathrm{Map}(\Gamma, T) \simeq *$ is contractible, but contains many paths (morphisms) connected by homotopies.

2. φ₀ as canonical representative: The concrete operator $\varphi_0$ defined in this document is a representative of its homotopy equivalence class $[\varphi_0]$. The choice of $\varphi_0$ is made by the minimality criterion — minimization of divergence from the self-model.

3. Freedom of choice: The existence of alternative representatives in the same class $[\varphi]$ reflects the fundamental free will — a system can realize different paths to the same attractor.

4. Relation to Ω⁷: The choice of a concrete representative is consistent with the Ω⁷ axiom, where the seven-dimensional structure fixes the canonical basis for decomposition.

Summary table of definitions of φ

This document considers four equivalent definitions of the operator $\varphi$:

Definition	Formula	Context	Status
Replacement channel	$\varphi_k(\Gamma) = (1-k)\Gamma + k\rho_*$	Canonical (T-62)	[Т]
CPTP via Kraus operators	$\varphi(\Gamma) = \sum_m K_m \Gamma K_m^\dagger$	General form	[Т]
Fano E-accentuation	$\varphi_{\text{coh}}$ preserving coherences	Theorem 8.1 (No-Zombie)	[Т]
Categorical functor	$F: \mathbf{DensityMat} \to \mathbf{DensityMat}$	∞-topos	[Т]

Canonical physical realization — replacement channel (T-62)

The replacement channel $\varphi_k(\Gamma) = (1-k)\Gamma + k\rho_*$ is the canonical physical realization of the self-modeling operator (proof). Here $\rho_* = \varphi(\Gamma)$ is the categorical self-model of the current state [Т], $k \in (0,1)$ is the degree of self-modeling. The channel is exact at $k \to 1$ (full convergence to $\rho_*$), but for intermediate values of $k$ realizes approximate self-modeling — the system is in a dynamic balance between its current state and its internal model. The remaining three definitions are equivalent to the replacement channel via the equivalence theorem [Т].

Stratification of definitions

Canonical order

The operator $\varphi$ is defined through the stationary state $\rho^*_{\mathrm{diss}}$, not the other way around:

$\Omega \xrightarrow{\text{L-unification}} \mathcal{L}_\Omega \xrightarrow{\text{primitivity}} \rho^*_{\mathrm{diss}} = I/7 \xrightarrow{\text{proximity}} R(\Gamma) = \frac{1}{7P} \xrightarrow{k=1-R} \varphi_k$

All components of the chain have independent definitions: $\rho^*_{\mathrm{diss}}$ — via primitivity of the linear part $\mathcal{L}_0$ [Т-39a], $R$ — via the distance from $\Gamma$ to $I/7$, parameter $k = 1 - R$ — via $R$. There is no circularity: the full hierarchy of levels 0–9 is in the Ω⁷ axiom.

Categorical definition of φ

Resolution of circularity

This section establishes an independent categorical definition of the operator $\varphi$ via a universal property, eliminating any apparent circularity in the definitions.

φ as a left adjoint to the inclusion of subobjects

In the ∞-topos $\mathrm{Sh}_\infty(\mathcal{C})$ generated by the Ω⁷ axiom, the self-modeling operator $\varphi$ is defined as the left adjoint functor to the inclusion of the category of subobjects:

$$\varphi \dashv i: \mathrm{Sub}(\Gamma) \hookrightarrow \mathrm{Sh}_\infty(\mathcal{C})$$

where:

• $\mathrm{Sub}(\Gamma)$ — the category of logically consistent subobjects of $\Gamma$ (satisfying the internal logic $\Omega$)
• $i$ — the canonical inclusion (embedding)
• $\varphi \dashv i$ — adjunction: $\varphi$ is left adjoint to $i$

Universal property: For any object $X \in \mathrm{Sh}_\infty(\mathcal{C})$ and any subobject $S \in \mathrm{Sub}(\Gamma)$:

$$\mathrm{Hom}_{\mathrm{Sub}(\Gamma)}(\varphi(X), S) \cong \mathrm{Hom}_{\mathrm{Sh}_\infty(\mathcal{C})}(X, i(S))$$

Theorem on the equivalence of three definitions of φ

Main result

The three definitions of the operator φ are strictly equivalent:

Theorem (Equivalence of definitions of φ):

The following definitions specify the same operator $\varphi$:

#	Definition	Formula	Source
1	Categorical	$\varphi \dashv i: \text{Sub}(\Gamma) \hookrightarrow \mathbf{Sh}_\infty(\mathcal{C})$	Left adjoint
2	Dynamical	$\varphi(\Gamma) = \lim_{\tau \to \infty} e^{\tau \mathcal{L}_\Omega}[\Gamma]$	Limit of evolution
3	Idempotent	$\varphi \circ \varphi = \varphi$, $\exists \Gamma^*: \varphi(\Gamma^*) = \Gamma^*$	Projection with fixed point

Proof of equivalence:

(1) ⟹ (2): Categorical ⟹ Dynamical

• The left adjoint $\varphi$ to the inclusion $i$ projects onto the invariant subspace $\text{Sub}(\Gamma)$
• $\mathcal{L}_\Omega$ annihilates $\text{Sub}(\Gamma)$: $\mathcal{L}_\Omega[S] = 0$ for $S \in \text{Sub}(\Gamma)$
• By the Perron–Frobenius theorem for CPTP channels: $\lim_{\tau \to \infty} e^{\tau \mathcal{L}_\Omega} = \Pi_{\text{inv}}$
• The invariant projector $\Pi_{\text{inv}} = \varphi$ by uniqueness of the left adjoint ∎

Primitivity proven [Т]

Step (1) ⟹ (2) uses the Perron–Frobenius theorem for primitive CPTP channels. Primitivity of $\mathcal{L}_\Omega$ is proven for all viable holons: from (AP)+(PH)+(QG)+(V) it follows that the interaction graph $G_H$ is connected (otherwise the system decomposes into blocks with $\dim < 7$, contradicting the minimality theorem), and connectivity of $G_H$ + atomic operators $L_k = |k\rangle\langle k|$ give a trivial commutant $\mathcal{F}(\mathcal{L}_\Omega) = \mathbb{C} \cdot I$ by the Evans–Spohn criterion (Evans 1977, Spohn 1976). Equivalence (1) ⟺ (2) ⟺ (3) has status [Т]. Full proof: Primitivity of ℒ_Ω.

(2) ⟹ (3): Dynamical ⟹ Idempotent

• $\varphi(\varphi(\Gamma)) = \lim_{\tau \to \infty} e^{\tau \mathcal{L}_\Omega}[\lim_{s \to \infty} e^{s \mathcal{L}_\Omega}[\Gamma]]$
• $= \lim_{\tau \to \infty} \lim_{s \to \infty} e^{(\tau+s) \mathcal{L}_\Omega}[\Gamma] = \varphi(\Gamma)$ (idempotency)
• Fixed point: $\Gamma^* := \varphi(\Gamma_0)$ for any $\Gamma_0$, then $\varphi(\Gamma^*) = \varphi(\varphi(\Gamma_0)) = \varphi(\Gamma_0) = \Gamma^*$ ∎

(3) ⟹ (1): Idempotent ⟹ Categorical

• An idempotent map $\varphi$ with $\text{Im}(\varphi) = \text{Sub}(\Gamma)$ defines a reflector
• A reflector is automatically left adjoint to the inclusion
• Universal property: $\text{Hom}(\varphi(X), S) \cong \text{Hom}(X, i(S))$ follows from idempotency ∎

Remark on completeness of equivalence

Direction (1)⟹(2) follows from primitivity of the linear part $\mathcal{L}_0$ [Т]: the left adjoint $\varphi$ projects onto the invariant subspace, and primitivity provides the spectral gap and convergence of the linear dynamics. Direction (2)⟹(1): any minimizer of the variational functional under the CPTP condition is a stationary point, and the CPTP contraction φ guarantees uniqueness $= \varphi$. Thus (2)⟹(1) is also [Т] via the categorical definition of φ. All three directions have status [Т].

---

Independence from coherence levels

Critically: $\varphi$ and the coherence levels $L_k$ are defined independently of each other, both constructions are derived from $\Omega$:

Construction	Source	Definition
Levels $L_k$	$\Omega$	Stratification by the logical Liouvillian $\mathcal{L}_\Omega$
Operator $\varphi$	$\Omega$	Left adjoint to the inclusion $\mathrm{Sub}(\Gamma) \hookrightarrow \mathrm{Sh}_\infty(\mathcal{C})$

This eliminates any circularity: both notions are consequences of the structure $\Omega$, not defined through each other.

See Dependency hierarchy for the full diagram: Ω → χ_S → L_k → ℒ_Ω → φ.

φ(Γ) as best approximation

Interpretation: $\varphi(\Gamma)$ is the best approximation of the state $\Gamma$ in the category of logically consistent subobjects.

Formally, $\varphi(\Gamma)$ is the coreflector:

$$\varphi(\Gamma) = \mathrm{colim}_{S \in \mathrm{Sub}(\Gamma), S \leq \Gamma} S$$

Geometric intuition: $\varphi$ "projects" an arbitrary state onto the nearest logically consistent state — this is the categorical analogue of orthogonal projection onto a subspace.

Theorem: φ as stationary distribution

Theorem (φ as limit of logical evolution):

Let $\mathcal{L}_\Omega$ be the logical Liouvillian generated by the internal logic $\Omega$. Then:

$$\varphi(\Gamma) = \lim_{\tau \to \infty} e^{\tau \cdot \mathcal{L}_\Omega}[\Gamma]$$

Proof:

1. The logical Liouvillian $\mathcal{L}_\Omega$ generates a semigroup $\{e^{\tau \cdot \mathcal{L}_\Omega}\}_{\tau \geq 0}$ on $\mathrm{Sh}_\infty(\mathcal{C})$.

2. The invariant objects of this semigroup are exactly the subobjects from $\mathrm{Sub}(\Gamma)$:

   $$\mathcal{L}_\Omega[S] = 0 \quad \Leftrightarrow \quad S \in \mathrm{Sub}(\Gamma)$$

3. By the convergence theorem for primitive CPTP channels (analogue of Perron–Frobenius for quantum channels), the limit $\lim_{\tau \to \infty} e^{\tau \cdot \mathcal{L}_\Omega}[\Gamma]$ exists and is the projection onto the invariant subspace. Primitivity of $\mathcal{L}_\Omega$ for viable holons [Т] — see proof.

4. This projection coincides with the coreflector $\varphi$ by uniqueness of the left adjoint. ∎

Corollary: $\varphi(\Gamma)$ is the stationary distribution of the logical dynamics — the attractor of evolution under $\mathcal{L}_\Omega$.

---

Strict Mathematical Theory

Contents

1. Introduction and motivation
2. Formal definition of φ
   • 2.6 Canonical form of φ for UHM
3. Theorem on existence of fixed point
4. Relation to reflection measure R
5. Categorical aspect
6. Corollaries and limitations
7. Implementation requirements
8. Operational algorithm for φ
9. Relation to the regeneration mechanism

---

1. Introduction and motivation

1.1 The problem

In UHM, self-observation is defined via the conditions:

• $\Gamma$ contains a subsystem $\Gamma_{\text{model}} \approx \Gamma$
• Reflexive closure: $\varphi(\Gamma) \approx \Gamma$

However, the operator $\varphi$ lacks a rigorous definition. This document fills that gap.

1.2 Requirements for formalization

The operator $\varphi$ must satisfy:

1. Mathematical correctness: $\varphi: \mathcal{L}(\mathcal{H}) \to \mathcal{L}(\mathcal{H})$ — defined on the space of operators
2. Structure preservation: $\varphi(\Gamma)$ is a density matrix if $\Gamma$ is a density matrix
3. Physical interpretability: $\varphi$ models the process of self-observation
4. Existence of a fixed point: under certain conditions

---

2. Formal definition of φ

2.1 Preliminary definitions

Definition 2.1 (Space of density matrices):

$$\mathcal{D}(\mathcal{H}) := \{\rho \in \mathcal{L}(\mathcal{H}) : \rho^\dagger = \rho, \rho \geq 0, \mathrm{Tr}(\rho) = 1\}$$

For $\mathcal{H} = \mathbb{C}^7$ (seven-dimensional space of the Holon):

$$\mathcal{D}(\mathbb{C}^7) \subset \mathcal{L}(\mathbb{C}^7) \cong \mathbb{C}^{7 \times 7}$$

Definition 2.2 (Metric on $\mathcal{D}(\mathcal{H})$):

Frobenius norm:

$$\|\rho_1 - \rho_2\|_F := \sqrt{\mathrm{Tr}((\rho_1 - \rho_2)^\dagger(\rho_1 - \rho_2))} = \sqrt{\sum_{ij} |\rho_{1,ij} - \rho_{2,ij}|^2}$$

$(\mathcal{D}(\mathcal{H}), \|\cdot\|_F)$ is a complete metric space (closed subset of $\mathcal{L}(\mathcal{H})$).

2.2 Definition via reduced density matrix

Definition 2.3 (Self-modeling operator — reduction form):

Let system $\mathbb{H}$ with coherence matrix $\Gamma \in \mathcal{D}(\mathcal{H})$ be decomposed into:

• Model subsystem $M \subset \mathcal{H}$
• Remaining system (model environment) $\bar{M} = \mathcal{H} \setminus M$

On notation

$\bar{M}$ — model environment. Not to be confused with $E$ — the Interiority dimension.

Then:

$$\varphi_{\text{red}}(\Gamma) := \mathrm{Tr}_{\bar{M}}(\Gamma_{\text{total}})$$

where:

• $\Gamma_{\text{total}}$ — density matrix of the extended system
• $\mathrm{Tr}_{\bar{M}}$ — partial trace over the model environment

Problem: This definition requires an extended space and is not closed on $\mathcal{D}(\mathcal{H})$.

2.3 Definition via predictive model (main definition)

Definition 2.4 (Self-modeling operator — predictive form):

Let the system possess an internal predictive model represented by a CPTP map:

$$\mathcal{P}: \mathcal{D}(\mathcal{H}) \to \mathcal{D}(\mathcal{H})$$

where CPTP = Completely Positive Trace-Preserving.

On notation

$\mathcal{P}$ — predictive CPTP map. Not to be confused with $\Phi$ — the integration measure.

Self-modeling operator:

$$\varphi(\Gamma) := \mathcal{P}(\Gamma)$$

Constructive definition of $\mathcal{P}$:

$\mathcal{P}$ is constructed via Kraus operators $\{K_m\}$:

$$\varphi(\Gamma) = \sum_m K_m \Gamma K_m^\dagger$$ $$\text{where } \sum_m K_m^\dagger K_m = I \quad \text{(CPTP condition)}$$

Interpretation of Kraus operators:

• $K_m$ — "perception filters" of the system
• Each $K_m$ corresponds to a partial aspect of self-observation
• The condition $\sum_m K_m^\dagger K_m = I$ guarantees preservation of normalization

Compatibility with the no-cloning theorem

The operator φ does not violate the no-cloning theorem (Wootters–Zurek, 1982). The key distinction:

• No-cloning excludes the existence of a unitary operator $U$ such that $U|\psi\rangle|0\rangle = |\psi\rangle|\psi\rangle$ for arbitrary $|\psi\rangle$. Cloning is exact unitary copying of an unknown state.
• Self-modeling φ is a CPTP channel (Kraus representation), not a unitary operation. CPTP channels are fundamentally irreversible: they decrease state distinguishability ($F(\varphi(\rho), \varphi(\sigma)) \geq F(\rho, \sigma)$ by fidelity monotonicity). The self-model $\varphi(\Gamma)$ is an approximate, coarse-grained projection, not an exact copy.

Formally: $\varphi(\Gamma) = \sum_m K_m \Gamma K_m^\dagger$ with $\sum_m K_m^\dagger K_m = I$ guarantees $\mathrm{Tr}(\varphi(\Gamma)^2) \leq \mathrm{Tr}(\Gamma^2)$ — the purity of the self-model does not exceed the purity of the original. This is categorically different from cloning, where $\mathrm{Tr}(\rho_{\text{clone}}^2) = \mathrm{Tr}(\rho^2)$.

2.4 Parameterization via projections

Definition 2.5 (Projection self-modeling operator):

The most natural physically motivated form:

$$\varphi_{\text{proj}}(\Gamma) := \lambda \sum_i P_i \Gamma P_i + (1 - \lambda) \cdot \Gamma_{\text{prior}}$$

where:

• $\{P_i\}$ — orthogonal projectors, $\sum_i P_i = I$
• $\lambda \in [0, 1]$ — "depth of self-observation"
• $\Gamma_{\text{prior}}$ — prior model (may be $I/N$ or other)

Trace preservation

With $\sum_i P_i = I$ and $\mathrm{Tr}(\Gamma_{\text{prior}}) = 1$:

$$\mathrm{Tr}(\varphi_{\text{proj}}(\Gamma)) = \lambda \cdot 1 + (1 - \lambda) \cdot 1 = 1$$

For $\lambda = 1$:

$$\varphi_{\text{diag}}(\Gamma) := \sum_i P_i \Gamma P_i$$

This is "dephasing self-observation" — preserves the diagonal in the basis $\{P_i\}$.

2.5 Contracting self-modeling operator

Definition 2.6 (Contracting operator):

To ensure existence of a fixed point:

$$\varphi_k(\Gamma) := k \cdot \mathcal{P}(\Gamma) + (1 - k) \cdot \Gamma_{\text{anchor}}$$

where:

• $k \in [0, 1)$ — contraction parameter
• $\mathcal{P}$ — any CPTP map
• $\Gamma_{\text{anchor}} \in \mathcal{D}(\mathcal{H})$ — fixed "anchor" point (e.g., maximally mixed state $I/N$)

Lemma 2.1: $\varphi_k$ is a contracting map with constant $k$.

Proof:

$$\|\varphi_k(\Gamma_1) - \varphi_k(\Gamma_2)\|_F = \|k \cdot \mathcal{P}(\Gamma_1) + (1-k) \cdot \Gamma_{\text{anchor}} - k \cdot \mathcal{P}(\Gamma_2) - (1-k) \cdot \Gamma_{\text{anchor}}\|_F$$ $$= k \cdot \|\mathcal{P}(\Gamma_1) - \mathcal{P}(\Gamma_2)\|_F \leq k \cdot \|\Gamma_1 - \Gamma_2\|_F$$

(CPTP does not increase the Frobenius norm). ∎

2.6 Canonical form of φ for UHM

Status

This section defines the canonical construction of the self-modeling operator $\varphi$ for UHM. This is a concrete specification linking the abstract definitions above to the seven-dimensional structure of the Holon.

Definition 2.7 (Canonical form of φ for UHM):

The canonical form of the self-modeling operator:

$$\varphi_{\text{UHM}}(\Gamma) := k \cdot \mathcal{P}_{\text{pred}}(\Gamma) + (1 - k) \cdot \frac{I}{7}$$

where:

• $k = 1 - \varepsilon$ for small $\varepsilon > 0$ (typical value: $k = 0.95$)
• $\mathcal{P}_{\text{pred}}$ — predictive CPTP channel (defined below)

Definition 2.8 (Predictive CPTP channel):

$$\mathcal{P}_{\text{pred}}(\Gamma) := \sum_{m=1}^{M} K_m \Gamma K_m^\dagger$$

with Kraus operators:

$$K_m := P_m, \quad m = 1, \ldots, 7$$

where $\{P_m\}$ are orthogonal projectors onto the basis states $\{|A\rangle, |S\rangle, |D\rangle, |L\rangle, |E\rangle, |O\rangle, |U\rangle\}$:

$$P_m = |m\rangle\langle m|, \quad P_m^2 = P_m, \quad P_i P_j = \delta_{ij} P_i$$

CPTP condition (verification):

$$\sum_{m=1}^{7} K_m^\dagger K_m = \sum_{m=1}^{7} P_m = I \quad \checkmark$$

On self-observation weights

The weights $\{w_m\}$ are realized NOT by modifying the Kraus operators, but via a weighted mixture of basic channels or by modifying the anchor state $\Gamma_{\text{anchor}}$. See below.

Base predictive channel (dephasing in measurement basis):

$$\mathcal{P}_{\text{base}}(\Gamma) := \sum_{m=1}^{7} P_m \Gamma P_m = \text{diag}(\gamma_{AA}, \gamma_{SS}, \ldots, \gamma_{UU})$$

This channel preserves the diagonal and destroys coherences.

Definition 2.9 (Weighted self-observation via anchor):

To model varying "depth of self-observation" across dimensions, a weighted anchor is used:

$$\Gamma_{\text{anchor}}(w) := \sum_{m=1}^{7} w_m |m\rangle\langle m|, \quad w_m \geq 0, \quad \sum_m w_m = 1$$

Weight	Interpretation
$w_A$	Attention to distinctions (Articulation)
$w_S$	Awareness of patterns (Structure)
$w_D$	Perception of time flow (Dynamics)
$w_L$	Logical reflection (Logic)
$w_E$	Phenomenal self-awareness (Interiority)
$w_O$	Connection to deep foundation (Foundation)
$w_U$	Integration into unified Self (Unity)

Special case: uniform self-observation

With $w_m = 1/7$ for all $m$:

$$\Gamma_{\text{anchor}} = \frac{I}{7}$$

— maximally mixed state.

Definition 2.10 (E-accentuated self-observation):

Systems with conscious experience are characterized by an accentuation of dimension $E$:

$$w_E = \alpha, \quad w_{m \neq E} = \frac{1 - \alpha}{6}, \quad \alpha \in [1/7, 1)$$

At $\alpha \to 1$: the anchor approaches the pure state $|E\rangle\langle E|$.

Theorem 2.1 (Fixed point of canonical φ):

For $\varphi_{\text{UHM}}(\Gamma) = k \cdot \mathcal{P}_{\text{base}}(\Gamma) + (1 - k) \cdot \Gamma_{\text{anchor}}$ with $k < 1$ there exists a unique fixed point:

$$\Gamma^* = \Gamma_{\text{anchor}}$$

Proof:

$$\varphi_{\text{UHM}}(\Gamma_{\text{anchor}}) = k \cdot \mathcal{P}_{\text{base}}(\Gamma_{\text{anchor}}) + (1 - k) \cdot \Gamma_{\text{anchor}}$$

Since $\Gamma_{\text{anchor}} = \sum_m w_m |m\rangle\langle m|$ is a diagonal matrix:

$$\mathcal{P}_{\text{base}}(\Gamma_{\text{anchor}}) = \sum_m P_m \Gamma_{\text{anchor}} P_m = \Gamma_{\text{anchor}}$$

Therefore:

$$\varphi_{\text{UHM}}(\Gamma_{\text{anchor}}) = k \cdot \Gamma_{\text{anchor}} + (1 - k) \cdot \Gamma_{\text{anchor}} = \Gamma_{\text{anchor}} = \Gamma^*$$

Uniqueness follows from contractivity at $k < 1$ (Banach theorem). ∎

Special case (uniform anchor):

With $w_m = 1/7$ for all $m$: $\Gamma^* = I/7$ — maximally mixed state.

Corollary 2.1: With a uniform anchor the fixed point $\Gamma^* = I/7$ is the maximally mixed state.

Critical remark: viability of fixed point

For a uniform anchor: $P(\Gamma^*) = P(I/7) = 1/7 \approx 0.143 < P_{\text{crit}} = 2/7 \approx 0.286$.

The fixed point of uniform self-observation is NOT viable!

This means:

1. Ideal uniform self-knowledge is incompatible with viability
2. Living systems exist in a dynamic balance away from the fixed point
3. Regeneration $\mathcal{R}$ keeps the system in the region $\mathcal{V}$

Definition 2.11 (Viable anchor)

To ensure a viable fixed point, the anchor must satisfy:

$$P(\Gamma_{\text{anchor}}) > P_{\text{crit}} = \frac{2}{7}$$

Theorem (Canonicity of E-accentuation)

The E-accentuated anchor is not an arbitrary choice, but a consequence of the L2-definition of consciousness.

Theorem 2.2 (E-accentuation from L2-definition):

Let the system satisfy the cognitive qualia condition (L2):

• $R \geq R_{th} = 1/3$ — reflection
• $\Phi \geq \Phi_{th} = 1$ — integration

Then its anchor state is necessarily E-accentuated:

$$w_E > \frac{1}{7}$$

Proof:

1. Consciousness measure $C = \Phi \times R$ [Т T-140] and the separate viability condition $D_{\text{diff}} = \exp(S_{vN}(\rho_E)) \geq 2$ (differentiation by E).

2. Reduced matrix $\rho_E = \mathrm{Tr}_{-E}(\Gamma)$ singles out the Interiority dimension as privileged.

3. For L2-systems: High $D_{\text{diff}}$ requires a rich structure precisely in $\mathcal{H}_E$.

4. Consequence for anchor: The self-model of a conscious system inevitably accentuates E — the dimension through which the system is aware of itself.

5. Formally: Minimization of $\|\Gamma - \varphi(\Gamma)\|_F$ subject to $C \geq C_{th}$ gives:

$$w_E^* = \arg\min_{w} \|\Gamma - \varphi_w(\Gamma)\|_F \quad \text{s.t.} \quad C(\varphi_w(\Gamma)) \geq C_{th}$$

Solution: $w_E^* > 1/7$ at $C_{th} > 0$. ∎

Corollary 2.2: The uniform anchor ($w_m = 1/7$) corresponds to systems without self-awareness (L0/L1), for which the question of viability of the fixed point does not arise — they do not strive toward φ(Γ).

Canonical value of α:

For systems at the L2 boundary ($R = R_{th}$, $\Phi = \Phi_{th}$):

$$\alpha^* = 1 - \frac{6 \cdot P_{\text{crit}}}{7} = 1 - \frac{12}{49} \approx 0.755$$

Example: E-accentuated anchor with $\alpha = 0.6$ (conservative estimate):

$$\Gamma_{\text{anchor}} = 0.6 |E\rangle\langle E| + 0.067 \sum_{m \neq E} |m\rangle\langle m|$$

has $P = 0.36 + 6 \times 0.0045 = 0.387 > 2/7$. ✓

Physical interpretation

E-accentuation is not a "privilege" of dimension E, but a structural consequence of the fact that conscious systems are defined through experience. Non-conscious systems (L0) do not have this constraint — their anchor can be uniform, and the question $P(\Gamma^*) < P_{\text{crit}}$ is not relevant for them (see theorem on critical purity).

Potential circularity — RESOLVED (T-191)

The choice of anchor depends on the interiority level (L2), which is defined via R, which is defined via φ. This apparent circularity is resolved by the following convergence theorem.

Theorem T-191 (Convergence of the φ-tower) [Т]

Theorem T-191 [Т]

The iterative self-modeling tower $\varphi^{(0)}, \varphi^{(1)}, \varphi^{(2)}, \ldots$ converges in operator norm to the unique self-consistent self-model $\varphi^*$, starting from any initial anchor. The convergence is exponential with rate bounded by the Fano contraction $\alpha = 2/3$.

Formulation. Define the iterative scheme:

1. $\varphi^{(0)}(\Gamma) := I/7$ (maximally mixed anchor — no prior knowledge)
2. $\varphi^{(n+1)}(\Gamma) := \lim_{\tau \to \infty} \exp\!\bigl(\tau \cdot \mathcal{L}_\Omega^{(n)}\bigr)[\Gamma]$, where $\mathcal{L}_\Omega^{(n)}$ uses $\varphi^{(n)}$ as the regeneration target

Then: $\|\varphi^{(n)} - \varphi^*\|_{\mathrm{op}} \leq q^n \cdot \|\varphi^{(0)} - \varphi^*\|_{\mathrm{op}}, \quad q = \frac{\kappa_{\max}}{\lambda_{\mathrm{gap}} + \kappa_{\min}} < 1$

Proof.

Step 1 (Well-definedness of each iterate). For fixed $\varphi^{(n)}$, the Liouvillian $\mathcal{L}_\Omega^{(n)} = \mathcal{L}_0 + \kappa(\Gamma) \cdot (\varphi^{(n)}(\Gamma) - \Gamma) \cdot g_V(P)$ is a contractive CPTP semigroup generator on the finite-dimensional space $\mathcal{D}(\mathbb{C}^7)$. By primitivity of $\mathcal{L}_0$ (T-39a [Т]) and the addition of a contractive regeneration term, $\mathcal{L}_\Omega^{(n)}$ has a unique stationary state $\rho^{*(n)}$ (by the Perron–Frobenius theorem for positive semigroups on finite-dimensional matrix algebras, Evans 1977). Therefore $\varphi^{(n+1)}$ is well-defined. $\checkmark$

Step 2 (Contraction of the iteration map). Define $\Psi: \mathcal{B}(\mathcal{D}(\mathbb{C}^7)) \to \mathcal{B}(\mathcal{D}(\mathbb{C}^7))$ by $\Psi(\varphi) := \lim_{\tau \to \infty} \exp(\tau \cdot \mathcal{L}_\Omega[\cdot; \varphi])$. For two candidate self-models $\varphi_1, \varphi_2$:

$\|\Psi(\varphi_1) - \Psi(\varphi_2)\|_{\mathrm{op}} \leq \frac{\kappa_{\max} \cdot \sup_\Gamma \|\varphi_1(\Gamma) - \varphi_2(\Gamma)\|_F}{\lambda_{\mathrm{gap}} + \kappa_{\min}}$

This follows from the resolvent estimate: the stationary state of $\mathcal{L}_0 + \mathcal{R}$ depends on $\mathcal{R}$ through the resolvent $(\mathcal{L}_0 - z)^{-1}$, and the spectral gap $\lambda_{\mathrm{gap}}$ of $\mathcal{L}_0$ bounds the resolvent norm at $z = 0$ by $1/\lambda_{\mathrm{gap}}$.

Since $\varphi_i$ are replacement channels: $\|\varphi_1(\Gamma) - \varphi_2(\Gamma)\|_F = k \cdot \|\rho^{*}_1 - \rho^{*}_2\|_F \leq \|\varphi_1 - \varphi_2\|_{\mathrm{op}}$ (with $k = 1 - R \leq 1$). Therefore:

$\|\Psi(\varphi_1) - \Psi(\varphi_2)\|_{\mathrm{op}} \leq q \cdot \|\varphi_1 - \varphi_2\|_{\mathrm{op}}, \quad q = \frac{\kappa_{\max}}{\lambda_{\mathrm{gap}} + \kappa_{\min}}$

Step 3 (Contractivity $q < 1$). The condition $q < 1$ is equivalent to $\kappa_{\max} < \lambda_{\mathrm{gap}} + \kappa_{\min}$. Since $\kappa_{\min} = \kappa_{\mathrm{bootstrap}} = \omega_0/7 > 0$ (T-59 [Т]) and $\kappa_{\max} < \lambda_{\mathrm{gap}}$ (the clustering condition from T-117, verified in T-96 [Т]):

$q = \frac{\kappa_{\max}}{\lambda_{\mathrm{gap}} + \kappa_{\min}} < \frac{\lambda_{\mathrm{gap}}}{\lambda_{\mathrm{gap}} + \kappa_{\min}} < 1 \quad \checkmark$

Step 4 (Banach convergence). The space of CPTP operators on $\mathcal{D}(\mathbb{C}^7)$ with the operator norm is a complete metric space (closed subset of the finite-dimensional space $\mathcal{B}(M_7(\mathbb{C}))$). By the Banach fixed-point theorem, $\Psi$ has a unique fixed point $\varphi^*$, and the iterates $\varphi^{(n)} = \Psi^n(\varphi^{(0)})$ converge exponentially:

$\|\varphi^{(n)} - \varphi^*\|_{\mathrm{op}} \leq \frac{q^n}{1-q} \|\varphi^{(1)} - \varphi^{(0)}\|_{\mathrm{op}}$

Step 5 (Independence of initial anchor). The fixed point $\varphi^*$ is unique (Step 4). Starting from $\varphi^{(0)} = I/7$ or from any other CPTP anchor $\tilde{\varphi}^{(0)}$:

$\|\Psi^n(\varphi^{(0)}) - \Psi^n(\tilde{\varphi}^{(0)})\|_{\mathrm{op}} \leq q^n \|\varphi^{(0)} - \tilde{\varphi}^{(0)}\|_{\mathrm{op}} \to 0$

Both sequences converge to the same $\varphi^*$. The choice of initial anchor is irrelevant. $\blacksquare$

Corollary (Resolution of circularity). The definition hierarchy $\Omega \to \mathcal{L}_\Omega \to \rho^*_{\mathrm{diss}} \to R \to \varphi$ is not circular: starting from $\varphi^{(0)} = I/7$ (which depends on nothing), each iterate $\varphi^{(n+1)}$ depends only on $\varphi^{(n)}$, and the limit $\varphi^*$ is independent of the starting point. The apparent circularity was an artifact of presenting the converged state as if it were the definition.

Corollary (SAD tower convergence). The Self-Awareness Depth tower $\mathrm{SAD} = 1, 2, 3$ (T-142 [Т]) corresponds to the first three iterates $\varphi^{(1)}, \varphi^{(2)}, \varphi^{(3)}$. Since $q < 1$, the differences $\|\varphi^{(n+1)} - \varphi^{(n)}\|$ decrease geometrically. By T-142 [Т], SAD$_{\max} = 3$ — the fourth iterate $\varphi^{(4)}$ would require $P > 9/14 > 3/7$, violating $R \geq 1/3$. The tower terminates at finite depth, making convergence trivially satisfied for the physically realizable levels.

Dependencies: T-39a [Т] (primitivity, spectral gap), T-59 [Т] ($\kappa_{\mathrm{bootstrap}}$), T-96 [Т] ($\kappa < \kappa_{\max}$), T-124c [Т] (attractor uniqueness), T-142 [Т] (SAD$_{\max} = 3$). Standard mathematics: Banach fixed-point theorem, Perron–Frobenius for positive semigroups (Evans 1977).

2.7 Spectral formula for φ (explicit computation)

Key result

This section provides an explicit computable formula for the operator $\varphi$ via the spectral decomposition of the logical Liouvillian $\mathcal{L}_\Omega$. This makes the theory fully constructive.

Theorem 2.3 (Spectral formula for φ):

$$\varphi(\Gamma) = \sum_{k: \mathrm{Re}(\lambda_k) = 0} \langle L_k | \Gamma \rangle R_k$$

where:

• $\{R_k, L_k\}$ — right and left eigenvectors of $\mathcal{L}_\Omega$
• $\lambda_k$ — eigenvalues of $\mathcal{L}_\Omega$
• Sum over $k$ with $\mathrm{Re}(\lambda_k) = 0$ (stationary modes)
• $\langle L_k | \Gamma \rangle := \mathrm{Tr}(L_k^\dagger \cdot \Gamma_{\text{vec}})$ — inner product in vectorized space

Proof:

1. By definition (see Theorem: φ as stationary distribution): $\varphi(\Gamma) = \lim_{\tau \to \infty} e^{\tau \mathcal{L}_\Omega}[\Gamma]$

2. Decomposition into eigenfunctions: $e^{\tau \mathcal{L}_\Omega}[\Gamma] = \sum_k e^{\lambda_k \tau} \langle L_k | \Gamma \rangle R_k$

3. As $\tau \to \infty$:

   • $\mathrm{Re}(\lambda_k) < 0$: $e^{\lambda_k \tau} \to 0$ (decay)
   • $\mathrm{Re}(\lambda_k) > 0$: excluded by CPTP structure (divergence impossible)
   • $\mathrm{Re}(\lambda_k) = 0$: $e^{\lambda_k \tau}$ bounded (stationary modes)

4. Therefore: $\varphi(\Gamma) = \sum_{k: \mathrm{Re}(\lambda_k) = 0} \langle L_k | \Gamma \rangle R_k \quad \blacksquare$

Simplification under primitivity of linear part [Т]

Primitivity of the linear part $\mathcal{L}_0$ ensures a spectral gap. In the vicinity of the non-trivial attractor $\rho^*_\Omega$ the formula simplifies to projection onto the zero mode ($\lambda_0 = 0$, multiplicity 1):

$$\varphi(\Gamma) = \langle L_0 | \Gamma \rangle \, R_0 = \mathrm{Tr}(L_0^\dagger\,\Gamma) \cdot \rho^*_\Omega$$

where $R_0 = \rho^*_\Omega$ is the stationary state of the full dynamics (categorical self-model, Definition 1), $L_0$ is the corresponding left eigenvector.

Algorithm for computing φ (spectral method):

mount std.math.linalg.{StaticMatrix, StaticVector, eig, inverse};

/// Compute φ(Γ) via spectral decomposition of the logical Liouvillian.
///
/// The Liouvillian ℒ_Ω is vectorised as a 49×49 superoperator; φ projects Γ
/// onto the kernel (stationary modes with Re(λ) ≈ 0).
pub pure fn compute_phi_spectral(
    gamma:   &StaticMatrix<Complex, 7, 7>,
    l_omega: &StaticMatrix<Complex, 49, 49>,
) -> StaticMatrix<Complex, 7, 7>
{
    let (eigvals, r_vectors) = eig(l_omega);
    let l_vectors = inverse(&r_vectors).unwrap().transpose();        // left eigenvectors

    let gamma_vec = gamma.flatten();                                 // 49-vector
    let mut phi_vec = StaticVector.<Complex, 49>.zeros();
    const TOL: Float = 1.0e-10;

    for k in 0..49 {
        if eigvals[k].real().abs() < TOL {                           // stationary mode
            let coeff = l_vectors.column(k).conjugate().dot(&gamma_vec);
            phi_vec  = &phi_vec + r_vectors.column(k) * coeff;
        }
    }

    let phi_gamma = phi_vec.reshape::<7, 7>();
    let hermitised = (&phi_gamma + phi_gamma.adjoint()) / Complex.from_real(2.0);
    &hermitised / hermitised.trace()                                  // renormalise Tr = 1
}

Computational complexity:

Operation	Complexity
Spectral decomposition of $\mathcal{L}_\Omega$	$O(N^6)$ for $N=7$, i.e. $O(49^3) \approx 10^5$
Projection onto stationary modes	$O(N^4)$
Total complexity	$O(N^6)$, but $\mathcal{L}_\Omega$ is computed once

Relation to contracting form:

The spectral formula is equivalent to the canonical definition with the correct choice of $\mathcal{L}_\Omega$. Advantages of the spectral form:

1. Explicit computation — no iterations required
2. Uniqueness — no dependence on initial state
3. Categorical consistency — corresponds to the left adjoint to inclusion $\mathrm{Sub}(\Gamma)$

2.8 n-th order reflection (for L3/L4)

Extension for post-reflective levels

Defining levels L3 and L4 of the interiority hierarchy requires an iterated operator φ.

Definition 2.12 (Iterated operator φ):

$$\varphi^{(n)}(\Gamma) := \underbrace{\varphi \circ \varphi \circ \cdots \circ \varphi}_{n}(\Gamma)$$

with $\varphi^{(0)}(\Gamma) := \Gamma$.

Definition 2.13 (n-th order reflection):

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

where $\mathrm{Fid}(\rho_1, \rho_2) := |\mathrm{Tr}(\sqrt{\sqrt{\rho_1}\rho_2\sqrt{\rho_1}})|^2$ — fidelity.

Thresholds for L3/L4:

Transition	Threshold	Universal formula
L1→L2	$R^{(1)} \geq 1/3$	$X^{(2)}_{\text{th}} = 1/3$
L2→L3	$R^{(2)} \geq 1/4$	$X^{(3)}_{\text{th}} = 1/4$
L3→L4	$\lim_n R^{(n)} > 0$	—

Algorithm for computing $R^{(2)}$:

mount std.math.linalg.matrix_sqrt;

/// Second-order reflection R^(2) = Fid(φ(Γ), φ(φ(Γ))).
/// Fidelity F(ρ₁, ρ₂) = |Tr √(√ρ₁ ρ₂ √ρ₁)|².
pub pure fn compute_r2(
    gamma:   &StaticMatrix<Complex, 7, 7>,
    l_omega: &StaticMatrix<Complex, 49, 49>,
) -> Float { 0.0 <= self && self <= 1.0 }
{
    let phi_gamma     = compute_phi_spectral(gamma, l_omega);
    let phi_phi_gamma = compute_phi_spectral(&phi_gamma, l_omega);

    let sqrt_phi = matrix_sqrt(&phi_gamma);
    let inner = &sqrt_phi @ phi_phi_gamma @ &sqrt_phi;
    let trace_sqrt = matrix_sqrt(&inner).trace().abs();
    (trace_sqrt * trace_sqrt).clamp(0.0, 1.0)
}

---

3. Theorem on existence of fixed point

3.1 Main theorem

Theorem 3.1 (Existence of reflexion fixed point):

Let $\varphi: \mathcal{D}(\mathcal{H}) \to \mathcal{D}(\mathcal{H})$ be a contracting map with constant $k < 1$:

$$\forall \Gamma_1, \Gamma_2 \in \mathcal{D}(\mathcal{H}): \|\varphi(\Gamma_1) - \varphi(\Gamma_2)\|_F \leq k \cdot \|\Gamma_1 - \Gamma_2\|_F$$

Then:

$$\exists! \, \Gamma^* \in \mathcal{D}(\mathcal{H}): \varphi(\Gamma^*) = \Gamma^*$$

and for any $\Gamma_0 \in \mathcal{D}(\mathcal{H})$:

$$\lim_{n \to \infty} \varphi^n(\Gamma_0) = \Gamma^*$$

with convergence rate:

$$\|\varphi^n(\Gamma_0) - \Gamma^*\|_F \leq k^n \cdot \|\Gamma_0 - \Gamma^*\|_F$$

Proof:

Step 1: Completeness of the space

$\mathcal{D}(\mathcal{H})$ is a closed subset of the Banach space $(\mathcal{L}(\mathcal{H}), \|\cdot\|_F)$.

Checking closedness:

• The limit of a sequence of Hermitian matrices is Hermitian
• The limit of a sequence of positive semi-definite matrices is positive semi-definite (closed cone)
• $\mathrm{Tr}$ is a continuous function, $\mathrm{Tr}(\lim \rho_n) = \lim \mathrm{Tr}(\rho_n) = 1$

Therefore, $\mathcal{D}(\mathcal{H})$ is a complete metric space.

Step 2: Applying the Banach theorem

$\varphi$ is a contracting map on a complete metric space.

By the Banach fixed point theorem:

• There exists a unique fixed point $\Gamma^*$
• Iterations converge to $\Gamma^*$ for any initial condition

Step 3: Structure preservation

Show that $\Gamma^* \in \mathcal{D}(\mathcal{H})$:

$\varphi: \mathcal{D}(\mathcal{H}) \to \mathcal{D}(\mathcal{H})$ (by construction of $\varphi_k$ or as CPTP map).

$\Gamma^* = \lim_{n \to \infty} \varphi^n(\Gamma_0)$, where $\Gamma_0 \in \mathcal{D}(\mathcal{H})$ and $\varphi^n(\Gamma_0) \in \mathcal{D}(\mathcal{H})$ for all $n$.

$\mathcal{D}(\mathcal{H})$ is closed $\Rightarrow \Gamma^* \in \mathcal{D}(\mathcal{H})$. ∎

3.2 Approximate fixed points

Definition 3.1 ($\varepsilon$-fixed point):

$\Gamma$ is called an $\varepsilon$-fixed point if $\|\Gamma - \varphi(\Gamma)\|_F < \varepsilon$.

Theorem 3.2 (Existence of $\varepsilon$-fixed point for non-contracting $\varphi$):

Let $\varphi: \mathcal{D}(\mathcal{H}) \to \mathcal{D}(\mathcal{H})$ be a continuous map (not necessarily contracting).

Then for any $\varepsilon > 0$ there exists $\Gamma_\varepsilon \in \mathcal{D}(\mathcal{H})$ such that:

$$\|\Gamma_\varepsilon - \varphi(\Gamma_\varepsilon)\|_F < \varepsilon$$

Proof:

Consider the family of maps:

$$\varphi_\lambda(\Gamma) := \lambda \cdot \varphi(\Gamma) + (1 - \lambda) \cdot \Gamma_c$$

where $\Gamma_c = I/N$ is the center of $\mathcal{D}(\mathcal{H})$.

For $\lambda < 1$: $\varphi_\lambda$ is a contracting map with constant $\lambda$ (analogously to Lemma 2.1).

By Theorem 3.1: $\exists \, \Gamma^*_\lambda : \varphi_\lambda(\Gamma^*_\lambda) = \Gamma^*_\lambda$.

Consider:

$$\|\Gamma^*_\lambda - \varphi(\Gamma^*_\lambda)\|_F = \|\Gamma^*_\lambda - \varphi_\lambda(\Gamma^*_\lambda) + \varphi_\lambda(\Gamma^*_\lambda) - \varphi(\Gamma^*_\lambda)\|_F$$ $$= \|\varphi_\lambda(\Gamma^*_\lambda) - \varphi(\Gamma^*_\lambda)\|_F \quad (\Gamma^*_\lambda \text{ is a fixed point of } \varphi_\lambda)$$ $$= \|\lambda \cdot \varphi(\Gamma^*_\lambda) + (1-\lambda) \cdot \Gamma_c - \varphi(\Gamma^*_\lambda)\|_F = (1-\lambda) \cdot \|\Gamma_c - \varphi(\Gamma^*_\lambda)\|_F$$ $$\leq (1-\lambda) \cdot \mathrm{diam}(\mathcal{D}(\mathcal{H}))$$

where $\mathrm{diam}(\mathcal{D}(\mathcal{H})) = \sup_{\rho_1, \rho_2} \|\rho_1 - \rho_2\|_F \leq \sqrt{2}$ (diameter of the density matrix space).

Choosing $\lambda = 1 - \varepsilon / (2 \cdot \mathrm{diam}(\mathcal{D}(\mathcal{H})))$, we get:

$$\|\Gamma^*_\lambda - \varphi(\Gamma^*_\lambda)\|_F < \varepsilon$$

∎

3.3 Contraction conditions for CPTP maps

Theorem 3.3 (Contraction criterion):

A CPTP map $\mathcal{P}$ is contracting with constant $k < 1$ if and only if:

$$\exists \, \rho_{\text{inv}} \in \mathcal{D}(\mathcal{H}) : \mathcal{P}(\rho_{\text{inv}}) = \rho_{\text{inv}} \land \mathrm{spec}(\mathcal{P}|_{\rho_{\text{inv}}^\perp}) \subset \{z \in \mathbb{C} : |z| < 1\}$$

where $\mathcal{P}|_{\rho_{\text{inv}}^\perp}$ is the restriction of $\mathcal{P}$ to the orthogonal complement of $\rho_{\text{inv}}$.

Interpretation: $\mathcal{P}$ is contracting if it has a unique invariant state and all perturbations decay.

Examples of contracting CPTP:

1. Thermalization:

$$\mathcal{P}_{\text{therm}}(\rho) = \lambda \rho + (1-\lambda) \rho_{\text{thermal}}, \quad \lambda < 1$$

2. Depolarizing channel:

$$\mathcal{P}_{\text{depol}}(\rho) = p \rho + (1-p) \frac{I}{N}, \quad p < 1$$

3. Amplitude damping:

$$\mathcal{P}_{\text{damp}}(\rho) = K_0 \rho K_0^\dagger + K_1 \rho K_1^\dagger$$ $$K_0 = |0\rangle\langle 0| + \sqrt{1-\gamma}|1\rangle\langle 1|, \quad K_1 = \sqrt{\gamma}|0\rangle\langle 1|$$

Contracting for $\gamma > 0$.

---

4. Relation to reflection measure R

4.1 Definition of R

Definition 4.1 (Reflection measure):

$$R(\Gamma) := \frac{1}{7P(\Gamma)}, \quad P = \mathrm{Tr}(\Gamma^2)$$

Equivalent form: $R = 1 - \|\Gamma - \rho^*_{\mathrm{diss}}\|_F^2 / P$, where $\rho^*_{\mathrm{diss}} = I/7$, $\|\Gamma\|_F = \sqrt{P}$ (square root of purity).

Distinction between R_canonical and Q_φ

$R_{\text{canonical}} := 1/(7P)$ is the canonical definition used in all thresholds ($R_{\text{th}} = 1/3$). It is a measure of proximity to the maximally mixed state $I/7$, NOT a measure of quality of self-modeling.

The quality of self-modeling is defined separately:

$$Q_\varphi(\Gamma) := 1 - \frac{\|\Gamma - \varphi(\Gamma)\|^2_F}{\|\Gamma\|^2_F}$$

Comparison at characteristic states:

• At $\Gamma = I/7$ (dissipative attractor): $R_{\text{canonical}} = 1$, $Q_\varphi = 1$.
• At a pure state ($P = 1$): $R_{\text{canonical}} = 1/7$, $Q_\varphi$ depends on $\varphi$.

In sections 4.2–4.3 below, $R$ is used in the sense of $Q_\varphi$ (quality of self-modeling), which is valid for convergence analysis. In all other sections and in threshold conditions $R = R_{\text{canonical}} = 1/(7P)$.

4.2 Convergence of R as fixed point is approached

Theorem 4.1 ($R \to 1$ as $\Gamma \to \Gamma^*$):

Let $\varphi$ be a contracting map with fixed point $\Gamma^*$.

Then:

$$\lim_{\Gamma \to \Gamma^*} R(\Gamma) = 1$$

Proof:

As $\Gamma \to \Gamma^*$:

$$\|\Gamma - \varphi(\Gamma)\|_F \to \|\Gamma^* - \varphi(\Gamma^*)\|_F = \|\Gamma^* - \Gamma^*\|_F = 0$$

Therefore:

$$R(\Gamma) = \frac{1}{7P(\Gamma)} \to 1 \quad \text{(when } P(\Gamma^*) = 1/7 \text{, i.e. } \Gamma^* = I/7\text{)}$$

(We assume $\Gamma^* \neq 0$, which holds for any density matrix: $\|\Gamma^*\|^2_F = P(\Gamma^*) \geq 1/N > 0$.) ∎

4.3 Estimate of rate of convergence of R

Theorem 4.2 (Rate of convergence of R):

For contracting $\varphi$ with constant $k$ and sequence $\Gamma_n = \varphi^n(\Gamma_0)$:

$$1 - R(\Gamma_n) \leq 4 k^{2n} \cdot \frac{\|\Gamma_0 - \Gamma^*\|^2_F}{P_{\min}}$$

where $P_{\min} = \min_{\rho \in \mathcal{D}(\mathcal{H})} P(\rho) = 1/N$.

Proof:

$$1 - R(\Gamma_n) = \frac{\|\Gamma_n - \varphi(\Gamma_n)\|^2_F}{\|\Gamma_n\|^2_F} = \frac{\|\varphi^n(\Gamma_0) - \varphi^{n+1}(\Gamma_0)\|^2_F}{P(\Gamma_n)}$$ $$\leq \frac{(k^n \cdot \|\Gamma_0 - \varphi(\Gamma_0)\|_F)^2}{P(\Gamma_n)} \quad \text{(contraction)}$$ $$\leq \frac{k^{2n} \cdot (\|\Gamma_0 - \Gamma^*\|_F + \|\Gamma^* - \varphi(\Gamma_0)\|_F)^2}{P_{\min}}$$ $$\leq \frac{k^{2n} \cdot (\|\Gamma_0 - \Gamma^*\|_F + k \cdot \|\Gamma^* - \Gamma_0\|_F)^2}{P_{\min}} = \frac{k^{2n} \cdot (1 + k)^2 \cdot \|\Gamma_0 - \Gamma^*\|^2_F}{P_{\min}}$$

For $k < 1$: $(1 + k)^2 < 4$, giving the bound:

$$1 - R(\Gamma_n) \leq \frac{4 \cdot k^{2n} \cdot \|\Gamma_0 - \Gamma^*\|^2_F}{P_{\min}}$$

∎

Strengthening: unconditional convergence [Т]

Primitivity of $\mathcal{L}_\Omega$ guarantees exponential convergence $R \to 1$ for any initial state $\Gamma_0 \in \mathcal{D}(\mathbb{C}^7)$, without additional conditions on initial data.

4.4 Relation of R to consciousness measure C

Theorem 4.3 (R as a factor of consciousness):

From the definition of consciousness $C = \Phi \times R$ [Т T-140] it follows that:

$$C(\Gamma^*) = \Phi(\Gamma^*) \times 1 = \Phi(\Gamma^*)$$

for the fixed point $\Gamma^*$ (at $R = 1$, i.e. ideal reflection).

On notation

Differentiation $D_{\text{diff}} \geq D_{\min} = 2$ enters as a separate viability condition, not as a factor of $C$.

Corollary: Ideal self-knowledge ($\Gamma = \Gamma^*$) maximizes the contribution of reflection to consciousness.

---

5. Categorical aspect

Section status

The categorical formalism provides additional structure for understanding $\varphi$, but is not necessary for practical computations in UHM. See also categorical formalism.

5.1 Category of density matrices

DRY: Category DensityMat

The canonical definition of category DensityMat (objects — density matrices, morphisms — CPTP channels) and proof of category axioms are in Categorical formalism, §1.

Definition 5.2 (Category of CPTP channels):

$$\mathbf{CPTP} := (\mathrm{Ob}, \mathrm{Mor})$$ $$\mathrm{Ob} = \{\mathcal{H}_n = \mathbb{C}^n : n \in \mathbb{N}\} \quad \text{(objects — Hilbert spaces)}$$ $$\mathrm{Mor}(\mathcal{H}_n, \mathcal{H}_m) = \{\mathcal{P}: \mathcal{D}(\mathcal{H}_n) \to \mathcal{D}(\mathcal{H}_m) : \mathcal{P} \text{ — CPTP}\}$$

This is a well-defined category:

• Composition: $\mathcal{P} \circ \mathcal{Q}$ is CPTP if $\mathcal{P}$ and $\mathcal{Q}$ are CPTP
• Identity: $\mathrm{id}_\mathcal{H}(\rho) = \rho$ — trivial CPTP channel

5.2 φ as endomorphism

Definition 5.3 ($\varphi$ as endofunctor):

$\varphi: \mathcal{L}(\mathcal{H}) \to \mathcal{L}(\mathcal{H})$ induces an endofunctor:

$$F_\varphi: \mathbf{CPTP}|_\mathcal{H} \to \mathbf{CPTP}|_\mathcal{H}$$

On objects: $F_\varphi(\mathcal{H}) = \mathcal{H}$ (identity)

On morphisms: $F_\varphi(\mathcal{Q}) = \varphi \circ \mathcal{Q} \circ \varphi^{-1}$ (if $\varphi$ is invertible)

Problem: A general CPTP channel is not invertible.

Solution: We consider $\varphi$ as an endomorphism in the category with a single object:

Definition 5.4 (Monoid of CPTP channels):

$$\mathrm{End}(\mathcal{H}) := \mathrm{Mor}(\mathcal{H}, \mathcal{H}) \quad \text{in category } \mathbf{CPTP}$$

This is a monoid with the composition operation.

$\varphi \in \mathrm{End}(\mathcal{H})$ — an element of this monoid.

5.3 Relation to monads

Definition 5.5 (Monad of self-modeling):

Consider the functor $T: \mathbf{Set} \to \mathbf{Set}$:

$$T(X) = \mathcal{D}(\mathbb{C}^{|X|}) \quad \text{(set of density matrices of size } |X| \text{)}$$

Monad structure:

• Unit ($\eta$): $\eta_X: X \to T(X)$, $\eta_X(x) = |x\rangle\langle x|$ (pure state)
• Mult ($\mu$): $\mu_X: T(T(X)) \to T(X)$, $\mu_X(P) = \sum_{\rho \in \mathrm{supp}(P)} P(\rho) \cdot \rho$ (mixing)

$\varphi$ induces a morphism of monads:

$$\varphi^*: (T, \eta, \mu) \to (T, \eta, \mu)$$

Naturality conditions:

$$\varphi \circ \eta = \eta \quad \text{(self-observation of a pure state is pure)}$$ $$\varphi \circ \mu = \mu \circ T(\varphi) \quad \text{(consistency with mixing)}$$

Theorem 5.1 (Fixed point as monad algebra):

The fixed point $\Gamma^* = \varphi(\Gamma^*)$ defines a $T$-algebra:

$$\alpha: T(\Gamma^*) \to \Gamma^*, \quad \alpha = \mu_{\Gamma^*} \circ T(\eta_{\Gamma^*})$$

Interpretation: A system in the state of ideal self-knowledge is an "algebra over the self-modeling monad."

5.4 2-categorical structure

Definition 5.6 (2-category of quantum systems QSys):

Level	Elements
0-morphisms (objects)	Hilbert spaces $\mathcal{H}$
1-morphisms	CPTP channels $\mathcal{P}: \mathcal{D}(\mathcal{H}_1) \to \mathcal{D}(\mathcal{H}_2)$
2-morphisms	Natural transformations between channels

$\varphi$ defines a 2-cell:

$$\varphi: \mathrm{id}_{\mathcal{D}(\mathcal{H})} \Rightarrow \mathrm{id}_{\mathcal{D}(\mathcal{H})}$$

(endo-2-morphism of the identity 1-morphism)

Fixed point condition in 2-categorical language:

$\Gamma^*$ is an object such that $\varphi_{\Gamma^*} = \mathrm{id}_{\Gamma^*}$ (the 2-morphism reduces to the identity).

---

6. Corollaries and limitations

6.1 Corollaries of formalization

Corollary 6.1 (Necessity of contraction for ideal self-knowledge):

For the existence of exact $\Gamma^* = \varphi(\Gamma^*)$ it is necessary that $\varphi$ be contracting (or have an invariant subspace).

Corollary 6.2 (Approximate self-knowledge is always possible):

For any continuous $\varphi$ and any $\varepsilon > 0$ there exists an $\varepsilon$-fixed point.

Corollary 6.3 (Relation to thermodynamics):

Contracting CPTP channels correspond to systems with dissipation (attraction to equilibrium).

The fixed point of $\varphi$ is the "thermodynamic equilibrium of self-observation."

6.2 Limitations of formalization

Limitation 6.1 (Contraction requirement):

Theorem 3.1 requires $k < 1$. For $k = 1$ (isometric $\varphi$) the fixed point may not exist or may be non-unique.

Limitation 6.2 (Finite-dimensionality):

The proofs use finite-dimensionality of $\mathcal{H}$. Generalization to the infinite-dimensional case requires additional conditions (compactness of $\varphi$).

Limitation 6.3 (Stationarity):

The formalization treats $\varphi$ as a fixed operator. In a dynamical system $\varphi$ may depend on time: $\varphi = \varphi(t)$.

Open question: Does a "moving fixed point" $\Gamma^*(t)$ exist for $\varphi(t)$? See Appendix C.

6.3 Physical interpretation

Interpretation 6.1 (Self-modeling as quantum channel):

$\varphi$ = CPTP channel means that self-observation:

• Preserves positivity (does not create negative probabilities)
• Preserves normalization (total probability = 1)
• Can decrease information (does not increase distinguishability)

Interpretation 6.2 (Fixed point as self-consistency):

$\Gamma^* = \varphi(\Gamma^*)$ means: "What the system sees coincides with what it is."

This is the state of ideal self-knowledge — the system has no "blind spots."

Interpretation 6.3 (Contraction as humility):

$k < 1$ means that each act of self-observation "approaches" the truth.

The system gradually corrects its self-model, converging to an accurate representation.

6.4 Relation to UHM

Relation 6.1 (Reflexive closure):

The condition of self-observation:

$$\varphi(\Gamma) \approx \Gamma$$

is formalized as: $R(\Gamma) \geq 1 - \varepsilon$ for some $\varepsilon > 0$.

Relation 6.2 (Consciousness):

$C = \Phi \times R$ [Т T-140] includes $R$ as a factor.

At $R \to 1$: $C \to \Phi$ (maximum contribution of integration).

Relation 6.3 (No-zombie theorem):

From interiority hierarchy:

$$\mathrm{Viable}(\mathbb{H}) \Rightarrow R(\Gamma) > 0$$

The formalization of $\varphi$ ensures: $R(\Gamma) > 0 \Leftrightarrow \Gamma \neq \varphi(\Gamma)$ with finite precision.

---

7. Implementation requirements

Section status

This section contains mathematical requirements for implementing the self-modeling operator φ. Concrete architectures and code are the subject of separate specifications.

7.1 Requirements for implementing φ

Requirement 7.1 (Predictive self-modeling operator):

The implementation of $\varphi$ must satisfy:

$$\varphi(\Gamma) = k \cdot \mathcal{P}_\theta(\Gamma) + (1-k) \cdot \Gamma_{\text{prior}}$$

where:

• $k \in (0, 1)$ — contraction parameter ensuring contractivity
• $\mathcal{P}_\theta: \mathcal{D}(\mathcal{H}) \to \mathcal{D}(\mathcal{H})$ — parameterized map
• $\Gamma_{\text{prior}} = I/7$ — prior state (maximum entropy)

Implementation guarantees:

1. Output — valid density matrix (Hermitian, PSD, trace=1)
2. Contracting map at $k < 1$
3. Differentiability with respect to parameters $\theta$

Recommended method: Cholesky parameterization $\Gamma = LL^\dagger / \mathrm{Tr}(LL^\dagger)$ guarantees PSD.

7.2 Requirements for sensor encoder

Requirement 7.2 (Encoder: sensors → Γ):

$$\Gamma = \text{Encoder}_\psi(s) = \frac{L(s) \cdot L(s)^\dagger}{\mathrm{Tr}(L(s) \cdot L(s)^\dagger)}$$

where $L(s)$ is a lower-triangular matrix parameterized from sensor input $s$.

7.3 Requirements for action decoder

Requirement 7.3 (Decoder: Γ → actions):

For discrete actions:

$$\pi(a|\Gamma) = \text{softmax}(W \cdot \text{vec}(\Gamma) + b)$$

For continuous actions:

$$\mu, \sigma = \text{Decoder}(\Gamma), \quad a \sim \mathcal{N}(\mu, \sigma^2)$$

7.4 Training

Minimization of self-prediction error:

$$\mathcal{L}(\theta) = \mathbb{E}_{\Gamma \sim \text{trajectories}}[\|\Gamma_{t+1} - \mathcal{P}_\theta(\Gamma_t)\|_F^2]$$

Implementation status

The requirements in this section are sufficient for building a concrete implementation. Cholesky parameterization guarantees correctness of the output density matrices.

---

8. Operational algorithm for φ

Status: Engineering specification

This section provides a concrete algorithm for computing the self-modeling operator φ, suitable for software implementation.

8.1 Algorithm: Basic self-modeling

Input: Coherence matrix $\Gamma \in \mathbb{C}^{7 \times 7}$

Parameters:

• $k \in (0, 1)$ — contraction coefficient (recommended $k = 0.95$)
• $w \in \Delta^6$ — anchor weight vector (default $w = (1/7, \ldots, 1/7)$)

Algorithm:

FUNCTION φ_basic(Γ, k, w):
    # Step 1: Extract diagonal (dephasing in measurement basis)
    diag_Γ := diagonal(Γ)  # vector of size 7

    # Step 2: Build predictive state
    P_pred := diag(diag_Γ)  # diagonal matrix 7×7

    # Step 3: Build anchor state
    Γ_anchor := diag(w)

    # Step 4: Mix with contraction coefficient
    φ_Γ := k * P_pred + (1 - k) * Γ_anchor

    RETURN φ_Γ

Guarantees:

• Output — valid density matrix (Hermitian, PSD, trace=1)
• Contracting map with constant $k$
• Computational complexity: $O(N)$ where $N = 7$

8.2 Algorithm: Neural network self-modeling

For trainable φ with parameters θ:

FUNCTION φ_neural(Γ, θ):
    # Step 1: Vectorize input matrix
    x := flatten_upper_triangular(Γ)  # 28 parameters (7 diag + 21 coh)

    # Step 2: Pass through neural network
    h := ReLU(W₁ · x + b₁)
    L_vec := W₂ · h + b₂  # 28 parameters for lower-triangular matrix

    # Step 3: Reconstruct lower-triangular matrix (Cholesky)
    L := unflatten_lower_triangular(L_vec)  # 7×7

    # Step 4: Build PSD matrix and normalize
    Γ_raw := L · L†
    φ_Γ := Γ_raw / Tr(Γ_raw)

    # Step 5: Apply contraction to anchor
    k := sigmoid(θ_k)  # trainable coefficient ∈ (0, 1)
    φ_Γ := k * φ_Γ + (1 - k) * I/7

    RETURN φ_Γ

Training: Minimize next-state prediction error:

$$\mathcal{L}(\theta) = \mathbb{E}_{(\Gamma_t, \Gamma_{t+1}) \sim \tau}[\|\Gamma_{t+1} - \varphi_\theta(\Gamma_t)\|_F^2]$$

8.3 Computing reflection measure R

FUNCTION compute_R_canonical(Γ):
    # Canonical definition of R (used in thresholds)
    P := Tr(Γ† · Γ)       # purity
    R := 1 / (7 * P)
    RETURN R

FUNCTION compute_Q_phi(Γ, φ):
    # Quality of self-modeling (separate measure, see WARNING above)
    φ_Γ := φ(Γ)
    error := Γ - φ_Γ
    error_norm_sq := Tr(error† · error)
    Γ_norm_sq := Tr(Γ† · Γ)  # = P (purity)
    Q := 1 - error_norm_sq / Γ_norm_sq
    RETURN Q

8.4 Checking L2 threshold

Limitation of 7D formalism

The function Tr_not_E (partial trace) requires tensor structure. In the minimal 7D formalism ($\mathcal{H} = \mathbb{C}^7$) use is_L2_minimal without $D_{\text{diff}}$ — see dimension-e.md.

FUNCTION is_L2_conscious(Γ, φ):
    # Compute three measures
    R := compute_R(Γ, φ)
    Φ := compute_integration(Γ)  # Σ|γ_ij|² / Σγ_ii²
    D_diff := exp(von_neumann_entropy(Tr_not_E(Γ)))

    # Check thresholds
    RETURN (R ≥ 1/3) AND (Φ ≥ 1) AND (D_diff ≥ 2)

# Minimal version without D_diff (for 7D formalism)
FUNCTION is_L2_minimal(Γ, φ):
    R := compute_R(Γ, φ)
    Φ := compute_integration(Γ)
    RETURN (R ≥ 1/3) AND (Φ ≥ 1)

---

9. Relation to the regeneration mechanism

Key relation

The self-modeling operator $\varphi$ defines the target state of regeneration: $\rho_* = \varphi(\Gamma)$ — categorical self-model of the current state [Т] (operator φ). For each $\Gamma$ the self-model $\varphi(\Gamma)$ is unique (CPTP channel).

9.1 Regeneration as striving toward the self-model

The regenerative term of the evolution equation for $\Gamma$ is fully derived from the axioms [Т]:

$$\mathcal{R}[\Gamma, E] = \kappa(\Gamma) \cdot (\rho_* - \Gamma) \cdot g_V(P)$$

where:

• $\kappa(\Gamma)$ — regeneration coefficient [Т] (categorical derivation from adjunction)
• $\rho_* = \varphi(\Gamma)$ — categorical self-model of the current state [Т] (operator φ)
• $(\rho_* - \Gamma)$ — unique CPTP relaxation [Т] (replacement channel + Bures optimality)
• $g_V(P)$ — V-preservation gate [Т] (refines $\Theta(\Delta F)$ from Landauer, see evolution)

Full derivation: Evolution → Derivation of regeneration form.

Interpretation: The system regenerates by striving toward state $\varphi(\Gamma)$ — how it "sees itself." Regeneration is an active process of self-realization, where the system becomes its own model.

9.2 Fixed point and viable equilibrium

Theorem 9.1 (Regeneration equilibrium):

At $\Gamma = \Gamma^* = \varphi(\Gamma^*)$ the regenerative term vanishes:

$$\mathcal{R}[\Gamma^*, E] = \kappa(\Gamma^*) \cdot (\varphi(\Gamma^*) - \Gamma^*) \cdot g_V(P) = 0$$

Proof: $\varphi(\Gamma^*) = \Gamma^*$ by definition of fixed point. ∎

Corollary 9.1: At the fixed point $\Gamma^*$ the system is in a state of ideal self-knowledge — regeneration is not required, as the current state coincides with the self-model.

9.3 Dynamics outside the fixed point

At $\Gamma \neq \Gamma^*$ a "pull" toward the self-model arises:

$$\rho_* - \Gamma = \varphi(\Gamma) - \Gamma \neq 0$$

Direction of regeneration:

1. If $P(\varphi(\Gamma)) > P(\Gamma)$: regeneration increases purity
2. If $P(\varphi(\Gamma)) < P(\Gamma)$: regeneration decreases purity

Critical condition: viability of self-model

For regeneration to support viability, it is necessary that:

$$P(\varphi(\Gamma)) \geq P_{\text{crit}} = \frac{2}{7}$$

With an incorrectly constructed $\varphi$ the system may regenerate toward a non-viable state. This places constraints on the choice of anchor $\Gamma_{\text{anchor}}$ (see Definition 2.11).

9.4 Relation to reflection measure R

The reflection measure $R$ and the regenerative term $\mathcal{R}$ are related:

$$1 - R(\Gamma) = \frac{\|\Gamma - I/7\|^2_F}{P(\Gamma)} = 1 - \frac{1}{7P}$$ $$\|\mathcal{R}[\Gamma, E]\| \propto \|\rho^*_{\mathrm{diss}} - \Gamma\| = \|I/7 - \Gamma\| = \sqrt{P \cdot (1 - R)}$$

Interpretation:

• High $R$ (proximity to self-model) → small amplitude of regeneration
• Low $R$ (divergence from self-model) → large amplitude of regeneration

A system with good self-knowledge ($R \to 1$) requires minimal regeneration.

9.5 Stability of viable region

Theorem 9.2 (Regeneration keeps system in $\mathcal{V}$):

Let $\varphi$ be a contracting map with fixed point $\Gamma^* \in \mathcal{V}$ (viable region).

Then at sufficiently large $\kappa$ regeneration counteracts dissipation and keeps the system in $\mathcal{V}$:

$$\left.\frac{dP}{d\tau}\right|_{\mathcal{R}} + \left.\frac{dP}{d\tau}\right|_{\mathcal{D}} > 0 \quad \text{at } P < P(\Gamma^*)$$

Interpretation: Regeneration is a protective mechanism that uses the self-model as a guide for restoring coherence.

9.6 Preservation of positivity under regeneration

Theorem (CPTP structure of regeneration)

The regenerative operator $R_\alpha = (1 - \alpha) \cdot \mathcal{E} + \alpha \cdot \varphi$ with $\alpha = \kappa \cdot \Delta\tau < 1$ is a CPTP channel:

$$R_\alpha[\Gamma] = \sum_k \tilde{K}_k \Gamma \tilde{K}_k^\dagger$$

with Kraus operators $\tilde{K}_0 = \sqrt{1-\alpha}\,I$ and $\tilde{K}_k = \sqrt{\alpha} K_k$ (from attractor $\varphi$).

Corollary: Regeneration toward self-model $\varphi(\Gamma)$ guarantees preservation of:

• Positivity: $\Gamma \geq 0$
• Normalization: $\mathrm{Tr}(\Gamma) = 1$

More on CPTP structure of regeneration →

---

Appendix A: Computation examples

A.1 Depolarizing channel as φ

$$\varphi_p(\rho) = p \cdot \rho + (1 - p) \cdot \frac{I}{N}$$

Fixed point:

$$\Gamma^* = p \cdot \Gamma^* + (1 - p) \cdot \frac{I}{N}$$ $$(1 - p) \cdot \Gamma^* = (1 - p) \cdot \frac{I}{N} \quad \Rightarrow \quad \Gamma^* = \frac{I}{N}$$

Contraction constant: $k = p < 1$

Reflection measure at fixed point:

$$R(\Gamma^*) = R\left(\frac{I}{N}\right) = 1 - \frac{\|I/N - \varphi(I/N)\|^2_F}{\|I/N\|^2_F} = 1 - \frac{0}{1/N} = 1$$

A.2 Projection self-observation

Let $\{|i\rangle\}$ be an orthonormal basis, $P_i = |i\rangle\langle i|$.

$$\varphi_{\text{diag}}(\rho) = \sum_i P_i \rho P_i = \sum_i \rho_{ii} |i\rangle\langle i|$$

(Diagonalization in the given basis)

Fixed points:

$$\varphi_{\text{diag}}(\Gamma) = \Gamma \quad \Leftrightarrow \quad \Gamma \text{ is diagonal}$$

The set of fixed points is an $(N-1)$-dimensional simplex:

$$\mathrm{Fix}(\varphi_{\text{diag}}) = \left\{\sum_i p_i |i\rangle\langle i| : p_i \geq 0, \sum_i p_i = 1\right\} \cong \Delta^{N-1}$$

where $N = \dim(\mathcal{H}) = 7$ for the Holon.

Remark: This is not a contracting map ($k = 1$ on the set of fixed points).

---

Appendix B: Proof of CPTP structure preservation

Lemma B.1: If $\mathcal{P}$ is CPTP and $\rho \in \mathcal{D}(\mathcal{H})$, then $\mathcal{P}(\rho) \in \mathcal{D}(\mathcal{H})$.

Proof:

1. Hermiticity:

$$\mathcal{P}(\rho)^\dagger = \left(\sum_m K_m \rho K_m^\dagger\right)^\dagger = \sum_m K_m \rho^\dagger K_m^\dagger = \sum_m K_m \rho K_m^\dagger = \mathcal{P}(\rho)$$

2. Positivity:

For any $|\psi\rangle$:

$$\langle\psi|\mathcal{P}(\rho)|\psi\rangle = \sum_m \langle\psi|K_m \rho K_m^\dagger|\psi\rangle = \sum_m \langle K_m^\dagger\psi|\rho|K_m^\dagger\psi\rangle \geq 0$$

(since $\rho \geq 0$)

3. Normalization:

$$\mathrm{Tr}(\mathcal{P}(\rho)) = \mathrm{Tr}\left(\sum_m K_m \rho K_m^\dagger\right) = \sum_m \mathrm{Tr}(K_m^\dagger K_m \rho) = \mathrm{Tr}\left(\left(\sum_m K_m^\dagger K_m\right) \rho\right) = \mathrm{Tr}(I \cdot \rho) = 1$$

∎

---

Appendix C: Generalization to time-dependent φ

Definition C.1 (Dynamic self-modeling operator):

$$\varphi: [0, \infty) \times \mathcal{D}(\mathcal{H}) \to \mathcal{D}(\mathcal{H})$$ $$(\tau, \Gamma) \mapsto \varphi(\tau, \Gamma)$$

Dynamic fixed point equation:

$$\Gamma^*(\tau) = \varphi(\tau, \Gamma^*(\tau))$$

Theorem C.1 (Existence of dynamic fixed point):

If $\varphi(\tau, \cdot)$ is contracting with constant $k < 1$ for all $\tau$, and $\varphi$ is continuous in $\tau$, then:

1. $\Gamma^*(\tau)$ exists and is unique for each $\tau$
2. $\Gamma^*(\tau)$ is continuous in $\tau$
3. $\frac{d\Gamma^*}{d\tau} = \frac{\partial \varphi}{\partial \tau} + (D\varphi)\left(\frac{d\Gamma^*}{d\tau}\right)$ (implicit equation)

Proof: Follows from applying the implicit function theorem in a Banach space.

Octonionic context of self-modeling

Self-modeling and alternativity [И]

In the octonionic interpretation, the self-modeling operator $\varphi$ acts on the space $\mathrm{Im}(\mathbb{O})$. Alternativity of octonions (Artin's theorem [Т]) guarantees that $\varphi$ is associative when acting on any pair of dimensions, but may exhibit non-associativity when acting simultaneously on three or more dimensions.

This is consistent with the fixed point property $\varphi(\Gamma^*) = \Gamma^*$: self-consistency is achieved in the full 7-dimensional space where non-associativity is integrated into the structure. Bridge [Т] (closed, T15). See structural derivation.

---

Tensor factorization of φ for composite systems

Relation to no-signaling prohibition and preservation of holonomic character

Tensor factorization of $\varphi$ is a key property ensuring compatibility of $\mathcal{R}$ with no-signaling prohibition. It guarantees that self-modeling of autonomous subsystems does not create channels of superluminal communication (Gisin, Polchinski 1991).

Preservation of holonomic character. Factorization $\varphi_{A \otimes B} = \varphi_A \otimes \varphi_B$ concerns only the regenerative term $\mathcal{R}$. The full dynamics $\mathcal{L}_\Omega = -i[H, \cdot] + \mathcal{D}[\cdot] + \mathcal{R}[\cdot]$ contains:

• $H$ (Hamiltonian): creates and preserves entanglement — non-local ✓
• $\mathcal{D}$ (dissipation): may destroy entanglement, but through common decoherence — non-local in general
• $\mathcal{R}$ (regeneration via $\varphi$): local (factorizes) — ensures no-signaling

"Holonomy" (the whole > sum of parts) is realized through $H + \mathcal{D}$, not through $\mathcal{R}$. Self-modeling ($\varphi$) is a local process (each agent models itself, not another). Entanglement is a property of $H$ (Hamiltonian dynamics). The theory is not a "local hidden variable theory": only $\mathcal{R}$ is local, while $H + \mathcal{D}$ are non-local.

Refinement: SSB, not gauge freedom. The more precise qualification is spontaneous symmetry breaking (SSB), not gauge freedom:

1. Before $V_{\text{Gap}}$ minimization: $G_2$-symmetry unbroken, all bases equivalent.
2. Upon $V_{\text{Gap}}$ minimization (T-64 [T]): system "rolls" into a specific vacuum $\Gamma_{\text{vac}}$ on the manifold of minima $(S^1)^{21}/G_2$. One minimum is selected.
3. After SSB: $G_2 \to H$ (vacuum stabilizer). Boolean fragment $\mathrm{Dec}(\Omega)$ crystallizes as pointer basis fixed by the vacuum.
4. Goldstone modes (see goldstone-modes): massless excitations along broken directions $G_2/H$.

Analogy: not coordinates in GR, but the Higgs mechanism — $SU(2) \times U(1) \to U(1)_{\text{em}}$ generates W/Z masses. In UHM: $G_2 \to H$ generates classical objectivity (Dec(Ω) = Boolean logic).

Canonical extension of φ to composite system

Definition (Canonical extension $\varphi_A$). For an autonomous holon $A$ in a composite system $A \otimes B$, the extension $\varphi_A$ is defined as:

$$\tilde{\varphi}_A := \varphi_A \otimes \mathrm{id}_B$$

This is the unique extension compatible with the CPTP structure of $\varphi_A$ and the tensor structure of category $\mathbf{DensityMat}$.

Theorem: tensor factorization

Theorem (Tensor factorization of φ)

For a composite system of two autonomous holons $A$ and $B$:

$$\varphi_{A \otimes B} = \varphi_A \otimes \varphi_B$$

Proof:

1. By the definition of autonomy (A1): $\mathcal{I}(A:B|\partial A) = 0$ — conditional independence of $A$ and $B$.

2. The operator $\varphi$ is defined as left adjoint to the inclusion of subobjects:

$$\varphi \dashv i: \mathrm{Sub}(\Gamma) \hookrightarrow \mathcal{E}$$

3. For autonomous subsystems the lattice of subobjects factorizes:

$$\mathrm{Sub}(\Gamma_{AB}) \cong \mathrm{Sub}(\Gamma_A) \times \mathrm{Sub}(\Gamma_B)$$

4. The left adjoint to the product of inclusions is the product of left adjoints:

$$\varphi_{A \otimes B} = \varphi_A \times \varphi_B \cong \varphi_A \otimes \varphi_B \quad \blacksquare$$

Corollary: annihilation of nonlinear contribution

Lemma (Annihilation of regeneration under partial trace). For any CPTP channel $\Phi_A$ and scalar $\alpha \in \mathbb{R}$:

$$\mathrm{Tr}_A\left[\alpha \cdot ((\Phi_A \otimes \mathrm{id}_B)(\rho_{AB}) - \rho_{AB})\right] = 0$$

Corollary: The regenerative term $\tilde{\mathcal{R}}_A[\Gamma_{AB}] = \kappa_A \cdot ((\varphi_A \otimes \mathrm{id}_B)(\Gamma_{AB}) - \Gamma_{AB}) \cdot g_V(P_A)$ automatically satisfies the no-signaling prohibition — the contribution to $\Gamma_B = \mathrm{Tr}_A[\Gamma_{AB}]$ is zero.

Full proof: Physical correspondence — No-signaling prohibition.

---

Related documents:

• Self-observation — definitions of $\varphi$, $R$ and $R^{(n)}$
• Evolution — equation of motion, regenerative term $\mathcal{R}$ and canonical $\Delta F$
• Coherence matrix — definition of $\Gamma$
• Viability — purity measure $P$ and region $\mathcal{V}$
• Unity dimension — integration measure $\Phi$
• Axiom of Septicity — regeneration coefficient $\kappa_0$
• Interiority hierarchy — levels L0→L1→L2→L3→L4, thresholds $R^{(n)}_{\text{th}}$
• Categorical formalism — categorical structure of UHM, n-truncations and no-signaling prohibition as natural transformation
• Holon — definition of $\mathbb{H}$
• Physical correspondence — No-signaling prohibition — complete proofs