The Theory of Persistence
Théorème

OS3 — Uniform reflection-positivity

For every $p \geq 3$, $M_p = T_p^T T_p \succeq 0$ (Gram matrix). Wightman reconstruction applies.

Statement

Let TpT_p be the mod-pp sieve transfer matrix (prime 3\geq 3). Then:

Mp=TpTTp0(Gram matrix, hence PSD).\boxed{M_p = T_p^T T_p \succeq 0 \qquad \text{(Gram matrix, hence PSD)}.}

For a square-free composite m=p1pkm = p_1 \cdot \ldots \cdot p_k, CRT factorisation gives:

Mm=Mp1Mpk0M_m = M_{p_1} \otimes \cdots \otimes M_{p_k} \succeq 0

(Kronecker product of PSD matrices is PSD).

Consequence — Osterwalder-Schrader reconstruction: for every finite TmT_m, the third OS axiom (reflection-positivity) is satisfied. The OS reconstruction theorem then yields a Wightman triple (Hm,Ωm,Wn)(\mathcal{H}_m, \Omega_m, W_n): a Hilbert space, a vacuum state, and Wightman functions.

Théorème

Why it matters

Before this theorem, OS3 was numerically verified at considerable cost on a few moduli (m{3,6,30,210}m \in \{3, 6, 30, 210\}). The status was [VAL] (empirical validation).

The uniform OS3 theorem promotes OS3 to [THM]: a short algebraic proof, applicable to every finite TmT_m without exception. Consequences:

Plain reading. In quantum field theory, certain matrices need to be “positive” so that probabilities make sense. OS3 says this positivity is automatic in PT: the relevant matrix has the form XTXX^T X, which is always positive. An automatic guarantee, not a case-by-case verification.

Proof

Step 1 — For pp prime

If TpT_p is a real matrix, then Mp=TpTTpM_p = T_p^T T_p is a Gram matrix (by definition, a matrix times its transpose). For any real matrix XX and any vector vv:

vT(XTX)v=(Xv)T(Xv)=Xv20.v^T (X^T X) v = (X v)^T (X v) = \|X v\|^2 \geq 0.

Hence XTX0X^T X \succeq 0 for any XX. In particular Mp0M_p \succeq 0.

Step 2 — For square-free composite mm

If m=p1p2pkm = p_1 \cdot p_2 \cdot \ldots \cdot p_k with all pip_i distinct, the Chinese Remainder Theorem gives:

Tm=Tp1Tp2Tpk.T_m = T_{p_1} \otimes T_{p_2} \otimes \cdots \otimes T_{p_k}.

Hence:

Mm=TmTTm=(Tp1TTpkT)(Tp1Tpk)=Mp1Mpk.M_m = T_m^T T_m = (T_{p_1}^T \otimes \cdots \otimes T_{p_k}^T)(T_{p_1} \otimes \cdots \otimes T_{p_k}) = M_{p_1} \otimes \cdots \otimes M_{p_k}.

The Kronecker product of PSD matrices is PSD (direct consequence: tensor-product eigenvalues are products of eigenvalues, and a product of positive reals is positive).

Step 3 — Consequence: OS3 satisfied uniformly

The Osterwalder-Schrader OS3 axiom requires the reflection matrix to be positive. The Gram matrix MmM_m plays exactly that role. Hence OS3 is satisfied for every finite TmT_m, no exception.

The OS reconstruction theorem applies, yielding a Wightman triple (Hm,Ωm,Wn)(\mathcal{H}_m, \Omega_m, W_n) for every mm.

Step 4 — Inductive limit (remaining gap)

Passing to the mm \to \infty limit to obtain the infinite Hilbert space H=pHp\mathcal{H}_\infty = \otimes_p \mathcal{H}_p is functional analysis (inductive limit). This passage is handled by lemma G (Hilbert reconstruction). OS3 itself is therefore fully THM; only the inductive limit remains a standard functional-analysis object.

Consequences

  1. 34/34 tests PASS on the OS3 suite (monograph, Appendix F).
  2. The QFT-from-sieve reconstruction programme becomes rigorous: each finite TmT_m corresponds to a Wightman QFT.
  3. Lemmas E, F, G (coupling, metric, Hilbert reconstruction) rely on OS3 for their BRIDGE → THM promotion.

See also