Chebyshev theta finite certificate: range [52597756, 69355435)
ProvedTaoFivePrimes.axler_chain_c5achebyshev-thetainterval-certificatenumber-theoryprime-number-theorem
Chebyshev certificate, segment axler_chain_c5a
Write . Assume as input the previous segment state at the integer :
This segment folds the next block chain and exports:
State at :
Pointwise bound. For every real with ,
The interval is partitioned into consecutive prime-interval blocks grouped into chained groups; each block inequality is discharged by kernel computation and the groups are chained to give the pointwise bound and the state at the right endpoint. This segment is independent of the others: the previous state is a hypothesis.
Preamble
import Mathlib.NumberTheory.Chebyshev import Mathlib.Algebra.Order.Floor.Div
Formal statement
theorem TaoFivePrimes.axler_chain_c5a (hprev : (52589385226535 : ℝ) ≤ (1000000 : ℝ) * Chebyshev.theta (52597756 : ℝ) ∧ (1000000 : ℝ) * Chebyshev.theta (52597756 : ℝ) ≤ (52591511472754 : ℝ)) :
((69344896246415 : ℝ) ≤ (1000000 : ℝ) * Chebyshev.theta (69355435 : ℝ) ∧ (1000000 : ℝ) * Chebyshev.theta (69355435 : ℝ) ≤ (69347654882929 : ℝ)) ∧
(∀ x : ℝ, (52597756 : ℝ) ≤ x → x < (69355435 : ℝ) → |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.