Preprint
Hypothesis

This version is not peer-reviewed.

The Square-Root Horizon: Squares, Reversal and Prime Clocks in the Distribution of the Primes and the Zeros of the Riemann Zeta Function

Submitted:

08 October 2026

Posted:

10 October 2026

You are already at the latest version

Abstract
We read the primes and the zeros of the Riemann zeta function through three exact structures: the residue classes of the divisor in the rebuild law \( \sum_{r\le x}M(x/r)=1 \), the squares of the primes, and the reversal of the Euler product. Split by \( r\bmod3 \) the rebuild law is \( (1,a(x),-a(x)) \). Its zero class reproduces the whole law at \( x/3 \), so the classes modulo \( 3^\kappa \) form a self-similar tower whose leaf energy is \( \ll x^{1+\varepsilon} \) for every \( \varepsilon>0 \) if and only if the Riemann Hypothesis (RH) holds; at every zero of \( \zeta \) the three classes stand as \( (0,a,-a) \). Each prime square enters the logarithm of the Euler product with weight \( \frac12 \), and at that weight the lean of the prime count vanishes: the weight fitted from the exact counts to \( 10^{10} \) is \( 0.4994 \). The squares part of \( \zeta \) is zero-free for \( \sigma>\frac12 \) and has a half-order pole at \( s=\frac12 \), the square-root horizon, matched by a half-order zero of the prime factor, which carries every zero of \( \zeta \) in \( \sigma>\frac12 \). Reversing the sign of every prime turns \( \zeta(s) \) into \( \zeta(2s)/\zeta(s) \) and every zero into a pole; the Liouville-weighted sawtooths rebuild the square staircase exactly, and if they approximate the odd-square staircase in \( L^2(0,\infty) \) then RH holds. On the critical line every forward term of the approximate functional equation is balanced by its reversed partner, and off it no two pairs are balanced at once; the pair truncated without its remainder has zeros off the line, at each of which \( \zeta \) itself is far from zero. The Jensen polynomials of \( \Xi \), read as Jacobi chains, have every coupling positive to degree \( 400 \), and each prime pulls the zeros toward the reversal of its clock, as Landau's formula prescribes. We state the axiom of harmonic independence: the prime waves are related only through the mechanism of their construction, and a zero off the critical line would be a relation without a mechanism. The Davenport--Heilbronn function, whose zeros leave the line, adds two Euler products with the root number as weight and couples distinct primes in its logarithm, as the axiom predicts.
Keywords: 
;  ;  ;  ;  

1. Introduction

Let μ be the Möbius function, λ the Liouville function and Λ the von Mangoldt function, and let M ( x ) = ∑ n ≤ x μ ( n ) , L ( x ) = ∑ n ≤ x λ ( n ) , π ( x ) , θ ( x ) = ∑ p ≤ x log p , ψ ( x ) = ∑ n ≤ x Λ ( n ) and J ( x ) = ∑ k ≥ 1 π ( x 1 / k ) / k ; functions of x vanish for x < 1 . We write π ( x ; q , a ) , θ ( x ; q , a ) and ψ ( x ; q , a ) for the same counts restricted to n ≡ a ( mod q ) , li ( x ) for the logarithmic integral, χ − 3 and χ − 4 for the nonprincipal characters modulo 3 and 4, L ( s , χ ) for Dirichlet L-functions, ζ ( s , a ) for the Hurwitz zeta function and η ( s ) = ∑ n ≥ 1 ( − 1 ) n − 1 n − s = ( 1 − 2 1 − s ) ζ ( s ) ; ν ( n ) and Ω ( n ) are the numbers of distinct and of all prime factors of n, and γ E is Euler’s constant. The nontrivial zeros of ζ are ρ = β + i γ , counted with multiplicity; N ( T ) is the number with 0 < γ ≤ T . The Riemann Hypothesis (RH) is the statement that β = 1 2 for every ρ . All zeros with 0 < γ ≤ 3 · 10 12 lie on the line σ = 1 2 [46]. Hardy proved that infinitely many zeros lie on the line [29], Selberg that a positive proportion do [55], Levinson more than one third [34], Conrey more than two fifths [19], Bui, Conrey and Young more than 41 % [14], and Pratt, Robles, Zaharescu and Zeindler more than five twelfths [49]. Montgomery’s pair-correlation method [39], made independent of RH by Aryan [3] and by Baluyot, Goldston, Suriajaya and Turnage-Butterbaugh [7], shows that at least two thirds of the zeros are simple and on the line if all zeros with T < γ ≤ 2 T lie within 0.3185 / log T of it [8]. In 2026 two results obtained by AI models were reported. Anthropic reported an unconditional proof, with a Lean formalisation, that at least 67.2 % of the zeros, counted with multiplicity, are simple and on the line, against the previous record 5 12 of [49] (given there as 41.6 % ); the argument combines the unconditional pair-correlation theorems of [3,7] with Bombieri’s work on Weil’s quadratic functional [13], and extends to primitive Dirichlet L-functions [4,18]. OpenAI released a manuscript asserting that every Dirichlet L-function, ζ included, and every finite-order Hecke L-function over Q ( − 3 ) has no zeros with Re s > 7 8 other than the pole at s = 1 , with a Lean formalisation of these statements [44]; a companion manuscript gives a different proof of the half-plane Re s > 11 12 [45]. The de Bruijn–Newman constant Λ dBN satisfies 0 ≤ Λ dBN ≤ 0.2 [22,40,48,52], [46, Corollary 2], and RH is equivalent to Λ dBN = 0 . We measure x in doublings, u = log 2 x ; a zero 1 2 + i γ contributes to the counts a wave x i γ = e 2 π i u γ log 2 / 2 π whose pitch is γ log 2 / 2 π turns per doubling.
Pairing the squarefree divisors { d , d p } of every integer k > 1 gives ∑ d ∣ k μ ( d ) = 0 , and summing over k ≤ x gives the rebuild law [1, Ch. 3]
∑ r ≤ x M ( x / r ) = 1 ( x ≥ 1 ) ,
by which the balance of the Möbius sum at every scale is fixed by the balances at all smaller scales. The present paper reads the law, the prime counts and ζ itself through three exact structures: the residue classes of the divisor r in (1); the squares of the primes, which sit on the square-root horizon σ = 1 2 where the series ∑ p p − 2 σ stops converging; and the reversal p ↦ − p of the Euler product, which turns every zero of ζ into a pole.

1.1. Main Results

For m ≥ 1 , a residue c mod m and a character χ mod m put
S c ( m ) ( x ) = ∑ r ≤ x r ≡ c ( m ) M ( x / r ) , G χ ( x ) = ∑ r ≤ x χ ( r ) M ( x / r ) = ∑ k ≤ x ( μ ∗ χ ) ( k ) ,
and write G − 3 = G χ − 3 , G − 4 = G χ − 4 .
Theorem 1 
(the triad tower).
(i)
For x ≥ 3 , S 0 ( 3 ) , S 1 ( 3 ) , S 2 ( 3 ) ( x ) = 1 , a ( x ) , − a ( x ) with a ( x ) = 1 2 G − 3 ( x ) ; for x ≥ 4 , S 0 ( 4 ) , S 1 ( 4 ) , S 2 ( 4 ) , S 3 ( 4 ) ( x ) = 1 , b ( x ) , 0 , − b ( x ) with b ( x ) = 1 2 G − 4 ( x ) .
(ii)
For κ ≥ 0 , every c and every x > 0 , S 3 c ( 3 κ + 1 ) ( x ) = S c ( 3 κ ) ( x / 3 ) ; for a unit v mod 3 κ , S v ( 3 κ ) ( x ) = φ ( 3 κ ) − 1 ∑ χ mod 3 κ χ ¯ ( v ) G χ ( x ) .
(iii)
The energy E κ ( x ) = ∑ c mod 3 κ S c ( 3 κ ) ( x ) 2 of level κ satisfies
E κ ( x ) = E κ − 1 ( x / 3 ) + 1 φ ( 3 κ ) ∑ χ mod 3 κ | G χ ( x ) | 2 ( κ ≥ 1 ) .
(iv)
If 3 κ > x the classes are the leaves S r ( 3 κ ) ( x ) = M ( x / r ) , and E ∞ ( x ) = ∑ r ≤ x M ( x / r ) 2 . RH holds if and only if E ∞ ( x ) ≪ ε x 1 + ε for every ε > 0 .
Theorem 2 
(the carriers). For every character χ, prime p and e ≥ 1 , ( μ ∗ χ ) ( p e ) = χ ( p ) e − 1 ( χ ( p ) − 1 ) . Hence μ ∗ χ vanishes on every multiple of a prime p with χ ( p ) = 1 ; for χ mod m this includes every prime p ≡ 1 ( mod m ) . In particular μ ∗ χ − 3 is supported on the integers 3 j n with j ∈ { 0 , 1 } and n composed of primes ≡ 2 ( mod 3 ) , where ( μ ∗ χ − 3 ) ( 3 j n ) = ( − 1 ) j + Ω ( n ) 2 ν ( n ) .
Theorem 3 
(the triad at a zero). Let A c ( s ) = ∑ n ≡ c ( 3 ) n − s and B c ( s ) = ∑ n ≡ c ( 4 ) n − s . Then A 0 = 3 − s ζ ( s ) , A c = 3 − s ζ ( s , c / 3 ) for c = 1 , 2 , A 1 + A 2 = ( 1 − 3 − s ) ζ ( s ) and A 1 − A 2 = L ( s , χ − 3 ) , and at every nontrivial zero ρ of ζ
A 0 , A 1 , A 2 ( ρ ) = 0 , 1 2 L ( ρ , χ − 3 ) , − 1 2 L ( ρ , χ − 3 ) , B 0 , B 1 , B 2 , B 3 ( ρ ) = 0 , 1 2 L ( ρ , χ − 4 ) , 0 , − 1 2 L ( ρ , χ − 4 ) .
The Dirichlet series whose summatory function is S c ( m ) is m − s ζ ( s , c / m ) / ζ ( s ) ( c ≢ 0 ), and at a simple zero ρ the residue of m − s ζ ( s , c / m ) x s / ( s ζ ( s ) ) , the coefficient of the wave x ρ of S c ( m ) ( x ) , is m − ρ ζ ( ρ , c / m ) x ρ / ( ρ ζ ′ ( ρ ) ) .
Theorem 4 
(primes, squares and wheels).
(i)
(window law) For consecutive primes p < p ′ , the integers in [ p , p p ′ ) with no prime factor below p are exactly the primes in [ p , p p ′ ) together with p 2 .
(ii)
(squares land in one class) For every prime p ≥ 5 , p 2 ≡ 1 ( mod 24 ) .
(iii)
(crossing law) In any increasing sequence of integers ≡ ± 1 ( mod 6 ) , in particular the primes ≥ 5 with or without the prime squares inserted, the number of gaps ≡ 2 ( mod 6 ) and the number of gaps ≡ 4 ( mod 6 ) differ by at most 1.
Theorem 5 
(the logarithm of the wheel). Let W be squarefree.
(i)
For σ > 1 , ∑ ( n , W ) = 1 n − s = ζ ( s ) ∏ q ∣ W ( 1 − q − s ) , and every zero of ζ with σ > 0 is a zero of this function of the same order. The count Φ W ( x ) = # { n ≤ x : ( n , W ) = 1 } satisfies Φ W ( x ) − x φ ( W ) / W = − ∑ d ∣ W μ ( d ) { x / d } , periodic with period W and bounded by 2 ν ( W ) .
(ii)
log ζ ( s ) = ∑ p ∑ k ≥ 1 p − k s / k = ∫ 1 ∞ x − s d J ( x ) for σ > 1 : each prime square enters with weight 1 2 , and π ( x ) = ∑ k ≥ 1 μ ( k ) J ( x 1 / k ) / k .
(iii)
π ( x ) − li ( x ) = J ( x ) − li ( x ) + log 2 − 1 2 li ( x ) + O x e − c log x , and J ( x ) − li ( x ) + log 2 = − ∑ ρ li ( x ρ ) + ∫ x ∞ d t t ( t 2 − 1 ) log t for x > 1 , with J taken at its jumps as the mean of its one-sided limits.
(iv)
L ( x ) = ∑ d ≤ x M ( x / d 2 ) .
(v)
ψ ( x ; 6 , 1 ) − ψ ( x ; 6 , 5 ) − θ ( x ; 6 , 1 ) − θ ( x ; 6 , 5 ) = θ ( x ) − log 6 + O ( x 1 / 3 log x ) for x ≥ 9 .
Theorem 6 
(the square-root horizon). Let S ( s ) = ∑ p ∑ k ≥ 2 p − k s / k , E = e S and F = ζ / E .
(i)
S converges absolutely for σ > 1 2 , where S ( s ) = − ∑ k ≥ 2 μ ( k ) k − 1 log ζ ( k s ) ; E is analytic and zero-free there; F is meromorphic in σ > 1 2 , equals exp ∑ p p − s for σ > 1 , and has exactly the zeros of ζ, with the same orders.
(ii)
For σ > 1 2 and all real t, E ( σ ) 3 | E ( σ + i t ) | 4 | E ( σ + 2 i t ) | ≥ 1 .
(iii)
E ( s ) 2 = ζ ( 2 s ) exp − 2 ∑ k ≥ 3 μ ( k ) k − 1 log ζ ( k s ) extends meromorphically to σ > 1 3 ; on σ ≥ 1 2 its only singularity is a simple pole at s = 1 2 and it has no zeros there. Hence F ( s ) 2 has a simple zero at s = 1 2 , and
log E ( σ ) + 1 2 log ( 2 σ − 1 ) → C E , log | F ( σ ) | − 1 2 log ( 2 σ − 1 ) → log | ζ ( 1 2 ) | − C E ( σ ↓ 1 2 ) ,
with C E = − ∑ k ≥ 3 μ ( k ) k − 1 log ζ ( k / 2 ) = 0.36399 and log | ζ ( 1 2 ) | − C E = 0.01469 .
(iv)
At every zero ρ = 1 2 + i γ the squared pair Q ζ ( σ , t ) = 3 log | ζ ( σ ) | + 4 log | ζ ( σ + i t ) | + log | ζ ( σ + 2 i t ) | tends to − ∞ as σ → 1 2 + with t = γ , and so does the squared pair Q F of the prime factor.
Theorem 7 
(the prime term at every height). Let ( ϑ p ) be independent and uniform on [ 0 , 2 π ) and σ > 0 .
(i)
The flow t ↦ ( t log p / 2 π mod 1 ) p ≤ y is equidistributed on the torus ( R / Z ) π ( y ) for every y.
(ii)
E ∑ p ≤ y p − σ e i ϑ p 2 = ∑ p ≤ y p − 2 σ , and ∑ p p − σ e i ϑ p converges almost surely if and only if σ > 1 2 .
(iii)
For σ > 1 2 the random Euler product Z σ = ∏ p ( 1 − p − σ e i ϑ p ) − 1 converges almost surely and in mean square, Z σ ≠ 0 almost surely, and E | Z σ | 2 = ζ ( 2 σ ) = ∑ n n − 2 σ .
(iv)
(Hardy and Littlewood; Bohr and Landau; Selberg; Bohr and Jessen) For fixed σ > 1 2 , 1 T ∫ 1 T | ζ ( σ + i t ) | 2 d t → ζ ( 2 σ ) ; the number N ( σ , T ) of zeros with β > σ , 0 < γ ≤ T is O ( T ) and O ( T 1 − ( σ − 1 2 ) / 4 log T ) , so that these zeros form a proportion O ( 1 / log T ) of all zeros up to height T; and log ζ ( σ + i t ) has an absolutely continuous limiting distribution.
Theorem 8 
(the reversed pattern).
(i)
For σ > 1 , ∏ p ( 1 + p − s ) − 1 = ζ ( 2 s ) / ζ ( s ) = ∑ n λ ( n ) n − s . Every zero of ζ with β ≥ 1 2 is a pole of ζ ( 2 s ) / ζ ( s ) of the same order; its centre s = 1 2 is a simple pole with residue 1 / ( 2 ζ ( 1 2 ) ) .
(ii)
Forward times reversed is the pattern of the squares: ζ ( s ) · ζ ( 2 s ) / ζ ( s ) = ζ ( 2 s ) , that is ∑ d ∣ n λ ( d ) = [ n is a square ] , and
∑ n ≤ x L ( x / n ) = ⌊ x ⌋ ( x > 0 ) .
(iii)
∑ n ≥ 1 λ ( n ) / n = 0 , and for every x > 0 the series ∑ k ≥ 1 λ ( k ) { x / k } converges, with
− ∑ k ≥ 1 λ ( k ) { x / k } = ⌊ x ⌋ , ∑ k ≤ N λ ( k ) { x / k } = x l ( N ) − ⌊ x ⌋ ( N ≥ x ) ,
where l ( N ) = ∑ k ≤ N λ ( k ) / k .
For t > 0 let ς k ( t ) = { 1 / ( k t ) } , let f ( t ) = 1 if 0 < t ≤ 1 and ⌊ t − 1 / 2 ⌋ is odd and f ( t ) = 0 otherwise (the odd-square staircase), and let
D N 2 = min c ∈ R N ∥ f − ∑ k ≤ N c k ς k ∥ L 2 ( 0 , ∞ ) 2 , d N 2 = min c ∈ R N ∥ χ ( 0 , 1 ] − ∑ k ≤ N c k ς k ∥ L 2 ( 0 , ∞ ) 2 .
Theorem 9 
(the reversed staircase).
(i)
∥ f ∥ 2 = η ( 2 ) = π 2 / 12 and ∫ 0 ∞ f ( t ) t s − 1 d t = η ( 2 s ) / s for σ > 0 ; and for every t > 0
− ∑ k ≥ 1 λ ( k ) − 2 λ ( k / 4 ) [ 4 ∣ k ] ς k ( t ) = f ( t ) ,
the Dirichlet series of the weights being η ( 2 s ) / ζ ( s ) .
(ii)
If D N → 0 as N → ∞ , then ζ ( s ) ≠ 0 for σ > 1 2 , and every zero of ζ in the critical strip lies on the line σ = 1 2 .
(iii)
For every N, every c ∈ R N and every zero ρ = 1 2 + i γ , the Mellin transform of f − ∑ k ≤ N c k ς k at ρ equals η ( 2 ρ ) / ρ = η ( 1 + 2 i γ ) / ρ ; for the unit step it equals 1 / ρ .
Theorem 10 
(prime clocks; Landau [33]). For fixed x > 1 , ∑ 0 < γ ≤ T x ρ = − T 2 π Λ ( x ) + O ( log T ) . Consequently, when the zeros up to height T lie on the line, 1 N ( T ) ∑ 0 < γ ≤ T cos ( γ log x ) = − T 2 π N ( T ) Λ ( x ) x + O log T N ( T ) , and for each prime p and each k ≥ 1 the k-th Fourier coefficient of the distribution of the readings γ log p / 2 π mod 1 of the clock t ↦ p i t is − T 2 π N ( T ) p − k / 2 log p + O log T N ( T ) .

