Tails of the smoothed Perron integral on are
ProvedDavenport.perron_tail_boundanalytic-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 , and , with and ,
On the line the Dirichlet series is bounded by , , and , so the two tails contribute . This is the truncation step of the contour method; with it is negligible.
Formalization Note. VerticalIntegral' f σ is , and the truncated integral is written as ; LSeries a s is .
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_tail_bound {ν : ℝ → ℝ} (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) →
∀ (X : ℝ), 3 < X → ∀ ε : ℝ, 0 < ε → ε < 1 → ∀ T : ℝ, 3 < T →
‖VerticalIntegral'
(fun s : ℂ ↦ LSeries a s * mellin (fun x ↦ (Smooth1 ν ε x : ℂ)) s * (X : ℂ) ^ s)
(1 + (Real.log X)⁻¹)
- (1 / (2 * Real.pi * Complex.I)) * (Complex.I * ∫ t in (-T)..T,
LSeries a ((1 + (Real.log X)⁻¹ : ℝ) + t * Complex.I)
* mellin (fun x ↦ (Smooth1 ν ε x : ℂ)) ((1 + (Real.log X)⁻¹ : ℝ) + t * Complex.I)
* (X : ℂ) ^ ((1 + (Real.log X)⁻¹ : ℝ) + t * Complex.I))‖
≤ C * X * Real.log X / (ε * T) := by sorry
end DavenportSource
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 Lemma (truncated Perron formula) and §18 p. 112 (the estimate for |t| > T on the line σ = 1 + 1/log x); smoothed form after PrimeNumberTheoremAnd project (A. Kontorovich, T. Tao et al.), https://github.com/AlexKontorovich/PrimeNumberTheoremAnd, file PrimeNumberTheoremAnd/MediumPNT.lean, theorems `I1Bound` and `I9Bound` (platform theorems for a(n) = Λ(n))