Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Recovering a sharp sum from finite differences of its Riesz sums

Proved
FiniteRieszSums.forwardDifference_desmoothing

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

analytic-number-theoryasymptoticsdirichlet-seriesfinite-differences

Let a(n)a(n)a(n) be a complex sequence with ∣a(n)∣≤1|a(n)|\le 1∣a(n)∣≤1, let S(x)=∑n≤xa(n)S(x)=\sum_{n\le x}a(n)S(x)=∑n≤x​a(n) and set Rm(t)=∑n≤ta(n)(t−n)mR_m(t)=\sum_{n\le t}a(n)(t-n)^mRm​(t)=∑n≤t​a(n)(t−n)m at nonnegative integers. For every integer order m≥0m\ge0m≥0, positive integer spacing hhh, and integer x≥0x\ge0x≥0, the mmm-fold forward difference Δhm\Delta_h^mΔhm​ satisfies

∣ΔhmRm(x)−m!hmS(x)∣≤2m(mh)m+1.\left|\Delta_h^m R_m(x)-m!h^m S(x)\right|\le 2^m(mh)^{m+1}.∣Δhm​Rm​(x)−m!hmS(x)∣≤2m(mh)m+1.

For fixed m≥1m\ge1m≥1, division by m!hmm!h^mm!hm recovers the sharp sum with error Om(h)O_m(h)Om​(h). This estimate applies to the coefficients a(n)=μ(n)χ(n)a(n)=\mu(n)\chi(n)a(n)=μ(n)χ(n) used in the mission's sharp twisted Möbius bound.

Preamble
import Mathlib.Algebra.Group.ForwardDiff
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem FiniteRieszSums.forwardDifference_desmoothing (a : ℕ → ℂ) (ha : ∀ n, ‖a n‖ ≤ 1) (m x h : ℕ) (hh : 0 < h) :
    let R := fun t : ℕ => ∑ n ∈ Finset.range (t+1), a n * ((t:ℂ)-n)^m
    let S := ∑ n ∈ Finset.range (x+1), a n
    ‖(fwdDiff h)^[m] R x - ((m.factorial:ℂ)*(h:ℂ)^m)*S‖ ≤
      (2:ℝ)^m * ((m:ℝ)*h)^(m+1) := by sorry
Source
Independent elementary derivation for the finite Riesz kernel, using Mathlib’s forward-difference formula and its evaluation on a monomial: https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Group/ForwardDiff.lean. For the corresponding analytic Perron kernel see the Perron–Mellin formula, Theorem 7.6, equation (7.52), https://www.cs.purdue.edu/homes/spa/courses/pg17/mybook.pdf.

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