Chebyshev theta finite certificate: anchor state and range [70111, 154970)
ProvedTaoFivePrimes.axler_chain_c1chebyshev-thetainterval-certificatenumber-theoryprime-number-theorem
Chebyshev certificate: anchor state and first segment
Write and . The verified interval table for on begins with a carry block and one folded block chain, and this theorem exports its two outputs:
Anchor state. With bracketed by integers,
Pointwise bound. For every real with ,
The bound is established by folding consecutive prime-interval blocks: the interval is partitioned into blocks on which 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 sorrySource
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.