Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Analytic ordered Dirichlet-series limit from a signed partial-sum bound

Proved
dirichlet_mellin_analytic_limit_of_partial_sum_bound

by ryanshin · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorydirichlet-seriesformalizationriemann-hypothesis

Let f:N→Cf:\mathbb N\to\mathbb Cf:N→C, r≥0r\ge0r≥0, and M(N)=∑n=1Nf(n)=O(Nr)M(N)=\sum_{n=1}^N f(n)=O(N^r)M(N)=∑n=1N​f(n)=O(Nr). Define M(t)=M(⌊t⌋)M(t)=M(\lfloor t\rfloor)M(t)=M(⌊t⌋) and

F(s)=s∫1∞M(t)t−s−1 dt.F(s)=s\int_1^\infty M(t)t^{-s-1}\,dt.F(s)=s∫1∞​M(t)t−s−1dt.

Then FFF is analytic on Re⁡s>r\operatorname{Re}s>rRes>r, and for every point in this half-plane,

lim⁡N→∞∑n=1Nf(n)ns=F(s).\lim_{N\to\infty}\sum_{n=1}^N\frac{f(n)}{n^s}=F(s).N→∞lim​n=1∑N​nsf(n)​=F(s).

The hypothesis bounds the signed sums, not the sums of absolute values. The conclusion concerns the displayed ordering of partial sums and does not assert absolute convergence. This is a reusable analytic continuation mechanism for cancellation-sensitive Dirichlet series.

Preamble
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Mathlib.NumberTheory.LSeries.Dirichlet
import Mathlib.NumberTheory.LSeries.SumCoeff
import Mathlib.Analysis.MellinTransform
import Mathlib.Tactic.NormNum
import Mathlib.Analysis.Complex.CauchyIntegral
open MeasureTheory
open scoped Topology
Formal statement
theorem dirichlet_mellin_analytic_limit_of_partial_sum_bound
    (f : ℕ → ℂ) {r : ℝ} (hr : 0 ≤ r)
    (hO : Asymptotics.IsBigO Filter.atTop
      (fun N : ℕ => ∑ n ∈ Finset.Icc 1 N, f n)
      (fun N : ℕ => (N : ℝ) ^ r)) :
    let F := fun s : ℂ => s * mellin (fun t : ℝ => ∑ n ∈ Finset.Icc 1 ⌊t⌋₊, f n) (-s)
    AnalyticOnNhd ℂ F {s : ℂ | r < s.re} ∧
      ∀ s : ℂ, r < s.re →
        Filter.Tendsto (fun N : ℕ => ∑ n ∈ Finset.Icc 1 N, f n / (n : ℂ) ^ s)
          Filter.atTop (nhds (F s)) := by sorry
Source
Derived specialization of pinned Mathlib https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/NumberTheory/AbelSummation.lean#L300, tendsto_sum_mul_atTop_nhds_one_sub_integral₀, and https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Analysis/MellinTransform.lean#L401, mellin_differentiableAt_of_isBigO_rpow. The cutoff below 1 turns the Mellin transform into the displayed improper integral.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me