Rosser--Schoenfeld theta lower bound: high range, integer endpoint certificate
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_finite_large_high_integer_certificateLet denote the Chebyshev theta function, where ranges over the primes and is the natural logarithm.
For every integer with ,
This is the finite endpoint certificate of the high sub-range in Rosser and Schoenfeld's Theorem 19. The Chebyshev theta function is constant on each unit interval , so checking the inequality at the right endpoint of every such interval dominates the corresponding real statement throughout the interval. It is an unconditional finite statement about the primes up to : it asserts that the sum of over all primes stays above the linear expression with the stated margin.
Formalization Note The margin is comfortably large throughout the range (about at and about at ), so the statement is a finite verification rather than an asymptotic estimate.
import Mathlib.NumberTheory.Chebyshev
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_finite_large_high_integer_certificate (n : Nat) (h1 : 10 ^ 6 <= n) (h2 : n <= 10 ^ 8) :
((n : Real) + 1) - 2 * Real.sqrt ((n : Real) + 1) <= Chebyshev.theta n := by sorry
end TaoFivePrimes