Cluster k0317
Lattice minima and Minkowski bounds with cusp function (Fuller data)
Files built around a "Fuller" package of data: a lattice in a space over a number field with a CM structure (a field with a complex-conjugation-like symmetry), a Hermitian form, and a chart. The main statements give a Minkowski-style bound relating the shortest nonzero vector to the covolume (the volume of one cell) of any sublattice, a bound for a cusp function by a multiple of the log of a chart size, and the corresponding comparison with a metric. Some files prove generic facts about independent vectors and Gram determinants. The simplest line example has zero cusp function.
5 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 pointsNumber fields, algebraic integersIdeals, ideal norm and discriminant of a number fieldLinear algebraHermitian, skew-Hermitian and unitary matrices; the spectral theorem
References
J. W. S. Cassels, An Introduction to the Geometry of Numbers · ch. V (Minkowski's theorems)Background reading suggested by the AI namer · unchecked
Uses
Used by
25 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.StabilizerCovolume.