Prime coefficients forced by finite Nyman–Beurling remainder certificates
ProvedNymanBeurling.prime_coefficient_sq_le_certificateapproximation-theorylower-boundsnyman-beurlingriemann-hypothesis
For every finitely supported rational coefficient vector , cutoff and prime , the exact rational cost from the finite remainder criterion bounds the deviation of the coefficient at denominator :
In particular, if and , denominator must be present, regardless of the larger denominators used. Any sequence of certificate costs tending to zero forces each fixed prime coefficient to approach one.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem NymanBeurling.prime_coefficient_sq_le_certificate (c : ℕ →₀ ℚ) (H p : ℕ) (hp : p.Prime) :
(1 - c (p-2))^2 ≤ (if p=2 then 14 else 2*(p:ℚ)^2+2) *
((∑ 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
Elementary obstruction for the finite rational Nyman–Beurling remainder certificate https://prove2.me/theorems/5b7b7b22-9280-4b04-9e90-f2f88cb85339, based on the jump at a prime of the discrete remainder (n mod d)/d and weighted Cauchy–Schwarz.