Skip to main content

Theorem on Critical Purity

Status: [T] Proven

The value Pcrit=2/NP_{\text{crit}} = 2/N is rigorously derived from several mathematically equivalent formulations of a single geometric principle (paths 1–4) and an independent autopoietic argument (path 5). The convergence of all approaches to a single value confirms the fundamentality of this threshold.

1. Theorem Statement

1.1 Main assertion

Theorem (Critical Purity):

For a holonomic system of dimension NN, the critical purity:

Pcrit=2NP_{\text{crit}} = \frac{2}{N}

is the unique value satisfying the following equivalent conditions:

  1. Geometric: ΓIN/NF2=IN/NF2\|\Gamma - I_N/N\|_F^2 = \|I_N/N\|_F^2
  2. Informational: DKL(ΓIN/N)=12D_{KL}(\Gamma \| I_N/N) = \frac{1}{2} nat (in linear approximation)
  3. Structural: r2=2σ2|\mathbf{r}|^2 = 2\sigma^2 (SNR = 1)
  4. Spectral: λmax=(1+N1)/N1/2\lambda_{\max} = (1 + \sqrt{N-1})/N \approx 1/2
  5. Autopoietic: minimal breaking of U(N)U(N) symmetry

1.2 For UHM (N = 7)

Pcrit=270.286P_{\text{crit}} = \frac{2}{7} \approx 0.286

At this threshold:

  • Structural deviation = scale of chaos
  • Informational contribution = 1/2 nat
  • Dominant mode ≈ 49% coherence
  • U(7)U(7) symmetry broken to distinguishability level

2. Necessary Definitions

2.1 Coherence matrix

The coherence matrix ΓL(CN)\Gamma \in \mathcal{L}(\mathbb{C}^N) satisfies:

Γ=Γ,Γ0,Tr(Γ)=1\Gamma^\dagger = \Gamma, \quad \Gamma \geq 0, \quad \mathrm{Tr}(\Gamma) = 1

2.2 Purity

P=Tr(Γ2)[1N,1]P = \mathrm{Tr}(\Gamma^2) \in \left[\frac{1}{N}, 1\right]
StatePurityDescription
PureP = 1Γ = |ψ⟩⟨ψ|
Maximally mixedP = 1/NΓ = I_N/N (chaos)

2.3 Frobenius norm

ΓF2=Tr(ΓΓ)=Tr(Γ2)=P\|\Gamma\|_F^2 = \mathrm{Tr}(\Gamma^\dagger \Gamma) = \mathrm{Tr}(\Gamma^2) = P

3. Five Derivation Paths (four equivalent + one independent)

3.1 Path 1: Geometric (structural doubling principle)

Principle: A system is distinguishable from chaos if its deviation from chaos exceeds the scale of chaos.

Criterion:

ΓIN/NF2>IN/NF2\|\Gamma - I_N/N\|_F^2 > \|I_N/N\|_F^2

Left-hand side computation:

ΓIN/NF2=Tr((ΓIN/N)2)=Tr(Γ2)2NTr(Γ)+Tr(IN2N2)=P2N+1N=P1N\begin{aligned} \|\Gamma - I_N/N\|_F^2 &= \mathrm{Tr}\left((\Gamma - I_N/N)^2\right) \\ &= \mathrm{Tr}(\Gamma^2) - \frac{2}{N}\mathrm{Tr}(\Gamma) + \mathrm{Tr}\left(\frac{I_N^2}{N^2}\right) \\ &= P - \frac{2}{N} + \frac{1}{N} \\ &= P - \frac{1}{N} \end{aligned}

Right-hand side computation:

IN/NF2=Tr(IN2N2)=NN2=1N\|I_N/N\|_F^2 = \mathrm{Tr}\left(\frac{I_N^2}{N^2}\right) = \frac{N}{N^2} = \frac{1}{N}

Threshold derivation:

P1N>1NP>2NP - \frac{1}{N} > \frac{1}{N} \quad \Rightarrow \quad \boxed{P > \frac{2}{N}}

Exact reformulation (majority of the Frobenius weight). The decomposition Γ=IN/N+Δ\Gamma = I_N/N + \Delta is orthogonal in the Hilbert–Schmidt inner product (IN/N,ΔF=Tr(Δ)/N=0\langle I_N/N, \Delta\rangle_F = \mathrm{Tr}(\Delta)/N = 0), so Pythagoras gives the exact split of the state's total Frobenius weight into a noise part and a structural part:

