Cluster k0444
Lattice sum bounds, transference and local coordinate counts
This cluster contains counting bounds for lattices with Hermitian forms. The statements bound sums over top rows of matrices by an exponential in the logarithm of a size parameter, bound the number of subgroups of bounded index, show a "covering" property follows from a transference statement, and count lattices whose coordinates have bounded mean size. Other files give finishing steps of a counting argument. A lot of the content is explicit constants with many parameters. It seems to be the final assembly of counting arguments, but I only see the statements.
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 pointsFinite sets and countingLinear algebraHermitian, skew-Hermitian and unitary matrices; the spectral theorem
References
Lubotzky and Segal, Subgroup Growth · ch. 1-3 (counting subgroups of bounded index)Background reading suggested by the AI namer · unchecked
Uses
Used by
20 Lean files, main folder Formalism.FlagUnipotentLattices.MinkowskiFactorialBounds.