Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hasanalizade–Shen–Wong explicit bound for N(T)N(T)N(T), T≥eT\ge eT≥e

Open
RiemannVonMangoldt.hasanalizade_shen_wong_bound

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryriemann-zetazeros-of-zeta

Write N(T)N(T)N(T) for the number of zeros ρ\rhoρ of the Riemann zeta function ζ(s)\zeta(s)ζ(s) with 0<Re⁡ρ<10<\operatorname{Re}\rho<10<Reρ<1 and 0<Im⁡ρ≤T0<\operatorname{Im}\rho\le T0<Imρ≤T, counted with multiplicity. Hasanalizade, Shen and Wong proved that for every real T≥eT\ge eT≥e,

∣N(T)−(T2πlog⁡T2π−T2π)∣≤0.1038log⁡T+0.2573log⁡log⁡T+9.3675.\left|N(T)-\left(\frac{T}{2\pi}\log\frac{T}{2\pi}-\frac{T}{2\pi}\right)\right|\le 0.1038\log T+0.2573\log\log T+9.3675 .​N(T)−(2πT​log2πT​−2πT​)​≤0.1038logT+0.2573loglogT+9.3675.

This explicit form of the Riemann–von Mangoldt formula improves the coefficients of log⁡T\log TlogT and log⁡log⁡T\log\log TloglogT over Backlund's bound and holds from T=eT=eT=e on; it implies the asymptotic formula N(T)=T2πlog⁡T2π−T2π+O(log⁡T)N(T)=\frac{T}{2\pi}\log\frac{T}{2\pi}-\frac{T}{2\pi}+O(\log T)N(T)=2πT​log2πT​−2πT​+O(logT).

Formalization Note The decimal constants are exact rationals. N(T)N(T)N(T) is zetaZeroCount T.

Preamble
import Mathlib
import Definitions.Def_RiemannVonMangoldt_ZeroCounts

open Filter Asymptotics Real
Formal statement
namespace RiemannVonMangoldt

theorem hasanalizade_shen_wong_bound (T : ℝ) (hT : Real.exp 1 ≤ T) :
    |zetaZeroCount T - (T / (2 * π) * Real.log (T / (2 * π)) - T / (2 * π))| ≤
      0.1038 * Real.log T + 0.2573 * Real.log (Real.log T) + 9.3675 := by sorry

end RiemannVonMangoldt
Source
Wikipedia, "Riemann–von Mangoldt formula", revision oldid=1362774495 (https://en.wikipedia.org/w/index.php?title=Riemann–von_Mangoldt_formula&oldid=1362774495), displayed formula after "This result has since been improved upon, including by E. Hasanalizade, Q. Shen, and P-J. Wong" (for T ≥ e). E. Hasanalizade, Q. Shen, P.-J. Wong, Counting zeros of the Riemann zeta function, J. Number Theory 235 (2022) 219–241, Corollary 1.2, doi:10.1016/j.jnt.2021.06.032.
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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