Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree bound for products of element polynomials

Proved
LatticePrepro.ExplicitTables.natDegree_elemProd_le

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let ppp be a prime and fix a field setup with sample field S\mathbb{S}S and extension K=S(γ)K=\mathbb{S}(\gamma)K=S(γ) of degree δ\deltaδ (every element of KKK is f(γ)f(\gamma)f(γ) with f∈S[X]f\in\mathbb{S}[X]f∈S[X], deg⁡f<δ\deg f<\deltadegf<δ). Let m,Bm,Bm,B be natural numbers, α∈K\alpha\in Kα∈K, and let ℓ0,…,ℓm−1∈S[X]\ell_0,\dots,\ell_{m-1}\in\mathbb{S}[X]ℓ0​,…,ℓm−1​∈S[X] be the element polynomials of α\alphaα, so that deg⁡ℓh<δ\deg\ell_h<\deltadegℓh​<δ and ℓh(γ)=αBh\ell_h(\gamma)=\alpha^{B^h}ℓh​(γ)=αBh. If η∈Nm\eta\in\mathbb{N}^mη∈Nm satisfies ηh≤2p(B−1)\eta_h\le2p(B-1)ηh​≤2p(B−1) for every hhh, i.e. η\etaη lies in the index set {0,…,2p(B−1)}m\{0,\dots,2p(B-1)\}^m{0,…,2p(B−1)}m, then

deg⁡∏h=0m−1ℓhηh≤Δ=2pm(B−1)(δ−1).\deg\prod_{h=0}^{m-1}\ell_h^{\eta_h}\le\Delta=2pm(B-1)(\delta-1).degh=0∏m−1​ℓhηh​​≤Δ=2pm(B−1)(δ−1).

This is the estimate deg⁡∏hℓhηh≤(δ−1)∑hηh≤Δ\deg\prod_h\ell_h^{\eta_h}\le(\delta-1)\sum_h\eta_h\le\Deltadeg∏h​ℓhηh​​≤(δ−1)∑h​ηh​≤Δ in the completeness part of the proof of Theorem A.8. Since the interpolants of the element table e^α\hat e_\alphae^α​ are exactly these products, it shows that element tables satisfy the low-degree constraints of Construction A.4.

Formalization Note: The degree is Mathlib's natDegree (the zero polynomial has degree 000). No hypotheses on mmm, BBB or δ\deltaδ are needed.

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_ElementTable

open LatticePrepro
open Polynomial
open LatticePrepro.ExplicitTables
variable {p : ℕ} [Fact p.Prime] {d δ : ℕ} (FS : FieldSetup p d δ) (m B : ℕ)
variable {FS m B}
Formal statement
theorem LatticePrepro.ExplicitTables.natDegree_elemProd_le (α : FS.K) {η : Fin m → ℕ} (hη : ∀ h, η h ≤ 2 * p * (B - 1)) :
    (elemProd FS m B α η).natDegree ≤ degBound p m B δ := 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}); Lean: LatticePrepro/Tables/ElementTable.lean, LatticePrepro.ExplicitTables.natDegree_elemProd_le

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