Theorem 5.1 (codes) for the paper's code — the code of the fixed linear system has gap
ProvedLatticePrepro.QuadraticVerifier.Tables.codeFamily_hasGapLet be a prime and let be a quadratic verifier over with instance length , assignment coordinates, evaluation tables and language . For a gap exponent put (momentAxes) and with = gapExp p δ. Tables for and consist of an integer with and an explicit moment representation in the sense of Theorem A.8 with axes and representation bound . They do not depend on the instance.
The fixed linear system of the tables is the system of Construction 4.5 built from them: is a fixed -linear map on whose columns are partitioned into blocks of size , and the right-hand side , for , is zero except for the entries of the translation equations, where is the encoding of the instance.
Statement. Let be a field of characteristic , let , and let be tables for and . Let , , be the code spanned over by , with the targets for a solution of if there is one and otherwise. Then, with = sizeExp p (1 - ε),
This is Theorem 5.1 for codes, for an arbitrary quadratic verifier, with the radius . 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 CodeFamily.HasGap. The field is any field that is an -algebra (the paper takes it finite). Polynomial-time computability of the code, 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 code 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.codeFamily_hasGap (F : Type) [Field F] [DecidableEq F] [Algebra (ZMod p) F] {ε : ℝ}
(hε : 0 < ε) (hε1 : ε < 1) (T : V.Tables (1 - ε)) :
(T.codeFamily F).HasGap T.system.numBlocks ε V.Language (V.S + 1) (sizeExp p (1 - ε)) := by sorry