Recovering a sharp sum from finite differences of its Riesz sums
ProvedFiniteRieszSums.forwardDifference_desmoothinganalytic-number-theoryasymptoticsdirichlet-seriesfinite-differences
Let be a complex sequence with , let and set at nonnegative integers. For every integer order , positive integer spacing , and integer , the -fold forward difference satisfies
For fixed , division by recovers the sharp sum with error . This estimate applies to the coefficients 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 sorrySource
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.