Correctness of the tester Gram-matrix construction program
ProvedExpandingCodes.Computation.TesterGram.program_stopscoding-theorycomplexity-theoryexpanding-codes-polynomial-stretch
Let with , let be the point dimension, the monomial degree cutoff, , and the received word. Let satisfy the tester core contract for these parameters, using registers and three buffers. Assume its first buffer head equals one, the first two buffers have bottom markers, and
For any input , the Gram construction reaches the complete specified build state after
The build state certifies all entries of the full padded Gram representation together with its storage and preservation invariants. The clock is the defined program bound. This isolates construction of the matrix from its later rank computation.
Preamble
import Definitions.Def_ExpandingCodes_PolynomialStretch_BinaryRuntime set_option autoImplicit false open scoped Classical open NKtLB
Formal statement
theorem ExpandingCodes.Computation.TesterGram.program_stops (d ell : ℕ) (h : 0<ell) (D M : ℕ) (hM : 1 ≤ M)
(y : Fin ((2^ell)^d) → Bool) (inp : Inputs) (s : ExpandingCodes.Computation.TapeStore (80+6*d) 3)
(hc : ExpandingCodes.Computation.TesterGram.Core d ell h D M y s) (hh : s.bufferHead 0=1)
(hm : ExpandingCodes.Computation.TapeArrays.BottomMarked s 0) (hsp : ExpandingCodes.Computation.TapeArrays.BottomMarked s 1)
(hdM : d*((2^ell)-1) ≤ M) (hhead : 1+(2^ell)^d*(2^ell) ≤ M)
(hmatrix : (2^ell)^d*(2^ell)^d ≤ M) :
∃ t e,t ≤ ExpandingCodes.Computation.TesterGram.programTime d M ((2^ell)^d) ∧ (ExpandingCodes.Computation.TesterGram.program d).Stops inp (s.toCfg (ExpandingCodes.Computation.TesterGram.program d).entry) t e ∧
ExpandingCodes.Computation.TesterGram.BuildState d ell h D M y s ((2^ell)^d*(2^ell)^d) e.store := by sorry
Source
Algorithmic supporting lemma for Section 2 of Isaac M Hair and Amit Sahai, Expanding Codes with Polynomial Stretch; the explicit tape-machine implementation is formalized in ExpandingCodes.Computation.TesterGramCorrectness. Supporting formal implementation contract, rather than a verbatim statement in the paper. Exact local source: ExpandingCodes/Computation/TesterGramCorrectness.lean, declaration ExpandingCodes.Computation.TesterGram.program_stops; source file SHA256 dbb5aa866a876da3ff2770c131d50afa586b9ceb6b528cd0e568b35848e1a380. The public construction is at https://prove2.me/missions/Expanding_Codes_with_Polynomial_Stretch.