Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An upper bound for a logarithmic counting-main increment

Proved
TaoFivePrimes.logarithmic_counting_main_increment

by Johan Mercedes · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisexplicit-estimatesriemann-zetatao-five-primes

Let 0<H≤t0<H\le t0<H≤t and c>0c>0c>0. Then

tc(log⁡tc−1)−Hc(log⁡Hc−1)≤t−Hclog⁡tc.\frac{t}{c}\left(\log\frac{t}{c}-1\right) -\frac{H}{c}\left(\log\frac{H}{c}-1\right) \le \frac{t-H}{c}\log\frac{t}{c}.ct​(logct​−1)−cH​(logcH​−1)≤ct−H​logct​.

In particular, taking c=2πc=2\pic=2π 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 sorry
Source
Elementary logarithmic inequality used with the published Riemann–von Mangoldt counting main term; derived using log x ≤ x−1 for x>0.

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