Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite Burnol product lower bound for rational remainder certificates

Proved
NymanBeurling.finite_zero_product_obstruction

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

hilbert-spacesmellin-transformnyman-beurlingriemann-hypothesis

Let S be any finite set of distinct zeros ρ of the Riemann zeta function with Re(ρ)>1/2 and ρ≠1. For any finitely supported rational coefficient vector c and cutoff H, the rational certificate C_H(c) used in the Bagchi remainder criterion satisfies 1 − ∏_{ρ∈S}|1−1/ρ|² ≤ C_H(c). Every distinct zero contributes a factor. The statement includes the empty set and does not require an assumption on zero multiplicities.

Preamble
import Mathlib
Formal statement
theorem NymanBeurling.finite_zero_product_obstruction (S : Finset {z : ℂ // (1/2:ℝ)<z.re})
    (hS : ∀ z ∈ S, z.val≠1 ∧ riemannZeta z.val=0) (c : ℕ →₀ ℚ) (H : ℕ) :
    1 - ∏ z ∈ S, ‖1-1/z.val‖^2 ≤
      (((∑ 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) : ℚ) : ℝ) := by sorry
Source
J.-F. Burnol, A note on Nyman’s equivalent formulation of the Riemann hypothesis, https://arxiv.org/abs/math/9910055 . This specializes the finite distinct-zero product bound to the discrete certificate of the mission. See also B. Bagchi, https://arxiv.org/abs/math/0607733 .

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