The Theory of Persistence
Théorème

T3 — Antidiagonal transfer

$T_3 = \mathrm{antidiag}(1,1)$ — the mod-3 matrix is purely off-diagonal.

Statement

The mod-3 sieve transfer matrix on 6-rough survivors is:

T3=(0110)=antidiag(1,1).\boxed{T_3 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} = \mathrm{antidiag}(1, 1).}

This purely antidiagonal structure is a direct consequence of T1 (forbidden transitions): the diagonal coefficients being zero (T1) and each row needing to sum to 1 (stochastic matrix), the off-diagonal coefficients must equal 1.

Théorème

Plain reading. Given T1 (two consecutive 6-rough integers are never in the same mod-3 class), the “matrix” describing how to move between classes is ultra-simple: we always switch, never stay. As a 2×2 table, it’s a checkerboard: 0s on the diagonals, 1s elsewhere.

Why it matters

T3 makes explicit the matrix T3T_3 used everywhere downstream: T2 uses it for spectral conservation, T6 for holonomy, T4 for convergence. It is the simplest possible form of a non-trivial 2×2 stochastic matrix — a pure flip operator.

That T3T_3 is purely antidiagonal also has important geometric consequences: its eigenvalues are ±1\pm 1, its square is the identity T32=IT_3^2 = I, and its action on the basis {1,2}\{1, 2\} is an involution.

Proof — outline

  1. Start from T1: T3[1,1]=T3[2,2]=0T_3[1,1] = T_3[2,2] = 0.
  2. Impose row sum = 1 (stochastic matrix).
  3. Conclude T3[1,2]=T3[2,1]=1T_3[1,2] = T_3[2,1] = 1.

Detailed proof

Step 1 — Stochastic matrix

A Markov-chain transfer matrix TT satisfies jT[i,j]=1\sum_j T[i, j] = 1 for each row ii (outgoing transition probabilities sum to 1).

For T3T_3 on {1,2}\{1, 2\}:

T3[1,1]+T3[1,2]=1,T3[2,1]+T3[2,2]=1.T_3[1, 1] + T_3[1, 2] = 1, \qquad T_3[2, 1] + T_3[2, 2] = 1.

Step 2 — Applying T1

T1 asserts T3[1,1]=T3[2,2]=0T_3[1, 1] = T_3[2, 2] = 0. Substituting:

T3[1,2]=1,T3[2,1]=1.T_3[1, 2] = 1, \qquad T_3[2, 1] = 1.

Hence:

T3=(0110).T_3 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}.

Spectrum

The characteristic polynomial is:

det(T3λI)=λ21.\det(T_3 - \lambda I) = \lambda^2 - 1.

So λ{+1,1}\lambda \in \{+1, -1\}. Associated eigenvectors:

  • λ1=+1\lambda_1 = +1: v1=(1,1)Tv_1 = (1, 1)^T (stationary, uniform on {1,2}\{1, 2\}),
  • λ2=1\lambda_2 = -1: v2=(1,1)Tv_2 = (1, -1)^T (antisymmetric mode).

Involution

Since T32=IT_3^2 = I, two successive applications return to the starting state. Consistent with the plain reading: “flip, flip, back”.

Articulation with T6

On the branch q=12/μq = 1 - 2/\mu, the generalised transfer matrix at non-trivial depth takes the form:

T3(q)=(1δ3δ3δ31δ3)T_3(q) = \begin{pmatrix} 1 - \delta_3 & \delta_3 \\ \delta_3 & 1 - \delta_3 \end{pmatrix}

with δ3=(1q3)/3\delta_3 = (1 - q^3)/3. The diagonal 1δ3=cosθ31 - \delta_3 = \cos\theta_3 appears naturally, and the T6 formula sin2θ3=δ3(2δ3)\sin^2\theta_3 = \delta_3 (2 - \delta_3) emerges as the squared off-diagonal transition amplitude.

In the ideal case q1q \to 1 (pure sieve limit), δ30\delta_3 \to 0 and cosθ31\cos\theta_3 \to 1, sin2θ30\sin^2\theta_3 \to 0. At q=13/15q = 13/15 (fixed point μ=15\mu^* = 15), δ3=0.1163\delta_3 = 0.1163 and sin2θ3=0.2192\sin^2\theta_3 = 0.2192 — the value entering the calculation of αEM\alpha_{\mathrm{EM}}.

T3 is therefore the limit case of T6 where δ=1/2\delta = 1/2 (stationary half-flip line), or more precisely the combinatorial envelope of which T6 is the analytically parametrised version.

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

See also