Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Interior uniform form of the zero-density bound (13.3)

Proved
GuthMaynard.zeroDensityCount_le_uniform_interior

by nonlocally · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

dirichlet-polynomialsriemann-zetazero-density

Let N(σ,T)N(\sigma,T)N(σ,T) denote the number of zeros ρ\rhoρ of the Riemann zeta function with Re⁡ρ≥σ\operatorname{Re}\rho\ge\sigmaReρ≥σ and ∣Im⁡ρ∣≤T|\operatorname{Im}\rho|\le T∣Imρ∣≤T, counted with multiplicity. There are a real constant CCC and a function e(T)e(T)e(T) tending to zero such that, for every T≥2T\ge2T≥2 and every σ∈[1/2,4/5]\sigma\in[1/2,4/5]σ∈[1/2,4/5],

N(σ,T)≤C T(30/13+e(T))(1−σ)(log⁡T)44.N(\sigma,T)\le C\,T^{(30/13+e(T))(1-\sigma)}(\log T)^{44}.N(σ,T)≤CT(30/13+e(T))(1−σ)(logT)44.

The same CCC and eee work throughout the stated interval. This is the interior-range form of the uniform zero-density bound in (13.3), with one absolute logarithmic power. It is reusable in arguments that handle a neighborhood of σ=1\sigma=1σ=1 separately.

Formalization Note. The zero count is valued in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞} and then coerced to [0,∞][0,\infty][0,∞]. Both displayed powers use real exponents, and the right-hand side is converted with ENNReal.ofReal.

Preamble
import Mathlib
import Definitions.Def_LindelofHypothesis_GrowthAndZeroCounts

open Filter Topology
open scoped ENNReal
Formal statement
namespace GuthMaynard

theorem zeroDensityCount_le_uniform_interior :
    ∃ (C : ℝ) (e : ℝ → ℝ), Tendsto e atTop (𝓝 0) ∧ ∀ T : ℝ, 2 ≤ T → ∀ σ : ℝ,
      σ ∈ Set.Icc (1 / 2 : ℝ) (4 / 5 : ℝ) →
      (LindelofHypothesis.zeroDensityCount σ T : ℝ≥0∞) ≤
        ENNReal.ofReal (C * T ^ ((30 / 13 + e T) * (1 - σ)) * Real.log T ^ (44 : ℝ)) := by
  sorry

end GuthMaynard
Source
Guth, L. and Maynard, J., New large value estimates for Dirichlet polynomials, Ann. of Math. (2) 203 (2026) 623–675, https://arxiv.org/abs/2405.20552v2, p. 50, equation (13.3); the main estimate (1.4) on p. 4, restricted here to 1/2 ≤ σ ≤ 4/5.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me