Mertens first theorem with explicit absolute error
ProvedLL_Decomp1528a.mertens1_absnumber-theory
For every real number , , where the sum runs over primes and denotes the natural logarithm.
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem mertens1_abs {x : ℝ} (hx : 1 ≤ x) :
|∑ p ∈ Nat.primesLE ⌊x⌋₊, log p / p - log x| ≤ 2 := by sorry
end LL_Decomp1528aSource
Rosser and Schoenfeld 1962, equations 3.21 and 3.24, p. 70; lab unit U-1528 assembly mertens1_abs, in the explicit-estimate context of Campbell 2026, Section 4. 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 :
The sum body is parsed at precedence 67, before the minus at 65, so the reading is , Mertens' first theorem with constant 2. Index set is the primes . At the left side is 0; for it is . No junk values. Non-strict; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.