A 64-term Bagchi certificate of squared error less than one hundredth
ProvedNymanBeurling.finite_rational_remainder_energy_certificateanalytic-number-theorynyman-beurlingriemann-hypothesisverified-computation
There is an explicit vector with exactly 64 nonzero rational coefficients at denominators at most 240. For the Bagchi remainder , every finite prefix of is less than . The proof gives the uniform bound , including for the infinite series. Even the elementary finite rational certificate at , formed by adding to the -term prefix, is strictly below . Thus one fixed vector verifies every accuracy index of the subpower-certificate frontier at arbitrarily large lower cutoffs . Arbitrary remains the open arithmetic condition.
Preamble
import Mathlib open Finset
Formal statement
theorem NymanBeurling.finite_rational_remainder_energy_certificate :
∃ c : ℕ →₀ ℚ, c.support.card = 64 ∧ (∀ k ∈ c.support, k+2 ≤ 240) ∧
(let R := fun n : ℕ => 1 - ∑ k ∈ c.support, c k * ((((n+1) % (k+2) : ℕ) : ℚ) / (k+2 : ℚ))
let E := fun n : ℕ => (R n)^2 / ((n+1 : ℚ)*(n+2 : ℚ))
let C := (∑ n ∈ Finset.range 100000000, E n) + (1 + ∑ k ∈ c.support, |c k|)^2/100000001
C < 1/100 ∧
(∀ H : ℕ, ∑ n ∈ Finset.range H, E n < 1/100) ∧
∀ (J L : ℕ), J ≤ 99 → ∃ H : ℕ, L ≤ H ∧
(∑ n ∈ Finset.range H, E n) ≤ 1/(J+1 : ℚ) ∧ C^(J+1) ≤ (H+1 : ℚ)) := by sorrySource
B. Bagchi, On Nyman, Beurling and Baez-Duarte’s Hilbert space reformulation of the Riemann hypothesis, Proc. Indian Acad. Sci. (Math. Sci.) 116 (2006), 137–146. Partial quantitative case of NymanBeurling.subpower_remainder_certificates, Prove2Me 28d55614-fcbe-4180-a244-028572cf1883.