Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A lower bound on the cutoff of a rational Nyman–Beurling certificate

Proved
NymanBeurling.cutoff_lower_bound_from_prime_denominators

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

analytic-number-theoryapproximation-theoryriemann-hypothesis

If the rational certificate has cost less than 1/(J+1)1/(J+1)1/(J+1), select any finite set PPP of coefficient indices kkk for which p=k+2p=k+2p=k+2 is prime and 8p2+24≤J+18p^2+24\le J+18p2+24≤J+1. Then its cutoff satisfies H+1>(J+1)(1+∣P∣/2)2H+1>(J+1)(1+|P|/2)^2H+1>(J+1)(1+∣P∣/2)2. This is an unconditional necessary resource bound, uniform over the chosen coefficients.

Preamble
import Mathlib.Data.Finsupp.Basic
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum

Formal statement
theorem NymanBeurling.cutoff_lower_bound_from_prime_denominators (c : ℕ →₀ ℚ) (J H : ℕ) (P : Finset ℕ)
    (haccuracy : ((∑ 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) : ℚ) < 1 / (J + 1 : ℚ))
    (hprime : ∀ k ∈ P, (k+2).Prime)
    (hsize : ∀ k ∈ P, 8*((k : ℚ)+2)^2+24 ≤ (J+1 : ℚ)) :
    (J+1 : ℚ) * (1+(P.card : ℚ)/2)^2 < (H+1 : ℚ) := by sorry
Source
Independent consequence of the prime-coefficient obstruction and the exact tail majorant in the Bagchi discrete Nyman–Beurling criterion. https://prove2.me/theorems/5b7b7b22-9280-4b04-9e90-f2f88cb85339

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