An explicit count for positive zeta zeros in a height interval
ProvedTaoFivePrimes.positive_zero_bin_countexplicit-estimatesriemann-zetatao-five-primes
Let be a finite set of distinct nontrivial zeros of the Riemann zeta function, with multiplicities , and suppose and for every . Then
The strict lower endpoint permits subtracting the zeros counted at .
Preamble
import Definitions.Def_dusart_psi_433_20261014_PsiZeroSum import Mathlib.Tactic open DusartSmoothing
Formal statement
theorem TaoFivePrimes.positive_zero_bin_count (Z : Finset ℂ) (L U : ℝ) (hL : 4 ≤ L) (hLU : L ≤ U)
(hZ : ∀ ρ ∈ Z, RvM.IsNontrivialZero ρ ∧ L < ρ.im ∧ ρ.im ≤ U) :
(∑ ρ ∈ Z, (RvM.zeroMult ρ : ℝ)) ≤
(U-L)/(2*Real.pi)*Real.log (U/(2*Real.pi)) + 18*Real.log (U+5) + 158 := by sorrySource
Derived from the proved ExplicitPNT.DusartTable1 zero-count and reciprocal-weight modules, whose Dusart and supporting formalization references are recorded in their published sources.