How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Tensor-product multiplicities for finite-dimensional simple modules
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra , positive system with base , positive cone , Weyl vector , weight lattice and set of dominant integral weights (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights).
For let denote the finite-dimensional simple -module of highest weight (Highest-weight classification), and let carry the tensor-product action (Direct-sum, dual, Hom, and tensor representations). By Weyl's complete reducibility theorem (Weyl's complete reducibility theorem) and the classification of finite-dimensional simple modules there is a decomposition with uniquely determined integers . The direct sum is finite because is finite-dimensional, so its completely reducible decomposition has only finitely many nonzero simple summands. Each constituent highest weight is a weight and lies below in the partial order of weights: every tensor-product weight is a sum of a weight of , which lies in , and a weight of , which lies in (Highest weight modules lie below the top weight).
The integers are the tensor-product multiplicities of . More generally, for a finite-dimensional completely reducible -module we write for the number of summands isomorphic to in any decomposition of into simple modules; this number does not depend on the chosen decomposition. By Schur's lemma (Schur’s lemma for irreducible Lie-algebra representations) the multiplicity has the equivalent hom-space description
Depends on
- The Axiom of Choice
- Weyl's complete reducibility theorem
- Highest-weight classification
- Direct-sum, dual, Hom, and tensor representations
- Highest weight modules lie below the top weight
- Root order on weights
- Finite Weyl root system, lattice and chamber conventions
- Integral, dominant, and strictly dominant weights
- Schur’s lemma for irreducible Lie-algebra representations
Used by
- The Racah--Speiser tensor-product algorithm Corollary
- The Clebsch--Gordan tensor decomposition for sl2 Example
- Three times three for sl3 Example
- Weyl alternation extracts a dominant highest-weight coefficient Lemma
- Tensor-product multiplicities are character structure constants Proposition
- Steinberg's tensor-product multiplicity formula Theorem
Dependency tree · two levels
45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes (standard reference, not scraped)
- R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, Graduate Texts in Mathematics 255, Springer 2009 (standard reference, not scraped)