Cluster k0565
Counting dimensions of square-integrable function spaces on tori
These files work with functions on a torus (a space where moving by whole numbers brings you back), measured by square-integrability, meaning the integral of the squared size is finite. One states a Parseval identity: the squared size of a function equals the sum of squared Fourier coefficients. Others bound the dimension of a space of sections by a power of an integer q, bound pointwise size by an average over a nearby ball, and count how many well-separated points fit in a ball, a packing count. A symplectic-basis fact about integer lattices appears too. The theme is dimension and size estimates in a fundamental domain.
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
Fourier analysis, Poisson summationReal analysisLinear algebraLattices in n dimensions, covolume and counting pointsLattices in the complex plane
References
Stein and Shakarchi, Fourier Analysis: An Introduction · ch. 3 (Parseval, Fourier series)Background reading suggested by the AI namer · unchecked
Uses
Used by
26 Lean files, main folder ReciprocityTheory.ReductiveGroups.ArithmeticGeometry.SquareIntegrability.