Rosser-Schoenfeld theta lower bound beyond 10^10
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_analytic_largeThe Rosser–Schoenfeld lower bound for the Chebyshev function, in the range beyond numerical verification:
Why this range is separate. The mission already has the companion statements
TaoFivePrimes.rosser_schoenfeld_theta_lower_analytic_mid for and
TaoFivePrimes.rosser_schoenfeld_theta_lower_finite for (in the form
). Together with this statement they cover with no gap,
which is what TaoFivePrimes.rosser_schoenfeld_theta_lower_analytic asserts; without it that
node cannot be closed, since the ceiling on the middle range is exactly where
tabulated data stops.
What the proof needs. This is the range where the estimate stops being a computation and becomes analysis: the bound follows from the explicit formula together with a zero-free region for , in the form Rosser and Schoenfeld give (Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), Theorem 10 and its refinements). The error term is far larger than the truth — — so the statement has enormous room, and a crude zero-free region suffices. What it cannot be is a finite check.
The threshold is a seam, not a feature. Any constant between and the point where the analytic argument starts working would do; is chosen to match the ceiling of the middle-range node so that the three ranges abut exactly. In particular there is no claim that is where the analytic method first applies.
Note also that the form of the finite range and the form here are comparable only for , which holds from onward — that is why the assembled statement starts at rather than at .
import Mathlib import Definitions.Def_TaoFivePrimes_ArcSplit open MeasureTheory
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_analytic_large (t : ℝ) (h1 : 10 ^ 10 ≤ t) :
t * (1 - 1 / (2 * Real.log t)) < Chebyshev.theta t := by sorry
end TaoFivePrimes