A rational Gram determinant at polynomial row cutoffs characterizes small Bagchi certificates
ProvedNymanBeurling.polynomial_cutoff_rational_gram_criterionTake the first Bagchi atoms with denominators . On the first positive integers give row weight . Let be the determinant of the Gram matrix with the constant target appended, divided by the determinant of the Gram matrix of the atoms alone. Both matrices have rational entries.
For the denominator is nonzero. The gap is the least weighted squared error on those rows, and a rational minimizer attains it. Every rational certificate using those denominators, at any row cutoff, has cost at least . The attained certificate at cutoff costs at most . At its cost is within of the gap.
Arbitrarily small finite rational certificates exist if and only if the explicit sequence tends to zero. More generally any prescribed cutoff sequence gives exactly the same zero-limit criterion. This identifies a deterministic one-parameter arithmetic condition. The convergence itself remains open.
import Definitions.Def_NymanBeurling_RationalGram open NymanBeurling.RationalGram Filter Topology
theorem NymanBeurling.polynomial_cutoff_rational_gram_criterion :
(∀ (c : ℕ →₀ ℚ) (N : ℕ), 1 ≤ N → (∀ k ∈ c.support, k+2 ≤ N) →
(mass c)^2 ≤ 2*(N+1:ℚ)^2+36*(N:ℚ)^3*headEnergy c N) ∧
(∀ (D H : ℕ), D+1 ≤ H →
(NymanBeurling.RationalGram.gram D H).det ≠ 0 ∧ 0 ≤ gap D H ∧
(∀ (c : ℕ →₀ ℚ), (∀ k ∈ c.support, k < D) → ∀ K, gap D H ≤ cost c K) ∧
∃ c : ℕ →₀ ℚ, (∀ k ∈ c.support, k < D) ∧ headEnergy c H = gap D H ∧
cost c H ≤ gap D H+(2*(D+2:ℚ)^2+36*(D+1:ℚ)^3*gap D H)/(H+1:ℚ)) ∧
(∀ D, ∃ c : ℕ →₀ ℚ, (∀ k ∈ c.support, k < D) ∧
headEnergy c (rows D) = gap D (rows D) ∧
cost c (rows D) ≤ gap D (rows D)+38/(D+2:ℚ)) ∧
(SmallCertificates ↔ Tendsto (fun D => gap D (rows D)) atTop (𝓝 0)) ∧
(∀ h : ℕ → ℕ, (∀ D, (D+2)^3 ≤ h D) →
(SmallCertificates ↔ Tendsto (fun D => gap D (h D)) atTop (𝓝 0))) := by sorry