Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3 (moment identification) — a function on at most ttt points whose first ttt moments vanish is zero

Proved
LatticePrepro.eq_zero_of_moment_eq_zero

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let Ω\OmegaΩ be a field, let g ⁣:Ω→Ωg\colon \Omega \to \Omegag:Ω→Ω be a finitely supported function, and let ttt be a natural number with ∣supp⁡g∣≤t|\operatorname{supp} g| \le t∣suppg∣≤t. If the moments of ggg of order less than ttt all vanish,

Mk(g)=∑α∈supp⁡gg(α) αk=0(0≤k<t),\mathcal M_k(g) = \sum_{\alpha \in \operatorname{supp} g} g(\alpha)\,\alpha^k = 0 \qquad (0 \le k < t),Mk​(g)=α∈suppg∑​g(α)αk=0(0≤k<t),

then g=0g = 0g=0.

Lemma 4.3 of the paper states, for coefficient functions f,f′ ⁣:Ω→Fpf, f'\colon \Omega \to \mathbb{F}_pf,f′:Ω→Fp​ with ∣supp⁡(f−f′)∣≤t|\operatorname{supp}(f - f')| \le t∣supp(f−f′)∣≤t, that f=f′f = f'f=f′ if and only if Mk(f)=Mk(f′)\mathcal M_k(f) = \mathcal M_k(f')Mk​(f)=Mk​(f′) for 0≤k<t0 \le k < t0≤k<t. The Lean statement is the nontrivial direction, formulated for the difference g=f−f′g = f - f'g=f−f′ and in a slightly more general setting: ggg may take arbitrary values in Ω\OmegaΩ rather than in Fp\mathbb{F}_pFp​, and t=0t = 0t=0 is allowed.

This Vandermonde argument is what turns the moment equations of the fixed-verifier system into pointwise identities between coefficient functions in the soundness proof of Theorem 4.6.

Formalization Note: ggg is a Finsupp Ω →₀ Ω, ∣supp⁡g∣|\operatorname{supp} g|∣suppg∣ is g.support.card, and the moment is the moment of Definitions 4.1–4.2 with coefficient ring Ω\OmegaΩ.

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Moments_Basic

open LatticePrepro
open Finsupp
variable {Ω : Type*} [Field Ω]
Formal statement
theorem LatticePrepro.eq_zero_of_moment_eq_zero (g : Ω →₀ Ω) {t : ℕ} (hs : g.support.card ≤ t)
    (h : ∀ k < t, moment g k = 0) : g = 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), Lemma 4.3 (\label{lem:scalar-moment-identification}); Lean: LatticePrepro/Moments/Basic.lean, LatticePrepro.eq_zero_of_moment_eq_zero
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