Explicit Mertens bound on
ProvedLL_Decomp1528a.mertens1_smallnumber-theory
For every real number with , , where the sum runs over primes.
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem mertens1_small {x : ℝ} (hx : 1 ≤ x) (hx5 : x < 5) :
|∑ p ∈ Nat.primesLE ⌊x⌋₊, log p / p - log x| ≤ 2 := by sorry
end LL_Decomp1528aSource
Lab unit U-1528, small-range component of the explicit Mertens estimate; compare Rosser and Schoenfeld 1962, equations 3.21 and 3.24. Source context: https://arxiv.org/abs/2608.09488v1
Read-back
What the Lean code literally says, in plain math · claude-haiku
For every real with :
is Nat.floor, values 1 to 4 here. Sum body stops before the minus. For the sum is empty and the claim is . Near 5 only primes 2 and 3 appear and . No junk values. Proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.