Critical-line verification from height 10,000 to 65,000
ProvedTaoFivePrimes.rh_verified_block_1e4_65knumerical-verificationriemann-zetatao-five-primes
Every zero of the Riemann zeta function in the open critical strip with
lies on the critical line . Both endpoints are included; no simplicity assertion is made. This is the finite-height verification needed by the 65,000 Chebyshev-error reduction.
Preamble
import Mathlib.NumberTheory.LSeries.RiemannZeta
Formal statement
theorem TaoFivePrimes.rh_verified_block_1e4_65k (s : ℂ)
(hs : riemannZeta s = 0) (h0 : 0 < s.re) (h1 : s.re < 1)
(ha : 10 ^ 4 ≤ s.im) (hb : s.im ≤ 65000) : s.re = 1 / 2 := by sorrySource
Restriction of the numerical finite-height RH verification cited in T. Tao, Every odd number greater than 1 is the sum of at most five primes, Theorem 1.5, https://arxiv.org/abs/1201.6656; see also D. J. Platt, Isolating some non-trivial zeros of zeta, Math. Comp. 86 (2017), 2449–2467, https://doi.org/10.1090/mcom/3198. The statement remains open on Prove2Me.