Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit truncation error for a Dirichlet series with bounded signed partial sums

Proved
dirichlet_mellin_truncation_error_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 with f(0)=0f(0)=0f(0)=0, and suppose r,C≥0r,C\ge0r,C≥0 and ∣M(N)∣≤CNr|M(N)|\le CN^r∣M(N)∣≤CNr for all integers N≥1N\ge1N≥1, where M(N)=∑n=1Nf(n)M(N)=\sum_{n=1}^Nf(n)M(N)=∑n=1N​f(n). Put F(s)=s∫1∞M(⌊t⌋)t−s−1 dtF(s)=s\int_1^\infty M(\lfloor t\rfloor)t^{-s-1}\,dtF(s)=s∫1∞​M(⌊t⌋)t−s−1dt. For σ=Re⁡s>r\sigma=\operatorname{Re}s>rσ=Res>r and N≥1N\ge1N≥1,

∣F(s)−∑n=1Nf(n)ns∣≤C(1+∣s∣σ−r)Nr−σ.\left|F(s)-\sum_{n=1}^N\frac{f(n)}{n^s}\right|\le C\left(1+\frac{|s|}{\sigma-r}\right)N^{r-\sigma}.​F(s)−n=1∑N​nsf(n)​​≤C(1+σ−r∣s∣​)Nr−σ.

This turns a signed partial-sum estimate into an explicit approximation guarantee. The constant and its dependence on distance to the convergence boundary are displayed. The zero-index normalization is harmless for series beginning at one.

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
open MeasureTheory
open scoped Topology
Formal statement
theorem dirichlet_mellin_truncation_error_bound
    (f : ℕ → ℂ) (hf : f 0 = 0)
    {r C : ℝ} (hr : 0 ≤ r) (hC : 0 ≤ C)
    (hbound : ∀ N : ℕ, 1 ≤ N →
      ‖∑ n ∈ Finset.Icc 1 N, f n‖ ≤ C * (N : ℝ) ^ r)
    {s : ℂ} (hs : r < s.re) {N : ℕ} (hN : 1 ≤ N) :
    ‖s * mellin (fun t : ℝ => ∑ n ∈ Finset.Icc 1 ⌊t⌋₊, f n) (-s) -
      (∑ n ∈ Finset.Icc 1 N, f n / (n : ℂ) ^ s)‖ ≤
      C * (1 + ‖s‖ / (s.re - r)) * (N : ℝ) ^ (r - s.re) := by sorry
Source
Derived quantitative corollary of pinned Mathlib https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/NumberTheory/AbelSummation.lean#L229, sum_mul_eq_sub_integral_mul₀'; https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Analysis/SpecialFunctions/ImproperIntegrals.lean#L172, integral_Ioi_rpow_of_lt; and https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/MeasureTheory/Integral/Bochner/Basic.lean#L947, norm_integral_le_of_norm_le. The bound is proved here from these cited identities, not attributed as a verbatim theorem.

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