Cluster k0876
Number-field splitting and lattice counting for hermitian families
Files mixing algebraic number theory with counting arguments. Statements include a notion of a prime that splits completely in a number field, a formula for a count in terms of products over indices, bounds in a family of non-generic cases, and a link between sums over words and "transport zero" statements. They use hermitian lattices (integer grids with a complex inner product) and volumes with Gauge normalisation. Many take hypotheses with large lists of constants, so are conditional and of a technical, project-specific nature.
3 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.
References
Neukirch, Algebraic Number Theory · ch. I sec. 8 (Splitting of primes)Background reading suggested by the AI namer · unchecked
Uses
Used by
31 Lean files, main folder Formalism.SharpRestriction.CuspSpanNormBounds.