Rosser--Schoenfeld theta lower bound: high range, sieve shard 407
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_finite_large_high_cert407Let be the Chebyshev theta function ( prime, natural) and suppose the integer below satisfies .
Then for every integer with ,
and moreover the accumulated lower bound computed by the certificate satisfies .
This is a sub-shard of the finite endpoint certificate of the high sub-range in Rosser and Schoenfeld's Theorem 19: the finite verification at the integer endpoints on which is constant. The certificate computes, for a chain of windows, the exact number of primes and the sum of their offsets above each window start (a bit-parallel sieve over the 1229 primes below ), converts at the window start into a fixed-point lower bound, and checks at every checkpoint the exact integer inequality equivalent to . The hypothesis is the quantitative carry handed on by the previous shard, so this shard starts from a tight lower bound for ; the second conjunct is the carry it hands to the next one.
Formalization Note The split is a Lean file with the whole sieve infrastructure inlined; the shards are independent (the previous carry enters as a hypothesis) and the leaf theorem chains them.
import Mathlib.NumberTheory.Chebyshev
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_finite_large_high_cert407
(hbase : (46973921882473598918 : Real) / 2 ^ 40 <= Chebyshev.theta (42729109 : Real))
(n : Nat) (h1 : 42729109 <= n) (h2 : n <= 44464712) :
(((n : Real) + 1) - 2 * Real.sqrt ((n : Real) + 1) <= Chebyshev.theta (n : Real)) /\
((48879966140703406179 : Real) / 2 ^ 40 <= Chebyshev.theta (44464713 : Real)) := by sorry
end TaoFivePrimes