Cluster k0584
Arakelov degrees, lattice covolumes and semistable reduction
A large cluster (125 files, many wrappers) about lattices over a number field with a Hermitian size rule, a family of norms, one for each complex embedding. It defines a "degree" of a sublattice, built from log norms (Arakelov degree), and proves relations such as how the degree changes in a smaller sublattice. Statements include a semistability claim (no sublattice is too heavy), a determinant bound, a polynomial-growth claim for representations of the general linear group, and a rank additivity formula. Others construct jets (Taylor data) over a number field and reduce to prime-to-p bases. Mixed in are ideas from semistable reduction of abelian varieties. Many statements are conditional on others.
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 theoremNumber fields, algebraic integersLinear algebraIdeals, ideal norm and discriminant of a number fieldLattices in n dimensions, covolume and counting pointsGroups as matrices: representations and characters
References
Bost, Périodes et isogénies des variétés abéliennes sur les corps de nombres · sec. on Arakelov degrees and slopesBackground reading suggested by the AI namer · unchecked
Uses
Used by
158 Lean files, main folder ReciprocityTheory.SemistableReduction.