Harmonic sum times Euler product is at most one
ProvedLL_Decomp1528b.harmonic_mul_prod_leFor every natural number , , where is Mathlib's harmonic N cast to and the product runs over primes .
import Mathlib open Real Finset Filter Topology
namespace LL_Decomp1528b
theorem harmonic_mul_prod_le (N : ℕ) :
(harmonic N : ℝ) * ∏ p ∈ Nat.primesLE N, (1 - (1 : ℝ) / p) ≤ 1 := by sorry
end LL_Decomp1528bRead-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: harmonic_mul_prod_le
For every natural number (including ), the following inequality holds. There are no hypotheses; is the only quantified variable.
Here is the -th harmonic number, taken as a real number:
The product runs over , the set of prime numbers with . Each factor is a real number in . The divisions are real divisions, not natural-number division.
The statement asserts that
The inequality is non-strict ().
Edge cases:
- For : , so the left side is .
- For : and is empty, so the empty product is . The left side is , with equality.
Nothing in the statement is vacuous: no hypothesis can fail to hold, so the claim applies to every .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.