Abstract
We introduce and rigorously formalize the Tesfa Grid, a family of deterministic two-dimensional matrix operators with a structured construction. This volume establishes nine proved theorems: the Column Closure Law; Upper and Lower Diagonal Mean Laws; the Row-6 Structural Prime Exclusion Theorem; the General Summation Formula; Prime-Only Block Divergence (R² = 0.9992); the Mod-6 Gap Constraint; the Twin Prime Hex-Spacing Theorem; and the Harmonic Sieve Theorem.
The volume further documents the Tesfa Wave, the Tesfa Gap Code, connections to the Riemann zeta function, and a spectral analysis of the prime residual sequence. Monte Carlo experiments yield a low-frequency power ratio of 0.406 versus 0.094 ± 0.018 for random permutations (Z ≈ 17σ). Sinusoidal fits of detrended column sums yield R² = 0.8622 at C = 600 with permutation p = 0.0000 in 5,000 trials. Cross-cycle residual correlation of 0.713 for real primes versus −0.184 for random-gap sequences establishes a structural signal unique to the prime distribution.
The Tesfa-Zeta Conjecture: that the scale-invariant prime envelope captured by the Tesfa Grid reflects a structural property of the prime sequence whose connection to the Riemann zeta function remains an open question is formally stated. No claims are made regarding proof of the Riemann Hypothesis.
The nine theorems
-
I
Column Closure Law For every column j and any parameters a, d: g(1,j) + g(2,j) + g(3,j) = g(6,j) + 2(d − a). An exact arithmetic identity linking the upper block to the bottom row.
-
II
Upper Diagonal Mean Law [g(1, j−1) + g(3, j+1)] / 2 = g(2, j). The center of any diagonal triple in the upper block is the exact arithmetic mean of its endpoints.
-
III
Lower Diagonal Mean Law [g(6, j) + g(5, j+1) + g(4, j+2)] / 3 = g(5, j+1). The symmetric invariance in the lower block, under the faster 3:1 velocity of Phase II.
-
IV
Row-6 Structural Prime Exclusion One row of the grid is structurally constrained to contain only composite values, regardless of the input sequence. The construction therefore performs an exact, zero-cost compositeness elimination on a fixed fraction of the grid's candidate positions. The proof and the explicit formula are given in Volume I, Section 4.
-
V
General Summation Formula The column sums of the grid admit a closed-form expression that is linear in the column index j and independent of the column count C. The formula and its derivation are given in Volume I, Section 5.
-
VI
Prime-Only Block Divergence In prime-only mode, the block divergence (lower − upper column sums) grows linearly: Δ_j ≈ 52.1 j + const, with R² = 0.9992 and p < 4.4×10⁻¹²². A new two-dimensional prime gap metric.
-
VII
Mod-6 Gap Constraint For all prime gaps g = p_{n+1} − p_n with p_n > 3: g ≡ 0, 2, or 4 (mod 6). No prime gap (after the initial gap of 1) is congruent to 1, 3, or 5 modulo 6.
-
VIII
Twin Prime Hex-Spacing For any two consecutive twin prime pairs (p, p+2) and (q, q+2) with p, q > 3, the gap q − p is divisible by 6.
-
IX
Harmonic Sieve Theorem The generalized Tesfa Grid operator T_{C,w} has exact spectral nulls at frequencies f_k = k/C for k = 1, …, w−1. The transfer function H(f) satisfies H(f_k) = 0 at every null, proved via the Dirichlet kernel. The operator preserves the DC component while annihilating exactly w−1 oscillatory frequencies per period.