1.2. Main Computations

The exact sieve to 10 10 gives the class values of the triad tower at x = 10 10 at every level, with M ( 10 10 ) = − 33 , 722 , G − 3 ( 10 10 ) = − 25 , 880 , G − 4 ( 10 10 ) = − 66 , 506 and the level-two sums in Z [ ω ] (Table 1); the wave amplitudes of M, a and b at the first twelve zeros agree with Theorem 3 to within 0.0003 , and their energies agree with the sums over the 2469 zeros below height 3000 to within 1 % (Table 3 and Table 4, Figure 1). The prime gaps up to 61 with 25 and 49 inserted, the balance 9 : 9 of the classes 6 k ± 1 , and the class counts to 10 8 are in Section 3. The leans of four prime counts over 2 12 ≤ x ≤ 10 10 , with and without the squares at weight 1 2 , and the fitted square weight 0.4994 are in Table 7 and Figure 2. The half-order limits of the squares part and the prime factor, and the reach of the squared pair of ζ at 138 zeros up to height 3000, are in Table 8 and Table 9 and Figure 3. The value distribution of log | ζ ( σ + i t ) | at 6000 heights in [ 5000 , 6000 ] and its deepest dips below height 3000 are in Table 10 and Figure 4. The reversal identities are checked in Table 14, and the identity at the first five zeros in Table 13. The exact weights of the staircase, cut at N, are in Table 15. The distances D N and d N , computed from exact integrals for N ≤ 2000 , are in Table 16 and Table 17 and Figure 7; Landau’s formula and the density of the zeros on the clock of 2 are in Table 18 and Table 19 and Figure 8. The forward and reversed terms, the zeros of the pair truncated without its remainder, and the Jensen chains of Ξ are in Table 11 and Figure 5 and Figure 6.

1.3. Organisation

Section 2 proves Theorems 1–3 and gives the tower at 10 10 . Section 3 proves Theorem 4 and gives the gaps and classes. Section 4 proves Theorem 5 and measures the leans. Section 5 proves Theorem 6. Section 6 proves Theorem 7(i)–(iii) and measures the value distribution. Section 7 states the axiom of harmonic independence, and Section 8 reads it at the midpoint: it compares the forward and reversed terms, computes the pair without its remainder and tests the Jensen polynomials of Ξ as chains. Section 9 proves Theorem 8. Section 10 proves Theorem 9 and computes the distances. Section 11 treats the prime clocks and the tenth zero. Section 12 describes the computations, Section 13 gathers the results, and Section 14 lists the external inputs.

2. The Triad Tower of the Rebuild Law

2.1. The Splits and the Tower

Proof of Theorem 1. 
(i) The integers r ≡ 0 ( mod 3 ) are r = 3 r ′ , so S 0 ( 3 ) ( x ) = ∑ r ′ ≤ x / 3 M ( ( x / 3 ) / r ′ ) = 1 for x ≥ 3 by (1) at x / 3 . By (1) at x, S 1 ( 3 ) + S 2 ( 3 ) = 1 − S 0 ( 3 ) = 0 , while S 1 ( 3 ) − S 2 ( 3 ) = ∑ r χ − 3 ( r ) M ( x / r ) = G − 3 ( x ) . The second expression for G χ in (2) follows from ∑ r n ≤ x χ ( r ) μ ( n ) = ∑ k ≤ x ∑ r n = k χ ( r ) μ ( n ) . Modulo 4: S 0 ( 4 ) ( x ) = 1 for x ≥ 4 as before; S 0 ( 4 ) + S 2 ( 4 ) = ∑ r even M ( x / r ) = 1 for x ≥ 2 by (1) at x / 2 , so S 2 ( 4 ) = 0 for x ≥ 4 ; S 1 ( 4 ) + S 3 ( 4 ) = 1 − 1 = 0 and S 1 ( 4 ) − S 3 ( 4 ) = G − 4 ( x ) .
(ii) The integers r ≡ 3 c ( mod 3 κ + 1 ) are r = 3 r ′ with r ′ ≡ c ( mod 3 κ ) , and M ( x / ( 3 r ′ ) ) = M ( ( x / 3 ) / r ′ ) . For a unit v, orthogonality ∑ χ mod q χ ¯ ( v ) χ ( r ) = φ ( q ) [ r ≡ v ( q ) ] gives the character formula.
(iii) Split the classes modulo 3 κ into the multiples of 3, whose squares sum to E κ − 1 ( x / 3 ) by (ii), and the units. By (ii) and orthogonality, ∑ v | S v | 2 = φ ( 3 κ ) − 2 ∑ χ , χ ′ G χ ¯ G χ ′ ∑ v χ ( v ) χ ′ ¯ ( v ) = φ ( 3 κ ) − 1 ∑ χ | G χ | 2 .
(iv) If 3 κ > x each class contains at most one r ≤ x . If RH holds then M ( y ) ≪ ε y 1 / 2 + ε [58, Theorem 14.25(C)], so E ∞ ( x ) ≪ ∑ r ≤ x ( x / r ) 1 + 2 ε ≤ ζ ( 1 + 2 ε ) x 1 + 2 ε . Conversely M ( x ) 2 is the term r = 1 of E ∞ ( x ) , so E ∞ ( x ) ≪ x 1 + ε gives M ( x ) ≪ x 1 / 2 + ε / 2 , and RH follows by the same theorem. □
The principal character modulo 3 κ contributes nothing to (3) once x ≥ 3 : G χ 0 ( x ) = ∑ 3 ∤ r M ( x / r ) = 1 − S 0 ( 3 ) ( x ) = 0 . At level one the recursion reads E 1 ( x ) = 1 + 1 2 G − 3 ( x ) 2 for x ≥ 3 . The tower therefore stores the rebuild law in a self-similar way: every zero class is the whole tower one level down at x / 3 , and each level adds only the character sums of its unit classes.

2.2. The Carriers

Proof of Theorem 2. 
For e ≥ 1 , ( μ ∗ χ ) ( p e ) = ∑ j = 0 e μ ( p j ) χ ( p ) e − j = χ ( p ) e − χ ( p ) e − 1 (with 0 0 = 1 ), which is χ ( p ) e − 1 ( χ ( p ) − 1 ) , and μ ∗ χ is multiplicative. If χ ( p ) = 1 the value is 0 for every e ≥ 1 . For χ − 3 : χ − 3 ( 3 ) = 0 gives − 1 at 3 and 0 at 3e, e ≥ 2 ; χ − 3 ( p ) = − 1 gives 2 ( − 1 ) e at p e . □
So G − 3 ( x ) = 2 a ( x ) is a signed count of the integers built from the primes ≡ 2 ( mod 3 ) and at most one factor 3, each weighted ± 2 ν ( n ) ; the primes ≡ 1 ( mod 3 ) do not enter it, and neither do the multiples of 9. Up to 2 · 10 5 these integers are 28.59 % of all integers. The same holds at every modulus: the unit classes of the tower modulo 3 κ are built from μ ∗ χ for the characters χ mod 3 κ , which vanish on every multiple of a prime ≡ 1 ( mod 3 κ ) .

2.3. The Triad at a Zero and the Waves

Proof of Theorem 3. 
For c = 1 , 2 , A c ( s ) = ∑ n ≥ 0 ( 3 n + c ) − s = 3 − s ζ ( s , c / 3 ) , and A 0 ( s ) = 3 − s ζ ( s ) ; these continue to C ∖ { 1 } [1, Ch. 12]. The identities A 0 + A 1 + A 2 = ζ and A 1 − A 2 = L ( s , χ − 3 ) hold for σ > 1 and hence everywhere, so A 1 + A 2 = ( 1 − 3 − s ) ζ ( s ) , and at a zero ρ of ζ , A 0 ( ρ ) = 0 and A 1 ( ρ ) = − A 2 ( ρ ) = 1 2 L ( ρ , χ − 3 ) . Modulo 4, B 0 = 4 − s ζ ( s ) , B 2 = 4 − s ζ ( s , 1 2 ) = 4 − s ( 2 s − 1 ) ζ ( s ) , B 1 + B 3 = ( 1 − 2 − s ) ζ ( s ) and B 1 − B 3 = L ( s , χ − 4 ) . The Dirichlet series whose summatory function is S c ( m ) is ∑ r ≡ c r − s ∑ n μ ( n ) n − s = m − s ζ ( s , c / m ) / ζ ( s ) , and at a simple zero the residue of m − s ζ ( s , c / m ) x s / ( s ζ ( s ) ) is m − ρ ζ ( ρ , c / m ) x ρ / ( ρ ζ ′ ( ρ ) ) , which, when the zeros are simple, is the coefficient of x ρ in the explicit formula, by the argument of [58, Theorem 14.27] for M ( x ) . □
The residue vanishes for the class 0 mod 3 and the classes 0 , 2 mod 4 , which are constant. For a zero ρ = 1 2 + i γ and its conjugate, the waves of M ( x ) / x , a ( x ) / x and b ( x ) / x in the doubling variable u have pitch γ log 2 / 2 π and amplitudes
2 | ρ ζ ′ ( ρ ) | , | L ( ρ , χ − 3 ) | | ρ ζ ′ ( ρ ) | , | L ( ρ , χ − 4 ) | | ρ ζ ′ ( ρ ) | ,
and the mean square over u of a sum of waves of distinct pitches is half the sum of their squared amplitudes:
e M = ∑ γ > 0 2 | ρ ζ ′ ( ρ ) | 2 , e a = ∑ γ > 0 | L ( ρ , χ − 3 ) | 2 2 | ρ ζ ′ ( ρ ) | 2 , e b = ∑ γ > 0 | L ( ρ , χ − 4 ) | 2 2 | ρ ζ ′ ( ρ ) | 2 .

2.4. Level Two in Eisenstein Integers

The group ( Z / 9 Z ) × is cyclic of order 6, generated by 2. Let ω = e 2 π i / 3 , so that ω 2 = − 1 − ω , and let χ 9 be the cubic character with χ 9 ( 2 ) = ω : χ 9 ( 1 ) = χ 9 ( 8 ) = 1 , χ 9 ( 2 ) = χ 9 ( 7 ) = ω , χ 9 ( 4 ) = χ 9 ( 5 ) = ω 2 . The six characters modulo 9 are χ 0 , χ − 3 , χ 9 , χ 9 ¯ , χ 9 χ − 3 , χ 9 ¯ χ − 3 , and all their values lie in the Eisenstein integers Z [ ω ] . Put G 9 = G χ 9 and G 9 * = G χ 9 χ − 3 , which lie in Z [ ω ] , and Tr ( a 1 + a 2 ω ) = 2 a 1 − a 2 for integers a 1 , a 2 . Since μ is real, G χ 9 ¯ = G 9 ¯ and G χ 9 ¯ χ − 3 = G 9 * ¯ , and Theorem 1(ii) gives, for x ≥ 9 and every unit v mod 9 ,
S v ( 9 ) ( x ) = 1 6 χ − 3 ( v ) G − 3 ( x ) + Tr χ 9 ¯ ( v ) G 9 ( x ) + χ − 3 ( v ) Tr χ 9 ¯ ( v ) G 9 * ( x ) ,
together with S 0 ( 9 ) ( x ) = 1 and S 3 ( 9 ) ( x ) = − S 6 ( 9 ) ( x ) = 1 2 G − 3 ( x / 3 ) . The whole of level two is thus computed in exact integer arithmetic in Z [ ω ] , with no complex numbers.

2.5. The Tower at 10 10

The exact sieve to X = 10 10 gives M ( X ) = − 33 , 722 , G − 3 ( X ) = − 25 , 880 , G − 4 ( X ) = − 66 , 506 , G 9 ( X ) = 6679 + 32060 ω , G 9 * ( X ) = − 34989 − 6254 ω and G − 3 ( X / 3 ) = 23 , 700 . By Theorem 1 and (8) these give the class values of Table 1. Independently, the leaves M ( X / r ) give ∑ r ≤ X M ( X / r ) = 1 and the same class values modulo 3, 4 and 9; for instance (8) at v = 2 reads 1 6 ( 25880 + 57441 − 22481 ) = 10140 . For every integer 3 ≤ x < 5000 the splits of Theorem 1(i) hold exactly in their stated ranges.
Table 1. The rebuild law at x = 10 10 split by r mod 3 , r mod 4 and r mod 9 . Each row sums to 1; the classes 1 , 4 , 7 mod 9 sum to S 1 ( 3 ) and the classes 2 , 5 , 8 to S 2 ( 3 ) .
Table 1. The rebuild law at x = 10 10 split by r mod 3 , r mod 4 and r mod 9 . Each row sums to 1; the classes 1 , 4 , 7 mod 9 sum to S 1 ( 3 ) and the classes 2 , 5 , 8 to S 2 ( 3 ) .
class c 0 1 2 3 4 5 6 7 8
S c ( 3 ) ( 10 10 ) 1 − 12 , 940 12 , 940
S c ( 4 ) ( 10 10 ) 1 − 33 , 253 0 33 , 253
S c ( 9 ) ( 10 10 ) 1 − 18 , 051 10 , 140 11 , 850 − 3 , 896 − 9 , 017 − 11 , 850 9 , 007 11 , 817
Table 2 gives the energy of every level up to κ = 12 and the largest class value; the leaves are reached at κ = 21 , where E ∞ ( 10 10 ) = 20 , 349 , 625 , 023 = 2.0350 x .
Table 2. Energy and largest class of the triad tower at x = 10 10 , level by level. At every level the largest class is at most 0.3396 x ; from κ = 3 on it is the class of r = 1 , whose value tends to M ( x ) = − 0.3372 x (it is − 33 , 724 at κ = 9 and − 33 , 721 at κ = 12 ).
Table 2. Energy and largest class of the triad tower at x = 10 10 , level by level. At every level the largest class is at most 0.3396 x ; from κ = 3 on it is the class of r = 1 , whose value tends to M ( x ) = − 0.3372 x (it is − 33 , 724 at κ = 9 and − 33 , 721 at κ = 12 ).
κ 1 2 3 4 5 6 7
E κ / x 0.0335 0.1027 0.2713 0.2666 0.2932 0.3301 0.3534
max c | S c | / x 0.1294 0.1805 0.3331 0.3312 0.3396 0.3376 0.3375
κ 8 9 10 11 12 leaves
E κ / x 0.3844 0.4111 0.5043 0.5189 0.5545 2.0350
max c | S c | / x 0.3371 0.3372 0.3372 0.3372 0.3372 0.3372

Waves

