Cluster k0415
Lattice transference, slope bounds and Gram determinants
This cluster handles lattices in real inner-product spaces. The statements say that a smaller subgroup of a discrete lattice is also discrete, that a certain "maximal slope" is at most a minus-log-of-shortest-vector term, that Gram determinants compare when a map stretches vectors by at most a constant, and give a Gauss-sum step from a Poisson-summation claim to a "key large" estimate. "Transference" relates a lattice to its dual. Some files are plain definitions or hypotheses. It reads as supporting estimates for counting lattice points.
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.
Prerequisite concepts
Linear algebraLattices in n dimensions, covolume and counting pointsReal analysisTopology: open sets, closed sets, compact and connected setsIntegration on a group, Haar measure and fundamental domainsFourier analysis, Poisson summation
References
Cassels, An Introduction to the Geometry of Numbers · ch. VIII (transference), ch. I-IIBackground reading suggested by the AI namer · unchecked
Uses
Used by
43 Lean files, main folder Formalism.LatticeSlopes.LatticeSlopesProofs.