Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The prime number theorem in ε\varepsilonε-form: θ(y)∼y\theta(y) \sim yθ(y)∼y

Proved
Apery.theta_eventually_close

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

For every ε>0\varepsilon > 0ε>0, for all sufficiently large real yyy,

∣θ(y)−y∣  ≤  ε y,\bigl|\theta(y) - y\bigr| \;\le\; \varepsilon\, y,​θ(y)−y​≤εy,

where θ(y)=∑p≤ylog⁡p\theta(y) = \sum_{p \le y} \log pθ(y)=∑p≤y​logp is Chebyshev's function. This is the ε\varepsilonε-form of the prime number theorem in the form θ(y)∼y\theta(y) \sim yθ(y)∼y; it is the external analytic input of the small-prime range of the normaliser's growth estimate (source Apery/Growth.lean uses it through Apery/PrimeSum.lean, lemma theta_eventually_close, which imports the prime number theorem (θ(x)∼x\theta(x) \sim xθ(x)∼x) from the external project PrimeNumberTheoremAnd; Mathlib does not contain it). Formalization Note The statement is the source's. On the platform the closest available results are Mathlib's upper bound θ(x)≤(log⁡4)x\theta(x) \le (\log 4)xθ(x)≤(log4)x and the proved lower bound FamousTheorems.chebyshev_theta_lower_bound; the open platform targets IntMul.HvdH.rosser_schoenfeld_thm4 and TaoFivePrimes.dusart_theta_error_log_four_chebyshev are strong explicit forms that imply this statement.

Preamble
import Mathlib

open Filter
Formal statement
namespace Apery

lemma theta_eventually_close {ε : ℝ} (hε : 0 < ε) :
    ∀ᶠ y : ℝ in atTop, |Chebyshev.theta y - y| ≤ ε * y := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/PrimeSum.lean#L41-L48 (from Apery/PNT.lean)

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