Cofinal small rational Gram gaps on an explicit subcubic cutoff at each accuracy
OpenNymanBeurling.cofinal_subcubic_rational_gram_rowsgram-matrixnyman-beurlingriemann-hypothesis
For each accuracy index and lower scale , there is an integer such that the rational Gram gap on the first Bagchi columns and weighted rows is at most . For fixed the number of rows is exactly . This estimate asks for a single explicit determinant comparison along a subsequence of integer scales at each accuracy. The finite rational certificate cost need not be small. The proved coefficient-mass bound in a45c709f makes any such comparison sufficient for the subpower-certificate frontier. Every full small-certificate family implies these cofinal comparisons by testing its fixed vectors against the larger column spans.
Preamble
import Definitions.Def_NymanBeurling_RationalGram open NymanBeurling.RationalGram
Formal statement
theorem NymanBeurling.cofinal_subcubic_rational_gram_rows (J B : ℕ) :
∃ n : ℕ, max 2 B ≤ n ∧
gap (n^(J+2)) (512*n^(3*(J+1))) ≤ 1/(J+1:ℚ) := by sorrySource
The weighted discrete Bagchi criterion, B. Bagchi, Proc. Indian Acad. Sci. (Math. Sci.) 116 (2006), 137–146. Proposed arithmetic input for NymanBeurling.subpower_remainder_certificates, 28d55614-fcbe-4180-a244-028572cf1883. The exact finite Gram comparison and coefficient-mass bound are proved in a45c709f-514b-47e9-abe4-c3c47b4f8981.