Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Dusart's Chebyshev estimate on [3594641, 3584912847][3594641,\,3584912847][3594641,3584912847]

Open
Dusart.chebyshev_theta_k2_finite

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

analytic-number-theorynumber-theoryprime-numbers

For every real ttt with 3594641≤t≤35849128473594641\le t\le 35849128473594641≤t≤3584912847,

∣θ(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 finite part of Dusart's estimate (the case k=2k=2k=2, η2=0.2\eta_2=0.2η2​=0.2 of his Theorem 5.2), up to just above e22≈3584912846.13e^{22}\approx3584912846.13e22≈3584912846.13. On this range Dusart uses exact values of θ\thetaθ; his Table 6.4 gives only η2=0.2112>0.2\eta_2=0.2112>0.2η2​=0.2112>0.2 on [e21,e22][e^{21},e^{22}][e21,e22] from the analytic bounds. A proof is a finite computation over the primes up to 3.6⋅1093.6\cdot10^93.6⋅109.

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

Status note (2026-10-17) This statement is proved in Lean 4, kernel-checked with axioms propext, Classical.choice, Quot.sound only, in the release Dusart v2.0.0, doi:10.5281/zenodo.23432990, under the same name Dusart.chebyshev_theta_k2_finite. The proof is a kernel sieve certificate (3416 segments, 221 modules) whose memory and time needs exceed this platform's per-job limits, so it is not re-checked here; its checker and base range are proved on this platform as ThetaCert.base.

Status note (2026-10-19) The current release is Dusart v3.0.0, doi:10.5281/zenodo.23463154; its clean replay rebuilt the whole sieve certificate in a fresh Lean kernel environment (10 of 10 replay steps passed). The statement and proof of Dusart.chebyshev_theta_k2_finite are unchanged from v2.0.0, and for the reason above the entry stays Open here.

Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
theorem Dusart.chebyshev_theta_k2_finite :
    ∀ t : ℝ, 3594641 ≤ t → t ≤ 3584912847 → |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); finite range checked there with exact values of θ (Tables 6.1, 6.2, 6.6).; proved in Lean 4 in doi:10.5281/zenodo.23432990

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