Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Element polynomials ℓh\ell_hℓh​ and their products (Construction A.4, step 6)

Definition
LatticePrepro_Tables_ElementTable

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 and an extension K=S(γ)K=\mathbb{S}(\gamma)K=S(γ) in which every element is f(γ)f(\gamma)f(γ) for some f∈S[X]f\in\mathbb{S}[X]f∈S[X] of degree <δ<\delta<δ. Let mmm and BBB be natural numbers and α∈K\alpha\in Kα∈K. The bundle defines:

  1. Element polynomials (elemPoly): for 0≤h<m0\le h<m0≤h<m, a polynomial ℓh∈S[X]\ell_h\in\mathbb{S}[X]ℓh​∈S[X] with
deg⁡ℓh<δ,ℓh(γ)=αBh.\deg\ell_h<\delta,\qquad \ell_h(\gamma)=\alpha^{B^h}.degℓh​<δ,ℓh​(γ)=αBh.
  1. Products (elemProd): for an exponent vector η∈Nm\eta\in\mathbb{N}^mη∈Nm, the polynomial
∏h=0m−1ℓhηh∈S[X].\prod_{h=0}^{m-1}\ell_h^{\eta_h}\in\mathbb{S}[X].h=0∏m−1​ℓhηh​​∈S[X].

In step 6 of Construction A.4 these polynomials define the evaluation table e^α\hat e_\alphae^α​ of α\alphaα: in each column s∈Ss\in\mathbb{S}s∈S it has a single entry 111, at the label λ=(ℓ0(s),…,ℓm−1(s))\lambda=(\ell_0(s),\dots,\ell_{m-1}(s))λ=(ℓ0​(s),…,ℓm−1​(s)). Its weighted column sums are the values ∏hℓh(s)ηh\prod_h\ell_h(s)^{\eta_h}∏h​ℓh​(s)ηh​, so its interpolants are the products above. These have low degree and evaluate at γ\gammaγ to αvalB(η)\alpha^{\mathrm{val}_B(\eta)}αvalB​(η), which gives the completeness part of Theorem A.8.

Formalization Note: ℓh\ell_hℓh​ is selected by choice from the field setup's property that every element of KKK is a polynomial of degree <δ<\delta<δ in γ\gammaγ. Since 1,γ,…,γδ−11,\gamma,\dots,\gamma^{\delta-1}1,γ,…,γδ−1 are S\mathbb{S}S-linearly independent, it is the unique such polynomial, as in the paper. The table e^α\hat e_\alphae^α​ itself (elemTab) is defined in the source module and is not part of this bundle. The paper writes φh,qα,c,ζ,d\varphi_h,\mathbf{q}_\alpha,c,\zeta,\mathsf dφh​,qα​,c,ζ,d for ℓh,e^α,δ,γ,B\ell_h,\hat e_\alpha,\delta,\gamma,Bℓh​,e^α​,δ,γ,B.

Definition code
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

/-!
# Evaluation tables of field elements (Construction A.4, step 6; completeness in Theorem A.8)

For `α ∈ K` and `h < m`, let `ℓ_h ∈ 𝕊[X]` be the polynomial of degree `< δ` with
`ℓ_h(γ) = α^{B^h}`. The *element table* `ê_α` has a single `1` in every column `s`, at the label
`λ = (ℓ_0(s), …, ℓ_{m-1}(s))`. Its column sums are `∏_h ℓ_h(s)^{η_h}`, so its interpolants are the
low-degree polynomials `∏_h ℓ_h^{η_h}`, and its moments are `α^k`.
-/

namespace LatticePrepro

open Polynomial

namespace ExplicitTables

variable {p : ℕ} [Fact p.Prime] {d δ : ℕ} (FS : FieldSetup p d δ) (m B : ℕ)

/-- The polynomial `ℓ_h` with `ℓ_h(γ) = α^{B^h}` and degree `< δ`. -/
noncomputable def elemPoly (α : FS.K) (h : Fin m) : FS.𝕊[X] :=
  (FS.exists_aeval (α ^ B ^ (h : ℕ))).choose

/-- The product polynomial `∏_h ℓ_h^{η_h}`. -/
noncomputable def elemProd (α : FS.K) (η : Fin m → ℕ) : FS.𝕊[X] :=
  ∏ h, elemPoly FS m B α h ^ η h

variable {FS m B}

end ExplicitTables

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), Construction A.4 (\label{con:moment-representation}), step 6 (\label{step:moment-element-table}); Lean: LatticePrepro/Tables/ElementTable.lean, LatticePrepro.ExplicitTables.elemPoly, LatticePrepro.ExplicitTables.elemProd

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