Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim A.2 (first part) — the generalized digits of kkk have value kkk

Proved
LatticePrepro.digitVal_gdigits

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let B≥2B\ge2B≥2 and m≥1m\ge1m≥1 be integers. Then for every natural number kkk,

valB(digitsB,m(k))=∑h=0m−1digitsB,m(k)h Bh=k.\mathrm{val}_B\bigl(\mathrm{digits}_{B,m}(k)\bigr)=\sum_{h=0}^{m-1}\mathrm{digits}_{B,m}(k)_h\,B^h=k .valB​(digitsB,m​(k))=h=0∑m−1​digitsB,m​(k)h​Bh=k.

Here digitsB,m(k)\mathrm{digits}_{B,m}(k)digitsB,m​(k) is the generalized digit vector of Definition A.1: writing k=t (Bm−1)+bk=t\,(B^m-1)+bk=t(Bm−1)+b with 0≤b<Bm−10\le b<B^m-10≤b<Bm−1, its hhh-th entry is t (B−1)+bht\,(B-1)+b_ht(B−1)+bh​, where bhb_hbh​ is the hhh-th base-BBB digit of bbb.

This makes the moment map μ^k\hat\mu_kμ^​k​ of Construction A.4, which is defined through the interpolant indexed by digitsB,m(k)\mathrm{digits}_{B,m}(k)digitsB,m​(k), a moment of order exactly kkk. Together with the additivity of valB\mathrm{val}_BvalB​, it identifies the polynomial matrix of an evaluation table at γ\gammaγ with the Hankel matrix (μ^h+h′)(\hat\mu_{h+h'})(μ^​h+h′​) (Lemma A.6), and it gives μ^k=αk\hat\mu_k=\alpha^kμ^​k​=αk on the element tables (Theorem A.8).

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Tables_Digits

open LatticePrepro
Formal statement
theorem LatticePrepro.digitVal_gdigits {B m : ℕ} (hB : 2 ≤ B) (hm : 1 ≤ m) (k : ℕ) :
    digitVal B (gdigits B m k) = k := 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), Claim A.2 (\label{clm:generalized-digits}), first part; Lean: LatticePrepro/Tables/Digits.lean, LatticePrepro.digitVal_gdigits

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