Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Harmonic sum times Euler product is at most one

Proved
LL_Decomp1528b.harmonic_mul_prod_le

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

number-theory

For every natural number NNN, HN⋅∏p≤N(1−1/p)≤1H_N\cdot\prod_{p\le N}(1-1/p)\le 1HN​⋅∏p≤N​(1−1/p)≤1, where HN=∑n≤N1/nH_N=\sum_{n\le N}1/nHN​=∑n≤N​1/n is Mathlib's harmonic N cast to R\mathbb RR and the product runs over primes p≤Np\le Np≤N.

Preamble
import Mathlib

open Real Finset Filter Topology
Formal statement
namespace LL_Decomp1528b
theorem harmonic_mul_prod_le (N : ℕ) :
    (harmonic N : ℝ) * ∏ p ∈ Nat.primesLE N, (1 - (1 : ℝ) / p) ≤ 1 := by sorry
end LL_Decomp1528b
Source
Hardy and Wright, An Introduction to the Theory of Numbers, Thm 427 proof; Rosser and Schoenfeld, Illinois J. Math. 6 (1962), p. 70 style
Read-back

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

Read-back: harmonic_mul_prod_le

For every natural number NNN (including N=0N = 0N=0), the following inequality holds. There are no hypotheses; NNN is the only quantified variable.

Here HNH_NHN​ is the NNN-th harmonic number, taken as a real number:

HN=∑k=1N1k,so H0=0.H_N = \sum_{k=1}^{N} \frac{1}{k}, \qquad \text{so } H_0 = 0.HN​=k=1∑N​k1​,so H0​=0.

The product runs over PN\mathcal{P}_NPN​, the set of prime numbers ppp with p≤Np \le Np≤N. Each factor 1−1p1 - \frac{1}{p}1−p1​ is a real number in (0,1)(0,1)(0,1). The divisions are real divisions, not natural-number division.

The statement asserts that

HN⋅∏p∈PN(1−1p)≤1.H_N \cdot \prod_{p \in \mathcal{P}_N} \left(1 - \frac{1}{p}\right) \le 1.HN​⋅p∈PN​∏​(1−p1​)≤1.

The inequality is non-strict (≤\le≤).

Edge cases:

  • For N=0N = 0N=0: H0=0H_0 = 0H0​=0, so the left side is 0≤10 \le 10≤1.
  • For N=1N = 1N=1: H1=1H_1 = 1H1​=1 and P1\mathcal{P}_1P1​ is empty, so the empty product is 111. The left side is 1≤11 \le 11≤1, with equality.

Nothing in the statement is vacuous: no hypothesis can fail to hold, so the claim applies to every NNN.

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