Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

TaoFivePrimes.rosser_schoenfeld_product_bound_3500_to_4000

Proved

by chstdu · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorymertens-theoremnumber-theory

For every real number xxx with 3500≤x≤40003500 \le x \le 40003500≤x≤4000,

∏p≤x,  p primepp−1<eγlog⁡x+2eγx,\prod_{p \le x, \; p \text{ prime}} \frac{p}{p-1} < e^{\gamma} \log x + \frac{2e^{\gamma}}{\sqrt{x}},p≤x,p prime∏​p−1p​<eγlogx+x​2eγ​,

where the product runs over the primes p≤xp \le xp≤x and γ\gammaγ denotes the Euler–Mascheroni constant.

This is a finite-range leg of the upper half of Theorem 23 of Rosser and Schoenfeld (p. 73, inequality (4.10)): the same bound as in the parent target, restricted to 3500≤x≤40003500 \le x \le 40003500≤x≤4000. The range is chosen so that the statement can be verified by a finite certificate over the primes in the interval, anchored on the exact primorial certificate at 349934993499 and telescoping the Euler product over the 616161 primes between 349934993499 and 398939893989, with the composite gap 3990…40003990 \dots 40003990…4000 discharged by an interval exhaustion.

Preamble
import Mathlib.NumberTheory.PrimeCounting
import Mathlib.NumberTheory.Harmonic.EulerMascheroni
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_product_bound_3500_to_4000 (x : ℝ) (hx : 3500 ≤ x) (hx' : x ≤ 4000) :
    ∏ p ∈ Nat.primesLE ⌊x⌋₊, (p : ℝ) / ((p : ℝ) - 1) <
      Real.exp Real.eulerMascheroniConstant * Real.log x +
        2 * Real.exp Real.eulerMascheroniConstant / Real.sqrt x := 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; §5, p. 73, Theorem 23, inequality (4.10). https://doi.org/10.1215/ijm/1255631807 Finite range 3500≤x≤40003500 \le x \le 40003500≤x≤4000. Companion to TaoFivePrimes.rosser_schoenfeld_product_bound_3000_to_3500 and TaoFivePrimes.rosser_schoenfeld_product_bound_2500_to_3000 (same range family, now anchored on primorial_certificate_3499).

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