On the grid u = 12 + 0.001 j , 2 12 ≤ x ≤ 10 10 , the amplitudes of M ( x ) / x , a ( x ) / x and b ( x ) / x at the pitches of the first twelve zeros agree with (6) to within 0.0003 (Table 3). The sixth zero has | L ( ρ 6 , χ − 3 ) | = 0.0796 , and its wave is nearly silent in the triad charge: 0.0012 measured, 0.0011 predicted, against 0.0274 in M. The tenth zero has | L ( ρ 10 , χ − 4 ) | = 0.1892 and its wave is nearly silent in the four-split charge: 0.0028 measured, 0.0027 predicted. At the twelve zeros the computed residuals | A 0 ( ρ ) | and | A 1 ( ρ ) + A 2 ( ρ ) | are of order 10 − 14 , the precision of the zeros.
Table 3. Wave amplitudes (units of x ) of M, of the triad charge a and of the four-split charge b at the pitches γ log 2 / 2 π (turns per doubling) of the first twelve zeros: measured from the counts to 10 10 and predicted by (6). The last two columns are | A 1 ( ρ ) | and | B 1 ( ρ ) | .
Table 3. Wave amplitudes (units of x ) of M, of the triad charge a and of the four-split charge b at the pitches γ log 2 / 2 π (turns per doubling) of the first twelve zeros: measured from the counts to 10 10 and predicted by (6). The last two columns are | A 1 ( ρ ) | and | B 1 ( ρ ) | .
γ pitch M meas. pred. a meas. pred. b meas. pred. 1 2 | L ( ρ , χ − 3 ) | 1 2 | L ( ρ , χ − 4 ) |
14.1347 1.5593 . 1784 . 1783 . 2584 . 2582 . 1988 . 1987 1.4484 1.1143
21.0220 2.3191 . 0836 . 0837 . 0585 . 0587 . 0469 . 0468 . 7011 . 5598
25.0109 2.7591 . 0583 . 0583 . 0523 . 0525 . 0541 . 0541 . 9000 . 9286
30.4249 3.3564 . 0505 . 0504 . 0254 . 0253 . 0552 . 0551 . 5013 1.0935
32.9351 3.6333 . 0440 . 0439 . 0631 . 0629 . 0189 . 0187 1.4321 . 4262
37.5862 4.1464 . 0274 . 0275 . 0012 . 0011 . 0359 . 0358 . 0398 1.3046
40.9187 4.5141 . 0329 . 0328 . 0704 . 0704 . 0190 . 0190 2.1484 . 5810
43.3271 4.7797 . 0253 . 0252 . 0140 . 0139 . 0454 . 0453 . 5540 1.8010
48.0052 5.2958 . 0266 . 0266 . 0209 . 0208 . 0135 . 0132 . 7839 . 4964
49.7738 5.4909 . 0284 . 0283 . 0372 . 0371 . 0028 . 0027 1.3118 . 0946
52.9703 5.8436 . 0154 . 0156 . 0083 . 0084 . 0050 . 0050 . 5374 . 3192
56.4462 6.2270 . 0150 . 0150 . 0139 . 0139 . 0094 . 0093 . 9269 . 6236

Energies

The mean squares over the same grid, and over its two halves, agree with the sums (7) over the 2469 zeros with 0 < γ < 3000 , completed by a tail beyond 3000 estimated from the mean of γ 2 times the summand over 2000 < γ < 3000 and the density 1 2 π log t 2 π of the zeros (Table 4).
Table 4. Mean square over 2 12 ≤ x ≤ 10 10 in doublings, against the energies (7).
Table 4. Mean square over 2 12 ≤ x ≤ 10 10 in doublings, against the energies (7).
measured first half second half zeros < 3000 with tail
M ( x ) / x 0.02900 0.02857 0.02943 0.02897 0.02904
a ( x ) / x 0.04864 0.04869 0.04859 0.04868 0.04890
b ( x ) / x 0.03033 0.03017 0.03048 0.03011 0.03022
Figure 1. (a) The triad charge a ( x ) / x (classes ± 1 mod 3 ) and the four-split charge b ( x ) / x (classes 1 , 3 mod 4 ) for 2 12 ≤ x ≤ 10 10 , from the exact sieve. (b) Amplitude spectra in doublings of a ( x ) / x and M ( x ) / x , with the amplitudes | L ( ρ , χ − 3 ) | / | ρ ζ ′ ( ρ ) | (circles) and 2 / | ρ ζ ′ ( ρ ) | (squares) of (6) at the pitches of the zeros. The sixth wave is nearly silent in the triad charge.
Figure 1. (a) The triad charge a ( x ) / x (classes ± 1 mod 3 ) and the four-split charge b ( x ) / x (classes 1 , 3 mod 4 ) for 2 12 ≤ x ≤ 10 10 , from the exact sieve. (b) Amplitude spectra in doublings of a ( x ) / x and M ( x ) / x , with the amplitudes | L ( ρ , χ − 3 ) | / | ρ ζ ′ ( ρ ) | (circles) and 2 / | ρ ζ ′ ( ρ ) | (squares) of (6) at the pitches of the zeros. The sixth wave is nearly silent in the triad charge.
Preprints 237341 g001

3. Prime Gaps with the Prime Squares

Proof of Theorem 4. 
(i) Let n ∈ [ p , p p ′ ) be composite with no prime factor below p, and write n = q 1 q 2 ⋯ q j with j ≥ 2 and p ≤ q 1 ≤ q 2 ≤ … . If q 2 ≥ p ′ then n ≥ p p ′ , which is excluded; so q 1 = q 2 = p , the only prime in [ p , p ′ ) . If j ≥ 3 then n ≥ p 3 > p p ′ , because p 2 ≥ 2 p > p ′ by Bertrand’s postulate. Hence n = p 2 , which lies in the window since p < p ′ . Conversely every prime in [ p , p p ′ ) and p 2 have no prime factor below p. (ii) An odd square is ≡ 1 ( mod 8 ) , and a square prime to 3 is ≡ 1 ( mod 3 ) . (iii) For integers ≡ ± 1 ( mod 6 ) , a gap ≡ 2 ( mod 6 ) leads from the class − 1 to the class + 1 , a gap ≡ 4 from + 1 to − 1 , and a gap ≡ 0 stays in its class. The crossings therefore alternate in direction, and the two counts differ by [ n last ≡ 1 ] − [ n first ≡ 1 ] ∈ { − 1 , 0 , 1 } . By (ii) every prime square ≥ 25 is ≡ 1 ( mod 6 ) . □
Corollary 1 
(each square opens the next wheel). Let W p = ∏ q < p q . On [ p , p p ′ ) the gaps between consecutive members of the primes together with p 2 are the gaps of the wheel of integers prime to W p . The least composite member of this wheel is p 2 , and the next is p p ′ .
For p = 5 the window is [ 5 , 35 ) and the wheel is that of 6: the numbers 5 , 7 , 11 , 13 , 17 , 19 , 23 , 25 , 29 , 31 have gaps 2 , 4 , 2 , 4 , … . For p = 7 the window is [ 7 , 77 ) and the wheel is that of 30; for p = 11 it is [ 11 , 143 ) and the wheel of 210. We have checked the window law directly through p = 19 . The wheel of 30 is symmetric about 30, since gcd ( n , 30 ) = gcd ( 60 − n , 30 ) : its members in ( 0 , 60 ) lie at the distances 1, 7, 11, 13, 17, 19, 23, 29 from 30 on both sides, and 49 = 60 − 11 , 59 = 60 − 1 . With 49 inserted, the gaps from 7 to 67 are the gaps of the wheel of 30, namely 4 , 2 , 4 , 2 , 4 , 6 , 2 , 6 , twice.

3.1. Gaps and Classes Up to 61

From 5 to 59 the gaps of the primes are
2 , 4 , 2 , 4 , 2 , 4 , 6 , 2 , 6 , 4 , 2 , 4 , 6 , 6 ,
and with 25 and 49 inserted they are
2 , 4 , 2 , 4 , 2 , 4 , 2 , 4 , 2 , 6 , 4 , 2 , 4 , 2 , 4 , 6 .
Table 5 lists the ten triads 6 k − 1 , 6 k , 6 k + 1 up to 61. Without the squares the classes 6 k − 1 and 6 k + 1 hold 9 and 7 primes, and the four gaps of length 6 ( 23 → 29 , 31 → 37 , 47 → 53 , 53 → 59 ) pass over 25, 35, 49 and 55: three times over the class + 1 and once over the class − 1 . With the squares inserted the two classes stand 9 : 9 , each with exactly one composite not a square, 35 = 5 · 7 and 55 = 5 · 11 , and the two remaining gaps of length 6 pass over these two, one in each class. The gaps ≡ 2 and ≡ 4 ( mod 6 ) number 5 and 5 without the squares and 7 and 7 with them.
Table 5. The ten triads up to 61. The class 6 k − 1 holds nine primes and the composite 35; the class 6 k + 1 holds seven primes, the two squares 25 and 49, and the composite 55.
Table 5. The ten triads up to 61. The class 6 k − 1 holds nine primes and the composite 35; the class 6 k + 1 holds seven primes, the two squares 25 and 49, and the composite 55.
k 6 k − 1 6 k 6 k + 1 k 6 k − 1 6 k 6 k + 1
1 5 6 7 6 35 = 5 · 7 36 37
2 11 12 13 7 41 42 43
3 17 18 19 8 47 48 49 = 7 2
4 23 24 25 = 5 2 9 53 54 55 = 5 · 11
5 29 30 31 10 59 60 61

3.2. Beyond 61

Up to 10 8 the gaps between consecutive primes from 5 on number 1 , 616 , 470 ( ≡ 2 mod 6 ), 1 , 616 , 470 ( ≡ 4 ) and 2 , 528 , 512 ( ≡ 0 ). Table 6 compares the two classes with the prime squares counted at weight 0, 1 and 1 2 . At weight 1 the class 6 k + 1 pulls ahead as the squares accumulate; at weight 1 2 the difference stays within the oscillation carried by the zeros of L ( s , χ − 3 ) , of scale x / log x , which is 543 at 10 8 . Section 4 explains the weight 1 2 .
Table 6. The classes 6 k − 1 and 6 k + 1 of the primes up to x, the number of prime squares p 2 ≤ x with p ≥ 5 (all in the class 6 k + 1 ), and π ( x ; 6 , 5 ) − π ( x ; 6 , 1 ) − w · # squares for w = 0 , 1 , 1 2 .
Table 6. The classes 6 k − 1 and 6 k + 1 of the primes up to x, the number of prime squares p 2 ≤ x with p ≥ 5 (all in the class 6 k + 1 ), and π ( x ; 6 , 5 ) − π ( x ; 6 , 1 ) − w · # squares for w = 0 , 1 , 1 2 .
x π ( x ; 6 , 5 ) π ( x ; 6 , 1 ) squares difference squares at weight 1 squares at weight 1 2
61 9 7 2 2 0 1
100 12 11 2 1 − 1 0
10 3 86 80 9 6 − 3 1.5
10 4 616 611 23 5 − 18 − 6.5
10 5 4 , 806 4 , 784 63 22 − 41 − 9.5
10 6 39 , 265 39 , 231 166 34 − 132 − 49
10 7 332 , 383 332 , 194 444 189 − 255 − 33
10 8 2 , 880 , 936 2 , 880 , 517 1 , 227 419 − 808 − 194.5

4. The Squares Carry the Lean

Proof of Theorem 5. 
(i) For σ > 1 , ∑ ( n , W ) = 1 n − s = ∑ n n − s ∑ d ∣ ( n , W ) μ ( d ) = ∑ d ∣ W μ ( d ) d − s ζ ( s ) . The finite product ∏ q ∣ W ( 1 − q − s ) is entire and has no zeros in σ > 0 , because | q − s | < 1 there. Likewise Φ W ( x ) = ∑ d ∣ W μ ( d ) ⌊ x / d ⌋ = x ∑ d ∣ W μ ( d ) / d − ∑ d ∣ W μ ( d ) { x / d } , with ∑ d ∣ W μ ( d ) / d = φ ( W ) / W ; each { x / d } has period d ∣ W , and W has 2 ν ( W ) divisors. (ii) log ζ ( s ) = − ∑ p log ( 1 − p − s ) = ∑ p ∑ k p − k s / k , and J jumps by 1 / k at each p k . Then ∑ k μ ( k ) k − 1 J ( x 1 / k ) = ∑ k , j μ ( k ) ( k j ) − 1 π ( x 1 / k j ) = ∑ n π ( x 1 / n ) n − 1 ∑ k ∣ n μ ( k ) = π ( x ) , all sums being finite. (iii) By definition π ( x ) = J ( x ) − 1 2 π ( x ) − ∑ k ≥ 3 π ( x 1 / k ) / k , the last sum is O ( x 1 / 3 ) , and π ( x ) = li ( x ) + O ( x e − c log x ) by the prime number theorem [21, Ch. 18]. The formula for J is Riemann’s [51], proved by von Mangoldt [62]. (iv) ζ ( 2 s ) / ζ ( s ) = ζ ( 2 s ) · ζ ( s ) − 1 gives λ ( n ) = ∑ d 2 ∣ n μ ( n / d 2 ) , so L ( x ) = ∑ d 2 m ≤ x μ ( m ) = ∑ d ≤ x M ( x / d 2 ) . (v) The left side is ∑ k ≥ 2 ∑ p k ≤ x log p [ p k ≡ 1 ] − [ p k ≡ 5 ] ( mod 6 ) . Powers of 2 and 3 are not prime to 6. For p ≥ 5 , p 2 ≡ 1 ( mod 6 ) by Theorem 4(ii), so k = 2 gives ∑ 5 ≤ p ≤ x log p = θ ( x ) − log 6 , and the terms k ≥ 3 total at most ∑ 3 ≤ k ≤ log 2 x θ ( x 1 / k ) = O ( x 1 / 3 log x ) . □

Three Weights for One Square 

Since p 2 = p , the prime square sits on its own square-root horizon, and three counts weigh it differently. The wheel of modulus W p counts p 2 as a member, with weight 1 (Corollary 1); the primes leave it out, with weight 0; the logarithm of the Euler product counts it with weight 1 2 (Theorem 5(ii)). By Theorem 5(i) every wheel series vanishes at every zero of ζ , yet its count carries no wave: its error is bounded and periodic, and for the wheel of ∏ p ≤ 37 p the spectrum in doublings of the error divided by x has amplitude at most 0.0018 at every pitch in [ 0.3 , 6 ] up to 10 10 (Section 12). The zeros become waves only through the logarithm, which turns each of them into a pole of ζ ′ / ζ , and the count that carries these waves with no term of order x / log x is J, in which the squares have weight 1 2 . By Theorem 5(iii), π ( x ) − li ( x ) contains in addition − 1 2 li ( x ) ∼ − x / log x : the lean of π against li is the square term. In the same way L ( x ) − M ( x ) = ∑ d ≥ 2 M ( x / d 2 ) carries the constant 1 / ζ ( 1 2 ) of the pole of ζ ( 2 s ) at s = 1 2 (Theorem 8(i)), and by Theorem 5(v) the difference θ ( x ; 6 , 1 ) − θ ( x ; 6 , 5 ) carries − θ ( x ) ∼ − x , while ψ ( x ; 6 , 1 ) − ψ ( x ; 6 , 5 ) = ψ ( x , χ − 3 ) + O ( log x ) is, by its explicit formula [21, Ch. 19], a sum of waves from the zeros of L ( s , χ − 3 ) . This is the mechanism of Chebyshev’s bias identified by Rubinstein and Sarnak [53].

4.1. Measurements

The exact counts to 10 10 (Section 12) give π , li, M, L, θ and ψ in the classes modulo 6 exactly. On the grid u = 12 + 0.001 j , 2 12 ≤ x ≤ 10 10 ( 21 , 220 points), Table 7 compares four counts with the squares left out and with the squares at weight 1 2 .
Table 7. The lean of four prime counts over 2 12 ≤ x ≤ 10 10 : mean over the grid, fraction of the grid where the count is positive, and number of sign changes on the grid. In ψ the prime power p k has weight log p = 1 k log p k , so its squares enter with weight 1 2 relative to their position; π □ ( x ) = # { p ≥ 5 : p 2 ≤ x } .
Table 7. The lean of four prime counts over 2 12 ≤ x ≤ 10 10 : mean over the grid, fraction of the grid where the count is positive, and number of sign changes on the grid. In ψ the prime power p k has weight log p = 1 k log p k , so its squares enter with weight 1 2 relative to their position; π □ ( x ) = # { p ≥ 5 : p 2 ≤ x } .
count squares mean time above 0 sign changes
( π ( x ) − li ( x ) ) log x / x left out − 1.364 0.000 0
( J ( x ) − li ( x ) + log 2 ) log x / x weight 1 2 + 0.0013 0.501 1816
L ( x ) / x = ∑ d M ( x / d 2 ) / x d 2 -multiples in − 0.6834 0.000 0
M ( x ) / x d 2 -multiples out − 0.0046 0.484 826
( θ ( x ; 6 , 1 ) − θ ( x ; 6 , 5 ) ) / x left out − 0.973 0.001 14
( ψ ( x ; 6 , 1 ) − ψ ( x ; 6 , 5 ) ) / x weight 1 2 − 0.0039 0.502 1273
( π ( x ; 6 , 5 ) − π ( x ; 6 , 1 ) ) log x / x left out + 1.157 1.000 0
( π ( x ; 6 , 5 ) − π ( x ; 6 , 1 ) − 1 2 π □ ( x ) ) log x / x weight 1 2 + 0.031 0.526 1408

The Balancing Weight

For π w ( x ) = π ( x ) + w π ( x ) + ∑ k ≥ 3 π ( x 1 / k ) / k , so that π 0 omits the squares and π 1 / 2 = J , the mean of ( π w ( x ) − li ( x ) + log 2 ) log x / x over the grid is linear in w: it is − 1.147 at w = 0 and + 1.150 at w = 1 , and it vanishes at w * = 0.4994 , with 0.4992 and 0.4997 on the two halves of the range. For the classes, the weight w that centres π ( x ; 6 , 5 ) − π ( x ; 6 , 1 ) − w π □ ( x ) is 0.514 ( 0.518 and 0.509 on the two halves).

The Waves are Unchanged

The amplitudes of ( J ( x ) − li ( x ) ) log x / x at the first eight zeros are 0.1419 , 0.0954 , 0.0798 , 0.0658 , 0.0609 , 0.0532 , 0.0492 and 0.0462 , against 2 / | ρ | = 0.1414 , 0.0951 , 0.0799 , 0.0657 , 0.0607 , 0.0532 , 0.0489 and 0.0462 , and π − li carries the same waves. The square weight moves the centre of the count and nothing else.

The Liouville Lean

