Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Elementary lower bound for the Mertens product

Proved
LL_Decomp1528b.mertens_prod_lower

by sthubbar · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For every real x≥2x\ge 2x≥2, 11500log⁡x≤∏p≤⌊x⌋(1−1p)\dfrac{1}{1500\log x}\le\prod_{p\le\lfloor x\rfloor}\left(1-\dfrac1p\right)1500logx1​≤∏p≤⌊x⌋​(1−p1​), the product being over primes p≤⌊x⌋p\le\lfloor x\rfloorp≤⌊x⌋, with the real number ppp obtained by casting the natural number ppp.

Preamble
import Mathlib

open Real Finset Filter Topology
Formal statement
namespace LL_Decomp1528b
theorem mertens_prod_lower {x : ℝ} (hx : 2 ≤ x) :
    1 / (1500 * log x) ≤ ∏ p ∈ Nat.primesLE ⌊x⌋₊, (1 - (1 : ℝ) / p) := by sorry
end LL_Decomp1528b
Source
Campbell, arXiv 2608.09488 v1, Section 4; compare Rosser and Schoenfeld, Illinois J. Math. 6 (1962), p. 70, eq. 3.25
Read-back

What the Lean code literally says, in plain math · claude-haiku

Read-back: LL_Decomp1528b.mertens_prod_lower

The declaration takes one real number xxx and one hypothesis 2≤x2 \le x2≤x. It asserts the following inequality.

11500 log⁡x  ≤  ∏p∈P(⌊x⌋)(1−1p)\frac{1}{1500\,\log x} \;\le\; \prod_{p \in P(\lfloor x \rfloor)} \left(1 - \frac{1}{p}\right)1500logx1​≤p∈P(⌊x⌋)∏​(1−p1​)

Symbols and conventions:

  • xxx is a real number with x≥2x \ge 2x≥2. This is the only hypothesis. There is no upper bound on xxx.
  • log⁡\loglog is the natural logarithm. Since x≥2x \ge 2x≥2, log⁡x≥log⁡2>0\log x \ge \log 2 > 0logx≥log2>0, so the left-hand side is well defined and positive.
  • ⌊x⌋\lfloor x \rfloor⌊x⌋ is the floor of xxx, taken as a natural number. Because x≥2x \ge 2x≥2, it is at least 222.
  • P(n)P(n)P(n) is the set of primes ppp with p≤np \le np≤n. Because ⌊x⌋≥2\lfloor x \rfloor \ge 2⌊x⌋≥2, this set is nonempty and contains 222.
  • The product runs over every prime p≤⌊x⌋p \le \lfloor x \rfloorp≤⌊x⌋. Each factor 1−1/p1 - 1/p1−1/p is computed in the real numbers, with ppp cast from a natural number to a real number.
  • The constant 150015001500 is a fixed natural number, cast to the reals.

The inequality is non-strict (≤\le≤). No other quantifiers, binders, or typeclass assumptions appear. The statement contains no division by a value that could be zero under the hypothesis, and no natural-number subtraction. The hypothesis 2≤x2 \le x2≤x is satisfiable, so the statement is not vacuous.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

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