Rosser–Schoenfeld upper bound for the Chebyshev function
ProvedTaoFivePrimes.rosser_schoenfeld_psi_leadditive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes
For every real , the Chebyshev function satisfies
This is the Rosser–Schoenfeld theorem (their 1962 Theorem 12), recorded with the slack constant that Tao uses in Lemma 4.3 and in the proof of Proposition 4.10.
Preamble
import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_psi_le (x : ℝ) (hx : 0 < x) :
Chebyshev.psi x ≤ 1.04 * x := 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, Theorem 12; used with the slack constant in T. Tao, *Every odd number greater than 1 is the sum of at most five primes*, arXiv:1201.6656, https://arxiv.org/abs/1201.6656, Lemma 4.3 and proof of Proposition 4.10.