Rosser–Schoenfeld (4.10), small range: product < e^γ log x + 2e^γ/√x for x < 286
ProvedTaoFivePrimes.rosser_schoenfeld_product_bound_to_286For every real number with ,
where the product runs over the primes and denotes the Euler–Mascheroni constant.
This is the small-range leg of the upper half of Theorem 23 of Rosser and Schoenfeld (p. 73, inequality (4.10)): the same bound as in the parent target, restricted to , the range below which their method is replaced by direct computation. Combined with the sibling middle-range and large-range legs it disposes of the whole range needed in their proof of the Mertens product bound (3.29); a Lean proof is a finite certification over the 61 primes : the product side is evaluated exactly as a rational, is bounded below by a -precision Taylor certificate, and by an integer overestimator, with the analytic step (monotonicity of in ) doing the rest.
Formalization Note. The product is written as in the parent target, ∏ p ∈ Nat.primesLE ⌊x⌋₊, (p : ℝ) / ((p : ℝ) - 1); is Real.exp Real.eulerMascheroniConstant and is Real.sqrt x.
import Mathlib.NumberTheory.PrimeCounting import Mathlib.NumberTheory.Harmonic.EulerMascheroni
namespace TaoFivePrimes
theorem rosser_schoenfeld_product_bound_to_286 (x : ℝ) (hx : 0 < x) (hx' : x < 286) :
∏ 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