Rosser–Schoenfeld (1962), Theorem 19: finite-range lower bound for θ
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_finiteanalytic-number-theorynumber-theoryprime-pairs
Let be the Chebyshev function, over primes . For every real with ,
This is the finite window of Theorem 19 of Rosser and Schoenfeld (1962), which states for (and again for ). It is the input used in §9 of that paper (p. 89) to construct the parameter of Lemma 15 in the range : taking makes , so that . For the argument lies in , so only this finite window is needed.
Formalization note: Chebyshev.theta is Mathlib's function on .
Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_finite (t : ℝ) (h1 : 255 ≤ t) (h2 : t ≤ 1420) :
t - 2 * Real.sqrt t < Chebyshev.theta t := by sorry
end TaoFivePrimesSource
J.B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94, Theorem 19, p. 82, eq. (4.6); used in §9, p. 89. https://doi.org/10.1215/ijm/1255631807