Rosser–Schoenfeld's Lemma 15 for the totient function
OpenTaoFivePrimes.rosser_schoenfeld_totient_lemma15additive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes
Let be an integer, a real number, Euler's totient function, the Euler–Mascheroni constant, and the Chebyshev theta function. Assume
Then
This is Lemma 15 of Rosser and Schoenfeld (1962), §9 (p. 88), the analytic core of Theorem 15. In the source it is obtained by applying Theorem 33 to bound by the Mertens-type product (3.29), giving
from which (3.41) follows since . The hypothesis is what converts the primorial bound of Theorem 33 into a bound on .
Formalization note: Chebyshev.theta is Mathlib's function, Real.exp Real.eulerMascheroniConstant is , and Nat.totient is .
Preamble
import Mathlib.Data.Nat.Totient import Mathlib.NumberTheory.Chebyshev import Mathlib.NumberTheory.Harmonic.EulerMascheroni
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_totient_lemma15 (n : ℕ) (y : ℝ) (hn : 1 < n)
(h1 : 2.88 ≤ Real.log (n : ℝ) + y)
(h2 : Real.log (n : ℝ) < Chebyshev.theta (Real.log (n : ℝ) + y))
(h3 : 0 ≤ y - 2)
(h4 : y - 2 ≤ 0.9 * Real.log (n : ℝ) / Real.log (Real.log (n : ℝ))) :
(n : ℝ) / Nat.totient n <
Real.exp Real.eulerMascheroniConstant * Real.log (Real.log (n : ℝ)) +
5 / (2 * 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.