Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A 64-term Bagchi certificate of squared error less than one hundredth

Proved
NymanBeurling.finite_rational_remainder_energy_certificate

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

analytic-number-theorynyman-beurlingriemann-hypothesisverified-computation

There is an explicit vector with exactly 64 nonzero rational coefficients at denominators at most 240. For the Bagchi remainder R(m)=1−∑dcd(m mod d)/dR(m)=1-\sum_d c_d(m\bmod d)/dR(m)=1−∑d​cd​(mmodd)/d, every finite prefix of ∑m≥1R(m)2/[m(m+1)]\sum_{m\ge1}R(m)^2/[m(m+1)]∑m≥1​R(m)2/[m(m+1)] is less than 1/1001/1001/100. The proof gives the uniform bound 994/100000994/100000994/100000, including for the infinite series. Even the elementary finite rational certificate at K=108K=10^8K=108, formed by adding (1+∑d∣cd∣)2/(K+1)(1+\sum_d|c_d|)^2/(K+1)(1+∑d​∣cd​∣)2/(K+1) to the KKK-term prefix, is strictly below 1/1001/1001/100. Thus one fixed vector verifies every accuracy index J≤99J\le99J≤99 of the subpower-certificate frontier at arbitrarily large lower cutoffs LLL. Arbitrary JJJ remains the open arithmetic condition.

Preamble
import Mathlib

open Finset
Formal statement
theorem NymanBeurling.finite_rational_remainder_energy_certificate :
    ∃ c : ℕ →₀ ℚ, c.support.card = 64 ∧ (∀ k ∈ c.support, k+2 ≤ 240) ∧
      (let R := fun n : ℕ => 1 - ∑ k ∈ c.support, c k * ((((n+1) % (k+2) : ℕ) : ℚ) / (k+2 : ℚ))
       let E := fun n : ℕ => (R n)^2 / ((n+1 : ℚ)*(n+2 : ℚ))
       let C := (∑ n ∈ Finset.range 100000000, E n) + (1 + ∑ k ∈ c.support, |c k|)^2/100000001
       C < 1/100 ∧
       (∀ H : ℕ, ∑ n ∈ Finset.range H, E n < 1/100) ∧
       ∀ (J L : ℕ), J ≤ 99 → ∃ H : ℕ, L ≤ H ∧
         (∑ n ∈ Finset.range H, E n) ≤ 1/(J+1 : ℚ) ∧ C^(J+1) ≤ (H+1 : ℚ)) := 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. Partial quantitative case of NymanBeurling.subpower_remainder_certificates, Prove2Me 28d55614-fcbe-4180-a244-028572cf1883.

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