Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chebyshev theta finite certificate: range [1699362, 17387265)

Proved
TaoFivePrimes.axler_chain_c3

by andreaskapfer · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

chebyshev-thetainterval-certificatenumber-theoryprime-number-theorem

Chebyshev θ\thetaθ certificate, segment k=3k=3k=3

Write θ(x)=∑p≤xlog⁡p\theta(x)=\sum_{p\le x}\log pθ(x)=∑p≤x​logp. Assume as input the previous segment state at the integer 169936216993621699362:

1697867131810≤106θ(1699362)≤16979512937711697867131810\le 10^6\theta(1699362)\le 16979512937711697867131810≤106θ(1699362)≤1697951293771

This segment folds the next block chain and exports:

State at T=17387265T=17387265T=17387265:

17382708166135≤106 θ(17387265)≤1738345938432817382708166135\le 10^6\,\theta(17387265)\le 1738345938432817382708166135≤106θ(17387265)≤17383459384328

Pointwise bound. For every real xxx with 1699362≤x<173872651699362\le x<173872651699362≤x<17387265,

∣θ(x)−x∣<100x(log⁡x)4.|\theta(x)-x|<\frac{100x}{(\log x)^4}.∣θ(x)−x∣<(logx)4100x​.

As in the first segment, [1699362,17387265)[1699362,17387265)[1699362,17387265) is partitioned into consecutive prime-interval blocks, each block inequality is discharged by kernel computation, and the blocks are chained to give the pointwise bound and the state at the right endpoint.

Preamble
import Mathlib.NumberTheory.Chebyshev
import Mathlib.Algebra.Order.Floor.Div
Formal statement
theorem TaoFivePrimes.axler_chain_c3 (hprev : (1697867131810 : ℝ) ≤ (1000000 : ℝ) * Chebyshev.theta (1699362 : ℝ) ∧ (1000000 : ℝ) * Chebyshev.theta (1699362 : ℝ) ≤ (1697951293771 : ℝ)) :
    ((17382708166135 : ℝ) ≤ (1000000 : ℝ) * Chebyshev.theta (17387265 : ℝ) ∧ (1000000 : ℝ) * Chebyshev.theta (17387265 : ℝ) ≤ (17383459384328 : ℝ)) ∧
    (∀ x : ℝ, (1699362 : ℝ) ≤ x → x < (17387265 : ℝ) → |Chebyshev.theta x - x| < 100 * x / (Real.log x) ^ 4) := by sorry
Source
Decomposition of the platform target TaoFivePrimes.axler_theta_log_four_finite_certificate (finite verification of Axler's bound |theta(x) - x| < 100 x / (log x)^4 on [70111, 10^8)); block data generated and exact-checked against the source certificate, Mathlib rev 0df444a360eaa60ab8c11dca51a86af692955474.

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