Elementary lower bound for the Mertens product
ProvedLL_Decomp1528b.mertens_prod_lowernumber-theory
For every real , , the product being over primes , with the real number obtained by casting the natural number .
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_Decomp1528bSource
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 and one hypothesis . It asserts the following inequality.
Symbols and conventions:
- is a real number with . This is the only hypothesis. There is no upper bound on .
- is the natural logarithm. Since , , so the left-hand side is well defined and positive.
- is the floor of , taken as a natural number. Because , it is at least .
- is the set of primes with . Because , this set is nonempty and contains .
- The product runs over every prime . Each factor is computed in the real numbers, with cast from a natural number to a real number.
- The constant is a fixed natural number, cast to the reals.
The inequality is non-strict (). 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 is satisfiable, so the statement is not vacuous.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.