L ( x ) − M ( x ) = ∑ d ≥ 2 M ( x / d 2 ) has mean − 0.6788 x over the grid, against 1 / ζ ( 1 2 ) = − 0.6848 ; it holds almost the whole lean of L, while M itself is centred. Tanaka [57] found L ( x ) ≤ 0 for 2 ≤ x < 906 , 150 , 257 , answering a question of Pólya [50]; in Table 7 the same count with its square multiples removed is M, which changes sign 826 times on the grid. Likewise π ( x ) < li ( x ) at every grid point, although π ( x ) − li ( x ) changes sign infinitely often [35], while J ( x ) − li ( x ) + log 2 changes sign 1816 times.
Figure 2. The squares carry the lean, 2 12 ≤ x ≤ 10 10 . (a) ( π ( x ) − li ( x ) ) log x / x and ( J ( x ) − li ( x ) + log 2 ) log x / x . (b) L ( x ) / x and M ( x ) / x , with 1 / ζ ( 1 2 ) dashed. (c) ( θ ( x ; 6 , 1 ) − θ ( x ; 6 , 5 ) ) / x and ( ψ ( x ; 6 , 1 ) − ψ ( x ; 6 , 5 ) ) / x . In each panel the count with the squares at weight 1 2 is centred and carries the same waves.
Figure 2. The squares carry the lean, 2 12 ≤ x ≤ 10 10 . (a) ( π ( x ) − li ( x ) ) log x / x and ( J ( x ) − li ( x ) + log 2 ) log x / x . (b) L ( x ) / x and M ( x ) / x , with 1 / ζ ( 1 2 ) dashed. (c) ( θ ( x ; 6 , 1 ) − θ ( x ; 6 , 5 ) ) / x and ( ψ ( x ; 6 , 1 ) − ψ ( x ; 6 , 5 ) ) / x . In each panel the count with the squares at weight 1 2 is centred and carries the same waves.
Preprints 237341 g002

5. The Square-Root Horizon

We call σ = 1 2 the square-root horizon: it is the line where the squares series ∑ p p − 2 σ , and with it the part of log ζ carried by the prime squares and higher powers, stops converging. Write P ( s ) = ∑ p p − s for σ > 1 , so that log ζ = P + S .
Proof of Theorem 6. 
(i) For σ > 1 2 , ∑ p ∑ k ≥ 2 | p − k s | / k ≤ ∑ p p − 2 σ ( 1 − p − σ ) − 1 < ∞ , uniformly on compact sets, so S is analytic and E = e S is analytic and zero-free there. For σ > 1 , log ζ ( s ) = ∑ m ≥ 1 P ( m s ) / m , and Möbius inversion, justified by absolute convergence, gives
P ( s ) = ∑ k ≥ 1 μ ( k ) k log ζ ( k s ) , S ( s ) = − ∑ k ≥ 2 μ ( k ) k log ζ ( k s ) .
For k ≥ 2 and σ > 1 2 , | log ζ ( k s ) | ≤ log ζ ( k σ ) ≤ ζ ( k σ ) − 1 ≪ 2 − k σ , so the second series converges to an analytic function of σ > 1 2 , which is S there. Since E has neither zeros nor poles in σ > 1 2 , F = ζ / E is meromorphic there with the zeros of ζ and their orders, and F = e P for σ > 1 . (ii) log | E ( σ + i t ) | = Re S = ∑ p ∑ k ≥ 2 p − k σ k − 1 cos ( k t log p ) , so, with θ = k t log p ,
3 log E ( σ ) + 4 log | E ( σ + i t ) | + log | E ( σ + 2 i t ) | = ∑ p ∑ k ≥ 2 p − k σ k ( 3 + 4 cos θ + cos 2 θ ) ,
an absolutely convergent series of terms p − k σ k · 2 ( 1 + cos θ ) 2 ≥ 0 . (iii) Since μ ( 2 ) = − 1 , (9) gives 2 S ( s ) = log ζ ( 2 s ) − 2 R ( s ) with R ( s ) = ∑ k ≥ 3 μ ( k ) k − 1 log ζ ( k s ) . For k ≥ 3 and σ > 1 3 , Re ( k s ) > 1 and the bound of (i) makes R analytic in σ > 1 3 . Hence E ( s ) 2 = ζ ( 2 s ) e − 2 R ( s ) continues meromorphically to σ > 1 3 . The factor e − 2 R has no zeros or poles; ζ ( 2 s ) has its only pole at s = 1 2 and no zeros with Re ( 2 s ) ≥ 1 [58, §3.3]. Since ζ ( 1 2 ) = − 1.4603 … ≠ 0 , F ( s ) 2 = ζ ( s ) 2 e 2 R ( s ) / ζ ( 2 s ) has a simple zero at s = 1 2 . For real σ → 1 2 + , ζ ( 2 σ ) = ( 2 σ − 1 ) − 1 + γ E + O ( 2 σ − 1 ) [58, §2.1], so log E ( σ ) + 1 2 log ( 2 σ − 1 ) = − R ( σ ) + O ( 2 σ − 1 ) → − R ( 1 2 ) = C E , and log | F ( σ ) | − 1 2 log ( 2 σ − 1 ) = log | ζ ( σ ) | − log E ( σ ) + 1 2 log ( 2 σ − 1 ) → log | ζ ( 1 2 ) | − C E . (iv) Let ρ = 1 2 + i γ have multiplicity m. As σ → 1 2 + , 3 log | ζ ( σ ) | → 3 log | ζ ( 1 2 ) | , log | ζ ( σ + 2 i γ ) | tends to log | ζ ( 1 2 + 2 i γ ) | or to − ∞ , and 4 log | ζ ( σ + i γ ) | = 4 m log ( σ − 1 2 ) + O ( 1 ) → − ∞ . So Q ζ ( σ , γ ) → − ∞ . By (iii), 3 log E ( σ ) = 3 2 log 1 2 σ − 1 + O ( 1 ) , while log | E ( σ + i γ ) | and log | E ( σ + 2 i γ ) | stay bounded, because E 2 is analytic and zero-free at 1 2 + i γ and 1 2 + 2 i γ ; hence Q F = Q ζ − Q E → − ∞ as well. □
Remark 1 
(the half-order zero is the square lean). The expansion P ( s ) = log ζ ( s ) − 1 2 log ζ ( 2 s ) − 1 3 log ζ ( 3 s ) − 1 5 log ζ ( 5 s ) + 1 6 log ζ ( 6 s ) − … of (9) is, term by term, Riemann’s expansion π ( x ) = J ( x ) − 1 2 J ( x ) − 1 3 J ( x 1 / 3 ) − … of Theorem 5(ii). The term − 1 2 log ζ ( 2 s ) , which near s = 1 2 is 1 2 log ( 2 s − 1 ) + O ( 1 ) , is the half-order zero of F = e P at the horizon, and in the count it is − 1 2 J ( x ) = − 1 2 li ( x ) + … , the lean of π against li measured in Section 4. The half-order pole of E at s = 1 2 is the same square term seen from the squares part.
Remark 2 
(edge and horizon). For ζ itself the squared pair is nonnegative for σ > 1 , ζ ( σ ) 3 | ζ ( σ + i t ) | 4 | ζ ( σ + 2 i t ) | ≥ 1 [37], [58, §3.3], from the identity 3 + 4 cos θ + cos 2 θ = 2 ( 1 + cos θ ) 2 ≥ 0 [58, (3.3.1)], which gives ζ ( 1 + i t ) ≠ 0 and, by the functional equation, ζ ( i t ) ≠ 0 . The inequality for ζ splits as Q ζ = Q E + Q F : the prime part Q F = ∑ p p − σ · 2 ( 1 + cos ( t log p ) ) 2 ≥ 0 holds for σ > 1 , and the squares part Q E ≥ 0 holds all the way down to the horizon by Theorem 6(ii). The zeros of ζ in σ > 1 2 are exactly those of the prime factor F (Theorem 6(i)). At the horizon the squares part has a half-order pole and the prime factor a half-order zero, and by Theorem 6(iv) the squared pair of ζ and of F is negative arbitrarily close to the horizon at the height of every zero on it.

5.1. Measurements

The Squares Part

By (9), log | E ( s ) | = − ∑ k ≥ 2 μ ( k ) k − 1 log | ζ ( k s ) | involves ζ only in σ > 1 . At 200 random points with 1 2 < σ < 1 and 1 < t < 61 the squared pair Q E has minimum 0.3355 . Table 8 shows the half-order limits of Theorem 6(iii).
Table 8. The half-order pole of the squares part E and the half-order zero of the prime factor F = ζ / E at s = 1 2 . The two limits add up to log | ζ ( 1 2 ) | = 0.37868 .
Table 8. The half-order pole of the squares part E and the half-order zero of the prime factor F = ζ / E at s = 1 2 . The two limits add up to log | ζ ( 1 2 ) | = 0.37868 .
σ 0.6 0.55 0.51 0.505 0.501 0.5001 limit
log E ( σ ) + 1 2 log ( 2 σ − 1 ) 0.29424 0.31979 0.35315 0.35842 0.36285 0.36387 0.36399
log | F ( σ ) | − 1 2 log ( 2 σ − 1 ) 0.37495 0.19824 0.05258 0.03374 0.01852 0.01507 0.01469

The Reach of the Squared Pair of ζ

For a zero 1 2 + i γ let its reach be the largest σ ∈ [ 0.5005 , 1 ] at which min | t − γ | ≤ 0.3 Q ζ ( σ , t ) < 0 . At the first 41 zeros and every 25th zero after them, 138 zeros in all up to height 3000, the reach lies between 0.546 and 0.847 (Table 9, Figure 3). For the prime factor alone the reach at the first twelve zeros is 0.888 , 0.862 , 0.855 , 0.869 , 0.848 , 0.798 , 0.837 , 0.806 , 0.852 , 0.856 , 0.775 and 0.773 . Above the reach the squared pair of ζ is nonnegative at the sampled points of the window, and at such points ζ has no zero; below it the band of negative values extends down to the zero on the horizon, as Theorem 6(iv) requires.
Table 9. Reach of the negative band of the squared pair Q ζ beside the zeros of ζ .
Table 9. Reach of the negative band of the squared pair Q ζ beside the zeros of ζ .
height of the zero < 50 50–100 100–300 300–1000 1000–2000 2000–3000
zeros 10 19 15 21 35 38
mean reach 0.802 0.761 0.747 0.727 0.711 0.693
largest reach 0.839 0.818 0.837 0.847 0.845 0.825
Figure 3. (a) The region 1 2 < σ ≤ 1.1 , 2 ≤ t ≤ 60 where the squared pair Q ζ is negative, and the zeros of ζ on σ = 1 2 . (b) The reach of the negative band at 138 zeros up to height 3000. The squares part satisfies Q E ≥ 0 everywhere above the horizon.
Figure 3. (a) The region 1 2 < σ ≤ 1.1 , 2 ≤ t ≤ 60 where the squared pair Q ζ is negative, and the zeros of ζ on σ = 1 2 . (b) The reach of the negative band at 138 zeros up to height 3000. The squares part satisfies Q E ≥ 0 everywhere above the horizon.
Preprints 237341 g003

6. The Prime Term at Every Height

By Theorem 6 every zero of ζ in σ > 1 2 is a zero of the prime factor F, whose logarithm is the prime term P ( s ) = ∑ p p − s for σ > 1 . At height t the prime term is the sum of the unit vectors p − i t = e − i t log p weighted by p − σ , and its phases t log p behave as independent in the sense of Theorem 7(i): any finitely many of them are jointly equidistributed.
Proof of Theorem 7(i)–(iii). 
(i) By unique factorisation the numbers log p are linearly independent over Q : an integer relation ∑ a p log p = 0 gives ∏ p a p = 1 , so every a p = 0 . Hence for every nonzero integer vector ( k p ) p ≤ y , ∑ k p log p ≠ 0 and 1 T ∫ 0 T e i t ∑ p k p log p d t → 0 , and Weyl’s criterion [61] gives the equidistribution of t ( log p / 2 π ) p ≤ y modulo 1; this is Kronecker’s theorem in Weyl’s form [31, Ch. XXIII]. (ii) E e i ( ϑ p − ϑ q ) = [ p = q ] gives the variance. For σ > 1 2 the independent terms have mean 0 and summable variances, so the series converges almost surely [32], [23, Theorem 2.5.6]. For σ ≤ 1 2 the real parts p − σ cos ϑ p are independent, have mean 0, are bounded by 1 and have variances 1 2 p − 2 σ with divergent sum, so by Kolmogorov’s three-series theorem with truncation level 1 [23, Theorem 2.5.8] their sum does not converge almost surely; by Kolmogorov’s zero-one law it diverges almost surely. (iii) Let Z y = ∏ p ≤ y ( 1 − p − σ e i ϑ p ) − 1 = ∏ p ≤ y ∑ j ≥ 0 p − j σ e i j ϑ p . Each factor has mean 1 and mean square ∑ j p − 2 j σ = ( 1 − p − 2 σ ) − 1 , so by independence E | Z y | 2 = ∏ p ≤ y ( 1 − p − 2 σ ) − 1 . For y < y ′ let Z y , y ′ = Z y ′ / Z y , which is independent of Z y and has mean 1; then E | Z y ′ − Z y | 2 = E | Z y | 2 E | Z y , y ′ | 2 − 1 ≤ ζ ( 2 σ ) ∏ y < p ≤ y ′ ( 1 − p − 2 σ ) − 1 − 1 → 0 . So Z y converges in mean square, and E | Z σ | 2 = lim E | Z y | 2 = ζ ( 2 σ ) . Also log Z y = ∑ p ≤ y p − σ e i ϑ p + O ( p − 2 σ ) converges almost surely by (ii), so Z y converges almost surely to exp ( lim log Z y ) ≠ 0 , which is Z σ . □
Part (iv) consists of classical theorems: the mean square is Theorem 7.2 of [58], due to Hardy and Littlewood; N ( σ , T ) = O ( T ) is Theorem 9.15(A) of [58], due to Bohr and Landau [12]; the bound N ( σ , T ) = O ( T 1 − ( σ − 1 2 ) / 4 log T ) is Theorem 9.19(C) of [58], due to Selberg [54]; and the limiting distribution is due to Bohr and Jessen [10,11]. Since N ( T ) ∼ T 2 π log T , the zeros with β > σ are a proportion O ( 1 / log T ) of the zeros up to height T, for every fixed σ > 1 2 .
The squares series appears twice. In the model, the variance of the prime term is ∑ p p − 2 σ and the mean square of the Euler product is ζ ( 2 σ ) = ∑ n n − 2 σ (Theorem 7(ii),(iii)); for ζ itself, the mean square over heights is the same ζ ( 2 σ ) (Theorem 7(iv)). Both are finite exactly for σ > 1 2 . For 1 2 < σ < 1 the mean square has the second main term
∫ 0 T | ζ ( σ + i t ) | 2 d t = ζ ( 2 σ ) T + ( 2 π ) 2 σ − 1 ζ ( 2 − 2 σ ) 2 − 2 σ T 2 − 2 σ + Δ σ ( T ) ,
where Matsumoto [36] proves Δ σ ( T ) = O ( T 1 / ( 1 + 4 σ ) log 2 T ) for 1 2 < σ < 3 4 .

6.1. Measurements

At 6000 heights drawn uniformly from [ 5000 , 6000 ] we computed ζ ( σ + i t ) for σ = 0.6 , 0.7 , 0.8 . The model value is log | Z σ | with the primes up to 10 6 and independent uniform phases, plus a Gaussian term with the variance 1 2 ∑ p > y p − 2 σ ≈ y 1 − 2 σ / ( 2 ( 2 σ − 1 ) log y ) , y = 10 6 , of the omitted primes; 6000 model values were drawn for each σ . Table 10 and Figure 4 compare the two.
Table 10. The value distribution of ζ ( σ + i t ) at 6000 random heights in [ 5000 , 6000 ] against the independent-phase model. The fourth column is the mean of | ζ | 2 over [ 5000 , 6000 ] given by the two main terms of (10).
Table 10. The value distribution of ζ ( σ + i t ) at 6000 random heights in [ 5000 , 6000 ] against the independent-phase model. The fourth column is the mean of | ζ | 2 over [ 5000 , 6000 ] given by the two main terms of (10).
σ mean | ζ | 2 ζ ( 2 σ ) by (10) sd of log | ζ | model sd 0.1 % quantile model
0.6 4.40 5.59 4.45 0.882 0.888 − 2.374 − 2.444
0.7 3.00 3.11 2.98 0.737 0.719 − 1.836 − 1.746
0.8 2.18 2.29 2.27 0.611 0.623 − 1.456 − 1.515

The Deepest Dips

On the grid t = 10 + 0.02 j , 10 ≤ t < 3000 , the least value of log | ζ ( 0.6 + i t ) | is − 3.007 ( | ζ | = 0.049 ), at t = 1329.12 , between the close zeros 1329.044 and 1329.205 ; the model’s quantile at 1 / 2469 , one value per zero in the range, is − 2.585 and the least of 50 , 000 model values, with the primes up to 10 5 , is − 2.941 . At σ = 0.7 the least value is − 2.214 , at the same height, against − 1.911 and − 2.203 . The deepest dips off the line sit beside zeros on the line, and at every computed point | ζ ( σ + i t ) | is positive.
Figure 4. Distribution of log | ζ ( σ + i t ) | at 6000 random heights 5000 ≤ t ≤ 6000 for σ = 0.6 , 0.7 , 0.8 (histograms), and of the independent-phase model log | Z σ | (curves).
Figure 4. Distribution of log | ζ ( σ + i t ) | at 6000 random heights 5000 ≤ t ≤ 6000 for σ = 0.6 , 0.7 , 0.8 (histograms), and of the independent-phase model log | Z σ | (curves).
Preprints 237341 g004

