Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 (lattices, NO instances) — every vector is rejected

Proved
LatticePrepro.LatticeReduction.not_accepts_of_isNo

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let p\mathsf pp be a prime, LLL a linear-system family over Fp\mathbb F_{\mathsf p}Fp​ (fixed linear map AAA, right-hand sides bxb_xbx​, DDD blocks), g∈Ng\in\mathbb Ng∈N, ppp a norm exponent, and let Red be a lattice reduction for LLL, ggg and ppp with lattice Λ⊆ZM\Lambda\subseteq\mathbb Z^MΛ⊆ZM and residual weight www. If xxx is a NO instance of LLL with gap ggg, meaning that every solution of Au=bxAu=b_xAu=bx​ has Hamming weight greater than g⋅Dg\cdot Dg⋅D, then no integer vector is accepted:

¬(v∈Λ  and  w(x,v)≤g⋅D)for every v∈ZM.\neg\bigl(v\in\Lambda\ \text{ and }\ w(x,v)\le g\cdot D\bigr)\qquad\text{for every }v\in\mathbb Z^M.¬(v∈Λ  and  w(x,v)≤g⋅D)for every v∈ZM.

This is the NO half of Lemma 5.2 (Testing search outputs) for lattices. Together with the YES half it shows that an approximate-CVPP search algorithm on these lattices, followed by the test, decides the underlying language; this is how the proof of Theorem 1.1 handles the search problem.

Formalization Note. The NO condition is L.IsNo g x, for the same gap ggg as the reduction, and vvv ranges over all of ZM\mathbb Z^MZM. No condition on an approximation factor is needed. The test is the predicate LatticeReduction.Accepts.

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
import Definitions.Def_LatticePrepro_Lattices_Distance
import Definitions.Def_LatticePrepro_Conversions_SearchTest

open LatticePrepro
open LatticePrepro.LatticeReduction
variable {p : ℕ} [Fact p.Prime] {X : Type} {L : LinearSystemFamily (ZMod p) X} {g : ℕ}
  {pn : PNorm} (Red : LatticeReduction L g pn)
Formal statement
theorem LatticePrepro.LatticeReduction.not_accepts_of_isNo {x : X} (hx : L.IsNo g x) (v : Red.Λ.M → ℤ) : ¬ Red.Accepts x v := 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 5.2 (\label{lem:search-test}), lattices, NO instances; Lean: LatticePrepro/Conversions/SearchTest.lean, LatticePrepro.LatticeReduction.not_accepts_of_isNo
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