Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bohr almost periods for Dobner's damped zeta series

Proved
DeBruijnNewman.Dobner.zeta_almost_periodic

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

analysisnumber-theoryriemann-hypothesis

Fix t<0t<0t<0 and let ZtZ_tZt​ be the Gaussian-damped zeta Dirichlet series. For every pair a<ba<ba<b of real numbers, every ε>0\varepsilon>0ε>0, and every real lower bound TTT, there exists a real shift τ≥T\tau\geq Tτ≥T such that

∣Zt(s+iτ)−Zt(s)∣<εfor every s∈C with a≤Re⁡s≤b.|Z_t(s+i\tau)-Z_t(s)|<\varepsilon \qquad\text{for every }s\in\mathbb C \text{ with }a\leq\operatorname{Re}s\leq b.∣Zt​(s+iτ)−Zt​(s)∣<εfor every s∈C with a≤Res≤b.

This is the unbounded-shift consequence of Bohr's almost-periodicity theorem for the everywhere absolutely convergent series ZtZ_tZt​. The estimate is uniform over the entire infinite strip, allowing a fixed zero disk to be translated to arbitrarily large heights.

Preamble
import Definitions.Def_DeBruijnNewman_Dobner
open Metric
Formal statement
theorem DeBruijnNewman.Dobner.zeta_almost_periodic (t : ℝ) (ht : t < 0)
    (a b : ℝ) (hab : a < b) (ε : ℝ) (hε : 0 < ε) (T : ℝ) :
    ∃ τ : ℝ, T ≤ τ ∧
      ∀ s : ℂ, a ≤ s.re → s.re ≤ b →
        ‖DeBruijnNewman.Dobner.zetaT t (s + (τ : ℂ) * Complex.I)
          - DeBruijnNewman.Dobner.zetaT t s‖ < ε := 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, Theorem 5 (Bohr's theorem), p. 14, and its application to F_t in Section 3.1, pp. 14–15. This states only the consequence that the almost periods are unbounded above, not the stronger density bounds in Theorem 5.

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