Rosser–Schoenfeld: the finite verification for
ProvedTaoFivePrimes.rosser_schoenfeld_totient_finite_verificationFor every integer with there exists an integer such that, writing for the primes,
where is the Chebyshev theta function and is the Euler–Mascheroni constant.
This is the numerical verification step in §9 of Rosser and Schoenfeld (1962), pp. 88–89: using values of from the Rosser–Walker prime tabulation, the estimate (3.41) — with constant , sharpened to in the exceptional case (equation (3.42)) — is checked step by step for . For in the interval the inequality is checked at the left endpoint and transported to by monotonicity of . Since and , this covers all with the uniform constant . Combined with Lemma 14 (which converts the primorial bound into a bound for ) this gives the finite half of Theorem 15.
Formalization note: Chebyshev.theta is Mathlib's , Nat.nth Nat.Prime m is (zero-indexed), and Real.exp 294 is .
import Mathlib.Data.Nat.Totient import Mathlib.Data.Nat.Nth import Mathlib.NumberTheory.Chebyshev import Mathlib.NumberTheory.Harmonic.EulerMascheroni
namespace TaoFivePrimes
theorem rosser_schoenfeld_totient_finite_verification (n : ℕ) (hn : 3 ≤ n)
(hfin : (n : ℝ) < Real.exp 294) :
∃ m : ℕ, 1 ≤ m ∧ (n : ℝ) < Real.exp (Chebyshev.theta (Nat.nth Nat.Prime m)) ∧
(∏ i ∈ Finset.range m,
(Nat.nth Nat.Prime i : ℝ) / ((Nat.nth Nat.Prime i : ℝ) - 1)) <
Real.exp Real.eulerMascheroniConstant * Real.log (Real.log (n : ℝ)) +
2.50637 / Real.log (Real.log (n : ℝ)) := by sorry
end TaoFivePrimes