7. The Axiom of Harmonic Independence

Axiom 1 
(harmonic independence). Harmonic independence is the absence of an integer relation. The prime waves are related only through a mechanism present in their construction. Because Unique Factorization guarantees that no integer relation exists between the primes, their wave frequencies are strictly linearly independent. A harmonic resonance between the primes beyond this explicit construction—such as a zero off the critical line—would be a relation without a mechanism.

The Waves and Their Frequencies 

At height t the prime p enters the prime term P ( s ) = ∑ p p − s as the wave p − i t = e − i t log p , weighted by p − σ , of frequency log p / 2 π in t; measured in doublings of p it is the clock of Section 11. An integer relation between the frequencies is a vector ( k p ) of integers, not all zero and finitely many nonzero, with ∑ p k p log p = 0 , that is ∏ p p k p = 1 . Unique factorisation excludes every such vector. This is the first step of the proof of Theorem 7(i), and through Kronecker’s theorem in Weyl’s form it makes the phases t log p of any finitely many primes jointly equidistributed on their torus: no finite set of prime waves holds a fixed phase relation over the heights, so the first part of the axiom is a theorem.

The Mechanism in the Construction 

The waves are joined in ζ by one mechanism, the Euler product ζ ( s ) = ∏ p ( 1 − p − s ) − 1 , whose expansion into ∑ n n − s is unique factorisation itself. The squares part E and the prime factor F of Theorem 6 are this mechanism divided into its terms of order two and higher and its prime term. The relations among the waves measured in this paper are made by it: the lean carried by the squares at weight 1 2 (Theorem 5), the variance ∑ p p − 2 σ of the prime term (Theorem 7(ii)), and the half-order zero of F at s = 1 2 that matches the half-order pole of E (Theorem 6).

A Zero Off the Line 

By Theorem 6(i) a zero ρ = β + i γ with β > 1 2 is a zero of the prime factor F. At the height γ it would be a relation among the prime waves weighted by p − β , a resonance beyond the independence of their frequencies and beyond the relations that the Euler product supplies. The model in which the waves carry no relation at all, the independent phases of Theorem 7, has this form: there the random Euler product Z σ converges and is nonzero almost surely for every σ > 1 2 (Theorem 7(iii)). The axiom states as a principle that ζ admits no relation among its prime waves beyond its construction; the theorems above give its first part, the linear independence of the frequencies, and with the axiom every zero of ζ in the critical strip lies on the line σ = 1 2 .

8. The Forward and Reversed Terms at the Midpoint

The approximate functional equation of Hardy and Littlewood [27,28], in the form of Riemann and Siegel [58, §§4.12–4.16], [56], writes ζ as a forward pattern, its reversal and a remainder:
ζ ( s ) = ∑ n ≤ N n − s + χ ( s ) ∑ n ≤ N n s − 1 + R N ( s ) , χ ( s ) = 2 s π s − 1 sin π s 2 Γ ( 1 − s ) , N = t / 2 π .
Theorem 11 
(termwise balance). Let s = σ + i t with t > 0 . For every n ≥ 1 , | χ ( s ) n s − 1 | / | n − s | = | χ ( s ) | n 2 σ − 1 . This ratio is independent of n if and only if σ = 1 2 , where it equals 1. For σ ≠ 1 2 it equals 1 for at most one real n, which is t / 2 π ( 1 + O σ ( 1 / t ) ) .
Proof. 
| n s − 1 | / | n − s | = n 2 σ − 1 . The functional equation gives χ ( s ) χ ( 1 − s ) = 1 and χ ( s ) ¯ = χ ( s ¯ ) ; on σ = 1 2 , 1 − s = s ¯ , so | χ ( s ) | 2 = 1 . For σ ≠ 1 2 , n 2 σ − 1 is strictly monotone in n, and | χ ( s ) | = ( t / 2 π ) 1 / 2 − σ ( 1 + O σ ( 1 / t ) ) by Stirling’s formula [58, §4.12]. □

The Axiom at the Midpoint 

On the critical line every forward term is balanced against its reversed partner, and off it no two pairs of terms are balanced at once. A zero of ζ is a point at which the completed forward pattern and its reversal cancel. On the line the cancellation is between balanced partners; off it, it would require a relation among unbalanced terms that the construction (11) does not supply, which is what Axiom 1 excludes. The same structure is exact in a small graph, the medial antiprism: a stack of six triangles, each turned through 180 ∘ against the next, in which every vertex is joined to every side midpoint of the neighbouring layer. Its lines form two strands, exchanged by the reversal of the vertical order. If the midpoint nodes are moved to the fraction f along their sides, lines of the two strands meet in each gap exactly three times at height f and three times at height 1 − f , and only at the midpoint placement f = 1 2 do all meetings lie on the middle plane.

A Mixed Construction 

The Davenport–Heilbronn function f ( s ) = 1 − i ξ 2 L ( s , χ ) + 1 + i ξ 2 L ( s , χ ¯ ) , with χ the character modulo 5 with χ ( 2 ) = i and ξ = ( 10 − 2 5 − 2 ) / ( 5 − 1 ) , satisfies a functional equation of the same kind as that of ζ and has zeros off the critical line [20], [58, §10.25]. It is the case that the axiom predicts. Its two Euler products are added with the relative weight ( 1 + i ξ ) / ( 1 − i ξ ) , which equals the root number ε ( χ ) = τ ( χ ) / ( i 5 ) ; both have argument 0.5535744 , so the mixing is forced by the functional equation. The logarithm of ζ lives on the prime powers and gives every prime square the weight 1 2 . The logarithm of f has nonzero coefficients at 130 of the 302 integers up to 400 that are not prime powers, beginning with b 6 = 1.080701 , and its square weights b p 2 / b p 2 are 1 2 where χ ( p ) is real and − 12.891435 where χ ( p ) = ± i . Its zero 0.808517182 + 85.699348485 i lies off the line. The zeros of f off the line are relations between prime waves that its construction supplies, which is what the axiom allows.

8.1. The Pair Without Its Remainder

The truncated pair Z N ( s ) = D N ( s ) + χ ( s ) D N ( 1 − s ) , D N ( s ) = ∑ n ≤ N n − s , satisfies Z N ( s ) = χ ( s ) Z N ( 1 − s ) , the functional equation of ζ , so its zeros off the line come in pairs σ , 1 − σ . Unlike ζ , it has many. Scanning each range of constant N for 1 ≤ N ≤ 30 (heights 6.3 ≤ t ≤ 6038 ), we located 116 zeros of Z N with 1 2 < σ ≤ 1.098 , each refined by Newton’s method to | Z N | < 10 − 9 (Table 11, Figure 5). At every one of them the complete ζ is far from zero: 0.165 ≤ | ζ ( s ) | ≤ 1.161 . The argument principle on a box of width 0.16 and height 0.8 about each of the 24 lowest finds no zero of ζ off the line, and all zeros of ζ in this range lie on the line [46]. At these heights the prime clocks are anti-aligned: the sum ∑ p ≤ 400 cos ( t log p ) / p lies at median percentile 16.7 among random heights nearby, and 33 of the 116 lie below the tenth percentile. The remainder R N closes every one of these meetings back onto the line.
Table 11. Zeros of the truncated pair Z N with σ > 1 2 located below height 6000, and the complete ζ at them. Clock percentile: of ∑ p ≤ 400 cos ( t log p ) / p among 2000 random heights within 200 of t.
Table 11. Zeros of the truncated pair Z N with σ > 1 2 located below height 6000, and the complete ζ at them. Clock percentile: of ∑ p ≤ 400 cos ( t log p ) / p among 2000 random heights within 200 of t.
heights zeros located largest σ least | ζ | there median clock percentile
[ 0 , 1000 ) 20 1.098 0.290 10.2
[ 1000 , 2000 ) 27 0.968 0.255 17.1
[ 2000 , 3000 ) 12 1.051 0.208 17.9
[ 3000 , 4000 ) 19 0.986 0.165 29.6
[ 4000 , 5000 ) 21 0.980 0.254 17.2
[ 5000 , 6000 ) 17 0.860 0.185 18.9
Figure 5. (a) The ratio | χ ( s ) n s − 1 | / | n − s | at t = 1000 for several n: every pair of terms is balanced exactly at σ = 1 2 (Theorem 11). (b) The 116 located zeros of the truncated pair with σ > 1 2 , coloured by | ζ | at the same point.
Figure 5. (a) The ratio | χ ( s ) n s − 1 | / | n − s | at t = 1000 for several n: every pair of terms is balanced exactly at σ = 1 2 (Theorem 11). (b) The 116 located zeros of the truncated pair with σ > 1 2 , coloured by | ζ | at the same point.
Preprints 237341 g005

8.2. Positive Chains

Following [24], define γ ( n ) by 8 ξ ( 1 2 + z ) = ∑ n ≥ 0 γ ( n ) z 2 n / n ! , where ξ ( s ) = 1 2 s ( s − 1 ) π − s / 2 Γ ( s 2 ) ζ ( s ) , and the Jensen polynomials J d , n ( X ) = ∑ j = 0 d d j γ ( n + j ) X j . Pólya proved that RH holds if and only if every J d , n is hyperbolic, that is, has only real roots [47]; Griffin, Ono, Rolen and Zagier proved hyperbolicity for every d and all sufficiently large n, and for d ≤ 8 and all n [24, Theorems 1, 2], the latter with a proof resting on a numerical check for n ≤ 10 6 ; an effective form of the first theorem is in [25]. For n = 0 , J d , 0 is known to be hyperbolic for d ≤ 2 · 10 17 [16]. A real polynomial p has only real zeros if and only if the J-fraction of p ′ / p , produced by the Euclidean algorithm on p and p ′ , has positive couplings, and its zeros are moreover distinct if and only if the fraction has full length; then p is the characteristic polynomial of a Jacobi matrix with those positive off-diagonal entries [60, Theorem 43.1], [17, Ch. I]. RH is therefore the statement that every Jensen polynomial of Ξ is a chain with positive couplings, the chain ending early only at a repeated real zero. Positive coupling keeps the zeros real.
We computed γ ( n ) for n ≤ 820 to 431 digits by Gauss–Legendre quadrature of Pólya’s kernel, checked against 8 ξ ( 1 2 ) and ξ ″ ( 1 2 ) , and ran the Euclidean algorithm in 420-digit arithmetic. These degrees are far below the range d ≤ 2 · 10 17 of [16] at n = 0 ; what the chains add is the size of the couplings and a control of the reach. Every coupling is positive, at full length, for all 7029 polynomials with 2 ≤ d ≤ 100 and 0 ≤ n ≤ 700 in steps of 10, and for d = 80 , 120 , 160 , 200 , 260 , 320 , 400 at n = 0 , 1 , 10 , 100 , 300 . After scaling to unit mean square of the roots, the smallest coupling divided by the corresponding coupling k / 2 of the Hermite chain, the limit of [24], is 0.765 , at d = 400 , n = 0 (Figure 6a).
The test has a reach, which a control measures. In the product ∏ k ≤ 40 ( 1 + X / γ k 2 ) over the first 40 zeros, all Jensen polynomials up to degree 10 7 are real-rooted. When one zero is moved off the line by δ , the first non-real degree is 237 for γ 1 with δ = 0.5 , 23714 for γ 1 with δ = 0.05 , 7499 for γ 20 with δ = 0.5 and 749894 for γ 20 with δ = 0.05 : about 0.3 ( γ / δ ) 2 (Figure 6b). Degree 400 therefore certifies only γ / δ ≲ 36 , far less than the verification of [46], and by the same scaling the degree 2 · 10 17 of [16] reaches γ / δ of order 8 · 10 8 . The chains are an exact form of RH, not a test of it at large heights.
Figure 6. (a) The smallest coupling of the chain of J d , 0 , relative to the Hermite chain, for d ≤ 400 : all positive. (b) Control: the degree at which a single zero moved off the line by δ is first detected, against ( γ / δ ) 2 .
Figure 6. (a) The smallest coupling of the chain of J d , 0 , relative to the Hermite chain, for d ≤ 400 : all positive. (b) Control: the degree at which a single zero moved off the line by δ is first detected, against ( γ / δ ) 2 .
Preprints 237341 g006

9. The Reversed Pattern

Reversing the sign of every prime in the Euler product gives the reversed pattern ∏ p ( 1 + p − s ) − 1 . A zero of ζ , where the forward pattern goes to − ∞ in logarithm, is a pole of the reversed pattern, where it goes to + ∞ : the same pattern read in reverse order.
Proof of Theorem 8. 
(i) ( 1 + p − s ) − 1 = ( 1 − p − s ) ( 1 − p − 2 s ) − 1 = ∑ k ≥ 0 ( − 1 ) k p − k s , so the product is ζ ( 2 s ) / ζ ( s ) and, λ being completely multiplicative with λ ( p ) = − 1 , equals ∑ λ ( n ) n − s for σ > 1 . If ζ ( ρ ) = 0 with β ≥ 1 2 then Re ( 2 ρ ) ≥ 1 , so ζ ( 2 ρ ) is finite and nonzero [58, §3.3] and ρ is a pole of the same order. At s = 1 2 , ζ ( 2 s ) has a simple pole with residue 1 2 and ζ ( 1 2 ) ≠ 0 . (ii) The product ζ ( s ) · ζ ( 2 s ) / ζ ( s ) = ζ ( 2 s ) is the identity ∑ d ∣ n λ ( d ) = [ n is a square ] [1, Theorem 2.19]. Hence ∑ n ≤ x L ( x / n ) = ∑ d m ≤ x λ ( d ) = ∑ k ≤ x ∑ d ∣ k λ ( d ) counts the squares up to x. (iii) Let m ( y ) = ∑ n ≤ y μ ( n ) / n . For y ≥ 1 , ∑ n ≤ y μ ( n ) ⌊ y / n ⌋ = 1 , so y m ( y ) = 1 + ∑ n ≤ y μ ( n ) { y / n } ; the term n = 1 is { y } and the others total at most ⌊ y ⌋ − 1 in absolute value, so | y m ( y ) | ≤ y and | m ( y ) | ≤ 1 . Also m ( y ) → 0 [1, Ch. 4]. Since λ ( n ) = ∑ d 2 ∣ n μ ( n / d 2 ) ,
l ( N ) = ∑ d ≤ N 1 d 2 m N d 2 ,
and dominated convergence, with the bound d − 2 , gives l ( N ) → 0 . Next, ∑ k ≤ x λ ( k ) ⌊ x / k ⌋ = ∑ n ≤ x L ( x / n ) = ⌊ x ⌋ by (ii), so ∑ k ≤ x λ ( k ) { x / k } = x l ( x ) − ⌊ x ⌋ ; for x < k ≤ N , { x / k } = x / k , which adds x ( l ( N ) − l ( x ) ) . This is (5) for N ≥ x , and letting N → ∞ gives the series. For 0 < x < 1 both sides of (5) vanish in the limit. □
In the variable t = 1 / x , with ς k ( t ) = { 1 / ( k t ) } , (5) reads − ∑ k λ ( k ) ς k ( t ) = ⌊ t − 1 / 2 ⌋ for every t > 0 . The forward counterpart is − ∑ k μ ( k ) ς k ( t ) = χ ( 0 , 1 ] ( t ) , by (1) and ∑ k μ ( k ) / k = 0 [1]: the Möbius-weighted sawtooths rebuild the unit step, with its single jump at t = 1 , and the Liouville-weighted sawtooths rebuild the square staircase, with a jump at every t = 1 / n 2 .

Centre and Lean 

The forward pattern ζ ( s ) has a single pole, at its centre s = 1 . The reversed pattern has its centre pole at s = 1 2 , made by the squares through ζ ( 2 s ) . In Perron’s formula for L ( x ) this pole contributes x / ζ ( 1 2 ) = − 0.6848 x , and in that for l ( K ) , whose Dirichlet series is ζ ( 2 + 2 w ) / ζ ( 1 + w ) at w = s − 1 , it contributes − 1 / ( ζ ( 1 2 ) K ) = 0.6848 / K . The measured mean of L ( x ) / x is − 0.6834 (Table 7), and K l ( K ) leans to the positive side, while N m ( N ) is centred (Table 12). The other poles of the reversed pattern are the zeros of ζ . Every one computed lies on the vertical line through the centre s = 1 2 : the 2469 below height 3000 used here, and all below height 3 · 10 12 [46].

Forward Times Reversed at a Zero 

The identity of Theorem 8(ii) holds as an identity of meromorphic functions. At a zero of ζ its left side is a zero times a pole.
Proposition 1 
(the identity at a zero). Let ρ = β + i γ be a zero of ζ of order m with β ≥ 1 2 . Then:
  • ζ ( 2 s ) / ζ ( s ) has a pole of order m at ρ;
  • the product ζ ( s ) · ζ ( 2 s ) / ζ ( s ) is analytic at ρ, with the value ζ ( 2 ρ ) , which is finite and nonzero;
  • for m = 1 ,
    Res s = ρ ζ ( 2 s ) ζ ( s ) = ζ ( 2 ρ ) ζ ′ ( ρ ) .
