Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded Möbius energies at fixed damping imply a shifted zero-free half-plane

Proved
NymanBeurling.fixed_damping_bounded_energy_implies_shifted_zero_free

by marozols · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

masullomoebius-functionnyman-beurlingriemannzetafunction

Fix ε>0\varepsilon>0ε>0. Write

RN,ε(m)=1+∑d=2N+1μ(d)dεm mod dd.R_{N,\varepsilon}(m)=1+\sum_{d=2}^{N+1}\frac{\mu(d)}{d^\varepsilon}\frac{m\bmod d}{d}.RN,ε​(m)=1+d=2∑N+1​dεμ(d)​dmmodd​.

Suppose the weighted prefix energies

∑m=1HRN,ε(m)2m(m+1)\sum_{m=1}^H\frac{R_{N,\varepsilon}(m)^2}{m(m+1)}m=1∑H​m(m+1)RN,ε​(m)2​

are bounded uniformly in the denominator cutoff NNN and the coordinate cutoff HHH. Then ζ(w)≠0\zeta(w)\ne0ζ(w)=0 for ℜw>1/2+ε\Re w>1/2+\varepsilonℜw>1/2+ε, with the pole w=1w=1w=1 excluded. This is a converse zero-free implication for the fixed-damping condition.

Preamble
import Mathlib
import Definitions.Def_NymanBeurling_DampedResidualLimits

open NymanBeurling
open scoped BigOperators
Formal statement
theorem NymanBeurling.fixed_damping_bounded_energy_implies_shifted_zero_free
    (ε : ℝ) (hε : 0 < ε)
    (hB : ∃ B : ℝ, ∀ N H : ℕ, (∑ n ∈ Finset.range H,
      (dampedResidualFinite N ε (n+1)) ^ 2 / ((n+1 : ℝ) * (n+2 : ℝ))) ≤ B)
    (w : ℂ) (hw : 1/2 + ε < w.re) (h1 : w ≠ 1) :
    riemannZeta w ≠ 0 := by sorry
Source
A converse to the fixed-damping convergence frontier https://prove2.me/theorems/b5d23ede-9bcc-4d2a-9c23-84182e886efc. The discrete Hilbert-space Mellin pairing is from B. Bagchi, On Nyman, Beurling and Baez-Duarte’s Hilbert space reformulation of the Riemann hypothesis, Proc. Indian Acad. Sci. (Math. Sci.) 116 (2006), pp. 137–146, https://arxiv.org/abs/math/0607733. The formalized finite Mellin inequality follows NymanBeurling.finite_remainder_zero_obstruction (Prove2Me submission 657705dd).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me