Rosser--Schoenfeld theta lower bound: high range, bootstrap shard
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_finite_large_high_cert701analytic-number-theorychebyshev-functionsnumber-theoryprimes
For every integer with , , and the certificate's accumulated bound satisfies . This is the bootstrap shard of the finite endpoint certificate of the high sub-range in Rosser and Schoenfeld's Theorem 19 (started at the Chebyshev bootstrap ); its second conjunct is the quantitative carry handed to the next shard.
Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_finite_large_high_cert701 (n : Nat) (h1 : 10001 <= n) (h2 : n <= 226652) :
(((n : Real) + 1) - 2 * Real.sqrt ((n : Real) + 1) <= Chebyshev.theta (n : Real)) /\
((248661901352816209 : Real) / 2 ^ 40 <= Chebyshev.theta (226653 : Real)) := by sorry
end TaoFivePrimesSource
J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), Theorem 19, p. 82, eq. (4.6), https://doi.org/10.1215/ijm/1255631807 (finite integer endpoint certificate, high sub-range 10^6 <= n <= 10^8, bootstrap shard)