Rosser--Schoenfeld (3.14) finite range : certificate segment 252 of 1348
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_mid_e10_seg0252Let be the Chebyshev theta function ( prime, natural), and suppose the integer satisfies .
Then for every integer with ,
and moreover the integer satisfies .
Role: this is segment of consecutive segments covering , the finite verification behind the range of Rosser and Schoenfeld's inequality (3.14), (Theorem 4), which is the parent node TaoFivePrimes.rosser_schoenfeld_theta_lower_analytic_mid. Since is constant between consecutive integers, the bound at the integers with gives the bound for real , and holds for . The hypothesis is the lower bound for handed on by the previous segment (for the first segment it is the second conjunct of TaoFivePrimes.rosser_schoenfeld_theta_lower_mid_lower_cert151, the last segment of the range ); the second conjunct is the lower bound this segment hands to the next one. Both conjuncts are unconditional finite statements about the primes up to .
Formalization Note The constant in front of is a formalization choice: it is weaker than the of Rosser--Schoenfeld's Theorem 19 (which is stated only up to ) and is all that (3.14) needs on this range. The segment endpoints and the integers , are the exact values produced by the certificate chain; segment 's is segment 's .
import Mathlib.NumberTheory.Chebyshev
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_mid_e10_seg0252
(hbase : (2859868370994453275355 : Real) / 2 ^ 40 <= Chebyshev.theta (2601067412 : Real))
(n : Nat) (h1 : 2601067412 <= n) (h2 : n <= 2607576509) :
(((n : Real) + 1) - 10 * Real.sqrt ((n : Real) + 1) <= Chebyshev.theta (n : Real)) /\
((2867016306472803431090 : Real) / 2 ^ 40 <= Chebyshev.theta (2607576510 : Real)) := by sorry
end TaoFivePrimes