P=ΓF2=IN/NF21/N (noise)+ΔF2structure,s:=ΔF2P (structural share).P = \|\Gamma\|_F^2 = \underbrace{\|I_N/N\|_F^2}_{1/N\ \text{(noise)}} + \underbrace{\|\Delta\|_F^2}_{\text{structure}}, \qquad s := \frac{\|\Delta\|_F^2}{P}\ \text{(structural share)}.

The criterion ΔF2>IN/NF2\|\Delta\|_F^2 > \|I_N/N\|_F^2 is then exactly the statement that the structural component holds the strict majority of the state's Frobenius weight:

P>2N    s>12.P > \frac{2}{N} \iff s > \frac{1}{2}.

Between exactly two orthogonal components, majority is the unique dominance threshold containing no free parameter — any other cut s>cs > c would introduce an arbitrary constant cc. The apparent "factor 2" is therefore not a chosen constant: it is the arithmetic consequence of the majority criterion, 1N+1N=2N\tfrac1N + \tfrac1N = \tfrac2N.

Interpretation: one dominance principle for both thresholds

This is the same plurality-dominance principle that fixes the reflection threshold: for RthR_{\mathrm{th}} the self-model must dominate each of K=3K = 3 competing hypotheses (plurality 1/3\Rightarrow 1/3); for PcritP_{\mathrm{crit}} the structural component must dominate the single competing component, noise (K=2K = 2 orthogonal parts \Rightarrow majority 1/21/2 of the weight P>2/N\Rightarrow P > 2/N). One principle, two thresholds.


3.2 Path 2: Information-theoretic

Principle: A system carries sufficient information for distinguishability if its divergence from chaos exceeds an information quantum.

Kullback–Leibler divergence:

DKL(ΓIN/N)=Tr(ΓlogΓ)Tr(ΓlogINN)D_{KL}(\Gamma \| I_N/N) = \mathrm{Tr}(\Gamma \log \Gamma) - \mathrm{Tr}\left(\Gamma \log \frac{I_N}{N}\right)

Using log(IN/N)=log(N)IN\log(I_N/N) = -\log(N) \cdot I_N:

DKL(ΓIN/N)=SvN(Γ)+log(N)D_{KL}(\Gamma \| I_N/N) = -S_{vN}(\Gamma) + \log(N)

where SvN(Γ)=Tr(ΓlogΓ)S_{vN}(\Gamma) = -\mathrm{Tr}(\Gamma \log \Gamma) is the von Neumann entropy.

Expansion for states close to IN/NI_N/N:

For Γ=IN/N+δΓ\Gamma = I_N/N + \delta\Gamma with small δΓ\delta\Gamma:

DKL(ΓIN/N)N2Tr(δΓ2)=N2(P1N)D_{KL}(\Gamma \| I_N/N) \approx \frac{N}{2} \cdot \mathrm{Tr}(\delta\Gamma^2) = \frac{N}{2} \cdot \left(P - \frac{1}{N}\right)

Minimum distinguishability:

The distinguishability threshold in the quadratic approximation = 12\frac{1}{2} nat.

N2(P1N)12\frac{N}{2} \cdot \left(P - \frac{1}{N}\right) \geq \frac{1}{2} P1N1NP2NP - \frac{1}{N} \geq \frac{1}{N} \quad \Rightarrow \quad \boxed{P \geq \frac{2}{N}}
Scope of applicability

Path 2 uses the quadratic approximation D_KL(Γ ‖ I/N) ≈ (N/2)(P − 1/N), valid when P − 1/N ≪ 1. The threshold D_KL = 1/2 nat is a convention (analogous to p-value 0.05 in statistics). Path 2 is a supporting argument, consistent with P_crit = 2/N, not an independent rigorous derivation — and the audit below makes precise how much weight it can bear.

How far Path 2 actually is from exact (measured 2026-08-06)

Two facts, both machine-verified:

  1. The threshold sits exactly where the approximation fails. At P=2/NP = 2/N we have P1/N=1/70.143P - 1/N = 1/7 \approx 0.143, which is not 1\ll 1.
  2. DKL(ΓI/N)D_{\mathrm{KL}}(\Gamma\,\|\,I/N) is not a function of purity alone. Over all states with P=2/7P = 2/7 the exact divergence spans [0.359,0.622][0.359,\,0.622] nat — 0.3440.344 for one dominant mode plus six equal, 0.4370.437 for two dominant plus five — against the approximation's 0.5000.500. So the correspondence "DKL=1/2    P=2/ND_{\mathrm{KL}} = 1/2 \iff P = 2/N" holds for some spectra and not others; it is not an equivalence.

