(13.3) — the zero density bound uniformly up to σ = 1
ProvedGuthMaynard.zeroDensityCount_le_uniformThere are constants and and a function with as such that
for all and all . Here is LindelofHypothesis.zeroDensityCount σ T, the number of zeros of with and , counted with multiplicity.
Formalization note. The display is read literally. The is one function , the constant is absolute, and is one fixed power , all uniform in . Unlike (1.4), the multiplies , so the bound stays strong as . That is what the proofs of Corollaries 1.3 and 1.4 use.
import Mathlib import Definitions.Def_LindelofHypothesis_GrowthAndZeroCounts open Filter Topology open scoped ENNReal
namespace GuthMaynard
theorem zeroDensityCount_le_uniform :
∃ (C A : ℝ) (e : ℝ → ℝ), Tendsto e atTop (𝓝 0) ∧ ∀ T : ℝ, 2 ≤ T → ∀ σ : ℝ, σ ∈ Set.Icc (1 / 2 : ℝ) 1 →
(LindelofHypothesis.zeroDensityCount σ T : ℝ≥0∞) ≤
ENNReal.ofReal (C * T ^ ((30 / 13 + e T) * (1 - σ)) * Real.log T ^ A) := by
sorry
end GuthMaynardRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
There exist real numbers and and a function with
such that for every real and every real with ,
, and are chosen once, before and : the same , , must work for all admissible and . Nothing is required of or beyond being real numbers (no sign conditions), and nothing is required of beyond the limit as ; in particular is not required to be continuous, monotone, or of any sign, and its values for small are unconstrained.
The zero count . Let be the Riemann zeta function, as a function . Then
the number of zeros of with real part at least and imaginary part in , counted with multiplicity. Both conditions are non-strict. The region is not bounded on the right: every zero with is included, not only those with . Zeros with negative imaginary part are included (the condition is on ).
Here is the order of vanishing of at , valued in : it is if vanishes identically on a neighbourhood of , if is not analytic at , and otherwise the natural number with near , analytic and . The point does not enter the count: is a total function here, its value at is , which is nonzero.
The sum is taken in the extended natural numbers : it is the supremum of all finite partial sums, so it equals the ordinary finite sum when only finitely many zeros qualify, and equals if infinitely many zeros qualify or any qualifying order is . This value is then viewed in (finite values as the corresponding nonnegative reals, as ).
The right-hand side. The real number is converted to by replacing it with if it is negative (this is the above); in particular the right-hand side is always a finite nonnegative number, so the inequality requires to be finite. Both powers are real powers with real exponents: since and (natural logarithm), and . The exponent of is the product , where is the real number thirty thirteenths. The products associate as .
Edge cases. At the exponent of is regardless of , and the bound reads . At the exponent is . The hypotheses on and are satisfiable (e.g. , ).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.