Claim A.2 (first part) — the generalized digits of have value
ProvedLatticePrepro.digitVal_gdigitscoding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing
Let and be integers. Then for every natural number ,
Here is the generalized digit vector of Definition A.1: writing with , its -th entry is , where is the -th base- digit of .
This makes the moment map of Construction A.4, which is defined through the interpolant indexed by , a moment of order exactly . Together with the additivity of , it identifies the polynomial matrix of an evaluation table at with the Hankel matrix (Lemma A.6), and it gives 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 sorrySource
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