By contrast Path 1 is exact and state-independent: ΓI/NF2=P1/N\|\Gamma - I/N\|_F^2 = P - 1/N identically (verified to 101610^{-16}), and I/NF2=1/N\|I/N\|_F^2 = 1/N, so the majority criterion is P>2/NP > 2/N with no approximation anywhere. Path 3 is likewise exact — the Weingarten constant 1/(N(N+1))=1/561/(N(N+1)) = 1/56 multiplies both sides and cancels. Read the "convergence of five paths" accordingly: two are proofs, the rest are corroboration.

:::

Interpretation for engineers

Information threshold: The system must carry at least 1/2 nat of information beyond maximum entropy. This is a fundamental distinguishability limit in information theory.

In practice: At P=2/NP = 2/N the structural information is one binary distinction — "structure exists" versus "no structure". Note that this is a qualitative reading, not a numerical one: the convention DKL=1/2D_{\mathrm{KL}} = 1/2 nat equals 0.5/ln20.720.5/\ln 2 \approx 0.72 bits, not 11 bit. Demanding exactly one bit would set the threshold at ln2\ln 2 nat and give P=(1+2ln2)/N0.341P = (1 + 2\ln 2)/N \approx 0.341, not 2/N0.2862/N \approx 0.286.


3.3 Path 3: Helstrom / Haar single-shot detection

Principle: A Haar-random single-shot measurement on Γ\Gamma produces a statistically detectable deviation from the noise reference I/NI/N iff P>2/NP > 2/N.

Setup. Let Π=ψψ\Pi = |\psi\rangle\langle\psi| with ψ|\psi\rangle Haar-uniform on the unit sphere of CN\mathbb{C}^N. For a self-adjoint AA, the Π\Pi-induced observable is Tr(AΠ)\mathrm{Tr}(A\Pi).

First-moment (Haar invariance). EΠ[Π]=I/N\mathbb E_\Pi[\Pi] = I/N (unitary invariance), hence EΠ[Tr(AΠ)]=Tr(A)/N\mathbb E_\Pi[\mathrm{Tr}(A\Pi)] = \mathrm{Tr}(A)/N.

Second-moment (Weingarten). The standard U(N)U(N)-Weingarten formula gives EΠ[ΠΠ]=1N(N+1)(I+SWAP).\mathbb E_\Pi[\Pi\otimes\Pi] = \frac{1}{N(N+1)}(I + \mathrm{SWAP}). For N=7N=7: EΠ[ΠΠ]=(I+SWAP)/56\mathbb E_\Pi[\Pi\otimes\Pi] = (I+\mathrm{SWAP})/56. Hence EΠ[Tr(AΠ)2]=Tr((AA)E[ΠΠ])=1N(N+1)(Tr(A)2+AF2).\mathbb E_\Pi[\mathrm{Tr}(A\Pi)^2] = \mathrm{Tr}((A\otimes A)\cdot\mathbb E[\Pi\otimes\Pi]) = \frac{1}{N(N+1)}(\mathrm{Tr}(A)^2 + \|A\|_F^2).

Variance formula. VarΠ(Tr(AΠ))=E[Tr(AΠ)2]E[Tr(AΠ)]2=AF2N(N+1)Tr(A)2N2(N+1)\mathrm{Var}_\Pi(\mathrm{Tr}(A\Pi)) = \mathbb E[\mathrm{Tr}(A\Pi)^2] - \mathbb E[\mathrm{Tr}(A\Pi)]^2 = \frac{\|A\|_F^2}{N(N+1)} - \frac{\mathrm{Tr}(A)^2}{N^2(N+1)}

(using 1N(N+1)1N2=1N2(N+1)\tfrac{1}{N(N+1)} - \tfrac{1}{N^2} = -\tfrac{1}{N^2(N+1)}; verified numerically against Haar sampling).

Applied to A=Δ=ΓI/NA = \Delta = \Gamma - I/N (traceless, Tr(Δ)=0\mathrm{Tr}(\Delta)=0): VarΠ(Tr(ΔΠ))=ΔF2N(N+1)=P1/NN(N+1).\mathrm{Var}_\Pi(\mathrm{Tr}(\Delta\Pi)) = \frac{\|\Delta\|_F^2}{N(N+1)} = \frac{P - 1/N}{N(N+1)}.