In σ ≥ 1 2 the squares pattern ζ ( 2 s ) has a single pole, at the centre s = 1 2 , where ζ ( 1 2 ) ≠ 0 .
Proof. 
Write ζ ( s ) = ( s − ρ ) m h ( s ) with h analytic near ρ and h ( ρ ) ≠ 0 . Then ζ ( 2 s ) / ζ ( s ) = ( s − ρ ) − m ζ ( 2 s ) / h ( s ) , and the product of the two patterns is ζ ( 2 s ) . This is analytic at ρ because Re ( 2 ρ ) ≥ 1 and, γ being nonzero, 2 ρ ≠ 1 . Also ζ ( 2 ρ ) ≠ 0 by [58, §3.3]. For m = 1 , h ( ρ ) = ζ ′ ( ρ ) . The only pole of ζ is at 1, so the only pole of ζ ( 2 s ) is at 1 2 . □
At every zero, the zero of the forward pattern and the pole of the reversed pattern cancel in the product. They cancel in the same way whether β = 1 2 or β > 1 2 . For β > 1 2 the point 2 ρ lies in σ > 1 . For β = 1 2 it lies on the edge σ = 1 at height 2 γ , away from the pole at 1. In both cases ζ ( 2 ρ ) is finite and nonzero. The identity therefore holds at every zero and does not by itself tell a zero on the line from a zero off it. The pole of the squares pattern sits at the centre alone, and the centre is not a zero of ζ . Table 13 gives the values at the first five zeros.
Table 13. The identity of Theorem 8(ii) at the first five zeros, computed with 30 significant digits. The last column gives the difference between ( s − ρ ) ζ ( 2 s ) / ζ ( s ) at s = ρ + 10 − 12 and ζ ( 2 ρ ) / ζ ′ ( ρ ) . At the same point the product ζ ( s ) · ζ ( 2 s ) / ζ ( s ) differs from ζ ( 2 ρ ) by at most 2.3 × 10 − 12 ; both differences are of the size of the offset. With | 1 − 2 − 2 i γ | 2 , the values | ζ ( 1 + 2 i γ ) | 2 give the edge weights | η ( 1 + 2 i γ ) | 2 of Section 10.
Table 13. The identity of Theorem 8(ii) at the first five zeros, computed with 30 significant digits. The last column gives the difference between ( s − ρ ) ζ ( 2 s ) / ζ ( s ) at s = ρ + 10 − 12 and ζ ( 2 ρ ) / ζ ′ ( ρ ) . At the same point the product ζ ( s ) · ζ ( 2 s ) / ζ ( s ) differs from ζ ( 2 ρ ) by at most 2.3 × 10 − 12 ; both differences are of the size of the offset. With | 1 − 2 − 2 i γ | 2 , the values | ζ ( 1 + 2 i γ ) | 2 give the edge weights | η ( 1 + 2 i γ ) | 2 of Section 10.
γ ζ ( 2 ρ ) = ζ ( 1 + 2 i γ ) | ζ ( 2 ρ ) / ζ ′ ( ρ ) | residue, direct
14.134725 1.836735 − 0.651198 i 2.456952 2.1 × 10 − 12
21.022040 0.812565 + 0.173883 i 0.730941 2.7 × 10 − 13
25.010858 0.444955 + 0.295572 i 0.389423 1.1 × 10 − 12
30.424876 0.374904 + 0.352748 i 0.394777 1.4 × 10 − 12
32.935062 0.789343 − 0.194577 i 0.588206 3.1 × 10 − 13

Checks 

The identity (4) holds exactly at x = 10 , 99, 100, 1000, 12345 and 10 5 , with values 3, 9, 10, 31, 111 and 316. Table 14 shows the partial sums of (5); by (5) they equal ⌊ x ⌋ − x l ( K ) , and the direct sums over k ≤ 10 4 agree with this to all digits shown. The exact sieve gives L ( 10 8 ) = − 3884 .
Table 14. The Liouville-weighted sawtooths rebuild the square staircase: − ∑ k ≤ K λ ( k ) { x / k } tends to ⌊ x ⌋ .
Table 14. The Liouville-weighted sawtooths rebuild the square staircase: − ∑ k ≤ K λ ( k ) { x / k } tends to ⌊ x ⌋ .
x ⌊ x ⌋ K = 10 4 K = 10 6 K = 10 8
0.7 0 − 0.00300 − 0.00057 − 0.00007
3.9 1 0.98331 0.99682 0.99961
50.5 7 6.78385 6.95887 6.99497
99.99 9 8.57202 8.91856 8.99004
1000.3 31 26.71844 30.18532 30.90037

10. The Reversed Staircase Criterion

The criterion of Nyman and Beurling [9,41], in the form of Báez-Duarte [2], reads RH from the unit step χ ( 0 , 1 ] , which the Möbius-weighted sawtooths rebuild exactly: RH holds if and only if d N → 0 . The reversed pattern rebuilds the square staircase (Theorem 8(iii)), and its alternating form f gives a second sawtooth criterion, built from the squares, in the direction that matters for RH: if D N → 0 then RH holds.
Lemma 1. 
(a)
∫ 0 ∞ ς k ( t ) t s − 1 d t = − ζ ( s ) k − s / s for 0 < σ < 1 .
(b)
(Vasyunin [59]) For h , k ≥ 1 with d = gcd ( h , k ) , h = d h 1 , k = d k 1 ,
〈 ς h , ς k 〉 = 1 d log 2 π − γ E 2 1 h 1 + 1 k 1 + k 1 − h 1 2 h 1 k 1 log h 1 k 1 − π 2 h 1 k 1 V ( h 1 , k 1 ) + V ( k 1 , h 1 ) ,
with V ( h , k ) = ∑ m = 1 k − 1 { m h / k } cot ( π m / k ) .
(c)
〈 f , ς k 〉 = ∫ 1 ∞ [ ⌊ u ⌋ odd ] { u / k } u − 2 d u , and on an interval [ y , y ′ ] containing no multiple of k and no square in its interior, where { u / k } = ( α + u − y ) / k with α = k { y / k } , the integrand integrates to k − 1 log ( y ′ / y ) − ( y − α ) ( y ′ − y ) / ( y y ′ ) . For the unit step, 〈 χ ( 0 , 1 ] , ς k 〉 = ( log k + 1 − γ E ) / k .
Proof. (a) Substituting y = 1 / ( k t ) gives k − s ∫ 0 ∞ { y } y − s − 1 d y = − k − s ζ ( s ) / s [58, §2.1]. (c) Substitute u = 1 / t ; then ∫ y y ′ ( α − y + u ) u − 2 d u = log ( y ′ / y ) − ( y − α ) 1 y − 1 y ′ . □
Proof of Theorem 9. 
(i) f = 1 exactly on the intervals ( ( n + 1 ) − 2 , n − 2 ] with n odd, so ∥ f ∥ 2 = ∑ n odd ( n − 2 − ( n + 1 ) − 2 ) = ∑ m ≥ 1 ( − 1 ) m − 1 m − 2 = η ( 2 ) , and for σ > 0 , ∫ 0 ∞ f ( t ) t s − 1 d t = s − 1 ∑ n odd ( n − 2 s − ( n + 1 ) − 2 s ) = η ( 2 s ) / s . By (5) at x = 1 / t and at x / 4 ,
− ∑ k λ ( k ) { x / k } + 2 ∑ m λ ( m ) { x / ( 4 m ) } = ⌊ x ⌋ − 2 ⌊ x / 2 ⌋ = [ ⌊ x ⌋ odd ] ,
since ⌊ x / 2 ⌋ = ⌊ ⌊ x ⌋ / 2 ⌋ ; this is the stated identity, both series converging. The weights have the Dirichlet series ζ ( 2 s ) / ζ ( s ) − 2 · 4 − s ζ ( 2 s ) / ζ ( s ) = ( 1 − 2 1 − 2 s ) ζ ( 2 s ) / ζ ( s ) = η ( 2 s ) / ζ ( s ) .
(ii) Let c ( N ) attain D N , g N = f − ∑ k ≤ N c k ( N ) ς k and A N ( s ) = ∑ k ≤ N c k ( N ) k − s . For t > 1 , ς k ( t ) = 1 / ( k t ) and f ( t ) = 0 , so g N ( t ) = − A N ( 1 ) / t and D N 2 ≥ ∫ 1 ∞ A N ( 1 ) 2 t − 2 d t = A N ( 1 ) 2 ; hence A N ( 1 ) → 0 . Suppose ζ ( s 0 ) = 0 with 1 2 < σ 0 < 1 . By (i) and Lemma 1(a) the absolutely convergent Mellin integral of g N at s 0 is
∫ 0 ∞ g N ( t ) t s 0 − 1 d t = η ( 2 s 0 ) s 0 + ζ ( s 0 ) A N ( s 0 ) s 0 = η ( 2 s 0 ) s 0 .
The part over ( 1 , ∞ ) is − A N ( 1 ) ∫ 1 ∞ t s 0 − 2 d t = − A N ( 1 ) / ( 1 − s 0 ) → 0 , and by Cauchy–Schwarz the part over ( 0 , 1 ] is at most D N ( 2 σ 0 − 1 ) − 1 / 2 → 0 . Hence η ( 2 s 0 ) = 0 . But η ( 2 s ) = ( 1 − 2 1 − 2 s ) ζ ( 2 s ) , where | 2 1 − 2 s | = 2 1 − 2 σ < 1 and ζ ( 2 s ) ≠ 0 by the Euler product for σ > 1 2 . So ζ ( s ) ≠ 0 for 1 2 < σ < 1 ; with ζ ( s ) ≠ 0 for σ ≥ 1 [58, §3.3] and the functional equation, every zero in the strip lies on σ = 1 2 .
(iii) Let g = f − ∑ k ≤ N c k ς k . On ( 0 , 1 ] , | g | ≤ 1 + ∑ | c k | , and on ( 1 , ∞ ) , | g ( t ) | = | A ( 1 ) | / t , so the Mellin integral of g converges absolutely on σ = 1 2 , and by (i) and Lemma 1(a) it equals η ( 2 s ) / s + ζ ( s ) A ( s ) / s , which is η ( 2 ρ ) / ρ at a zero ρ . For the unit step the transform of χ ( 0 , 1 ] is 1 / s . □

The Norm and the Value at − 1

The functional equation ζ ( 1 − s ) = 2 ( 2 π ) − s cos π s 2 Γ ( s ) ζ ( s ) [58, §2.1] at s = 2 reflects s = 2 through the midpoint s = 1 2 to s = − 1 and gives ζ ( − 1 ) = − ζ ( 2 ) / 2 π 2 . Since ζ ( 2 ) = 2 η ( 2 ) , Theorem 9(i) gives
ζ ( − 1 ) = − ∥ f ∥ 2 π 2 = − 1 12 :
the value that Ramanujan assigned to 1 + 2 + 3 + ⋯ [5, Ch. 6], [30] is the norm of the odd-square staircase, reflected through the midpoint and divided by − π 2 .

The Weight of a Zero 

By the Mellin–Plancherel formula ∥ g ∥ 2 = 1 2 π ∫ − ∞ ∞ | g ^ ( 1 2 + i t ) | 2 d t , and by Theorem 9(iii) no choice of coefficients moves the transform of the error at a zero on the line: it stays 1 / ρ for the unit step and η ( 1 + 2 i γ ) / ρ for the odd-square staircase. The reversed reading therefore weights each zero on the line by the value of η on the edge σ = 1 at twice its height. For the unit step, Burnol [15] proved that the pinned values give lim inf N d N 2 log N ≥ ∑ Re ρ = 1 / 2 mult ( ρ ) 2 / | ρ | 2 , and Bettin, Conrey and Farmer [6] proved d N 2 ∼ C fwd / log N under RH and a hypothesis on ∑ ρ 1 / | ζ ′ ( ρ ) | 2 , with
C fwd = ∑ ρ 1 ρ ( 1 − ρ ) = 2 + γ E − log 4 π = 0.0461914 ,
which is ∑ ρ 1 / | ρ | 2 when every β = 1 2 , the setting of [6]. The reversed pinned values attach to the zeros on the line the constant
C rev = ∑ Re ρ = 1 / 2 | η ( 2 ρ ) | 2 | ρ | 2 = 0.075016 ,
computed over the 2469 zeros with 0 < γ < 3000 and both signs of γ , completed by the tail beyond 3000 with the density of the zeros and the mean value ζ ( 2 ) = π 2 / 6 of | η ( 1 + i u ) | 2 ; the ratio is C rev / C fwd = 1.624 . The edge weights | η ( 1 + 2 i γ ) | 2 of the first ten zeros are 2.014 , 2.273 , 1.138 , 0.653 , 1.460 , 2.229 , 0.115 , 3.692 , 1.083 and 0.026 .

10.1. Computation

For N ≤ 60 the Gram matrix 〈 ς h , ς k 〉 is computed by exact integration on the intervals where both sawtooths are linear; for N ≤ 2000 by Lemma 1(b), which agrees with the exact integrals to 3.1 × 10 − 13 on the 60 × 60 block. The inner products 〈 f , ς k 〉 are computed by Lemma 1(c), splitting [ 1 , 2000 2 ] at the multiples of k and at the squares, with the tail beyond 2000 2 evaluated with the mean 1 2 of { u / k } ; the same procedure gives 〈 χ ( 0 , 1 ] , ς k 〉 to within 2.6 × 10 − 13 of ( log k + 1 − γ E ) / k , and direct quadrature on a truncated range agrees to 10 − 15 . Then D N 2 = η ( 2 ) − b T G − 1 b , with b = ( 〈 f , ς k 〉 ) k ≤ N , by a Cholesky factorisation of G, whose condition number is 1.27 × 10 4 at N = 60 , 3.84 × 10 6 at N = 1000 and 1.50 × 10 7 at N = 2000 .
In double precision, with unit roundoff u = 1.1 × 10 − 16 , the condition number bounds the relative error of the Cholesky solution by a quantity of order 1.50 × 10 7 u ≈ 2 × 10 − 9 , far below the digits shown. A second implementation of the same formulas reproduces the condition number and the values of D N 2 in Table 16 and Table 17 at the 15 values of N recomputed. The matrix serves only to compute D N at finite N. Theorem 9(ii) does not use it: the theorem holds for any coefficients that attain D N .

The Exact Weights Cut at N

The weights w k = λ ( k ) − 2 λ ( k / 4 ) [ 4 ∣ k ] of Theorem 9(i) rebuild f at every point. They also satisfy ∑ k w k / k = 0 , the value at s = 1 of η ( 2 s ) / ζ ( s ) , where ζ has its pole. This follows from Theorem 8(iii): ∑ k λ ( k ) / k = 0 , and ∑ 4 ∣ k λ ( k / 4 ) / k = 1 4 ∑ m λ ( m ) / m = 0 . Cut at N, the weights give the error
g N = f + ∑ k ≤ N w k ς k = − ∑ k > N w k ς k .
For t > 1 , g N ( t ) = W N / t with W N = ∑ k ≤ N w k / k = − ∑ k > N w k / k . So the part of ∥ g N ∥ 2 over ( 1 , ∞ ) is W N 2 , which tends to 0; this is the first step of the proof of Theorem 9(ii). The part over ( 0 , 1 ] , where the sawtooths are not linear, is not controlled by W N . Table 15 computes both parts with the same Gram matrix, ∥ g N ∥ 2 = η ( 2 ) + 2 ∑ k w k 〈 f , ς k 〉 + w T G w .
Table 15. The odd-square staircase approximated by its exact weights cut at N, against the distance D N 2 attained by the best coefficients. The error of the cut weights over ( 1 , ∞ ) is W N 2 . Over ( 0 , 1 ] it does not decrease.
Table 15. The odd-square staircase approximated by its exact weights cut at N, against the distance D N 2 attained by the best coefficients. The error of the cut weights over ( 1 , ∞ ) is W N 2 . Over ( 0 , 1 ] it does not decrease.
N D N 2 W N 2 , part over ( 1 , ∞ ) part over ( 0 , 1 ] ∑ k ≤ N w k
10 0.052277 5.87 × 10 − 3 0.14267 0
30 0.023911 1.03 × 10 − 3 0.09117 − 2
60 0.021086 3.27 × 10 − 4 0.08574 0
100 0.017627 1.62 × 10 − 4 0.07427 0
200 0.015199 2.64 × 10 − 4 0.12457 − 4
300 0.013664 2.32 × 10 − 5 0.06351 − 2
500 0.012777 7.39 × 10 − 6 0.06715 − 2
700 0.011496 4.51 × 10 − 7 0.05846 0
1000 0.011124 4.64 × 10 − 7 0.06261 − 2
1400 0.010606 4.51 × 10 − 5 0.13060 8
2000 0.010119 9.05 × 10 − 5 0.28049 18
Over 300 ≤ N ≤ 2000 the part over ( 0 , 1 ] lies between 0.058 and 0.281 and does not decrease, while D N 2 falls to 0.0101 . It is largest where the partial sum ∑ k ≤ N w k is largest: + 8 at N = 1400 and + 18 at N = 2000 . The exact weights cut at N rebuild f at every point but not in the norm. The vanishing of η ( 2 s ) / ζ ( s ) at the pole of ζ settles the distance over t > 1 . The distance over 0 < t ≤ 1 is carried by the coefficients that attain D N , which are chosen afresh at each N. By Theorem 9(ii) the statement D N → 0 gives RH, and it is a statement about those coefficients.
Table 16. The distances of the odd-square staircase ( D N ) and of the unit step ( d N ) from the span of N sawtooths, for N ≤ 60 .
Table 16. The distances of the odd-square staircase ( D N ) and of the unit step ( d N ) from the span of N sawtooths, for N ≤ 60 .
N 1 2 3 4 5 6 8 10 12
D N 2 . 731629 . 253830 . 155946 . 130060 . 129492 . 104097 . 072527 . 052277 . 050267
d N 2 . 858212 . 289965 . 093837 . 065129 . 036102 . 035986 . 024161 . 023772 . 020443
N 15 20 25 30 40 45 50 55 60
D N 2 . 046176 . 030875 . 026741 . 023911 . 022696 . 022493 . 022021 . 021487 . 021086
d N 2 . 018335 . 016504 . 015520 . 014530 . 012715 . 012023 . 011869 . 011623 . 011471
Table 17. Distances times log N up to N = 2000 , against the constants C fwd = 0.04619 and C rev = 0.07502 of the zeros. Over 1200 ≤ N ≤ 2000 the means lie 0.6 % below C fwd and 2.5 % above C rev ; the ratio at N = 2000 is 1.655 , against C rev / C fwd = 1.624 .
Table 17. Distances times log N up to N = 2000 , against the constants C fwd = 0.04619 and C rev = 0.07502 of the zeros. Over 1200 ≤ N ≤ 2000 the means lie 0.6 % below C fwd and 2.5 % above C rev ; the ratio at N = 2000 is 1.655 , against C rev / C fwd = 1.624 .
N d N 2 log N D N 2 log N ratio window of N mean d N 2 log N mean D N 2 log N
60 0.04697 0.08634 1.838 40–100 0.04720 0.08600
100 0.04692 0.08118 1.730 100–300 0.04650 0.07956
200 0.04726 0.08053 1.704 300–700 0.04582 0.07850
300 0.04560 0.07794 1.709 700–1200 0.04514 0.07640
400 0.04618 0.07822 1.694 1200–2000 0.04591 0.07686
500 0.04611 0.07940 1.722
700 0.04421 0.07531 1.704 constant 0.04619 0.07502
1000 0.04529 0.07684 1.697
1400 0.04571 0.07683 1.681
2000 0.04647 0.07691 1.655
Figure 7. D N 2 log N for the odd-square staircase and d N 2 log N for the unit step, 5 ≤ N ≤ 2000 , computed from exact integrals, with the constants C rev and C fwd of the zeros (dashed).
Figure 7. D N 2 log N for the odd-square staircase and d N 2 log N for the unit step, 5 ≤ N ≤ 2000 , computed from exact integrals, with the constants C rev and C fwd of the zeros (dashed).
Preprints 237341 g007

