Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite rational remainder certificate excludes zeta zeros in an explicit disk

Proved
NymanBeurling.finite_remainder_zero_obstruction

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

analytic-number-theorynyman-beurlingriemann-zeta

For positive integers mmm set rk(m)=(m mod (k+2))/(k+2)r_k(m)=(m\bmod(k+2))/(k+2)rk​(m)=(mmod(k+2))/(k+2) and take a finitely supported rational vector ccc. Its residual is ec(m)=1−∑kckrk(m)e_c(m)=1-\sum_k c_k r_k(m)ec​(m)=1−∑k​ck​rk​(m). For an integer cutoff H≥0H\ge0H≥0 define the rational certificate cost

CH(c)=∑m=1Hec(m)2m(m+1)+(1+∑k∣ck∣)2H+1.C_H(c)=\sum_{m=1}^H\frac{e_c(m)^2}{m(m+1)}+\frac{(1+\sum_k |c_k|)^2}{H+1}.CH​(c)=m=1∑H​m(m+1)ec​(m)2​+H+1(1+∑k​∣ck​∣)2​.

The last term bounds the whole omitted tail by telescoping. If ζ(s)=0\zeta(s)=0ζ(s)=0, s≠1s\ne1s=1, and ℜs>1/2\Re s>1/2ℜs>1/2, then 2ℜs−1≤CH(c)∣s∣22\Re s-1\le C_H(c)|s|^22ℜs−1≤CH​(c)∣s∣2 for every certificate. In particular, a specific finite calculation with CH(c)∣s∣2<2ℜs−1C_H(c)|s|^2<2\Re s-1CH​(c)∣s∣2<2ℜs−1 certifies that ζ(s)≠0\zeta(s)\ne0ζ(s)=0. The inequality itself holds unconditionally.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
theorem NymanBeurling.finite_remainder_zero_obstruction (s : ℂ) (hs : 1 / 2 < s.re) (h1 : s ≠ 1)
    (hz : riemannZeta s = 0) (c : ℕ →₀ ℚ) (H : ℕ) :
    2*s.re-1 ≤ (((∑ n ∈ Finset.range H, (1 - ∑ k ∈ c.support, c k *
          (((n+1) % (k+2) : ℕ) : ℚ) / ((k+2 : ℕ) : ℚ))^2 /
          ((n+1 : ℚ)*(n+2 : ℚ))) +
      (1 + ∑ k ∈ c.support, |c k|)^2/(H+1) : ℚ) : ℝ) * ‖s‖^2 := by sorry
Source
B. Bagchi, On Nyman, Beurling and Baez-Duarte’s Hilbert space reformulation of the Riemann hypothesis, Proc. Indian Acad. Sci. (Math. Sci.) 116 (2006), 137–146, Theorems 1 and 2 and the Mellin identity (4). https://arxiv.org/abs/math/0607733. The finite rational tail majorant is an elementary explicit addition.

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