Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser–Schoenfeld (1962), §9: existence of the Lemma 15 parameter (corrected constant 288)

Proved
TaoFivePrimes.rosser_schoenfeld_totient_theta_exists_corrected

by andreaskapfer · 1 vote · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theorytotient

Rosser--Schoenfeld (1962), §9 (corrected constant). For every integer n≥3n \ge 3n≥3 with log⁡n≥294\log n \ge 294logn≥294 there exists a real number yyy such that

288≤log⁡n+y,log⁡n<θ(log⁡n+y),0≤y−2≤0.9 log⁡nlog⁡log⁡n,288 \le \log n + y, \qquad \log n < \theta(\log n + y), \qquad 0 \le y - 2 \le \frac{0.9\,\log n}{\log\log n},288≤logn+y,logn<θ(logn+y),0≤y−2≤loglogn0.9logn​,

i.e. yyy satisfies all the hypotheses of Lemma 15 (apart from n>1n > 1n>1, which follows from n≥3n \ge 3n≥3).

This is the existence statement used in §9, p. 89, to feed Lemma 15: on the range 255≤log⁡n≤1340255 \le \log n \le 1340255≤logn≤1340 one takes y=2+21+log⁡ny = 2 + 2\sqrt{1+\log n}y=2+21+logn​ and uses Theorem 19 (θ(t)>t−2t\theta(t) > t - 2\sqrt tθ(t)>t−2t​) to get log⁡n<θ(log⁡n+y)\log n < \theta(\log n+y)logn<θ(logn+y); on log⁡n≥1340\log n \ge 1340logn≥1340 one takes y=2+0.9log⁡n/log⁡log⁡ny = 2 + 0.9\log n/\log\log ny=2+0.9logn/loglogn and uses inequality (3.14) (θ(t)>t(1−1/(2log⁡t))\theta(t) > t(1 - 1/(2\log t))θ(t)>t(1−1/(2logt))). In the first range log⁡n+y≥255+2256=289\log n + y \ge 255 + 2\sqrt{256} = 289logn+y≥255+2256​=289, and in the second log⁡n≥1340\log n \ge 1340logn≥1340, so the displayed lower bound 288≤log⁡n+y288 \le \log n + y288≤logn+y holds in both cases. (Some OCR digitizations misread the printed constant 288288288 as "2.88".)

Preamble
import Mathlib.Data.Nat.Totient
import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_totient_theta_exists_corrected (n : ℕ) (hn : 3 ≤ n)
    (hlog : 294 ≤ Real.log (n : ℝ)) :
    ∃ y : ℝ, 288 ≤ 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 TaoFivePrimes
Source
J.B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94; §9, p. 89 (constant 288; cf. Theorem 19 and inequality (3.14)). https://doi.org/10.1215/ijm/1255631807

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me