Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.11, eq. (38), NO instances — every codeword is far from the target

Proved
LatticePrepro.LinearSystemFamily.code_no

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let ppp be a prime and LLL a linear-system family over Fp\mathbb F_pFp​: a fixed linear map AAA on Fpι\mathbb F_p^{\iota}Fpι​, right-hand sides bxb_xbx​, and a partition of the columns ι\iotaι into DDD blocks of size QQQ each. Let CL=ker⁡A×{0}⊆Fpι⊔ι\mathcal C_L=\ker A\times\{0\}\subseteq\mathbb F_p^{\iota\sqcup\iota}CL​=kerA×{0}⊆Fpι⊔ι​ and yxy_xyx​ be its code and targets (LinearSystemFamily.code, codeTarget). Let ggg be a natural number with g<Qg<Qg<Q, and assume D>0D>0D>0.

If xxx is a NO instance with gap ggg, meaning that every solution v∈Fpιv\in\mathbb F_p^{\iota}v∈Fpι​ of Av=bxAv=b_xAv=bx​ has Hamming weight wt⁡(v)>g⋅D\operatorname{wt}(v)>g\cdot Dwt(v)>g⋅D, then

Δ(yx,c)>g⋅Dfor every codeword c∈CL,\Delta(y_x,c)>g\cdot D\qquad\text{for every codeword } c\in\mathcal C_L,Δ(yx​,c)>g⋅Dfor every codeword c∈CL​,

where Δ\DeltaΔ is the Hamming distance. Equivalently, Δ(yx,CL)>g⋅D\Delta(y_x,\mathcal C_L)>g\cdot DΔ(yx​,CL​)>g⋅D.

This is the NO half of the gap (38) in the proof of Lemma 3.11 (Appendix B.1). Together with the YES half it gives a ggg-gap NCPP instance with radius DDD, and it is the source of the NO bounds in the lattice reduction of Lemma 3.12.

Formalization Note. The gap is Γ\GammaΓ in the paper and ggg in Lean; the block size QQQ is L.blockSize and DDD is L.numBlocks. The hypotheses g<Qg<Qg<Q and D>0D>0D>0 are explicit here; in the paper they are part of Definition 3.10 (Q>ΓQ>\GammaQ>Γ, D≥1D\ge1D≥1). The paper states the conclusion as a bound on Δ(yx,CL)\Delta(y_x,\mathcal C_L)Δ(yx​,CL​); Lean states it for every codeword.

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
import Definitions.Def_LatticePrepro_Reduction_LinearSystem
import Definitions.Def_LatticePrepro_Conversions_Codes

open LatticePrepro
variable {p : ℕ} [Fact p.Prime] {X : Type} (L : LinearSystemFamily (ZMod p) X)
Formal statement
theorem LatticePrepro.LinearSystemFamily.code_no {g : ℕ} (hg : g < L.blockSize) (hD : 0 < L.numBlocks) {x : X}
    (hx : L.IsNo g x) :
    ∀ c ∈ L.code, g * L.numBlocks < hammingDist (L.codeTarget x) c := 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.11 (\label{lem:block-system-codes}), NO case of equation (38) (\label{eq:code-gap}) in its proof (Appendix B.1); Lean: LatticePrepro/Conversions/Codes.lean, LatticePrepro.LinearSystemFamily.code_no
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