Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser–Schoenfeld's Lemma 14: the primorial bound for n/φ(n)n/\varphi(n)n/φ(n)

Proved
TaoFivePrimes.rosser_schoenfeld_totient_lemma14

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

additive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes

Let n,mn, mn,m be positive integers, let p1<p2<⋯p_1 < p_2 < \cdotsp1​<p2​<⋯ be the primes, let φ\varphiφ be Euler's totient function, and let θ\thetaθ be the Chebyshev theta function. If

n<eθ(pm+1),n < e^{\theta(p_{m+1})},n<eθ(pm+1​),

then

nφ(n)  ≤  ∏i=1mpipi−1.(9.1)\frac{n}{\varphi(n)} \;\le\; \prod_{i=1}^{m} \frac{p_i}{p_i - 1}. \qquad (9.1)φ(n)n​≤i=1∏m​pi​−1pi​​.(9.1)

This is Lemma 14 of Rosser and Schoenfeld (1962), §9, p. 88, the elementary primorial bound underlying Theorem 15. Proof (as in the source): if q1<⋯<qrq_1 < \cdots < q_rq1​<⋯<qr​ are the distinct primes dividing nnn, then p1⋯pr≤q1⋯qr≤n<p1⋯pm+1p_1\cdots p_r \le q_1\cdots q_r \le n < p_1\cdots p_{m+1}p1​⋯pr​≤q1​⋯qr​≤n<p1​⋯pm+1​, so r≤mr \le mr≤m; moreover qi≥piq_i \ge p_iqi​≥pi​ and the map t↦t/(t−1)t \mapsto t/(t-1)t↦t/(t−1) is decreasing for t≥2t \ge 2t≥2, so ∏i=1rqiqi−1≤∏i=1rpipi−1≤∏i=1mpipi−1\prod_{i=1}^{r} \frac{q_i}{q_i-1} \le \prod_{i=1}^{r}\frac{p_i}{p_i-1} \le \prod_{i=1}^{m}\frac{p_i}{p_i-1}∏i=1r​qi​−1qi​​≤∏i=1r​pi​−1pi​​≤∏i=1m​pi​−1pi​​. Since n/φ(n)=∏q∣nqq−1n/\varphi(n) = \prod_{q \mid n} \frac{q}{q-1}n/φ(n)=∏q∣n​q−1q​, the claim follows.

Formalization note: Chebyshev.theta is Mathlib's θ\thetaθ, and Nat.nth Nat.Prime m is the (m+1)(m+1)(m+1)-st prime (zero-indexed), i.e. pm+1p_{m+1}pm+1​.

Preamble
import Mathlib.Data.Nat.Totient
import Mathlib.Data.Nat.Nth
import Mathlib.NumberTheory.Chebyshev
Formal statement
namespace TaoFivePrimes

theorem rosser_schoenfeld_totient_lemma14 (n m : ℕ) (hn : 1 ≤ n) (hm : 1 ≤ m)
    (h : (n : ℝ) < Real.exp (Chebyshev.theta (Nat.nth Nat.Prime m))) :
    (n : ℝ) / Nat.totient n ≤
      ∏ i ∈ Finset.range m,
        (Nat.nth Nat.Prime i : ℝ) / ((Nat.nth Nat.Prime i : ℝ) - 1) := by sorry

end TaoFivePrimes
Source
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 14, p. 88, and pp. 88–89 for the Rosser–Walker verification; 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.

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