Detection threshold. The observer's expected single-shot quadratic detection signal (above the zero-signal noise baseline) exceeds the reference scale I/NF2/(N(N+1))=1/(N2(N+1))\|I/N\|_F^2/(N(N+1)) = 1/(N^2(N+1)) iff ΔF2>I/NF2    P>2/N.\|\Delta\|_F^2 > \|I/N\|_F^2 \iff P > 2/N.

P>2N\boxed{P > \frac{2}{N}}

Interpretation: operational realization of the majority criterion

The Weingarten computation of the variance is exact [T], and the Haar constant 1/(N(N+1))=1/561/(N(N+1)) = 1/56 (for N=7N=7) multiplies both sides of the comparison and drops out — so the threshold is basis-independent and realizable by a physical Haar-random single-shot probe. What Path 3 adds is thus operational content: the Frobenius-majority criterion of Path 1 is not merely geometric bookkeeping but the detectability condition of an implementable random-basis measurement. The comparison scale itself (I/NF2\|I/N\|_F^2, i.e. the majority criterion) is the same dominance principle as in Path 1 — Path 3 realizes it operationally rather than forcing the constant independently.


3.4 Path 4: Spectral condition (characterization, not an independent derivation)

Principle: For an identity to exist, the system must have a dominant mode.

Spectrum of Γ\Gamma:

Spectrum(Γ)={λ1,λ2,,λN},λ1λ2λN0\mathrm{Spectrum}(\Gamma) = \{\lambda_1, \lambda_2, \ldots, \lambda_N\}, \quad \lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_N \geq 0

With constraints:

iλi=1,iλi2=P\sum_i \lambda_i = 1, \quad \sum_i \lambda_i^2 = P

Optimization problem:

Find the maximum λ1\lambda_1 for a given PP:

maxλ1subject toiλi=1,iλi2=P,λi0\max \lambda_1 \quad \text{subject to} \quad \sum_i \lambda_i = 1, \quad \sum_i \lambda_i^2 = P, \quad \lambda_i \geq 0

Solution (Lagrange method):

By symmetry, the optimum is reached when λ2=λ3==λN=λ\lambda_2 = \lambda_3 = \cdots = \lambda_N = \lambda:

λ1+(N1)λ=1λ=1λ1N1\lambda_1 + (N-1)\lambda = 1 \quad \Rightarrow \quad \lambda = \frac{1 - \lambda_1}{N-1} λ12+(N1)λ2=P\lambda_1^2 + (N-1)\lambda^2 = P

Substituting:

λ12+(1λ1)2N1=P\lambda_1^2 + \frac{(1 - \lambda_1)^2}{N-1} = P

Solving the quadratic equation:

λ1=1+(N1)(NP1)N\lambda_1 = \frac{1 + \sqrt{(N-1)(NP - 1)}}{N}

At P=2/NP = 2/N:

λmax=1+(N1)(21)N=1+N1N\lambda_{\max} = \frac{1 + \sqrt{(N-1)(2 - 1)}}{N} = \frac{1 + \sqrt{N-1}}{N}

For N=7N = 7:

λmax=1+670.49312\lambda_{\max} = \frac{1 + \sqrt{6}}{7} \approx 0.493 \approx \frac{1}{2}
Interpretation

~50% dominance threshold: At P=2/NP = 2/N the dominant mode captures approximately half of the coherence. This is the 1:1 threshold — structure is barely distinguishable from the uniform distribution.

Spectral structure at P=2/7P = 2/7:

  • λ10.493\lambda_1 \approx 0.493 (49.3% of coherence)
  • λ2==λ70.085\lambda_2 = \cdots = \lambda_7 \approx 0.085 (8.5% each)

3.5 Path 5: Symmetry breaking (U(N)U(N) stabilizer)

Principle: Sufficient structure is required for self-modeling φ(Γ)\varphi(\Gamma): chaos I/NI/N has maximal symmetry and admits no preferred direction; structure exists only when the symmetry is broken non-trivially.

Stabilizer group. For ΓD(CN)\Gamma \in \mathcal D(\mathbb C^N): Stab(Γ)={UU(N):UΓU=Γ}.\mathrm{Stab}(\Gamma) = \{U \in U(N) : U\Gamma U^\dagger = \Gamma\}.

