Cluster k0579
Reduction theory for a Hermitian lattice, compactness and short vectors
A large cluster (73 files) of facts about a Hermitian lattice, a grid of points over a number field with complex multiplication and a conjugate-symmetric pairing, and its fundamental domain. Statements include basic positivity facts, that a set of bounded entries lies in the domain, a duality claim for the pairing, a "Mahler compactness criterion" (a set of lattices with no very short vector is relatively compact), and a short-vector bound. Many are small lemmas on flow matrices and majorants (size functions). Several are conditional on assumed claims.
4 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 pointsHermitian, skew-Hermitian and unitary matrices; the spectral theoremNumber fields, algebraic integersLinear algebraIntegration on a group, Haar measure and fundamental domainsTopology: open sets, closed sets, compact and connected sets
References
Borel, Introduction aux groupes arithmétiques · ch. 1-3 (reduction theory)Background reading suggested by the AI namer · unchecked
Uses
Used by
73 Lean files, main folder ReciprocityTheory.ReductiveGroups.ArithmeticGeometry.FundamentalDomains.