An upper bound for a logarithmic counting-main increment
ProvedTaoFivePrimes.logarithmic_counting_main_incrementanalysisexplicit-estimatesriemann-zetatao-five-primes
Let and . Then
In particular, taking bounds the main-term increment in the Riemann–von Mangoldt zero count by the length of the interval times its upper-endpoint logarithmic density.
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Tactic
Formal statement
theorem TaoFivePrimes.logarithmic_counting_main_increment
(H t c : ℝ) (hH : 0 < H) (hHt : H ≤ t) (hc : 0 < c) :
t/c * (Real.log (t/c)-1) - H/c * (Real.log (H/c)-1) ≤
(t-H)/c * Real.log (t/c) := by sorrySource
Elementary logarithmic inequality used with the published Riemann–von Mangoldt counting main term; derived using log x ≤ x−1 for x>0.