Partial summation: a square-root Mertens bound implies convergence of the Möbius Dirichlet series for σ > 1/2
Provedmoebius_dirichlet_partialSum_tendsto_of_moebius_boundFor every real , if the Mertens function satisfies the square-root-with-arbitrary-epsilon bound for every — the hypothesis being exactly the statement of the platform node moebius_summatory_rpow_bound — then the real Möbius Dirichlet series converges at : the partial sums have a finite limit as .
This is the classical partial-summation (Abel) step from a Mertens bound to convergence of in the half-plane . Its role on the platform is structural: the implication from moebius_summatory_rpow_bound to moebius_dirichlet_partialSum_tendsto_of_half_lt was previously available only inlined inside an accepted sketch of the latter node, so the decomposition graph could not reference the summatory bound as a child of the convergence node. As a standalone theorem, this node makes that edge of the RH equivalence web explicit and reusable.
import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.Analysis.Asymptotics.Defs import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real open Finset Filter Asymptotics
theorem moebius_dirichlet_partialSum_tendsto_of_moebius_bound (σ : ℝ) (hσ : 1 / 2 < σ)
(hM : ∀ ε : ℝ, 0 < ε →
Asymptotics.IsBigO Filter.atTop
(fun N : ℕ => ∑ n ∈ Finset.Icc 1 N, (ArithmeticFunction.moebius n : ℂ))
(fun N : ℕ => (N : ℝ) ^ (1 / 2 + ε))) :
∃ L : ℝ, Filter.Tendsto
(fun N : ℕ => ∑ n ∈ Finset.Icc 1 N, (ArithmeticFunction.moebius n : ℝ) * (n : ℝ) ^ (-σ))
Filter.atTop (nhds L) := by sorry