Cluster k0786
Index bounds for pairs of lattices, triple sums
Files on "pairing index bounds": how far apart two lattices in a complex vector space are, measured by the index (the number of cosets) of one inside the other. Samples show a triple-sum constant equal to one, a model construction that turns lattice data into a linear map from indicator functions, a standard lattice being a lattice, and moves between lattices that preserve triangles. It is technical bookkeeping that bounds counts of lattice points for the theta argument. Several definitions are claims; some results assume other claims as hypotheses.
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
Lattices in n dimensions, covolume and counting pointsHermitian, skew-Hermitian and unitary matrices; the spectral theoremCosets, normalizers and quotient groupsLinear algebra
References
Cassels, An Introduction to the Geometry of Numbers · ch. I-IIIBackground reading suggested by the AI namer · unchecked
Uses
Used by
31 Lean files, main folder Formalism.LocalToGlobal.KernelLattices.ColumnData.ColumnDataEquations.