The smoothed sum is within of
ProvedDavenport.perron_smoothed_closeanalytic-number-theorycontour-integrationmellin-transformnumber-theoryprime-number-theoremsiegel-walfisz
Throughout, is a fixed smoothing kernel: a function on supported in , nonnegative on , with ; Smooth1 ν ε is the smoothed indicator of obtained by Mellin convolution with the delta-spike (it equals on , on , and lies in ), and is its Mellin transform (Mathlib's mellin).
Statement. There is a constant (depending only on ) such that for all coefficients with , all integers and all with ,
Indeed differs from the sharp indicator of only for in a window (plus ), where , and the window contains integers. This is the price of smoothing in the contour method; with it is absorbed in the de la Vallée Poussin error term.
Formalization Note. The left sum is a tsum over , the right one is over Finset.range N, i.e. .
Preamble
import Definitions.Def_MellinCalculus_defs import Definitions.Def_ResidueCalcOnRectangles_defs import Mathlib.NumberTheory.LSeries.Basic import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Analysis.MellinTransform import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Pow.Complex import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic open Set MeasureTheory
Formal statement
namespace Davenport
theorem perron_smoothed_close {ν : ℝ → ℝ} (diffν : ContDiff ℝ 1 ν)
(suppν : ν.support ⊆ Icc (1 / 2) 2) (νnonneg : ∀ x > 0, 0 ≤ ν x)
(mass_one : ∫ x in Ioi (0 : ℝ), ν x / x = 1) :
∃ C : ℝ, 0 < C ∧
∀ (a : ℕ → ℂ), (∀ n : ℕ, ‖a n‖ ≤ ArithmeticFunction.vonMangoldt n) →
∀ (N : ℕ), 3 < (N : ℝ) → ∀ ε : ℝ, 0 < ε → ε < 1 → 2 < N * ε →
‖(∑' n : ℕ, a n * (Smooth1 ν ε (n / N) : ℂ)) - ∑ n ∈ Finset.range N, a n‖
≤ C * ε * N * Real.log N := by sorry
end DavenportSource
PrimeNumberTheoremAnd project (A. Kontorovich, T. Tao et al.), https://github.com/AlexKontorovich/PrimeNumberTheoremAnd, file PrimeNumberTheoremAnd/MediumPNT.lean, theorem `SmoothedChebyshevClose` (platform theorem of the same name, for a(n) = Λ(n)); the elementary input is Λ(n) ≤ log n, H. Davenport, Multiplicative Number Theory, 3rd ed. (revised by H. L. Montgomery), GTM 74, Springer, 2000, https://doi.org/10.1007/978-1-4757-5927-3; §17 eq. (1)