Cluster k0879
Formal degree via polar coordinates and Gaussian limits
Files computing a formal degree (the constant measuring how big a discrete series is) by a limiting argument. Statements include coordinates on the non-compact part of the group, a Jacobian that is continuous, a count of coordinates, a log-sum-exp lower bound, an upper and lower bound for the formal degree, and a limit statement comparing a matrix coefficient with a Gaussian after rescaling. The key ingredient is a tangent-pairing claim assumed as hypothesis. A technical analysis cluster.
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
Knapp, Representation Theory of Semisimple Groups: An Overview Based on Examples · ch. IXBackground reading suggested by the AI namer · unchecked
Uses
Used by
34 Lean files, main folder ReciprocityTheory.ReductiveGroups.DiscreteSeries.FormalDegree.