Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded real-line Dirichlet partial sums force a summatory power bound

Proved
summatory_isBigO_rpow_of_dirichlet_partial_bound

by sflicht · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

abel-summationasymptoticsdirichlet-seriesriemann-hypothesis

Let a:N→Ca:\mathbb N\to\mathbb Ca:N→C be any complex sequence and let σ≥0\sigma\ge0σ≥0. Suppose its ordered Dirichlet partial sums on the real line σ\sigmaσ are uniformly bounded: there is a real constant C≥0C\ge0C≥0 such that

∣∑k=1Na(k)kσ∣≤Cfor every N∈N.\left|\sum_{k=1}^{N}\frac{a(k)}{k^\sigma}\right|\le C \qquad\text{for every }N\in\mathbb N.​k=1∑N​kσa(k)​​≤Cfor every N∈N.

Then the ordinary summatory function obeys

∑k=1Na(k)=O(Nσ)(N→∞).\sum_{k=1}^{N}a(k)=O(N^\sigma)\qquad(N\to\infty).k=1∑N​a(k)=O(Nσ)(N→∞).

The hypothesis requires boundedness of the ordered partial sums; it does not require their convergence or absolute convergence. This provides an arithmetic bridge from a real-axis Dirichlet-polynomial bound to a Mertens-type growth estimate. In the theta Gram-certificate branch of the Masullo RH mission, one can apply it to a(k)=μ(k)a(k)=\mu(k)a(k)=μ(k) and σ=1/2+η\sigma=1/2+\etaσ=1/2+η.

Formalization Note. Finite sums use the inclusive interval from 111 to NNN, so the N=0N=0N=0 sum is empty. The natural number kkk is cast to C\mathbb CC before taking its complex power with real exponent; the comparison function in the big-O conclusion is the real power of NNN.

Preamble
import Mathlib.Algebra.BigOperators.Module
import Mathlib.Analysis.Normed.Group.Basic
import Mathlib.Analysis.Normed.Module.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.Asymptotics.Defs
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring

set_option autoImplicit false
open scoped BigOperators
open Filter Asymptotics
Formal statement
theorem summatory_isBigO_rpow_of_dirichlet_partial_bound
    (a : ℕ → ℂ) (σ : ℝ) (hσ : 0 ≤ σ)
    (hbound : ∃ C : ℝ, 0 ≤ C ∧ ∀ n : ℕ,
      ‖∑ i ∈ Finset.Icc 1 n, a i / (i : ℂ) ^ (σ : ℂ)‖ ≤ C) :
    (fun n : ℕ => ∑ i ∈ Finset.Icc 1 n, a i) =O[atTop]
      (fun n : ℕ => (n : ℝ) ^ σ) := by sorry
Source
Elementary Abel-summation lemma formalized for the Masullo RH mission. The finite summation identity is Mathlib Finset.sum_range_by_parts, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/BigOperators/Module.lean . Intended application: NymanBeurling.moebius_polynomial_fixed_line_bound, https://prove2.me/theorems/d6f5e94d-d64d-4be3-b952-882091cb75d8 . This is supporting formalization, not a theorem claimed to be extracted from Masullo's paper. The explicit estimate in the proof is 2*C*N^sigma.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me