Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pointwise translation identity for light solutions (soundness of Theorem 4.6)

Proved
LatticePrepro.FixedSystem.translation_pointwise

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let ppp be a prime, KKK a field that is an Fp\mathbb{F}_pFp​-algebra, and Ω\OmegaΩ an extension field of KKK. Elements of Fp\mathbb{F}_pFp​ and KKK are viewed in Ω\OmegaΩ through the algebra maps. Consider the fixed-verifier system of Construction 4.5 for a quadratic verifier VVV (instance length nnn, SSS coordinates), a moment representation RRR over KKK (moment parameter rrr, moment maps M^k\hat M_kM^k​) and an encoding tuple (Ei)(E_i)(Ei​). Let θx=∑i=1nxiEi+En+1\theta_x=\sum_{i=1}^nx_iE_i+E_{n+1}θx​=∑i=1n​xi​Ei​+En+1​. Let x∈{0,1}nx\in\{0,1\}^nx∈{0,1}n and let vvv satisfy all equations of the system for xxx. Suppose that every table TTT has a finitely supported coefficient function fT:Ω→Fpf_T:\Omega\to\mathbb{F}_pfT​:Ω→Fp​ such that

  • M^k(vT)=μk(fT):=∑αfT(α) αk\hat M_k(v_T)=\mu_k(f_T):=\sum_{\alpha}f_T(\alpha)\,\alpha^kM^k​(vT​)=μk​(fT​):=∑α​fT​(α)αk in Ω\OmegaΩ, for every table TTT and every 0≤k≤2r−20\le k\le2r-20≤k≤2r−2;
  • ∑T∣supp⁡fT∣<r\sum_T|\operatorname{supp}f_T|<r∑T​∣suppfT​∣<r.

Write f0,0f_{0,0}f0,0​ for the function of the main table v0,0v_{0,0}v0,0​ and f(i)f^{(i)}f(i) for that of the auxiliary table v(i)v^{(i)}v(i), n+1<i≤Sn+1<i\le Sn+1<i≤S. Then for every α∈Ω\alpha\in\Omegaα∈Ω,

f0,0(α)−∑i=n+2S(f(i)(α−Ei)−f(i)(α))=1[α=θx].f_{0,0}(\alpha)-\sum_{i=n+2}^{S}\bigl(f^{(i)}(\alpha-E_i)-f^{(i)}(\alpha)\bigr)=\mathbf{1}[\alpha=\theta_x].f0,0​(α)−i=n+2∑S​(f(i)(α−Ei​)−f(i)(α))=1[α=θx​].

This is the translation identity (19) of the paper. The soundness proof of Theorem 4.6 shows that it holds pointwise for solutions below the weight threshold. Summing it over the coset θx+span⁡Fp{Ei:i>n+1}\theta_x+\operatorname{span}_{\mathbb{F}_p}\{E_i: i>n+1\}θx​+spanFp​​{Ei​:i>n+1} then gives ∑f0,0=1\sum f_{0,0}=1∑f0,0​=1 on that coset.

Formalization Note Lean writes the identity as "left-hand side minus Finsupp.single θ_x 1 evaluated at α\alphaα equals 000". The functions are Ω →₀ ZMod p indexed by TblIdx, and f0,0f_{0,0}f0,0​ is the function at index rep 0 0. The support hypothesis sums over all tables, product and auxiliary. The moment hypothesis is stated after mapping KKK into Ω\OmegaΩ.

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
import Definitions.Def_LatticePrepro_Reduction_LinearSystem
import Definitions.Def_LatticePrepro_Moments_Basic
import Definitions.Def_LatticePrepro_Moments_Representation
import Definitions.Def_LatticePrepro_Verifier_Quadratic
import Definitions.Def_LatticePrepro_Reduction_FixedSystem

open LatticePrepro
open Finsupp
open LatticePrepro.FixedSystem
variable {p : ℕ} [Fact p.Prime] {K : Type} [Field K] [Algebra (ZMod p) K]
    {Ω : Type} [Field Ω] [Algebra (ZMod p) Ω] [Algebra K Ω] [IsScalarTower (ZMod p) K Ω]
    (V : QuadraticVerifier p) (R : MomentRepresentation p K Ω) (ε : EncodingTuple p K V.S)
variable {x : Fin V.n → Bool} {v : Col V R → ZMod p} (hv : Solves V R ε x v)
  (f : V.TblIdx → Ω →₀ ZMod p)
  (hf : ∀ T (k : R.Order), algebraMap K Ω (R.momentMap k (tbl V R v T)) = moment (f T) k)
  (hN : ∑ T, (f T).support.card < R.r)
include hv hf hN
Formal statement
theorem LatticePrepro.FixedSystem.translation_pointwise (α : Ω) :
    algebraMap (ZMod p) Ω (f (Sum.inl (V.rep 0 0)) α) -
      ∑ i : V.AuxIdx, (algebraMap (ZMod p) Ω (f (Sum.inr i) (α - algebraMap K Ω (ε.E i.1))) -
        algebraMap (ZMod p) Ω (f (Sum.inr i) α)) -
      Finsupp.single (algebraMap K Ω (V.instanceEnc ε x)) (1 : Ω) α = 0 := 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), Theorem 4.6 (\label{thm:fixed-verifier-reduction}), step of the soundness proof establishing the translation identity (19) (\label{eq:strategy-target}) pointwise; Lean: LatticePrepro/Reduction/Soundness.lean, LatticePrepro.FixedSystem.translation_pointwise

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