Theorem 5.1 (lattices) for the paper's lattice — the lattice of Lemma 3.12 for the fixed linear system has gap
ProvedLatticePrepro.QuadraticVerifier.Tables.latticeFamily_hasGapLet be a real norm exponent or , with , and let . Let be a quadratic verifier over with instance length , assignment coordinates and language , and let be tables for and the gap exponent (a base and an explicit moment representation, independent of the instance). Let be the fixed linear system of Construction 4.5 for , with blocks, let be the lattice of Lemma 3.12 for this system (the Construction A lattice of the padded code if , its blockwise Walsh–Hadamard transform otherwise), with its integer targets , and let be the radius of Lemma 3.12 (, or ).
Statement. With = sizeExp 2 (1 - s ε),
This is Theorem 5.1 for lattices, for an arbitrary quadratic verifier over . The existence form of this statement only asserts that some code or lattice with targets has the gap. Since the Lean statement does not require the targets to be computable, that form is satisfied by a construction unrelated to the paper, in which the target records whether is in the language. Here the code, the lattice and the targets are the ones the paper constructs.
Formalization Note. The statement holds for every choice of tables; they exist by Tables.nonempty. The conclusion is LatticeFamily.HasGap. The exponent ranges over all reals and (the paper takes rational). Polynomial-time computability of the lattice and the targets is not formalized. The target uses a solution of picked by classical choice, where the paper uses Gaussian elimination; the distance from the target to the lattice does not depend on the solution.
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
import Definitions.Def_LatticePrepro_Reduction_LinearSystem
import Definitions.Def_LatticePrepro_Conversions_Codes
import Definitions.Def_LatticePrepro_Conversions_Codes_Ext
import Definitions.Def_LatticePrepro_Conversions_ConstructionA
import Definitions.Def_LatticePrepro_Conversions_ConstructionA_Ext
import Definitions.Def_LatticePrepro_Conversions_Hadamard
import Definitions.Def_LatticePrepro_Conversions_Hadamard_Ext
import Definitions.Def_LatticePrepro_Conversions_Padding
import Definitions.Def_LatticePrepro_Conversions_Lattices
import Definitions.Def_LatticePrepro_Conversions_Lattices_Ext
import Definitions.Def_LatticePrepro_Lattices_Distance
import Definitions.Def_LatticePrepro_Moments_Basic
import Definitions.Def_LatticePrepro_Moments_Representation
import Definitions.Def_LatticePrepro_Verifier_Quadratic
import Definitions.Def_LatticePrepro_Reduction_FixedSystem
import Definitions.Def_LatticePrepro_Tables_Digits
import Definitions.Def_LatticePrepro_Tables_FieldSetup
import Definitions.Def_LatticePrepro_Tables_Hankel
import Definitions.Def_LatticePrepro_Tables_Construction
import Definitions.Def_LatticePrepro_Tables_ElementTable
import Definitions.Def_LatticePrepro_Tables_TableSoundness
import Definitions.Def_LatticePrepro_Tables_Explicit
import Definitions.Def_LatticePrepro_Lattices_Mathlib
import Definitions.Def_LatticePrepro_Main
import Definitions.Def_LatticePrepro_Verifier_Gates
import Definitions.Def_LatticePrepro_Verifier_Circuit
import Definitions.Def_LatticePrepro_Verifier_Expr
import Definitions.Def_LatticePrepro_Verifier_ThreeSAT
import Definitions.Def_LatticePrepro_ThreeSAT
import Definitions.Def_LatticePrepro_ThreeSAT_Ext
import Definitions.Def_LatticePrepro_Explicit
open LatticePrepro
open LatticePrepro.QuadraticVerifier
variable {p : ℕ} [hp : Fact p.Prime]
open LatticePrepro.QuadraticVerifier.Tables
variable {V : QuadraticVerifier p} {δ : ℝ}theorem LatticePrepro.QuadraticVerifier.Tables.latticeFamily_hasGap (pn : PNorm) {ε : ℝ} (hε : 0 < ε) (hε1 : ε < 1 / pn.s)
{V : QuadraticVerifier 2} (T : V.Tables (1 - pn.s * ε)) :
(T.latticeFamily pn).HasGap pn (T.latticeRadius pn) ε V.Language (V.S + 1)
(sizeExp 2 (1 - pn.s * ε)) := by sorry