Lemma (Schur's lemma applied to I/NI/N). Stab(Γ)=U(N)\mathrm{Stab}(\Gamma) = U(N) iff Γ=I/N\Gamma = I/N.

Proof. I/NI/N is scalar, hence commutes with every UU. Conversely, if Γ\Gamma commutes with every UU(N)U \in U(N), then Γ\Gamma lies in the commutant of the standard U(N)U(N)-action on CN\mathbb C^N; since this action is irreducible, Schur gives ΓCI\Gamma \in \mathbb C \cdot I; trace-1 forces Γ=I/N\Gamma = I/N. \square

Stabilizer dimension bound. If Γ\Gamma has kk distinct eigenvalues with multiplicities m1,,mkm_1,\ldots,m_k (with mi=N\sum m_i = N), then Stab(Γ)=U(m1)××U(mk)\mathrm{Stab}(\Gamma) = U(m_1)\times\cdots\times U(m_k), real Lie dimension mi2\sum m_i^2. For k=1k=1 this is N2N^2 (the I/NI/N case). For k2k\ge 2 the maximum is attained at the most unequal split (1,N1)(1, N-1), giving 1+(N1)2=N22N+2<N21 + (N-1)^2 = N^2 - 2N + 2 < N^2. For N=7N = 7: max non-constant stabilizer dimension is 37<4937 < 49.

Strengthened symmetry-breaking criterion. Mere inequality Stab(Γ)U(N)\mathrm{Stab}(\Gamma)\subsetneq U(N) is equivalent to ΔF>0\|\Delta\|_F > 0, which is satisfied for any ΓI/N\Gamma \ne I/N (arbitrarily small breaking). The strengthened criterion requires that the traceless component dominate the scalar reference: ΓIN/NFIN/NF.\|\Gamma - I_N/N\|_F \ge \|I_N/N\|_F. By Path 1 this is equivalent to: P2N.\boxed{P \ge \frac{2}{N}}.

Dependence on Path 1 — clarified

The strengthened criterion ΔFI/NF\|\Delta\|_F \ge \|I/N\|_F coincides with Path 1 at the algebraic level. Path 5's independent content is the representation-theoretic statement that I/NI/N is the unique U(N)U(N)-symmetric density matrix (Schur's lemma on the irreducible fundamental representation), making I/NI/N the canonical "maximally symmetric" reference. This is what justifies the choice of reference used in Path 1 — without it, the critical purity would depend on an arbitrary reference state.


3.6 Path 6: Octonionic norm [I]

Interpretation [I]

In the octonionic interpretation, purity P=Tr(Γ2)P = \mathrm{Tr}(\Gamma^2) is connected to the norm on Im(O)\mathrm{Im}(\mathbb{O}). The normativity xy=xy|xy| = |x||y| ensures a multiplicative metric. The threshold Pcrit=2/7P_{\text{crit}} = 2/7 can be interpreted as the minimum norm of a vector in Im(O)\mathrm{Im}(\mathbb{O}) ≅ ℝ⁷ at which its projection onto structural directions (Fano triplets) exceeds the noise projection.

Status: [T], bridge [T] (closed, T15). Compatible with the other five paths. See structural derivation.


4. Convergence of All Paths

4.1 Results table

PathPrincipleMain toolResult
1. GeometricFrobenius structural dominanceHS PythagorasP > 2/N ✓
2. InformationalRelative entropy 2nd-orderOperator Taylor of log\logP = 2/N at D=1/2 nat ✓
3. Single-shot detectionHaar-averaged observable varianceWeingarten 2nd moment (1/(N(N+1))1/(N(N+1)))P > 2/N ✓
4. SpectralDominant eigenvalue optimumLagrange multipliersλ_max = (1+√(N−1))/N at P = 2/N ✓
5. Symmetry breakingStabilizer dimensionSchur's lemma + Cauchy-SchwarzP > 2/N ✓

4.2 Uniqueness theorem

Theorem: The value Pcrit=2/NP_{\text{crit}} = 2/N is the unique one at which all five criteria coincide.

Proof: Uniqueness follows from the algebraic equivalence of conditions 1–4 (all express the same geometric requirement in different terms). The autopoietic criterion (5) yields the same threshold from an independent symmetry-breaking requirement. All five formulations lead to P1/N=1/NP - 1/N = 1/N. ∎

Logical structure of the five paths

The derivation has one load-bearing core and four structural supports, each with a precisely delimited role:

