Integer lift of a word over (Lemma B.1, Construction A)
DefinitionLatticePrepro_Conversions_ConstructionAFor a prime and a coordinate set , the map liftZMod sends a word to the integer vector
replacing each coordinate by its least nonnegative integer representative, so that .
This is the vector of Lemma B.1 (From codes to lattices). There a code gives the Construction A lattice , and a target gives the lattice target . The lattice reduction of Lemma 3.12 uses the lifted code targets , directly for norm exponents and after the block Hadamard map for ; the lift of a binary error vector is its -valued integer copy.
Formalization Note. The lift is fun i => ((y i).val : ℤ), using ZMod.val; the coordinate set is an arbitrary type, and Lean writes the prime as p. The source module also defines the Construction A lattice (constructionA, a -submodule of ) and coordinatewise reduction modulo (redMod) with their properties; these do not occur in the published statements and are not part of this bundle.
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
/-!
# Construction A (Lemma B.1)
For a prime `p` and a code `𝒞 ⊆ 𝔽_p^M`, the lattice `Λ_𝒞 = {v ∈ ℤ^M : v mod p ∈ 𝒞}`.
We also define the lift `liftZMod y ∈ {0, …, p-1}^M` of a word `y ∈ 𝔽_p^M`, and prove the
residual bounds used in the lattice reduction: for `v ∈ Λ_𝒞`, the reduction of `t - v` modulo
`p` lies in `y - 𝒞`, and its Hamming weight is at most the number of nonzero coordinates of
`t - v`.
-/
namespace LatticePrepro
open Finset
variable {p : ℕ} [Fact p.Prime] {M : Type*}
/-- The lift `y ↦ (y_i.val)_i ∈ {0, …, p-1}^M`. -/
def liftZMod (y : M → ZMod p) : M → ℤ := fun i => ((y i).val : ℤ)
end LatticePrepro