11. Prime Clocks

The clock of a prime p is t ↦ p i t ; at height t it reads t log p / 2 π turns. At a whole turn the clock is aligned, p i t = 1 ; at a half turn it is reversed, p i t = − 1 . At t = 0 every clock is aligned and the Euler product ∏ p ( 1 − p − s ) − 1 has its pole at s = 1 ; turning every clock by half a turn, p − s ↦ − p − s , gives the reversed pattern of Section 9. The pitch in doublings of the wave of a zero (Section 2) is the reading of the clock of 2 at its height.
Proof of Theorem 10. 
The first statement is Landau’s formula [33]; Gonek [26] gives a version uniform in x. When ρ = 1 2 + i γ , x ρ = x e i γ log x , and taking real parts gives the mean of cos ( γ log x ) . For the clock of p, 1 N ( T ) ∑ e 2 π i k γ log p / 2 π = 1 N ( T ) ∑ p i k γ = p − k / 2 N ( T ) ∑ ( p k ) ρ , and Λ ( p k ) = log p . □
With these Fourier coefficients, the density of the readings of the clock of p over the zeros up to height T is
δ p ( ϕ ) = 1 − T log p π N ( T ) ∑ k ≥ 1 p − k / 2 cos 2 π k ϕ ,
with δ p ( 0 ) = 1 − T log p π N ( T ) ( p − 1 ) at the alignment and δ p ( 1 2 ) = 1 + T log p π N ( T ) ( p + 1 ) at the reversal; this is the main term, each coefficient carrying an error O ( log T / N ( T ) ) . Every coefficient is negative: each prime pulls the zeros toward the reversal of its clock, with strength Λ ( x ) / x at x = p k . The zeros sit on the reversed side of every clock. For p = 2 , T = 3000 and N ( T ) = 2469 , δ 2 ( 0 ) = 0.353 and δ 2 ( 1 2 ) = 1.111 .

11.1. Measurements

Over the 2469 zeros with 0 < γ < 3000 , the mean of cos ( γ log x ) agrees with Landau’s formula to within 0.0012 at every prime power up to 13 (Table 18) and to within 0.0038 at all 35 prime powers up to 100, the largest difference being at x = 81 . The density of the zeros on the clock of 2 follows (12) (Table 19, Figure 8): near the alignment it is 0.68 and 0.65 of the average, and elsewhere about 1.1 .
Table 18. Mean of cos ( γ log x ) over the 2469 zeros below height 3000, and − T 2 π N ( T ) Λ ( x ) / x .
Table 18. Mean of cos ( γ log x ) over the 2469 zeros below height 3000, and − T 2 π N ( T ) Λ ( x ) / x .
x 2 3 4 5 7 8 9 11 13
measured − . 0946 − . 1225 − . 0668 − . 1386 − . 1411 − . 0468 − . 0697 − . 1387 − . 1370
Landau − . 0948 − . 1227 − . 0670 − . 1392 − . 1422 − . 0474 − . 0708 − . 1398 − . 1376
Table 19. Density of the zeros below height 3000 on the clock of 2, per tenth of a turn (average 1).
Table 19. Density of the zeros below height 3000 on the clock of 2, per tenth of a turn (average 1).
reading mod 1 0– . 1 . 1 – . 2 . 2 – . 3 . 3 – . 4 . 4 – . 5 . 5 – . 6 . 6 – . 7 . 7 – . 8 . 8 – . 9 . 9 –1
measured 0.680 0.996 1.118 1.065 1.126 1.110 1.114 1.077 1.061 0.652
by (12) 0.671 1.026 1.088 1.105 1.110 1.110 1.105 1.088 1.026 0.671
Figure 8. (a) Density of the 2469 zeros below height 3000 on the clock of 2, in twentieths of a turn, and the density (12). (b) Mean of cos ( γ log x ) over the same zeros at the 35 prime powers x ≤ 100 , and Landau’s formula.
Figure 8. (a) Density of the 2469 zeros below height 3000 on the clock of 2, in twentieths of a turn, and the density (12). (b) Mean of cos ( γ log x ) over the same zeros at the 35 prime powers x ≤ 100 , and Landau’s formula.
Preprints 237341 g008

The Clock of 2 in the Triad Charge

Since χ − 3 ( 2 ) = − 1 , the Euler factor of L ( s , χ − 3 ) at 2 is ( 1 + 2 − s ) − 1 , whose modulus at s = 1 2 + i γ is | 1 + 2 − 1 / 2 2 − i γ | − 1 : 3.414 at a half turn of the clock of 2 and 0.586 at a whole turn. The wave amplitudes of the triad charge a ( x ) in (6) carry | L ( ρ , χ − 3 ) | , and over the zeros below height 3000 the mean of | L ( ρ , χ − 3 ) | is 4.24 for the 274 zeros within 0.05 turn of a half turn and 0.98 for the 130 zeros within 0.05 turn of a whole turn; divided by the factor at 2, the two means are 1.38 and 1.66 . The sixth zero, whose wave is nearly silent in the triad charge (Table 3), reads 4.1464 turns, 0.15 turn past a whole turn.

11.2. The Tenth Zero

The tenth zero γ 10 = 49.7738 reads 5.4909 turns on the clock of 2, within 0.009 of 5 1 2 , which in base two is 101.1 ; there 2 i γ 10 = − 0.9984 + 0.0569 i , and the clock is reversed. The reversed reading of Theorem 9(iii) weights the zero by
| η ( 1 + 2 i γ ) | 2 = | 1 − 2 − 2 i γ | 2 | ζ ( 1 + 2 i γ ) | 2 , | 1 − 2 − 2 i γ | = 2 | sin ( γ log 2 ) | ,
and at twice the height the clock of 2 reads 10.9819 turns, within 0.018 of 11, which in base two is 1011: doubling the height moves the binary point one place, the half turn becomes a whole number of turns, and the factor 1 − 2 1 − 2 s of η ( 2 s ) closes. For γ 10 , | 1 − 2 − 2 i γ | 2 = 0.0129 , | ζ ( 1 + 2 i γ ) | 2 = 2.04 , and the weight is 0.0264 , against a mean of 1.52 over the 2469 zeros.
The factor | 1 − 2 − 2 i γ | 2 vanishes whenever the clock of 2 reads a half or a whole turn. of the 2469 zeros below height 3000, 71 have weight below 0.05 : 49 lie within 0.1 turn of a half turn and 22 within 0.1 turn of a whole turn, more of them near the reversal, where the density (12) is higher. The first seven are, as (rank, γ , reading mod 1, weight), ( 10 , 49.774 , 0.491 , 0.0264 ) , ( 124 , 276.452 , 0.498 , 0.0029 ) , ( 163 , 339.858 , 0.492 , 0.0263 ) , ( 172 , 353.489 , 0.996 , 0.0111 ) , ( 269 , 498.581 , 0.002 , 0.0016 ) , ( 311 , 557.565 , 0.509 , 0.0451 ) and ( 327 , 580.137 , 0.999 , 0.0004 ) .
Remark 3 
(rank and value). The silence of the tenth zero in the reversed reading is a property of its value, the height γ 10 read on the clock of the prime 2, and not of its rank: the same clock silences 70 further zeros below height 3000. That prime is 2, written 10 in base two.

12. Methods of Computation

Counts to 10 10

An exact segmented sieve gives μ ( n ) , λ ( n ) and Λ ( n ) to 10 10 and records π , M, L, θ , ψ , their restrictions to the classes 1 and 5 mod 6 , and π − li in extended precision at 675 , 247 checkpoints; it gives π ( 10 10 ) = 455 , 052 , 511 , M ( 10 10 ) = − 33 , 722 and L ( 10 10 ) = − 116 , 026 . The grid u = 12 + 0.001 j is interpolated linearly between checkpoints; J is formed from π and a table of π ( y ) for y ≤ 10 5 .

The Tower 

A second segmented sieve to 10 10 computes for every n the values μ ( n ) , ( μ ∗ χ − 3 ) ( n ) and ( μ ∗ χ − 4 ) ( n ) in integers and ( μ ∗ χ 9 ) ( n ) and ( μ ∗ χ 9 χ − 3 ) ( n ) in Z [ ω ] , stored as integer pairs ( a 1 , a 2 ) for a 1 + a 2 ω with ω 2 = − 1 − ω , from the values at prime powers in Theorem 2. Each n is divided exactly by the primes up to 10 5 , and the cofactor left after these divisions is 1 or a prime. All partial sums are exact and are recorded at 123 , 450 checkpoints, which contain the grid, the points x / 3 and the values ⌊ 10 10 / r ⌋ , r ≤ 10 5 . The leaves M ( 10 10 / r ) come from these checkpoints for r ≤ 10 5 and from a table of M ( v ) , v ≤ 10 5 , for r > 10 5 , and give every class of the tower at every level exactly.

Spectra and Energies 

Mean over the grid removed, Hann window, direct evaluation of the Fourier sum at each pitch.

Zeros and Special Values 

The 2469 zeros with 0 < γ < 3000 are computed with mpmath [38], whose count N ( 3000 ) = 2469 by Turing’s method agrees; all lie on the critical line [46]. The functions ζ ( s ) , ζ ′ ( s ) and ζ ( s , a ) are evaluated by Euler–Maclaurin summation, L ( s , χ − 3 ) = 3 − s ( ζ ( s , 1 3 ) − ζ ( s , 2 3 ) ) and L ( s , χ − 4 ) = 4 − s ( ζ ( s , 1 4 ) − ζ ( s , 3 4 ) ) . The squares part is evaluated by (9) as log | E ( s ) | = − ∑ 2 ≤ k ≤ K μ ( k ) k − 1 log | ζ ( k s ) | , with K = 24 at the random points and K = 79 for Table 8.

Squared Pair 

Q ζ on the grid σ = 0.52 , 0.53 , … , 1.10 , t = 2 + 0.05 j for Figure 3(a); the reach by 14 bisection steps in σ , with the minimum over 13 equally spaced heights in [ γ − 0.3 , γ + 0.3 ] .

Value Distribution 

ζ ( σ + i t ) at 6000 uniform random heights in [ 5000 , 6000 ] ; the model as described in Section 6; the extremes on the grid t = 10 + 0.02 j .

Reversal 

An exact sieve of λ to 10 8 gives l ( K ) in double precision; (4) is checked by direct summation of L.

Sawtooth Integrals 

As in Section 10; linear algebra in double precision by Cholesky factorisation. For the recomputation and Table 15, 〈 f , ς k 〉 = ∑ n odd Φ k ( ( n + 1 ) 2 ) − Φ k ( n 2 ) with Φ k ( y ) = ∫ 1 y { u / k } u − 2 d u = log y − H ⌊ y / k ⌋ / k + ⌊ y / k ⌋ / y , where H m is the harmonic number. The sum runs over n < 2 · 10 5 , and the tail is evaluated with the mean 1 2 of { u / k } .

The Identity at a Zero 

The values of Table 13 are computed with 30 significant digits by the mpmath library [38].

Gaps and Classes 

A sieve of the primes to 10 8 ; the window law is checked directly for p ≤ 19 .

Truncated Pair 

Z N evaluated in double precision with log | χ | from the complex log-gamma function; for each N, the local minima of | Z N | on the grid σ = 0.5005 + 0.005 j , t = 2 π N 2 + 0.01 k , below a fifth of the median, refined by Newton’s method; ζ at the points and on the boxes with mpmath at 15 digits [38]. The list of located zeros is not claimed to be complete.

Jensen Chains 

γ ( n ) from γ ( n ) = 64 · 4 n n ! ( 2 n ) ! ∫ 0 ∞ u 2 n Φ ( u ) d u with Pólya’s kernel Φ ( u ) = ∑ k ≥ 1 ( 2 π 2 k 4 e 9 u − 3 π k 2 e 5 u ) e − π k 2 e 4 u , by composite Gauss–Legendre quadrature on [ 0 , 2 ] ; the Euclidean algorithm on the polynomial centred at the mean of its roots and scaled to unit mean square, in mpmath at 420 digits.

13. Concluding Remarks

The Triad Tower 

The rebuild law splits by the residue of the divisor into the self-similar tower of Theorem 1: its zero classes repeat the whole law one level down, its unit classes are the character sums G χ , carried only by the primes that the characters do not fix (Theorem 2), and its leaves are the values M ( x / r ) , whose energy is subpolynomially above x exactly when RH holds. At every zero of ζ the triad of Dirichlet series is ( 0 , a , − a ) with a = 1 2 L ( ρ , χ − 3 ) (Theorem 3), and this fixes every wave of the tower: at 10 10 the class values agree exactly with the leaves, and the twelve leading wave amplitudes of M, a and b and their energies agree with the zeros to within 0.0003 and 1 % .

The Squares 

Each prime square opens the next wheel (Theorem 4): with 25 and 49 inserted, the primes to 61 are the wheels of 6 and 30, and the classes 6 k ± 1 stand 9 : 9 . All squares fall in the class 6 k + 1 , and the logarithm of the Euler product counts each of them with weight 1 2 (Theorem 5). At that weight the lean of π against li vanishes, with fitted weight 0.4994 , and the lean of the classes 6 k ± 1 drops from 1.157 to 0.031 , with fitted weight 0.514 ; the lean of L sits in its square multiples, and without them L becomes M, which is centred. The waves are unchanged.

The Horizon 

The squares part E of ζ is analytic, zero-free and satisfies the squared-pair inequality all the way down to the square-root horizon σ = 1 2 , where it has a half-order pole; the prime factor F = ζ / E carries every zero of ζ in σ > 1 2 and has at s = 1 2 the matching half-order zero, which is the square lean − 1 2 li ( x ) of the prime count (Theorem 6, Remark 1). The phases t log p are jointly equidistributed on every finite torus, and in the model with independent phases the prime term has the squares series as variance and converges almost surely exactly beyond the horizon (Theorem 7); for each fixed σ > 1 2 the zeros with β > σ form a proportion O ( 1 / log T ) of those up to height T; and the values of ζ at heights 5000 to 6000 follow the independent-phase law.

The Axiom 

Harmonic independence is the absence of an integer relation (Axiom 1). By unique factorisation the frequencies log p of the prime waves admit none, which is a theorem (Section 7); the waves are related only through the Euler product that constructs ζ , and a zero off the critical line would be a relation without a mechanism.

The Reversed Pattern 

