Nonnegative Nyman–Beurling coefficients force remainder cost at least
ProvedNymanBeurling.nonnegative_coefficients_cost_ge_one_div_42analytic-number-theoryfinite-certificatesnyman-beurlingriemann-hypothesis
Let be a finitely supported rational sequence with for every , and write
For every integer , its Nyman–Beurling certificate cost satisfies
Consequently every certificate with cost strictly below must contain a negative coefficient. A finite signed certificate is already known with cost below .
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 sorrySource
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.