Cluster k0619
Highest-weight irreducibility and Gelfand-Tsetlin branching
These files study spaces of polynomials in an N-by-N grid of variables acted on by invertible matrices. The key claims say each such space (labelled by a decreasing list of integers called a dominant weight) cannot be split further when acted on by the group, and has a single "extremal" line fixed by upper-triangular matrices. They also state a branching rule: restricting from N to N-1 dimensions splits the space by an interlacing pattern, as in Gelfand-Tsetlin theory. Other files give norm bounds from Schur's lemma and a Capelli-type identity. Final results are mostly assembled from named claims.
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
Groups as matrices: representations and charactersWeights, highest-weight vectors and the Casimir operatorLinear algebraPolynomialsHermitian, skew-Hermitian and unitary matrices; the spectral theorem
References
Goodman and Wallach, Symmetry, Representations, and Invariants · ch. 8 (branching) and ch. 5Background reading suggested by the AI namer · unchecked
Uses
Used by
83 Lean files, main folder Formalism.PeriodIntegrals.