Core (the derivation proper). Pcrit=2/NP_{\mathrm{crit}} = 2/N follows from two ingredients, both parameter-free:

IngredientContentStatus
Reference canonicity (Path 5)I/NI/N is the unique U(N)U(N)-invariant density matrix (Schur's lemma on the irreducible fundamental representation) — the only canonical "chaos" reference[T]
Majority criterion (Path 1)With the orthogonal split P=I/NF2+ΔF2P = \|I/N\|_F^2 + \|\Delta\|_F^2, distinguishability = the structural component holds the strict majority of the Frobenius weight, s>1/2s > 1/2 — the unique dominance threshold between two orthogonal components containing no free constant[T] equivalence; the majority principle is the same plurality-dominance rule that fixes Rth=1/3R_{\mathrm{th}} = 1/3

Together: s>12    P>2/Ns > \tfrac12 \iff P > 2/N, with no adjustable parameter anywhere.

Supports (delimited roles, per their own sections):

PathRoleRelation to the core
3 (Haar detection)Operational realization [T]: exact Weingarten variance; the Haar constant drops out of the comparison, so the majority criterion is basis-independent and physically measurable by a random single-shot probeRealizes the Path-1 criterion operationally; does not force the constant independently
4 (Spectral)Characterization [T] (per §3.4: not an independent derivation): at P=2/NP = 2/N the extremal spectrum has λmax=(1+N1)/N1/2\lambda_{\max} = (1+\sqrt{N-1})/N \approx 1/2Describes what the threshold state looks like spectrally
2 (KL entropy)Interpretive confirmation: reduces to Path 1 in the quadratic approximation; the DKL=1/2D_{KL} = 1/2 nat cut is a conventionInformation-theoretic reading of the same inequality

The theorem-level content is therefore: given the canonical reference (Schur) and the parameter-free majority criterion, Pcrit=2/NP_{\mathrm{crit}} = 2/N is forced [T] — with operational measurability (Path 3), spectral shape (Path 4), and informational meaning (Path 2) established as corollaries, not as independent forcings.


5. Spectral Characterization

5.1 Optimal spectrum at the boundary

Theorem (Spectrum at P=PcritP = P_{\text{crit}}):

At P=2/NP = 2/N, the optimal spectrum (maximizing λmax\lambda_{\max}) has the form:

λ1=1+N1Nλ2=λ3==λN=N1N1N(N1)\begin{aligned} \lambda_1 &= \frac{1 + \sqrt{N-1}}{N} \\ \lambda_2 = \lambda_3 = \cdots = \lambda_N &= \frac{N - 1 - \sqrt{N-1}}{N(N-1)} \end{aligned}

5.2 Numerical values

NP_crit = 2/Nλ_max at P_crit
21.0001.000
30.6670.789
40.5000.683
50.4000.618
60.3330.573
70.2860.493
80.2500.457

5.3 Verification for N = 7

λ1=1+670.493\lambda_1 = \frac{1 + \sqrt{6}}{7} \approx 0.493 λ2==λ7=66420.085\lambda_2 = \cdots = \lambda_7 = \frac{6 - \sqrt{6}}{42} \approx 0.085

Verification:

λ1+6λ2=0.493+6×0.085=1.000\lambda_1 + 6\lambda_2 = 0.493 + 6 \times 0.085 = 1.000 \quad \checkmark λ12+6λ22=0.243+6×0.0072=0.286=27\lambda_1^2 + 6\lambda_2^2 = 0.243 + 6 \times 0.0072 = 0.286 = \frac{2}{7} \quad \checkmark

6. Hierarchy of Purity Thresholds

6.1 Full hierarchy

Pcritregen<Pcritgeom<Psafe<PtargetP_{\text{crit}}^{\text{regen}} < P_{\text{crit}}^{\text{geom}} < P_{\text{safe}} < P_{\text{target}}
ThresholdFormulaValue (N=7)Purpose
P_crit^regenγ/(κ_rate · Coh_E^min)≈ 0.033Dynamical (κ > γ)
P_crit^geom2/N≈ 0.286Structural (main)
P_safeP_crit^geom + margin0.30Operational (with margin)
P_target0.50Recommended

6.2 Interpretation

  • Pcritregen0.033P_{\text{crit}}^{\text{regen}} \approx 0.033: Minimum for regeneration to exceed dissipation
  • Pcritgeom=2/70.286P_{\text{crit}}^{\text{geom}} = 2/7 \approx 0.286: Minimum for structural distinguishability from chaos (main threshold)
  • Psafe=0.30P_{\text{safe}} = 0.30: Operational threshold with 5% margin
  • Ptarget=0.50P_{\text{target}} = 0.50: Recommended operating point
Important

A system with Pcritregen<P<PcritgeomP_{\text{crit}}^{\text{regen}} < P < P_{\text{crit}}^{\text{geom}} can regenerate, but has no structural identity — it is indistinguishable from noise.


7. Practical Applications

7.1 For AI systems engineers

Viability criterion:

/// Viability check: P > P_crit = 2/N (T-39a [T]).
public pure fn is_viable<const N: Int>(gamma: &StaticMatrix) -> Bool
where requires N >= 2
{
let p = (gamma.matmul(&gamma)).trace().real();
p > 2.0 / (N as Float)
}

Structural deviation computation:

/// Structural deviation ‖Γ − I/N‖_F² = P − 1/N.
///
/// **Interpretation**:
/// - deviation < 1/N: indistinguishable from noise
/// - deviation = 1/N: viability boundary
/// - deviation > 1/N: structured system
public pure fn structural_deviation<const N: Int>(gamma: &StaticMatrix) -> Float
where requires N >= 2
{
let p = (gamma.matmul(&gamma)).trace().real();
p - 1.0 / (N as Float)
}

Dominance threshold:

/// Dominant eigenvalue threshold λ_max at P = P_crit = 2/N.
///
/// For N = 7: returns ≈ 0.493.
public pure fn dominant_eigenvalue_threshold(n: Int { self >= 2 }) -> Float {
(1.0 + ((n - 1) as Float).sqrt()) / (n as Float)
}

7.2 For consciousness researchers

Connection with interiority levels:

LevelConditionInterpretation
L0 (Interiority)ρ_E ≠ 0Inner state exists
L1 (Phenomenal geometry)rank(ρ_E) > 1Structure of qualities
ViabilityP > 2/7Distinguishability from chaos
L2 (Cognitive qualia)R ≥ 1/3, Φ ≥ 1, D_diff ≥ 2*Reflexive access

*DdiffD_{\text{diff}} requires tensor structure; in the minimal 7D formalism Cmin=Φ×RC_{\min} = \Phi \times R is used — see dimension-e.md.

Key conclusion: P>2/NP > 2/N is a necessary condition for L1 and L2. Without structural distinguishability, phenomenology is impossible.

7.3 For physicists

Analogies with phase transitions:

UHMStatistical physicsMeaning
P = 2/NCritical temperature T_cOrdering threshold
P − 1/NOrder parameterMeasure of structure
λ_max ≈ 1/2Macroscopic occupancyCondensation into one mode

Entropic interpretation:

At P=2/NP = 2/N:

SvN=logNN2(2N1N)+O(1N2)=logN12S_{vN} = \log N - \frac{N}{2}\left(\frac{2}{N} - \frac{1}{N}\right) + O\left(\frac{1}{N^2}\right) = \log N - \frac{1}{2}

The system contains 1/2 nat less entropy than maximal chaos.

7.4 For information theorists

Channel capacity:

Distinguishing state Γ\Gamma from IN/NI_N/N is equivalent to transmitting information over a channel with capacity:

C=DKL(ΓIN/N)N2(P1/N)C = D_{KL}(\Gamma \| I_N/N) \approx \frac{N}{2}(P - 1/N)

At P=2/NP = 2/N: C=1/2C = 1/2 nat = distinguishability boundary.

Holevo bound:

χ({pi,ρi})S(ρˉ)ipiS(ρi)\chi(\{p_i, \rho_i\}) \leq S(\bar{\rho}) - \sum_i p_i S(\rho_i)

To distinguish Γ\Gamma from IN/NI_N/N one needs χ1/2\chi \geq 1/2 nat, which requires P2/NP \geq 2/N.


8. Universality of the Factor 2

8.1 Appearance in various contexts

ContextFormulaInterpretation
Detection theorySNR = 1Signal = noise
Quantum distinguishabilityF(ρ, σ) = 1/2Distinguishability limit
Information theoryΔS = k ln 2One bit of information
Statistics2σ ruleSignificant deviation
UHMP = 2/NStructure = chaos

8.2 Physical meaning

The factor of 2 is the arithmetic footprint of the majority criterion: with the orthogonal split P=I/NF2+ΔF2P = \|I/N\|_F^2 + \|\Delta\|_F^2, the boundary is exactly

s=ΔF2P=12(structure holds half the total weight),s = \frac{\|\Delta\|_F^2}{P} = \frac{1}{2} \quad\text{(structure holds half the total weight)},

equivalently deviation2=baseline2\|\text{deviation}\|^2 = \|\text{baseline}\|^2, i.e.

P=2×Pmin=2N.P = 2 \times P_{\min} = \frac{2}{N}.

The "2" is thus not a tuned constant but the denominator of the parameter-free majority threshold 1/21/2 — the K=2K=2 instance of the same plurality-dominance principle whose K=3K=3 instance gives Rth=1/3R_{\mathrm{th}} = 1/3.


9. Conclusion

9.1 Main result

Theorem (formulation)

For a holonomic system of dimension NN:

Pcrit=2NP_{\text{crit}} = \frac{2}{N}

This value is unique, at which:

  • All five formulations of the criterion coincide (4 mathematically equivalent + 1 autopoietic)
  • The factor of 2 arises naturally (signal = noise)
  • The dominant mode captures ~50% of coherence

9.2 For N = 7 (UHM)

Pcrit=270.286P_{\text{crit}} = \frac{2}{7} \approx 0.286

Spectral structure at the boundary:

  • λ10.493\lambda_1 \approx 0.493 (~50%)
  • λ2==λ70.085\lambda_2 = \cdots = \lambda_7 \approx 0.085 (~8.5% each)

9.3 Methodological significance

  1. Convergence of independent paths confirms the fundamentality of the threshold
  2. Factor 2 — universal distinguishability threshold in information systems
  3. Spectral characterization connects purity with mode dominance

Appendix A: Complete Computations

A.1 Derivation of λ_max at P = 2/N

Problem:

maxλ1subject toi=1Nλi=1,i=1Nλi2=2N\max \lambda_1 \quad \text{subject to} \quad \sum_{i=1}^N \lambda_i = 1, \quad \sum_{i=1}^N \lambda_i^2 = \frac{2}{N}

Lagrangian:

L=λ1μ(iλi1)ν(iλi22N)\mathcal{L} = \lambda_1 - \mu\left(\sum_i \lambda_i - 1\right) - \nu\left(\sum_i \lambda_i^2 - \frac{2}{N}\right)

Optimality conditions:

Lλ1=1μ2νλ1=0\frac{\partial \mathcal{L}}{\partial \lambda_1} = 1 - \mu - 2\nu\lambda_1 = 0 Lλk=μ2νλk=0(k=2,,N)\frac{\partial \mathcal{L}}{\partial \lambda_k} = -\mu - 2\nu\lambda_k = 0 \quad (k = 2, \ldots, N)

From the second condition: λ2==λN=μ/(2ν)=λ\lambda_2 = \cdots = \lambda_N = -\mu/(2\nu) = \lambda.

Substituting into the constraints:

λ1+(N1)λ=1\lambda_1 + (N-1)\lambda = 1 λ12+(N1)λ2=2N\lambda_1^2 + (N-1)\lambda^2 = \frac{2}{N}

From the first: λ=(1λ1)/(N1)\lambda = (1 - \lambda_1)/(N-1).

Substituting into the second:

λ12+(1λ1)2N1=2N\lambda_1^2 + \frac{(1 - \lambda_1)^2}{N-1} = \frac{2}{N} (N1)λ12+(1λ1)2=2(N1)N(N-1)\lambda_1^2 + (1 - \lambda_1)^2 = \frac{2(N-1)}{N} Nλ122λ1+1=2(N1)NN\lambda_1^2 - 2\lambda_1 + 1 = \frac{2(N-1)}{N} N2λ122Nλ1+N2(N1)=0N^2\lambda_1^2 - 2N\lambda_1 + N - 2(N-1) = 0 N2λ122Nλ1+2N=0N^2\lambda_1^2 - 2N\lambda_1 + 2 - N = 0

By the quadratic formula:

λ1=2N±4N24N2(2N)2N2=2N±2NN12N2=1±N1N\lambda_1 = \frac{2N \pm \sqrt{4N^2 - 4N^2(2-N)}}{2N^2} = \frac{2N \pm 2N\sqrt{N-1}}{2N^2} = \frac{1 \pm \sqrt{N-1}}{N}

Taking ++ (maximum):

λmax=1+N1N\boxed{\lambda_{\max} = \frac{1 + \sqrt{N-1}}{N}}

Related documents: