Cluster k0566
Gaussian-weighted function spaces and packing estimates
These files estimate the size of complex functions weighted by a Gaussian, the bell-shaped factor e to the minus pi times distance squared. Statements include a Cauchy-type bound on derivatives at a point, Gaussian tail sums over lattices (regular grids of points), and a packing count: well-separated points in a ball cannot exceed a fixed power of the ratio of radii. Larger claims say a section with prescribed polynomial behaviour exists and that a supremum is controlled by an L2 norm (a root-mean-square size). They look like estimates for building special functions on a complex torus. Several statements assume other claims.
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 pointsLinear algebraReal analysisComplex analysisFourier analysis, Poisson summation
References
Folland, Harmonic Analysis in Phase Space · ch. 1 (Fock-Bargmann space)Background reading suggested by the AI namer · unchecked
Uses
Used by
41 Lean files, main folder ReciprocityTheory.ReductiveGroups.ArithmeticGeometry.SquareIntegrability.