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 are character structure constants
Statement
Assume the Axiom of Choice. In the notation of Tensor-product multiplicities for finite-dimensional simple modules, for all the following hold in the completed character ring of The completed formal character ring:
(i) , a finite sum; (ii) if is any finite-dimensional -module and with integers (finitely many nonzero), then for every , so the expansion coefficients of the character are exactly the composition multiplicities and the elements , , are linearly independent in ; (iii) for every weight one has the weight-multiplicity formula a finite sum, where and (The formal character of a finite-dimensional weight module, Weight and weight space).
Facts & Assumptions
Given: AC and dominant integral weights , with the decomposition of Tensor-product multiplicities for finite-dimensional simple modules.
Every finite-dimensional -module is the direct sum of its weight spaces, the tensor product of two finite-dimensional modules has weight spaces , and the formal character is additive over direct sums and multiplicative over tensor products in the completed ring (Finite-dimensional modules decompose into weight spaces, Weight and weight space, Formal characters are additive and multiplicative, The completed formal character ring).
For each the module is the unique simple module of highest weight , its highest weight space is one-dimensional, and every weight of lies in , so is the maximum of the weights of in the root order; moreover every finite-dimensional module is completely reducible (Highest-weight classification, Highest weight modules lie below the top weight, Root order on weights, Tensor-product multiplicities for finite-dimensional simple modules).
Proof
Part (i) is the multiplicativity and additivity of the formal character applied to the decomposition: the tensor product distributes over the direct sum, so in ; the sum is finite by Tensor-product multiplicities for finite-dimensional simple modules.
Part (ii), comparison of coefficients. Let be finite-dimensional with decomposition , . Then . Suppose also with integers , both sums finite. Let be maximal in the root order among the indices with (if there is none, the two families are equal). Evaluating both characters in the weight and using that unless with equality only for , while [F2], gives a contradiction. Hence for all .
Part (ii), linear independence. Suppose with a finite nonempty set and integers , not all zero. Split at the with and and let and ; the vanishing of the alternating sum gives in . Both are characters of finite-dimensional modules, so by step 1.2 the multiplicity families and agree on every , forcing against the choice of . Hence the characters are linearly independent.
Part (iii): by the tensor-product weight-space formula of [F1], , and taking dimensions gives ; only the finitely many pairs of weights of and can contribute, so the sum is finite.
Depends on
- Tensor-product multiplicities for finite-dimensional simple modules
- The Axiom of Choice
- The formal character of a finite-dimensional weight module
- Formal characters are additive and multiplicative
- The completed formal character ring
- Finite-dimensional modules decompose into weight spaces
- Weight and weight space
- Highest weight modules lie below the top weight
- Root order on weights
- Highest-weight classification
Used by
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)