Theorem 5.1 (fixed code and lattice gaps) for 3SAT — both parts
ProvedLatticePrepro.ThreeSAT.fixed_code_and_lattice_gapsFor 3SAT on variables, with instance length (one bit per possible clause), both of the following hold.
- Codes. For every prime , every finite field of characteristic , and every , there is such that for every there are a linear code with , targets and an integer radius with
where is the Hamming distance to the code. 2. Lattices. For every , with , and every , there is such that for every there are a full-rank lattice (containing for some integer ) with , integer targets and an integer radius with
where .
This is the paper's Theorem 5.1 for the 3SAT verifier, and the final theorem of the formalization; it is the conjunction of ThreeSAT.exists_code_gap and ThreeSAT.exists_lattice_gap.
Formalization Note: The two parts assert Nonempty (CodeGap F ε (SAT v) (len v) C) and Nonempty (LatticeGap pn ε (SAT v) (len v) C); the constant is chosen before , so it depends only on the field (resp. norm exponent) and . Code distances are natural numbers (codeDist), lattice distances are real infima (latticeDist), ranges over all reals and (PNorm), and is a real power. Polynomial-time computability and description lengths are not formalized. The search test of Lemma 5.2 is a separate milestone for the paper's concrete tests; it is not bundled here, since without its running-time bound an abstract test would be satisfied by satisfiability itself.
Note (existence form). This statement asserts only that some code and some lattice with targets have the gap. The Lean statement does not require the targets to be computable, so this form is also satisfied by a construction unrelated to the paper, in which the target records whether the instance is in the language. The statement for the object that the paper constructs is LatticePrepro.ThreeSAT.explicit_code_and_lattice_gaps.
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_ConstructionA import Definitions.Def_LatticePrepro_Conversions_Hadamard import Definitions.Def_LatticePrepro_Conversions_Lattices import Definitions.Def_LatticePrepro_Lattices_Distance import Definitions.Def_LatticePrepro_Lattices_Mathlib 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_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 open LatticePrepro open LatticePrepro.ThreeSAT
theorem LatticePrepro.ThreeSAT.fixed_code_and_lattice_gaps :
(∀ (p : ℕ) [Fact p.Prime] (F : Type) [Field F] [Fintype F] [DecidableEq F]
[Algebra (ZMod p) F] (ε : ℝ), 0 < ε → ε < 1 →
∃ C : ℕ, ∀ v : ℕ, 1 ≤ v → Nonempty (CodeGap F ε (SAT v) (len v) C)) ∧
(∀ (pn : PNorm) (ε : ℝ), 0 < ε → ε < 1 / pn.s →
∃ C : ℕ, ∀ v : ℕ, 1 ≤ v → Nonempty (LatticeGap pn ε (SAT v) (len v) C)) := by sorryConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.