Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.12 — fixed lattices from block-sparse linear systems

Proved
LatticePrepro.exists_latticeReduction

by WizardOfMenlo · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let p\mathsf pp be a prime and LLL a linear-system family over Fp\mathbb F_{\mathsf p}Fp​ with instance set XXX: a fixed linear map AAA on Fpι\mathbb F_{\mathsf p}^{\iota}Fpι​, right-hand sides bxb_xbx​ (x∈Xx\in Xx∈X), and n=∣ι∣n=|\iota|n=∣ι∣ columns partitioned into DDD blocks of size QQQ each. Let g∈Ng\in\mathbb Ng∈N with g<Qg<Qg<Q, assume D≥1D\ge1D≥1, and let ppp be a norm exponent, a real number p≥1p\ge1p≥1 or p=∞p=\inftyp=∞, with s=min⁡{p,2}s=\min\{p,2\}s=min{p,2} (s=2s=2s=2 for p=∞p=\inftyp=∞). Then there exist

  • a lattice Λ⊆ZM\Lambda\subseteq\mathbb Z^MΛ⊆ZM (an additive subgroup), the same for every instance, with 2n≤M<4n2n\le M<4n2n≤M<4n and N⋅ZM⊆ΛN\cdot\mathbb Z^M\subseteq\LambdaN⋅ZM⊆Λ for some integer N>0N>0N>0, so that Λ\LambdaΛ has full rank;
  • an integer target tx∈ZMt_x\in\mathbb Z^Mtx​∈ZM for every instance xxx;
  • an integer radius RRR with 1≤R≤M1\le R\le M1≤R≤M, the same for every instance;
  • a residual weight w(x,v)∈Nw(x,v)\in\mathbb Nw(x,v)∈N for every instance xxx and every v∈ZMv\in\mathbb Z^Mv∈ZM,

such that:

  1. YES instances. If Au=bxAu=b_xAu=bx​ has a solution u∈{0,1}ιu\in\{0,1\}^{\iota}u∈{0,1}ι with at most one nonzero coordinate per block, then ∥tx−v∥p≤R\|t_x-v\|_p\le R∥tx​−v∥p​≤R for some v∈Λv\in\Lambdav∈Λ.
  2. Weight bound. For every instance xxx and every v∈Λv\in\Lambdav∈Λ,
w(x,v)≤16⋅D⋅(∥tx−v∥pR)s.w(x,v)\le16\cdot D\cdot\left(\frac{\|t_x-v\|_p}{R}\right)^{s}.w(x,v)≤16⋅D⋅(R∥tx​−v∥p​​)s.
  1. NO instances. If every solution uuu of Au=bxAu=b_xAu=bx​ has Hamming weight greater than g⋅Dg\cdot Dg⋅D, then w(x,v)>g⋅Dw(x,v)>g\cdot Dw(x,v)>g⋅D for every v∈Λv\in\Lambdav∈Λ.

Parts 2 and 3 give ∥tx−v∥p>(g/16)1/sR\|t_x-v\|_p>(g/16)^{1/s}R∥tx​−v∥p​>(g/16)1/sR for all v∈Λv\in\Lambdav∈Λ on NO instances, so for g>16fsg>16f^sg>16fs the instances are fff-gap CVPP instances; this is how the paper phrases Lemma 3.12. It is the lattice half of the conversions: composed with the moment reduction (Theorem 4.8) it gives Theorem 5.1 for lattices, and the residual weight is the quantity tested in Lemma 5.2.

Formalization Note. The conclusion is Nonempty (LatticeReduction L g pn), i.e. such data exists; the structure LatticeReduction packages the lattice family (Λ,(tx))(\Lambda,(t_x))(Λ,(tx​)), RRR, NNN and www with the properties above. The lattice is a Z\mathbb ZZ-submodule of ZM\mathbb Z^MZM (Submodule ℤ (M → ℤ)), and full rank is encoded by N⋅ZM⊆ΛN\cdot\mathbb Z^M\subseteq\LambdaN⋅ZM⊆Λ. The norm exponent is a PNorm, so every real p≥1p\ge1p≥1 and p=∞p=\inftyp=∞ are covered, whereas the paper states the lemma for rational ppp (needed only for computability). The hypotheses g<Qg<Qg<Q (L.blockSize) and D≥1D\ge1D≥1 (L.numBlocks) correspond to Q>ΓQ>\GammaQ>Γ and D≥1D\ge1D≥1 in Definition 3.10; Lean's gap ggg is the paper's Γ\GammaΓ. The polynomial-time claims (integer basis, membership test, computing www) are not formalized, and www is an arbitrary function.

Note (existence form). This statement asserts only that some lattice reduction exists. The statement for the object that the paper constructs is LatticePrepro.LinearSystemFamily.exists_latticeReduction_eq.

Preamble
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

open LatticePrepro
Formal statement
theorem LatticePrepro.exists_latticeReduction {p : ℕ} [Fact p.Prime] {X : Type}
    (L : LinearSystemFamily (ZMod p) X) {g : ℕ} (hg : g < L.blockSize) (hD : 0 < L.numBlocks)
    (pn : PNorm) : Nonempty (LatticeReduction L g pn) := by sorry
Source
G. Fenzi, G. Weissenberg, Nearly Optimal Hardness for CVP and NCP with Preprocessing (STOC 2027 submission #847; IACR ePrint 2026/2634, https://eprint.iacr.org/2026/2634), Lemma 3.12 (\label{lem:block-system-lattices}); Lean: LatticePrepro/Conversions/Lattices.lean, LatticePrepro.exists_latticeReduction
Human review
  • Endorsed by Shuze Chen · Nov 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by WizardOfMenlo · Nov 15, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me