Cluster k0416
Counting sublattices and index bounds, mixed estimates
This cluster mixes counting and size estimates. One statement says a matrix congruent to the identity modulo a large integer and of finite order must be the identity. Others bound the number of submodules using Dedekind zeta functions, compare constants across the same place, and bound a sum of "losses" over places. These are all about how many sublattices of a given index exist and how large they can be. They concern different mechanisms (group theory, zeta bounds, bookkeeping sums), so I would call the files only loosely related. Many are statements stated as definitions.
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
Dedekind domains (unique factorisation of ideals)Number fields, algebraic integersFinite sets and countingFinitely generated abelian groupsLinear algebra
References
Lubotzky and Segal, Subgroup Growth · ch. 15 and ch. 3Background reading suggested by the AI namer · unchecked
Uses
Used by
33 Lean files, main folder Formalism.FlagUnipotentLattices.