Reversing every prime turns ζ ( s ) into ζ ( 2 s ) / ζ ( s ) and every zero into a pole; forward times reversed is ζ ( 2 s ) ; and the Liouville-weighted sawtooths rebuild the square staircase ⌊ x ⌋ exactly (Theorem 8). The forward pattern has its single pole at its centre s = 1 . The reversed pattern has its centre pole at s = 1 2 , which gives L ( x ) its lean x / ζ ( 1 2 ) , and its other poles at the zeros of ζ . In this form the Riemann Hypothesis is the statement that every pole of the reversed pattern lies on the vertical line through its centre. The results bear on this statement from four sides. The squares part is positive and zero-free down to that line (Theorem 6). In the independent-phase model of the prime factor, which carries the poles, the prime term converges almost surely beyond the line with the squares series as variance, and for each fixed σ > 1 2 the poles with β > σ form a proportion O ( 1 / log T ) of those up to height T (Theorem 7). The odd-square staircase, rebuilt exactly by the reversed sawtooths, gives the criterion that D N → 0 puts every pole on the line, and computed to N = 2000 , D N 2 log N stays within 3.3 % of the constant C rev of the poles on the line over 1200 ≤ N ≤ 2000 (Theorem 9, Table 17). Every prime clock pulls the poles toward its reversal as Landau’s formula prescribes, as verified over the 2469 poles below height 3000 at the 35 prime powers up to 100 and in the density on the clock of 2 (Theorem 10, Table 18 and Table 19). At each zero the forward zero and the reversed pole cancel in the product, leaving ζ ( 2 ρ ) with residue ζ ( 2 ρ ) / ζ ′ ( ρ ) . They cancel in the same way on the line and off it, so the identity holds at every zero and does not place it (Proposition 1). The exact weights of the staircase settle the distance over t > 1 through the vanishing of η ( 2 s ) / ζ ( s ) at s = 1 . Over 0 < t ≤ 1 they leave an error that does not decrease up to N = 2000 (Table 15), so the criterion rests on the coefficients that attain D N .

The Midpoint 

The forward terms and their reversed partners are balanced, all at once, exactly on the critical line (Theorem 11). Without the remainder, the pair meets itself off the line: we locate 116 such zeros below height 5952, all at heights where the prime clocks are anti-aligned, and the complete ζ is nonzero at every one of them. With the remainder, every zero computed lies on the line. As positive chains, the Jensen polynomials of Ξ are real-rooted wherever tested, and a control shows how far such a test reaches. In the reading of Axiom 1, a zero is a meeting of the completed pattern with its reversal, and the construction supplies balance at the midpoint only.

Outlook 

The computations extend directly: the tower beyond 10 10 by the rebuild law, the reversed distance D N beyond N = 2000 by Vasyunin’s closed form, and the densities of the zeros on the clocks of the odd primes by (12).

14. Data and Sources

External Inputs 

All inputs are mathematical; no measured data are used.
(i)
All nontrivial zeros of ζ with 0 < γ ≤ 3 · 10 12 lie on the critical line [46].
(ii)
Results reported in 2026 and cited for context only: [4,18,44,45].
(iii)
Published values used for comparison: π ( 10 n ) [42]; M ( 10 10 ) = − 33 , 722 [43]; the least x > 1 with L ( x ) > 0 , 906 , 150 , 257 [57].
(iv)
Classical and published theorems: the rebuild law [1, Ch. 3]; Littlewood’s criterion and the explicit formula for M [58, Theorems 14.25(C), 14.27]; Riemann’s formula for J [51,62]; the prime number theorem and the explicit formula for ψ ( x , χ ) [21, Ch. 18, 19]; the Hurwitz zeta function, ∑ d ∣ n λ ( d ) and ∑ μ ( n ) / n = 0 [1]; Kronecker’s theorem and Weyl’s criterion [31,61]; the variance criterion and the three-series theorem [23,32]; the mean square of ζ [58, Theorem 7.2] and its second term [36]; the density theorems of Bohr and Landau and of Selberg [12,54], [58, Theorems 9.15(A), 9.19(C)]; the value distribution [10,11]; Mertens’ inequality [37], [58, §3.3, (3.3.1)]; Chebyshev’s bias [53]; the sign changes of π − li [35]; Pólya’s question [50]; the criterion of Nyman, Beurling and Báez-Duarte [2,9,41]; Vasyunin’s closed form [59]; Burnol’s bound [15]; the asymptotic of Bettin, Conrey and Farmer [6]; Landau’s formula [26,33]; the approximate functional equation [56], [58, §4.12]; the approximate functional equation [27,28]; zeros on the line and simple zeros [3,7,8,14,19,29,34,39,49,55]; the de Bruijn–Newman constant [22,40,48,52], [46, Corollary 2]; Jensen polynomials [16,24,25,47]; J-fractions and Favard’s theorem [17,60].

Computed Quantities 

Every other number in the paper is computed from formulas stated in the text by the methods of Section 12: the tower and its waves and energies, the gaps and class counts, the leans and the fitted weights, the half-order limits and the reach of the squared pair, the value distribution and its extremes, the Liouville sums, the Gram matrices and the distances D N and d N , the error of the exact weights cut at N, the identity at the first zeros, the zeros of the truncated pair and the Jensen chains, the constants C fwd and C rev , and the readings and densities of the zeros on the prime clocks.

References

  1. Apostol, T. M. Introduction to Analytic Number Theory. In Undergraduate Texts in Mathematics; Springer: New York, 1976. [Google Scholar]
  2. Báez-Duarte, L. A strengthening of the Nyman–Beurling criterion for the Riemann hypothesis. Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 2003, 14, 5–11. [Google Scholar]
  3. Aryan, F. On an extension of the Landau–Gonek formula. J. Number Theory 2022, 233, 389–404. [Google Scholar] [CrossRef]
  4. Anthropic, Learning more about Claude’s mathematical capabilities. 10 August 2026. Available online: https://www.anthropic.com/news/riemann-zeta.
  5. Berndt, B. C. Ramanujan’s Notebooks, Part I; Springer: New York, 1985. [Google Scholar]
  6. Bettin, S.; Conrey, J. B.; Farmer, D. W. An optimal choice of Dirichlet polynomials for the Nyman–Beurling criterion. Proc. Steklov Inst. Math. 2013, 280, S30–S36. [Google Scholar] [CrossRef]
  7. Baluyot, S. A. C.; Goldston, D. A.; Suriajaya, A. I.; Turnage-Butterbaugh, C. L. An unconditional Montgomery theorem for pair correlation of zeros of the Riemann zeta-function. Acta Arith. 2024, 214, 357–376. [Google Scholar] [CrossRef]
  8. Baluyot, S. A. C.; Goldston, D. A.; Suriajaya, A. I.; Turnage-Butterbaugh, C. L. Pair correlation of zeros of the Riemann zeta function I: proportions of simple zeros and critical zeros. arXiv 2026, arXiv:2501.14545v3. [Google Scholar]
  9. Beurling, A. A closure problem related to the Riemann zeta-function. Proc. Nat. Acad. Sci. U.S.A. 1955, 41, 312–314. [Google Scholar] [CrossRef] [PubMed]
  10. Bohr, H.; Jessen, B. Über die Werteverteilung der Riemannschen Zetafunktion. Erste Mitt. Acta Math. 1930, 54, 1–35. [Google Scholar] [CrossRef]
  11. Bohr, H.; Jessen, B. Über die Werteverteilung der Riemannschen Zetafunktion. Zweite Mitt. Acta Math. 1932, 58, 1–55. [Google Scholar] [CrossRef]
  12. Bohr, H.; Landau, E. Ein Satz über Dirichletsche Reihen mit Anwendung auf die ζ-Funktion und die L-Funktionen. Rend. Circ. Mat. Palermo 1914, 37, 269–272. [Google Scholar] [CrossRef]
  13. Bombieri, E. Remarks on Weil’s quadratic functional in the theory of prime numbers, I. Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei (9) Mat. Appl. 2000, 11, 183–233. [Google Scholar]
  14. Bui, H. M.; Conrey, J. B.; Young, M. P. More than 41% of the zeros of the zeta function are on the critical line. Acta Arith. 2011, 150, 35–64. [Google Scholar] [CrossRef]
  15. Burnol, J.-F. A lower bound in an approximation problem involving the zeros of the Riemann zeta function. Adv. Math. 2002, 170, 56–70. [Google Scholar] [CrossRef]
  16. Chasse, M. Laguerre multiplier sequences and sector properties of entire functions. Complex Var. Elliptic Equ. 2013, 58, 875–885. [Google Scholar] [CrossRef]
  17. Chihara, T. S. An Introduction to Orthogonal Polynomials; Gordon and Breach: New York, 1978. [Google Scholar]
  18. Claude (Anthropic). More than two thirds of the zeros of the Riemann zeta function are simple and on the critical line, manuscript dated 11 August 2026. Available online: https://www-cdn.anthropic.com/95c246936988e43127bc6b2ceb7077c1dad2d68e.pdf.
  19. Conrey, J. B. More than two fifths of the zeros of the Riemann zeta function are on the critical line. J. Reine Angew. Math. 1989, 399, 1–26. [Google Scholar] [CrossRef]
  20. Davenport, H.; Heilbronn, H. On the zeros of certain Dirichlet series. J. Lond. Math. Soc. 1936, 11, 181–185 and 307–312. [Google Scholar] [CrossRef]
  21. Davenport, H. Multiplicative Number Theory, 3rd ed.; Montgomery, H. L., Ed.; Graduate Texts in Mathematics 74; Springer: New York, 2000. [Google Scholar]
  22. de Bruijn, N. G. The roots of trigonometric integrals. Duke Math. J. 1950, 17, 197–226. [Google Scholar] [CrossRef]
  23. Durrett, R. Probability: Theory and Examples, 5th ed.; Cambridge Series in Statistical and Probabilistic Mathematics 49; Cambridge University Press: Cambridge, 2019. [Google Scholar]
  24. Griffin, M.; Ono, K.; Rolen, L.; Zagier, D. Jensen polynomials for the Riemann zeta function and other sequences. Proc. Natl. Acad. Sci. USA 2019, 116, 11103–11110. [Google Scholar] [CrossRef] [PubMed]
  25. Griffin, M.; Ono, K.; Rolen, L.; Thorner, J.; Tripp, Z.; Wagner, I. Jensen polynomials for the Riemann xi-function. Adv. Math. 2022, 397, 108186. [Google Scholar] [CrossRef]
  26. Gonek, S. M. An explicit formula of Landau and its applications to the theory of the zeta-function. In A Tribute to Emil Grosswald: Number Theory and Related Analysis; Contemp. Math. 143, Amer. Math. Soc.: Providence, RI, 1993; pp. 395–413. [Google Scholar]
  27. Hardy, G. H.; Littlewood, J. E. The zeros of Riemann’s zeta-function on the critical line. Math. Z. 1921, 10, 283–317. [Google Scholar] [CrossRef]
  28. Hardy, G. H.; Littlewood, J. E. The approximate functional equation in the theory of the zeta-function, with applications to the divisor-problems of Dirichlet and Piltz. Proc. Lond. Math. Soc. 1923, 21, 39–74. [Google Scholar] [CrossRef]
  29. Hardy, G. H. Sur les zéros de la fonction ζ(s) de Riemann. C. R. Acad. Sci. Paris 1914, 158, 1012–1014. [Google Scholar]
  30. G. H. Hardy, Divergent Series; Clarendon Press: Oxford, 1949.
  31. Hardy, G. H.; Wright, E. M. An Introduction to the Theory of Numbers, 6th ed.; Heath-Brown, D. R., Silverman, J. H., Eds.; Oxford University Press: Oxford, 2008. [Google Scholar]
  32. Khintchine, A.; Kolmogoroff, A. Über Konvergenz von Reihen, deren Glieder durch den Zufall bestimmt werden. Mat. Sb. 1925, 32, 668–677. [Google Scholar]
  33. Landau, E. Über die Nullstellen der Zetafunktion. Math. Ann. 1912, 71, 548–564. [Google Scholar] [CrossRef]
  34. Levinson, N. More than one third of zeros of Riemann’s zeta-function are on σ = 1/2. Adv. Math. 1974, 13, 383–436. [Google Scholar]
  35. Littlewood, J. E. Sur la distribution des nombres premiers. C. R. Acad. Sci. Paris 1914, 158, 1869–1872. [Google Scholar]
  36. Matsumoto, K. The mean square of the Riemann zeta-function in the critical strip. Jpn. J. Math. (N.S.) 1989, 15, 1–13. [Google Scholar] [CrossRef]
  37. Mertens, F. Ueber eine Eigenschaft der Riemann’schen ζ-Function. Sitzungsber. Kais. Akad. Wiss. Wien. Math.-Naturwiss. Cl. 1898, 107, 1429–1434. [Google Scholar]
  38. The mpmath development team, mpmath: a Python library for arbitrary-precision floating-point arithmetic, version 1.3.0. 2023. Available online: https://mpmath.org/.
  39. Montgomery, H. L. The pair correlation of zeros of the zeta function. In Analytic Number Theory (St. Louis, 1972); Proc. Sympos. Pure Math. 24; American Mathematical Society: Providence, RI, 1973; pp. 181–193. [Google Scholar]
  40. Newman, C. M. Fourier transforms with only real zeros. Proc. Amer. Math. Soc. 1976, 61, 245–251. [Google Scholar] [CrossRef]
  41. Nyman, B. On Some Groups and Semigroups of Translations. Thesis, Uppsala, 1950. [Google Scholar]
  42. OEIS Foundation. Sequence A006880, number of primes < 10n, The On-Line Encyclopedia of Integer Sequences. Available online: https://oeis.org/A006880.
  43. OEIS Foundation. Sequence A084237, a(n) = M(10n), where M(n) is Mertens’s function, The On-Line Encyclopedia of Integer Sequences. Available online: https://oeis.org/A084237.
  44. OpenAI. The quasi-Riemann hypothesis: a zero-free half-plane Re(s) > 7/8, manuscript dated 30 September 2026, released 6 October 2026. Available online: https://github.com/openai/math/tree/main/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026.
  45. OpenAI. The quasi-Riemann hypothesis, manuscript dated 5 October 2026, released 6 October 2026. Available online: https://github.com/openai/math/tree/main/preprints/The-Quasi-Riemann-Hypothesis-October-5-2026.
  46. Platt, D.; Trudgian, T. The Riemann hypothesis is true up to 3·1012. Bull. Lond. Math. Soc. 2021, 53, 792–797. [Google Scholar] [CrossRef]
  47. Pólya, G. Über die algebraisch-funktionentheoretischen Untersuchungen von J. L. W. V. Jensen. Kgl. Dan. Vid. Selsk. Math.-Fys. Medd. 1927, 7, 1–33. [Google Scholar]
  48. Polymath, D. H. J. Effective approximation of heat flow evolution of the Riemann ξ function, and a new upper bound for the de Bruijn–Newman constant. Res. Math. Sci. 2019, 6, 31. [Google Scholar] [CrossRef]
  49. Pratt, K.; Robles, N.; Zaharescu, A.; Zeindler, D. More than five-twelfths of the zeros of ζ are on the critical line. Res. Math. Sci. 2020, 7, 2. [Google Scholar] [CrossRef]
  50. Pólya, G. Verschiedene Bemerkungen zur Zahlentheorie. Jahresber. Deutsch. Math.-Verein. 1919, 28, 31–40. [Google Scholar]
  51. Riemann, B. Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse. Monatsber. Königl. Preuss. Akad. Wiss. Berl. 1859, 671–680. [Google Scholar]
  52. Rodgers, B.; Tao, T. The De Bruijn–Newman constant is non-negative. Forum Math. Pi 2020, 8, e6. [Google Scholar] [CrossRef]
  53. Rubinstein, M.; Sarnak, P. Chebyshev’s bias. Exp. Math. 1994, 3, 173–197. [Google Scholar] [CrossRef]
  54. Selberg, A. Contributions to the theory of the Riemann zeta-function. Arch. Math. Naturvid. 1946, 48, 89–155. [Google Scholar]
  55. Selberg, A. On the zeros of Riemann’s zeta-function. Skr. Nor. Vid.-Akad. Oslo I 1942, 1–59. [Google Scholar]
  56. Siegel, C. L. Über Riemanns Nachlaß zur analytischen Zahlentheorie. Quellen und Studien zur Geschichte der Mathematik, Astronomie und Physik, Abt. B: Studien 1932, 2, 45–80. [Google Scholar]
  57. Tanaka, M. A numerical investigation on cumulative sum of the Liouville function. Tokyo J. Math. 1980, 3, 187–189. [Google Scholar] [CrossRef]
  58. Titchmarsh, E. C. The Theory of the Riemann Zeta-Function, 2nd ed.; Heath-Brown, D. R., Ed.; Oxford University Press: Oxford, 1986. [Google Scholar]
  59. Vasyunin, V. I. On a biorthogonal system associated with the Riemann hypothesis. St. Petersburg Math. J. 1996, 7, 405–419. [Google Scholar]
  60. Wall, H. S. Analytic Theory of Continued Fractions; Van Nostrand, New York, 1948. [Google Scholar]
  61. H. Weyl, Über die Gleichverteilung von Zahlen mod. Eins Math. Ann. 1916, 77, 313–352.
  62. H. von Mangoldt, Zu Riemanns Abhandlung “Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse”. J. Reine Angew. Math. 1895, 114, 255–305. [CrossRef]
Table 12. Value imbalance of the first K terms of the reversed and forward patterns. The reversed one leans around − 1 / ζ ( 1 2 ) = 0.6848 , the forward one around 0.
Table 12. Value imbalance of the first K terms of the reversed and forward patterns. The reversed one leans around − 1 / ζ ( 1 2 ) = 0.6848 , the forward one around 0.
K 10 2 10 3 10 4 10 5 10 6 10 7 10 8
K l ( K ) (reversed) 1.0787 0.9169 0.4280 0.4437 0.8144 1.0877 0.9960
K m ( K ) (forward) + 0.3113 + 0.1395 − 0.2083 − 0.1541 + 0.2006 + 0.3210 + 0.2047
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.