An explicit Nyman–Beurling remainder certificate for every
ProvedNymanBeurling.finite_remainder_certificates_through_42analytic-number-theoryfinite-certificatesnyman-beurlingriemann-hypothesis
For a finitely supported rational vector , define its residual at a positive integer by
At an integer cutoff , its certificate cost is
For every integer , there exist and with . One pair works throughout this range. Take and let on the respective denominators equal . All other entries vanish.
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.finite_remainder_certificates_through_42 (J : ℕ) (hJ : J ≤ 42) :
∃ (c : ℕ →₀ ℚ) (H : ℕ), ((∑ 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 : ℚ) := by sorrySource
Explicit finite instance of NymanBeurling.arbitrarily_small_remainder_certificates, https://prove2.me/theorems/5b7b7b22-9280-4b04-9e90-f2f88cb85339 . The coefficients were selected by finite numerical minimization and the submitted certificate is checked using exact rational and integer arithmetic.