Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 (lattices, YES instances) — approximate solutions pass the test

Proved
LatticePrepro.LatticeReduction.accepts_of_isApprox

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​ with DDD blocks, g∈Ng\in\mathbb Ng∈N, and ppp a norm exponent (a real p≥1p\ge1p≥1 or p=∞p=\inftyp=∞) with s=min⁡{p,2}s=\min\{p,2\}s=min{p,2}. Let Red be a lattice reduction for LLL, ggg and ppp (the output of Lemma 3.12): a lattice Λ⊆ZM\Lambda\subseteq\mathbb Z^MΛ⊆ZM, targets txt_xtx​, a radius R≥1R\ge1R≥1 and a residual weight www. Let f≥0f\ge0f≥0 be a real number with

16⋅fs≤g.16\cdot f^{s}\le g.16⋅fs≤g.

If xxx is a YES instance of LLL and vvv is an fff-approximate solution, that is, v∈Λv\in\Lambdav∈Λ and ∥tx−v∥p≤f⋅dist⁡p(tx,Λ)\|t_x-v\|_p\le f\cdot\operatorname{dist}_p(t_x,\Lambda)∥tx​−v∥p​≤f⋅distp​(tx​,Λ), then vvv is accepted:

v∈Λandw(x,v)≤g⋅D.v\in\Lambda\qquad\text{and}\qquad w(x,v)\le g\cdot D.v∈Λandw(x,v)≤g⋅D.

Here dist⁡p(tx,Λ)=min⁡u∈Λ∥tx−u∥p\operatorname{dist}_p(t_x,\Lambda)=\min_{u\in\Lambda}\|t_x-u\|_pdistp​(tx​,Λ)=minu∈Λ​∥tx​−u∥p​ (Definition 3.1).

This is the YES half of Lemma 5.2 (Testing search outputs) for lattices. In Theorem 5.1 for lattices it is applied with f=M1/s−εf=M^{1/s-\varepsilon}f=M1/s−ε, so that every M1/s−εM^{1/s-\varepsilon}M1/s−ε-approximate solution to a YES instance passes the test.

Formalization Note. Red : LatticeReduction L g pn is an arbitrary lattice reduction; its YES radius bound and weight bound w≤16D(∥tx−v∥p/R)sw\le16D(\|t_x-v\|_p/R)^sw≤16D(∥tx​−v∥p​/R)s are fields of the structure. The paper assumes f≥1f\ge1f≥1 and Γ>16fs\Gamma>16f^sΓ>16fs; Lean needs only f≥0f\ge0f≥0 and 16fs≤g16f^s\le g16fs≤g, with fsf^sfs a real power. dist⁡p(tx,Λ)\operatorname{dist}_p(t_x,\Lambda)distp​(tx​,Λ) is latticeDist, and the test is the predicate LatticeReduction.Accepts. The polynomial running time of the test is not formalized.

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.accepts_of_isApprox {f : ℝ} (hf : 0 ≤ f) (hgf : 16 * f ^ pn.s ≤ g) {x : X}
    (hx : L.IsYes x) {v : Red.Λ.M → ℤ} (hv : Red.IsApprox f x v) : 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, YES instances; Lean: LatticePrepro/Conversions/SearchTest.lean, LatticePrepro.LatticeReduction.accepts_of_isApprox
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