Rosser--Schoenfeld theta lower bound: high range, analytic floor step
ProvedTaoFivePrimes.rosser_schoenfeld_theta_lower_finite_large_high_floor_stepLet denote the Chebyshev theta function, where ranges over the primes and is the natural logarithm, and let be the integer part of a real number .
For every real with ,
This is the analytic monotonicity step that reduces the real range of the finite Rosser--Schoenfeld estimate to integer inputs. The map is strictly increasing on , and is strictly smaller than the next integer , which is the right endpoint of the unit interval containing . Hence is strictly dominated by the value of the same expression at that endpoint. Combined with the integer endpoint certificate on the same range, this gives for all real in the range, the finite lower bound of Rosser and Schoenfeld's Theorem 19.
Formalization Note The upper hypothesis is not used by the argument; it is retained so that the statement matches the range of the parent target.
import Mathlib.NumberTheory.Chebyshev
namespace TaoFivePrimes
theorem rosser_schoenfeld_theta_lower_finite_large_high_floor_step (t : Real) (h1 : 10 ^ 6 <= t) (h2 : t <= 10 ^ 8) :
t - 2 * Real.sqrt t < ((Nat.floor t : Real) + 1) - 2 * Real.sqrt ((Nat.floor t : Real) + 1) := by sorry
end TaoFivePrimes