Cluster k0413
Successive minima, reduced bases and covolume bounds
This cluster is about integer lattices, the grids of points formed by whole-number combinations of vectors. The "successive minima" are the lengths of the shortest independent lattice vectors. The statements bound their product by a constant times the lattice's covolume (the volume of one grid cell), express the covolume as the square root of a Gram determinant, show that a set of independent vectors can be adjusted to a lattice basis, and give a Lenstra-Lenstra-Lovasz-style size reduction. Several files are ordinary lemmas about determinants and bases. It looks like groundwork for Minkowski-type arguments later in the project.
3 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Lattices in n dimensions, covolume and counting pointsLinear algebraHermitian, skew-Hermitian and unitary matrices; the spectral theoremTopology: open sets, closed sets, compact and connected sets
References
Cassels, An Introduction to the Geometry of Numbers · ch. V-VIII (successive minima, reduction)Background reading suggested by the AI namer · unchecked
Uses
Used by
48 Lean files, main folder Formalism.SuccessiveMinima.SuccessiveMinimaProofs.