Cluster k0480
Local counts at primes for pairs of terms
The files count local objects (lattices at one prime) attached to a pair of terms, using matrices over a local field. Sampled statements say a count is zero when a Gram value vanishes, a point's smallest minor is zero when its last block is big, cokernel determinants of two matrices differ by a unit if the cokernels match, and a local phase equals an explicit expression. Larger "cut leaves" statements bundle about a dozen smaller claims. Many are definitions of claims, so much of this is a plan whose parts are proved elsewhere or assumed.
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
Linear algebraHermitian, skew-Hermitian and unitary matrices; the spectral theoremValuation rings and lattices over themLocal rings and residue fields: one big ideal of small elementsFinite sets and counting
Uses
Used by
102 Lean files, main folder Formalism.LocalToGlobal.SiegelLatticeTheory.CokernelGLCounts.RankPointCounts.