Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Dusart's Chebyshev estimate for t≥e22t\ge e^{22}t≥e22

Open
Dusart.chebyshev_theta_k2_large

by @bwdaugherty · 1 vote · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theoryprime-numbers

For every real t≥3584912846t\ge 3584912846t≥3584912846 (just below e22e^{22}e22),

∣θ(t)−t∣≤15 tlog⁡2t,θ(t)=∑p≤tlog⁡p.|\theta(t)-t|\le\frac{1}{5}\,\frac{t}{\log^2t},\qquad \theta(t)=\sum_{p\le t}\log p .∣θ(t)−t∣≤51​log2tt​,θ(t)=p≤t∑​logp.

This is the analytic part of Dusart's estimate (Theorem 5.2, k=2k=2k=2, η2=0.2\eta_2=0.2η2​=0.2). Dusart obtains it from bounds ∣θ(x)−x∣<εθ(b) x|\theta(x)-x|<\varepsilon_\theta(b)\,x∣θ(x)−x∣<εθ​(b)x for x≥ebx\ge e^bx≥eb (his Table 6.3, after Schoenfeld). These give η2≤0.1524\eta_2\le0.1524η2​≤0.1524 on [e22,e23][e^{22},e^{23}][e22,e23] and smaller values beyond (Tables 6.4–6.5), with an asymptotic bound for x≥e5000x\ge e^{5000}x≥e5000. Those bounds rest on explicit estimates for ψ(x)−x\psi(x)-xψ(x)−x from zero-free regions and zero computations of ζ\zetaζ.

Formalization Note θ\thetaθ is Mathlib's Chebyshev.theta.

Status note (2026-10-17) With this statement, Dusart's bound for ∑p≤x1/p\sum_{p\le x}1/p∑p≤x​1/p (x≥10372x\ge10372x≥10372) follows in Lean 4: the complementary finite range and the deduction are proved in the release Dusart v2.0.0, doi:10.5281/zenodo.23432990.

Status note (2026-10-19) The release Dusart v3.0.0, doi:10.5281/zenodo.23463154 proves in Lean 4 (axioms propext, Classical.choice, Quot.sound only) Dusart.chebyshev_theta_k2_large_of_bklnw: this statement follows from the published bound ∣θ(t)−t∣<0.15952 t/log⁡2t|\theta(t)-t|<0.15952\,t/\log^2t∣θ(t)−t∣<0.15952t/log2t for t>5⋅106t>5\cdot10^6t>5⋅106 (Broadbent, Kadiri, Lumley, Ng and Wilk, Math. Comp. 90 (2021), Theorem 1 with k=2k=2k=2, Table 15, row log⁡X0=log⁡(5⋅106)\log X_0=\log(5\cdot10^6)logX0​=log(5⋅106)). That bound rests on rigorous verifications of the Riemann hypothesis and is not formalized, so this entry stays Open here.

Status note (2026-10-19, ψ/θ release) The release Kernel-checked explicit Chebyshev bounds from a zero-free half-plane, doi:10.5281/zenodo.23475184 proves this inequality for every real t≥2626t\ge2^{626}t≥2626 (PsiHalfplane.theta_bound; axioms propext, Classical.choice, Quot.sound only), using no input about ζ\zetaζ beyond the formally proved zero-free half-plane ℜs>7/8\Re s>7/8ℜs>7/8. It is built with Lean 4.34.1 and a newer Mathlib than this platform's, and it does not cover 3584912846≤t<26263584912846\le t<2^{626}3584912846≤t<2626, so this entry stays Open.

Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
theorem Dusart.chebyshev_theta_k2_large :
    ∀ t : ℝ, 3584912846 ≤ t → |Chebyshev.theta t - t| ≤ (1 / 5) * t / Real.log t ^ 2 := by sorry
Source
P. Dusart, Estimates of some functions over primes without R.H., arXiv:1002.0442 (2010), Theorem 5.2 (k = 2, η = 0.2, x ≥ 3 594 641); derived there from Table 6.3 (ε_θ(b)) and Tables 6.4–6.5 (η_2 column) for x ≥ e^22.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me