A lower bound on the cutoff of a rational Nyman–Beurling certificate
ProvedNymanBeurling.cutoff_lower_bound_from_prime_denominatorsanalytic-number-theoryapproximation-theoryriemann-hypothesis
If the rational certificate has cost less than , select any finite set of coefficient indices for which is prime and . Then its cutoff satisfies . 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 sorrySource
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