The S0 bound with explicit constant 500
Provedgpy_mertensS0_boundnumber-theory
For every natural number , the partial sum differs from by at most . The constant is fully explicit: it comes from the sharper bound together with . The proof is elementary, via the Dirichlet convolution with , , and for , plus truncated Euler product bounds; no prime number theorem or Chebyshev estimate is used. This discharges the hypothesis of the conditional bridge to the general one-variable Mertens bound, making the GPY monomial input unconditional. Formalization Note: the sum is written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_mertensS0_bound : ∀ i : ℕ,
abs ((∑ D ∈ Finset.range (i + 1), (if Squarefree D then (ArithmeticFunction.moebius D : ℝ) ^ 2
/ ((Nat.totient D : ℕ) : ℝ) else 0)) - Real.log (i : ℝ)) ≤ 500 := by sorrySource
GPY S0 bound: explicit unconditional Mertens input for hMono