The Theory of Persistence
Théorème

T5 — Unique fixed point μ* = 15

The sieve admits a unique stable fixed point at $\mu^* = 3+5+7 = 15$.

Statement

The sieve self-consistency equation

μ=p:γp(μ)>sp,s=1/2,\mu^* = \sum_{p\,:\,\gamma_p(\mu^*) > s} p, \qquad s = 1/2,

admits a unique stable solution, namely:

μ=3+5+7=15,active set={3,5,7}.\boxed{\mu^* = 3 + 5 + 7 = 15, \qquad \text{active set} = \{3, 5, 7\}.}

The proof combines an exact rational exhaustive scan over μ[3,100]\mu \in [3, 100] with an analytic monotonicity bound for p7p \geq 7, excluding any fixed point outside the active primorial {3,5,7}\{3, 5, 7\}.

Théorème

Plain reading. We have a self-referential equation: ”μ\mu must equal the sum of primes active at μ\mu”. How many solutions are there? T5 says: exactly one. It’s μ=15\mu = 15 with active primes {3,5,7}\{3, 5, 7\}. No other choice of primes closes the equation. This uniqueness is what makes PT “zero-parameter”: if several solutions existed, you’d have to choose, and that choice would be a parameter.

Why it matters

T5 is the summit of the chain of theorems. All preceding ones (T0–T6, GFT, L0) are needed to formulate T5, and T5 closes the sieve: at μ=15\mu^* = 15, the parity split seeded by p=2p = 2 is frozen as the q+/qq_+/q_- bifurcation, and the 43 physical observables are then derived.

Three regimes exist in fact:

It is μ=15\mu^* = 15 that drives PT physics, after p=2p = 2 has “crystallised” into the binary infrastructure.

Proof — outline

  1. Define γp(μ)=dln(sin2θp)/dlnμ\gamma_p(\mu) = -d\ln(\sin^2\theta_p)/d\ln\mu (anomalous dimension).
  2. Compute γp\gamma_p via exact rational arithmetic at μ=15\mu = 15: γ3,γ5,γ7>1/2\gamma_3, \gamma_5, \gamma_7 > 1/2, γ11,γ13<1/2\gamma_{11}, \gamma_{13} < 1/2.
  3. Verify 3+5+7=153 + 5 + 7 = 15 — consistency reached.
  4. Analytic bound: γp\gamma_p strictly decreasing in pp for p7p \geq 7, so no prime 11\geq 11 is active at any reasonable μ\mu.
  5. Exhaustive scan of finite subsets of {3,5,7,11,13,...}\{3, 5, 7, 11, 13, ...\} to confirm uniqueness.

Detailed proof

Step 1 — Exact rational computation of γp\gamma_p at μ=15\mu = 15

At q=13/15q = 13/15, every quantity is an exact rational number (fractions.Fraction, zero floating-point error). Values are:

ppγp\gamma_p (exact fraction)γp\gamma_p (decimal)>1/2> 1/2?
34536129/56167044\,536\,129 / 5\,616\,7040.80761…
5486792684365/699097512194486\,792\,684\,365 / 699\,097\,512\,1940.69632…
72827519972576117/47483960227464682\,827\,519\,972\,576\,117 / 4\,748\,396\,022\,746\,4680.59547…
11(exact rational, omitted)0.42573…
13(exact rational, omitted)0.35624…

Differences γ3γ5\gamma_3 - \gamma_5, γ5γ7\gamma_5 - \gamma_7, γ7γ11\gamma_7 - \gamma_{11} are strictly positive (verified by exact fraction subtraction).

Step 2 — Numerical consistency

The set {3,5,7}\{3, 5, 7\} is active at μ=15\mu = 15. Its sum:

3+5+7=15=μ.3 + 5 + 7 = 15 = \mu.

The self-consistency equation is satisfied. This is a fixed point.

Step 3 — Analytic monotonicity for p7p \geq 7

γp\gamma_p factors as γp=F(p)G(p)\gamma_p = F(p) \cdot G(p) with:

  • F(p)=4qp1/μF(p) = 4 q^{p-1}/\mu — exponentially decreasing,
  • G(p)=(1δp)/(δp(2δp))G(p) = (1 - \delta_p)/(\delta_p (2 - \delta_p)) — sign analysis.

The gap fraction δp=(1qp)/p\delta_p = (1 - q^p)/p is strictly decreasing in pp (real-variable analysis x(1eLx)/xx \mapsto (1 - e^{-Lx})/x with L=ln(15/13)>0L = \ln(15/13) > 0).

Consequence: for every p7p \geq 7, γp<γ70.595\gamma_p < \gamma_7 \approx 0.595. Adding a prime p11p \geq 11 to the active set is therefore impossible: γp<1/2\gamma_p < 1/2 would violate activity.

Step 4 — Exhaustive scan of finite candidates

Enumerate all finite subsets S{3,5,7,11,13,17,19,23,...}S \subset \{3, 5, 7, 11, 13, 17, 19, 23, ...\}, compute μS=pSp\mu_S = \sum_{p \in S} p, and test the consistency γp(μS)>1/2\gamma_p(\mu_S) > 1/2 for pSp \in S.

Exhaustive scan results (cf. proof_T5_fixed_point.py, 33 PASS):

  • S={3,5,7}S = \{3, 5, 7\}: μ=15\mu = 15, consistent
  • S={3,5}S = \{3, 5\}: μ=8\mu = 8, but γ3(8),γ5(8),γ7(8)>1/2\gamma_3(8), \gamma_5(8), \gamma_7(8) > 1/2 imply 7 should be included — contradiction.
  • S={3,5,7,11}S = \{3, 5, 7, 11\}: μ=26\mu = 26, but γ11(26)<1/2\gamma_{11}(26) < 1/2 — inconsistent.
  • S={2,3,5}S = \{2, 3, 5\}: μ=10\mu = 10, binary/spin sector (distinct fixed point, p=2p = 2 included).
  • S={2,3,5,7}S = \{2, 3, 5, 7\}: μ=17\mu = 17, transitional sector.

No other subset closes the equation in the information sector (without p=2p = 2). μ=15\mu^* = 15 is unique for the info sector.

Step 5 — Linear stability

Stability of the fixed point is checked by computing the Jacobian:

Jij=γpjμiμ=μ.J_{ij} = \frac{\partial \gamma_{p_j}}{\partial \mu_i} \bigg|_{\mu = \mu^*}.

The spectral radius |\lambda_\max(J)| < 1 confirms μ=15\mu^* = 15 is an attractor (cf. ch. 8, Stability Theorem).

J1–J6: six independent justifications

The monograph lists six independent justifications of μ=15\mu^* = 15:

  1. Exhaustive scan (step 4).
  2. Linear stability (step 5).
  3. Nc=3N_c = 3: unique solution of (Nc+1)!/(Nc+3)=2Ns1(N_c + 1)! / (N_c + 3) = 2^{N_s - 1} with Ns=3N_s = 3.
  4. Prime 7 = integer oracle of e2e^2: drift Ap=lnp/pA_p = \ln p / \sqrt{p} is maximal at p=7p = 7.
  5. Echo product identity: p{3,5,7}qp=1/e\prod_{p \in \{3,5,7\}} q_-^p = 1/e exactly.
  6. Cosmogony: the sequence μ=101715\mu = 10 \to 17 \to 15 gives the evolutionary scenario.

For the complete derivation, see chapter 8 of the monograph.

See also