Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Each Gaussian–Mellin coefficient approaches its damped Dirichlet term

Proved
DeBruijnNewman.Dobner.mellin_mode_approximation

by adobner · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysiscomplex-analysisnumber-theory

Fix t<0t<0t<0, a strip a≤Re⁡s≤ba\leq\operatorname{Re}s\leq ba≤Res≤b with a<ba<ba<b, and one positive integer NNN. The normalized individual coefficient satisfies

Bt,N(s)γt(s)−exp⁡ ⁣(t4log⁡2N−slog⁡N)⟶0\frac{B_{t,N}(s)}{\gamma_t(s)} -\exp\!\left(\frac{t}{4}\log^2N-s\log N\right) \longrightarrow0γt​(s)Bt,N​(s)​−exp(4t​log2N−slogN)⟶0

uniformly in that strip as Im⁡s→+∞\operatorname{Im}s\to+\inftyIms→+∞. Precisely, for each ε>0\varepsilon>0ε>0 there is a height YYY such that the norm of this difference is below ε\varepsilonε whenever a≤Re⁡s≤ba\leq\operatorname{Re}s\leq ba≤Res≤b and Im⁡s≥Y\operatorname{Im}s\geq YIms≥Y. The height may depend on t,a,b,N,εt,a,b,N,\varepsilont,a,b,N,ε.

This is the qualitative, fixed-coefficient consequence of Lemma 4(i). It identifies the damped Dirichlet term associated with one contour coefficient and provides the individual limits used in a subsequent summation argument. No uniformity in NNN is asserted here.

Formalization Note. The natural-number index nnn represents the positive integer N=n+1N=n+1N=n+1.

Preamble
import Definitions.Def_DeBruijnNewman_Dobner_Mellin
Formal statement
theorem DeBruijnNewman.Dobner.mellin_mode_approximation (t : ℝ) (ht : t < 0)
    (a b : ℝ) (hab : a < b) (n : ℕ) (ε : ℝ) (hε : 0 < ε) :
    ∃ Y : ℝ, ∀ s : ℂ, a ≤ s.re → s.re ≤ b → Y ≤ s.im →
      ‖DeBruijnNewman.Dobner.normalizedMellinTerm t s n
        - DeBruijnNewman.Dobner.zetaTerm t s n‖ < ε := by sorry
Source
Alexander Dobner, A proof of Newman's conjecture for the extended Selberg class, arXiv:2005.05142v2 (10 January 2026), https://arxiv.org/abs/2005.05142v2, Lemma 4(i), p. 16; steepest-descent proof pp. 19–22, especially equations (21)–(28). Fixed-time, fixed-strip, fixed-index consequence.

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