Conditional Mertens bound: an S0 bound implies the general S_m bound
Provedgpy_mertensMuSqSum_bound_of_S0number-theory
CONDITIONAL statement. Assume a constant such that for every i, the partial sum differs from by at most . Then for every m and T, the log-power sum differs from by at most . The constant is exact. The S0 bound itself is a hypothesis of this theorem and is NOT proved by it; nothing here asserts that any such exists. Formalization Note: the weight on squarefree D (0 otherwise) and both sums are written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_mertensMuSqSum_bound_of_S0 (m : ℕ) (T : ℕ) (C₀ : ℝ)
(hC₀ : 0 ≤ C₀)
(hS0 : ∀ i : ℕ,
abs ((∑ D ∈ Finset.range (i + 1), (if Squarefree D then (ArithmeticFunction.moebius D : ℝ) ^ 2
/ ((Nat.totient D : ℕ) : ℝ) else 0)) - Real.log (i : ℝ)) ≤ C₀) :
abs ((∑ D ∈ Finset.range (T + 1),
(if Squarefree D then (ArithmeticFunction.moebius D : ℝ) ^ 2
/ ((Nat.totient D : ℕ) : ℝ) else 0) * (Real.log (D : ℝ)) ^ m)
- (Real.log (T : ℝ)) ^ (m + 1) / ((m : ℝ) + 1))
≤ (6 + 2 * C₀) * (Real.log (T : ℝ)) ^ m := by sorrySource
GPY Mertens partial: harmonic log-power bound and the conditional bridge from an S0 bound to the general S_m bound