Cluster k0551
Counting subgroup sizes and indices at one prime
These files compute sizes and indices of groups of matrices modulo a prime, as steps in a mass computation. One counts the elements of a matrix group over the integers mod a prime as a product of two counts. Another gives a standard fact about subgroups: the index times the size of the image equals the size of the quotient. Others show a residue ring is isomorphic to integers mod a prime, and that a subgroup's image is parabolic (keeps a chain of subspaces in place). Several steps assume other claims. The theme is plain counting, but the setting uses project-specific objects.
6 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
Finite sets and countingGroups and homomorphismsCosets, normalizers and quotient groupsModular arithmeticLocal rings and residue fields: one big ideal of small elementsNumber fields, algebraic integers
References
Borel, Linear Algebraic Groups · ch. IVBackground reading suggested by the AI namer · unchecked
Uses
Used by
23 Lean files, main folder Formalism.PeriodIntegrals.UnitaryGroupMassFormula.LatticeIndices.