Cluster k0451
Nuclear-norm bounds, lattice counting and slope estimates
This large cluster collects counting and norm bounds for Hermitian lattices. One statement bounds the average of a list of numbers from below given how many are below each threshold (a layer-cake argument), another bounds a "nuclear norm" (sum of singular values), another gives trace-of-powers as a sum over eigenvalues, and another bounds sums over subsets of indices (a Sobolev-type sum). Further statements count lattices from geometric inputs and bound a Dedekind residue. They are all size estimates but the mechanisms differ, so I mark the grouping mixed.
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
Hermitian, skew-Hermitian and unitary matrices; the spectral theoremFinite sets and countingLinear algebra
Uses
Used by
61 Lean files, main folder Formalism.FlagUnipotentLattices.