The Riemann zeta function (), continued meromorphically to , encodes the distribution of primes through its zeros. Riemann (1859) conjectured that all nontrivial zeros lie on . Hadamard and de la Vallée Poussin (1896) proved there are no zeros on , which gives the prime number theorem, but all classical zero-free regions shrink toward the line as the height grows. The quasi-Riemann hypothesis asks for a fixed such that for all : one zero-free gap valid at every height. The uniform version for all Dirichlet -functions is a standard formulation in analytic number theory (e.g. Friedlander–Goldston).
This preprint claims a proof with , for , for all Dirichlet -functions, and for all finite-order Hecke -functions over .
For a Dirichlet character modulo (extended by zero on non-units), for , continued meromorphically; the character modulo gives . For with ring of integers , a finite-order Hecke character modulo a nonzero ideal is a character of the ray class group modulo , extended by zero, and . Principal characters have a pole at .
In Lean, is Mathlib's riemannZeta, Dirichlet -functions are Mathlib's DirichletCharacter.LFunction, and the Hecke family is OAI.SevenEighths.HeckeFamily.LFunction: a Character is a multiplicative character of trivial on units (for this class-number-one field these are exactly the ray class characters), and its -function is a lattice sum over divided by the units, continued through a theta-type functional equation pair.
For every Dirichlet character modulo and every with , , except at the pole of a principal character.
For every finite-order Hecke character of and every with , , except at the pole of a principal character.
The three statements are ordered from weakest to strongest; the proof in the preprint goes through the whole Hecke family even for , because Poisson summation introduces Hecke twists of the target.
The result. A fixed zero-free half-plane would give power-saving error terms in the prime number theorem and in prime counts in arithmetic progressions, uniformly in the modulus, and would exclude Siegel zeros beyond . The preprint derives (Corollary 1.2) that the least quadratic nonresidue modulo is , proving Vinogradov's conjecture, and a deterministic polynomial-time square-root algorithm modulo primes.
Formalizing it. This is a claimed resolution of a long-standing question in an unrefereed preprint; a machine-checked proof would be strong independent verification. The goal uses only Mathlib definitions, so it cannot be weakened by a definitional choice. The Hecke milestone uses a custom -function definition that must also be checked against the source.
Classical zero-free regions come from positivity arguments (the inequality) that give regions of width shrinking to the line ; they cannot produce a fixed half-plane. Zero-density estimates bound the number of zeros to the right of a line but do not exclude every zero. The preprint instead continues reciprocals across a uniform distance by comparing two exact representations of a completed cubic-theta sum, with exponent margins independent of the target character.
∀ s : ℂ, 7/8 < s.re → riemannZeta s ≠ 0. Mathlib assigns a finite nonzero value, so no pole exclusion is needed.χ = 1 ∧ s = 1, where Mathlib's value is a junk value at the pole.χ.residue = 1 ∧ s = 1.The goal is not vacuous and cannot be satisfied by a convention: it is a statement about Mathlib's riemannZeta on an open half-plane.
Needed infrastructure: Hecke -functions over imaginary quadratic fields and their functional equations, cubic and sextic residue symbols, Patterson's cubic theta coefficients, large sieve inequalities over , and Mellin inversion. Contributions toward the half-plane (Theorem 3.1) as an intermediate target are welcome.
theorem riemannZeta_ne_zero_of_seven_eighths_lt_re
{s : ℂ} (hs : (7 / 8 : ℝ) < s.re) : riemannZeta s ≠ 0 := by
sorry
end OAI
The theorem states that for every complex number s whose real part satisfies Re(s) > 7/8, the Riemann zeta function does not vanish there: ζ(s) ≠ 0. This is a zero-free half-plane statement, with the real part compared against 7/8 as a real number and no other hypotheses on s. The source declaration is admitted without a proof in the file.
No open leaves. Every sub-goal is proved or awaiting decomposition.