Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hankel length ℓ=p(r−1)+1\ell=p(r-1)+1ℓ=p(r−1)+1 (Theorem A.7)

Definition
LatticePrepro_Tables_Hankel

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

For natural numbers ppp and rrr, the Hankel length (hankelLen p r) is

ℓ=p (r−1)+1.\ell=p\,(r-1)+1 .ℓ=p(r−1)+1.

In the moment reconstruction theorem, ppp is the characteristic, r≥2r\ge2r≥2 is the moment parameter, and a sequence y0,…,y2ℓ−2y_0,\dots,y_{2\ell-2}y0​,…,y2ℓ−2​ is arranged into the ℓ×ℓ\ell\times\ellℓ×ℓ Hankel matrix (yi+j)0≤i,j<ℓ(y_{i+j})_{0\le i,j<\ell}(yi+j​)0≤i,j<ℓ​.

The length is chosen so that the Frobenius identities ypk=yk py_{pk}=y_k^{\,p}ypk​=ykp​ are available for all k<rk<rk<r (as then pk≤ℓ−1pk\le\ell-1pk≤ℓ−1), which forces the reconstructed coefficients into Fp\mathbb{F}_pFp​, while r≤ℓr\le\ellr≤ℓ. In Construction A.4, with r=Bmr=B^mr=Bm, it is the size p(Bm−1)+1p(B^m-1)+1p(Bm−1)+1 of the polynomial matrix and of the Hankel matrix of moments.

Formalization Note: The bundle contains only this definition; the functionals used in the proof of Theorem A.7 are in the source module. The paper writes ν\nuν and κ\kappaκ for ℓ\ellℓ and rrr.

Definition code
import Mathlib
import Definitions.Def_LatticePrepro_Moments_Basic

namespace LatticePrepro.Hankel end LatticePrepro.Hankel
/-!
# Moment reconstruction from a Hankel matrix (Theorem A.7)

Let `Ω` be an algebraically closed field of characteristic `p`, `r ≥ 2`, and
`ℓ = p · (r - 1) + 1`. Suppose `y_0, …, y_{2ℓ-2} ∈ Ω` satisfy the Frobenius identities
`y_{p k} = y_k ^ p` and the first `t + 1` columns of the Hankel matrix `(y_{i+j})_{i,j<ℓ}` are
linearly dependent for some `t < r`. Then there is a coefficient function `f : Ω →₀ 𝔽_p` with at
most `t` support points whose moments of order `< ℓ` are `y_0, …, y_{ℓ-1}`.

The proof follows the paper: extract a shortest linear recurrence `χ` from the first dependent
column, define the functional `ψ(f) = ∑ (f mod χ)_i y_i`, show `ψ(f^p) = ψ(f)^p` using the
Frobenius identities, deduce that `χ` has distinct roots, and read off the coefficients by
Lagrange interpolation; they lie in `𝔽_p` because they are fixed by Frobenius.

## Implementation

* `Hankel.seqFun y j` is the linear functional `f ↦ ∑ i, f_i · y (j + i)` on `Polynomial Ω`.
* `Hankel.Annihilates y ℓ χ` says `seqFun y j χ = 0` for all `j < ℓ`, i.e. the coefficients of
  `χ` give a linear recurrence valid on the first `ℓ` shifts (equivalently, a linear dependence
  among the first `deg χ + 1` columns of the Hankel matrix).
* `Hankel.psi y χ f = seqFun y 0 (f %ₘ χ)` is the functional `ψ` of the paper. It agrees with
  `seqFun y 0` on polynomials of degree `< ℓ + deg χ` (`psi_eq_seqFun`).
-/

namespace LatticePrepro

open Polynomial

/-- The Hankel length `ℓ = p · (r - 1) + 1`. -/
def hankelLen (p r : ℕ) : ℕ := p * (r - 1) + 1

open Hankel

end LatticePrepro
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 A.7 (\label{thm:moment-hankel-reconstruction}); Lean: LatticePrepro/Tables/Hankel.lean, LatticePrepro.hankelLen

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