Cluster k0001
Gaussian sums over lattices and height kernels
Files about sums of Gaussian bell curves over lattices (regular grids of points in space), plus related helper claims. They bound such a sum by quantities like the determinant of a positive-definite matrix (a matrix that always gives positive "squared lengths") and the shortest nonzero lattice vector. Other files in the group deal with roots of unity, Plücker-type bounds and theta constants (special sums used for abelian varieties). Many names end in "Statement", so a good share of the files state a claim as a definition and prove other claims by assuming such statements. The role seems to be supplying numerical estimates for a "heights" argument, meaning a way of measuring how complicated a point is.
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 pointsFourier analysis, Poisson summationLinear algebraHermitian, skew-Hermitian and unitary matrices; the spectral theorem
References
Hindry and Silverman, Diophantine Geometry: An Introduction · Part B (heights)Background reading suggested by the AI namer · unchecked
Uses
Used by
50 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.HeightKernels.