Cluster k0414
Counting Hermitian matrices and Gauss sums over rings
This cluster counts matrices and characters over finite rings that carry a conjugation, a model for complex conjugation. Statements say how many Hermitian matrices are divisible by a given element, how many elements have norm zero, and that certain Gauss sums (sums of a character over a finite ring) take exact values and satisfy a recursion in the level. Another group describes "local densities", limits of such counts as the level grows. Many are stated as claims, and a number are paired with wrapper statements. It looks like an exact-counting toolkit for lattice mass calculations.
5 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 countingLinear algebraRings, fields and algebrasHermitian, skew-Hermitian and unitary matrices; the spectral theoremDiscrete valuation rings: numbers with one prime, and reducing mod it
References
Lidl and Niederreiter, Finite Fields · ch. 5 (Gauss sums) and ch. 6 (quadratic forms)Background reading suggested by the AI namer · unchecked
Uses
Used by
48 Lean files, main folder Development.AutomorphicSpectrum.Proofs.BlockDecomposition.