Full rank in Mathlib terms — a lattice containing is a Mathlib IsZLattice (Section 3, Lemma 3.12)
ProvedLatticePrepro.LatticeFamily.isZLattice_realLatticeLet be a lattice family, with an additive subgroup, and let be a natural number with such that
i.e. . Then the real image of is a full-rank lattice in Mathlib's sense, IsZLattice ℝ Λ.realLattice: a discrete -submodule of whose -linear span is all of .
Section 3 defines a lattice as a discrete additive subgroup of and assumes full rank throughout; Lemma 3.12 and Theorem 5.1 produce full-rank lattices . The formalization records full rank as the condition (a field of LatticeReduction and of the final LatticeGap), and this theorem shows that the condition yields Mathlib's notion. It is used to show that the lattices of Theorem 5.1 are IsZLattices.
Formalization Note. Mathlib's class IsZLattice ℝ L takes the discreteness of as a DiscreteTopology instance argument (provided for every lattice family by the instance discreteTopology_realLattice) and has the single field span_top : span ℝ L = ⊤. Here is the function space M → ℝ, and is LatticeFamily.realLattice.
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
import Definitions.Def_LatticePrepro_Reduction_LinearSystem
import Definitions.Def_LatticePrepro_Conversions_Codes
import Definitions.Def_LatticePrepro_Conversions_ConstructionA
import Definitions.Def_LatticePrepro_Conversions_Hadamard
import Definitions.Def_LatticePrepro_Conversions_Lattices
import Definitions.Def_LatticePrepro_Lattices_Distance
import Definitions.Def_LatticePrepro_Lattices_Mathlib
open LatticePrepro
open scoped ENNReal
open WithLp
open LatticePrepro.LatticeFamily
variable {X : Type} (Λ : LatticeFamily X)theorem LatticePrepro.LatticeFamily.isZLattice_realLattice {N : ℕ} (hN : 0 < N)
(h : ∀ v : Λ.M → ℤ, (N : ℤ) • v ∈ Λ.lattice) : IsZLattice ℝ Λ.realLattice := by sorryConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.