Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chebyshev theta finite certificate: anchor state and range [70111, 154970)

Proved
TaoFivePrimes.axler_chain_c1

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

chebyshev-thetainterval-certificatenumber-theoryprime-number-theorem

Chebyshev θ\thetaθ certificate: anchor state and first segment

Write θ(x)=∑p≤xlog⁡p\theta(x)=\sum_{p\le x}\log pθ(x)=∑p≤x​logp and T1=154970T_1=154970T1​=154970. The verified interval table for θ\thetaθ on [70111,108)[70111,10^8)[70111,108) begins with a carry block and one folded block chain, and this theorem exports its two outputs:

Anchor state. With 106θ(T1)10^6\theta(T_1)106θ(T1​) bracketed by integers,

154635160747≤106 θ(154970)≤154642599361.154635160747\le 10^6\,\theta(154970)\le 154642599361 .154635160747≤106θ(154970)≤154642599361.

Pointwise bound. For every real xxx with 70111≤x<15497070111\le x<15497070111≤x<154970,

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

The bound is established by folding 530953095309 consecutive prime-interval blocks: the interval [70111,154970)[70111,154970)[70111,154970) is partitioned into blocks [a,b)[a,b)[a,b) on which θ\thetaθ is trapped between rational bounds built from the primes in the block, and each block inequality is discharged by kernel computation. Chaining the blocks gives the pointwise bound on the whole segment.

Preamble
import Mathlib.NumberTheory.Chebyshev
import Mathlib.Algebra.Order.Floor.Div
Formal statement
theorem TaoFivePrimes.axler_chain_c1 :
    ((154635160747 : ℝ) ≤ (1000000 : ℝ) * Chebyshev.theta (154970 : ℝ) ∧ (1000000 : ℝ) * Chebyshev.theta (154970 : ℝ) ≤ (154642599361 : ℝ)) ∧
    (∀ x : ℝ, (70111 : ℝ) ≤ x → x < (154970 : ℝ) → |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