Cluster k0014
Matrix kernel lengths and character column bounds over valuation rings
Files giving bounds on the "length" of kernels of matrices with entries in a discrete valuation ring (a ring with one prime). A basic statement says the length of the kernel of a square matrix equals the valuation of its determinant. Longer statements bound congruence ideals (a measure of how two systems of eigenvalues agree modulo the prime), using block-triangular matrices from group representations. They are written with many abstract ring and module assumptions. One small file shows a "hyperbolic" pairing. The cluster seems to turn a determinant condition into a length bound. It leans on definitions in other clusters.
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
Discrete valuation rings: numbers with one prime, and reducing mod itValuation rings and lattices over themGroups as matrices: representations and charactersLinear algebraPolynomials
References
Diamond and Im, Modular Forms and Modular Curves · sections on congruence modulesBackground reading suggested by the AI namer · unchecked
Uses
Used by
40 Lean files, main folder Formalism.CharacterColumnKernels.IdempotentNormalForms.