Rosser--Schoenfeld theta lower bound: high range, sieve shard 30
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_finite_large_high_cert230Let 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 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 the Chebyshev theta function is constant. The certificate evaluates, for a chain of windows, the exact number of primes and the sum of their offsets above the window start (a bit-parallel sieve over the 1229 primes below ), converts at each 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 produced by the previous shard, which is what lets this shard start from a tight lower bound for ; the second conjunct is the carry it hands on. Both conjuncts are unconditional finite statements about the primes up to .
Formalization Note The range is one of twelve consecutive shards covering ; the shards are independent Lean files (the previous carry enters as a hypothesis) and the leaf theorem chains them and splits over their ranges.
import Mathlib.NumberTheory.Chebyshev
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_finite_large_high_cert230
(hbase : (104501626123100538332 : Real) / 2 ^ 40 <= Chebyshev.theta (95054541 : Real))
(n : Nat) (h1 : 95054541 <= n) (h2 : n <= 99999999) :
(((n : Real) + 1) - 2 * Real.sqrt ((n : Real) + 1) <= Chebyshev.theta (n : Real)) /\
((109937568534278953594 : Real) / 2 ^ 40 <= Chebyshev.theta (100000000 : Real)) := by sorry
end TaoFivePrimes