Rosser–Schoenfeld: existence of the Lemma 15 parameter for
ProvedTaoFivePrimes.rosser_schoenfeld_totient_theta_existsadditive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes
Let be an integer with , and let denote the Chebyshev theta function. Then there exists a real number such that
This is the parameter-selection step in §9 of Rosser and Schoenfeld (1962), p. 89, which completes the proof of Theorem 15 for the analytic range: with this , Lemma 15 applies and yields . The source gives two constructions. For one takes ; then and , so by Theorem 19 ( for and ). For one takes ; then follows from (3.14) (). In both cases is immediate (for the first, monotonicity of in the stated range).
The statement here is stated for the range actually used by the reduction of the analytic half of Theorem 15.
Formalization note: Chebyshev.theta is Mathlib's function and Real.log is the natural logarithm.
Preamble
import Mathlib.Data.Nat.Totient import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_totient_theta_exists (n : ℕ) (hn : 3 ≤ n)
(hlog : 294 ≤ Real.log (n : ℝ)) :
∃ y : ℝ, 2.88 ≤ Real.log (n : ℝ) + y ∧
Real.log (n : ℝ) < Chebyshev.theta (Real.log (n : ℝ) + y) ∧
0 ≤ y - 2 ∧ y - 2 ≤ 0.9 * Real.log (n : ℝ) / Real.log (Real.log (n : ℝ)) := by sorry
end TaoFivePrimesSource
J.B. Rosser, L. Schoenfeld, *Approximate formulas for some functions of prime numbers*, Illinois Journal of Mathematics 6 (1962), 64–94, https://projecteuclid.org/journals/illinois-journal-of-mathematics/volume-6/issue-1/Approximate-formulas-for-some-functions-of-prime-numbers/10.1215/ijm/1255631807.full, §9, Lemma 15, p. 88, and p. 89 for the selection of ; Theorem 33, (3.29), (3.14), Theorem 19; used in T. Tao, *Every odd number greater than 1 is the sum of at most five primes*, arXiv:1201.6656, proof of Proposition 4.10.