Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser–Schoenfeld (1962), (3.29): Mertens product upper bound

Open
TaoFivePrimes.rosser_schoenfeld_product_bound

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

analytic-number-theorymertens-theoremnumber-theory

Rosser--Schoenfeld (1962), Theorem 8, inequality (3.29). For every real number x≥286x \ge 286x≥286,

∏p≤xpp−1  <  eγlog⁡x(1+12log⁡2x),\prod_{p \le x} \frac{p}{p-1} \;<\; e^{\gamma} \log x \left(1 + \frac{1}{2 \log^2 x}\right),p≤x∏​p−1p​<eγlogx(1+2log2x1​),

where the product runs over all primes p≤⌊x⌋p \le \lfloor x \rfloorp≤⌊x⌋ and γ\gammaγ is the Euler--Mascheroni constant.

This is the explicit upper bound for the Mertens-type product ∏p≤xp/(p−1)\prod_{p \le x} p/(p-1)∏p≤x​p/(p−1); equivalently, exponentiating the classical Mertens estimate ∑p≤xlog⁡(1−1/p)=−log⁡log⁡x−γ+o(1)\sum_{p \le x} \log(1 - 1/p) = -\log\log x - \gamma + o(1)∑p≤x​log(1−1/p)=−loglogx−γ+o(1), with an explicit error term valid from x≥286x \ge 286x≥286 on. It is inequality (3.29) of §8, Theorem 8, and is applied in §9 with x=log⁡n+y−2≥286x = \log n + y - 2 \ge 286x=logn+y−2≥286 in the proof of Lemma 15.

Preamble
import Mathlib.NumberTheory.PrimeCounting
import Mathlib.NumberTheory.Harmonic.EulerMascheroni
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_product_bound (x : ℝ) (hx : 286 ≤ x) :
    ∏ p ∈ Nat.primesLE ⌊x⌋₊, (p : ℝ) / ((p : ℝ) - 1) <
      Real.exp Real.eulerMascheroniConstant * Real.log x *
        (1 + 1 / (2 * (Real.log x) ^ 2)) := 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; §8, p. 70, Theorem 8, inequality (3.29). 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