Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Soundness setup — a light constrained table has a short dependence among its Hankel columns

Proved
LatticePrepro.ExplicitTables.soundness_setup

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Fix a field setup: a sample field S\mathbb{S}S with qqq elements and an extension K=S(γ)K=\mathbb{S}(\gamma)K=S(γ) of degree δ\deltaδ, of characteristic ppp. Let m≥1m\ge1m≥1 and B≥2B\ge2B≥2 be integers, let Δ=2pm(B−1)(δ−1)\Delta=2pm(B-1)(\delta-1)Δ=2pm(B−1)(δ−1), assume 4Δ<q4\Delta<q4Δ<q, and let ℓ=p(Bm−1)+1\ell=p(B^m-1)+1ℓ=p(Bm−1)+1. Let y∈Fp Sm×Sy\in\mathbb{F}_p^{\,\mathbb{S}^m\times\mathbb{S}}y∈FpSm×S​ be an evaluation table that satisfies all the constraints of Construction A.4 (low-degree, index-consistency and Frobenius) and has weight

2 wt(y)<Bm⋅q.2\,\mathrm{wt}(y)<B^m\cdot q .2wt(y)<Bm⋅q.

Then there is a natural number ttt with

t<Bm,q⋅t≤2 wt(y),t<B^m,\qquad q\cdot t\le2\,\mathrm{wt}(y),t<Bm,q⋅t≤2wt(y),

and there are c0,…,ct∈Kc_0,\dots,c_t\in Kc0​,…,ct​∈K, not all zero, with

∑j=0tcj μ^i+j(y)=0(0≤i<ℓ).\sum_{j=0}^{t}c_j\,\hat\mu_{i+j}(y)=0\qquad(0\le i<\ell).j=0∑t​cj​μ^​i+j​(y)=0(0≤i<ℓ).

That is, the first t+1t+1t+1 columns of the ℓ×ℓ\ell\times\ellℓ×ℓ Hankel matrix (μ^i+j(y))0≤i,j<ℓ(\hat\mu_{i+j}(y))_{0\le i,j<\ell}(μ^​i+j​(y))0≤i,j<ℓ​ of the moments of yyy are linearly dependent over KKK.

This packages Lemma A.6 with the counting in the soundness part of the proof of Theorem A.8, where ttt is the rank of the moment Hankel matrix and the paper shows t≤4 wt(y)/(3q)<2r/3t\le4\,\mathrm{wt}(y)/(3q)<2r/3t≤4wt(y)/(3q)<2r/3 for r=Bmr=B^mr=Bm. Its conclusion is the hypothesis of the Hankel reconstruction Theorem A.7, which then yields a coefficient function with at most t≤2 wt(y)/qt\le2\,\mathrm{wt}(y)/qt≤2wt(y)/q support points.

Formalization Note: "Satisfies all the constraints" is constraintFun FS m B y = 0, and wt(y)\mathrm{wt}(y)wt(y) is Mathlib's hammingNorm (the number of nonzero entries). The hypothesis 4Δ<q4\Delta<q4Δ<q is implied by the paper's choice q≥8pmBδq\ge8pmB\deltaq≥8pmBδ. The weight condition 2 wt(y)<Bmq2\,\mathrm{wt}(y)<B^m q2wt(y)<Bmq is the soundness threshold wt(y)<rD/2\mathrm{wt}(y)<rD/2wt(y)<rD/2 of Definition 4.4 with r=Bmr=B^mr=Bm and D=qD=qD=q blocks.

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
import Definitions.Def_LatticePrepro_Moments_Basic
import Definitions.Def_LatticePrepro_Moments_Representation
import Definitions.Def_LatticePrepro_Tables_Digits
import Definitions.Def_LatticePrepro_Tables_FieldSetup
import Definitions.Def_LatticePrepro_Tables_Construction
import Definitions.Def_LatticePrepro_Tables_TableSoundness

open LatticePrepro
open Polynomial Matrix
open LatticePrepro.ExplicitTables
variable {p : ℕ} [Fact p.Prime] {d δ : ℕ} (FS : FieldSetup p d δ) (m B : ℕ)
variable {FS m B}
Formal statement
theorem LatticePrepro.ExplicitTables.soundness_setup (hB : 2 ≤ B) (hm : 1 ≤ m)
    (hΔ : 4 * degBound p m B δ < Fintype.card FS.𝕊) {y : Coord FS m → ZMod p}
    (hy : constraintFun FS m B y = 0) (hw : 2 * hammingNorm y < B ^ m * Fintype.card FS.𝕊) :
    ∃ t : ℕ, t < B ^ m ∧ Fintype.card FS.𝕊 * t ≤ 2 * hammingNorm y ∧
      ∃ c : Fin (t + 1) → FS.K, c ≠ 0 ∧
        ∀ i : Fin (hLen p m B), ∑ j, c j * mom FS m B y (i.val + j.val) = 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); auxiliary lemma used in the proof of Theorem A.8 (\label{thm:moment-representation-construction}), combining Lemma A.6 (\label{lem:table-rank}); Lean: LatticePrepro/Tables/TableSoundness.lean, LatticePrepro.ExplicitTables.soundness_setup

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