Mertens product bound on the finite leg [5000, 5500]: exact rational walk from the 4999 primorial certificate
ProvedTaoFivePrimes.mertens_product_finite_leg_5000_to_5500Statement
For every real number with ,
where the product runs over the primes and denotes the Euler–Mascheroni constant.
Meaning
This is the first finite leg of the decomposition of
TaoFivePrimes.rosser_schoenfeld_product_bound_5000_to_1e8
(theorem 41877d9e-61fc-4fe8-ba5c-e031826409c4, status Open, deprecated_at null),
whose natural-language statement describes the expected proof split: a finite leg
followed by the analytic tail . It extends the certified
finite legs below (, , ) by one rung.
Proof route
Pure finite computation. The left-hand side is piecewise constant: it changes only at
the finitely many primes in , while the right-hand side is strictly
increasing in . It therefore suffices to check the inequality at the left endpoint
of each jump interval — an exact rational walk: the product at each step is an
exact rational, and the right-hand side at each prime admits rigorous rational bounds
(rational bounds for , , , in the style of
PrimePairSieve.sieve_constants_certificate), anchored at the primorial certificate
for . Decidable; no analysis required.
import Mathlib.NumberTheory.PrimeCounting import Mathlib.NumberTheory.Harmonic.EulerMascheroni set_option autoImplicit false
namespace TaoFivePrimes
theorem mertens_product_finite_leg_5000_to_5500 (x : ℝ) (hx : 5000 ≤ x) (hx' : x ≤ 5500) :
∏ 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