Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonnegative Nyman–Beurling coefficients force remainder cost at least 1/421/421/42

Proved
NymanBeurling.nonnegative_coefficients_cost_ge_one_div_42

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

analytic-number-theoryfinite-certificatesnyman-beurlingriemann-hypothesis

Let ccc be a finitely supported rational sequence with ck≥0c_k\ge0ck​≥0 for every kkk, and write

ec(m)=1−∑d≥2cd−2m mod dd.e_c(m)=1-\sum_{d\ge2} c_{d-2}\frac{m\bmod d}{d}.ec​(m)=1−d≥2∑​cd−2​dmmodd​.

For every integer H≥0H\ge0H≥0, its Nyman–Beurling certificate cost satisfies

∑m=1Hec(m)2m(m+1)+(1+∑k∣ck∣)2H+1 ≥ 142.\sum_{m=1}^H\frac{e_c(m)^2}{m(m+1)}+\frac{(1+\sum_k|c_k|)^2}{H+1}\ \ge\ \frac1{42}.m=1∑H​m(m+1)ec​(m)2​+H+1(1+∑k​∣ck​∣)2​ ≥ 421​.

Consequently every certificate with cost strictly below 1/421/421/42 must contain a negative coefficient. A finite signed certificate is already known with cost below 1/431/431/43.

Preamble
import Mathlib.Data.Finsupp.Basic
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Algebra.BigOperators.Group.Finset.Basic

set_option autoImplicit false
Formal statement
theorem NymanBeurling.nonnegative_coefficients_cost_ge_one_div_42 (c : ℕ →₀ ℚ) (hc : ∀ k, 0 ≤ c k) (H : ℕ) :
    (1/42 : ℚ) ≤ (∑ 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
Finite dual certificate for NymanBeurling.arbitrarily_small_remainder_certificates, https://prove2.me/theorems/5b7b7b22-9280-4b04-9e90-f2f88cb85339 . The signed comparison witness is NymanBeurling.finite_remainder_certificates_through_42, https://prove2.me/theorems/ed644939-4ab2-4240-9464-c2c11589f785 . Integer dual weights were chosen using a finite nonnegative least-squares calculation and checked by exact arithmetic.

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