Cluster k0886
Counting discrete-series automorphic representations via kernel bounds
Files for counting representations that appear in a space of functions on an arithmetic quotient. Definitions of hypotheses on parameters (size, primes, gap), a claim that rare flags have small probability, pointwise kernel bounds, finite-dimensionality of a rows space, a cusp frame claim, and a counting theorem derived from a volume step. Also a number-theory fact about when a prime ideal is radical. Many results assume hypotheses, so the count is conditional. Over a quarter are statement wrappers.
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.
References
Bump, Automorphic Forms and Representations · ch. 3Background reading suggested by the AI namer · unchecked
Uses
Used by
99 Lean files, main folder Development.AbelianVarietyTheory.Proofs.FlagMeasures.