Cluster k0903
Eventually-true family estimates and Plancherel bounds
These files are about "families" of objects indexed by a growing real parameter x, and properties that hold once x is large enough (the files call this "eventually" holding). Statements show that such eventual bounds can be introduced from bounds for every large x, and that several family-level claims about primes in short intervals, rank-two mass, logarithm lower bounds, and Plancherel-type bounds (sizes of Fourier-like transforms) imply each other. They are mainly conditional implications: given these assumed claims, derive that claim. The role looks like bookkeeping that bridges named assumptions. The exact mathematics behind the abbreviations is unclear from statements alone.
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
Chebyshev functions theta and psiFourier analysis, Poisson summationReal analysisA stranger way to measure size: ultrametric absolute values
Uses
Used by
18 Lean files, main folder Formalism.SharpRestriction.CuspSpanNormBounds.BruhatCellsKronecker.