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.
The Racah--Speiser tensor-product algorithm
Statement
Assume the Axiom of Choice. Let . For every weight of with multiplicity put and say that is regular relative to when is fixed by no reflection of , equivalently for every root . If is regular relative to , there is a unique with strictly dominant (Finite Weyl closed chambers and stabilizers), and then is a dominant integral weight (the shifted action being ). The Racah--Speiser algorithm computes the multiplicities of Steinberg's tensor-product multiplicity formula as the sum being finite; a weight for which is not regular is discarded, and every with occurs as for some regular weight of .
Facts & Assumptions
Given: AC, dominant integral weights , the weight set of with multiplicities (Weight and weight space), and the Weyl group acting on by the reflection action (Root reflections and the Weyl group action).
Steinberg's formula: the sum being finite (Steinberg's tensor-product multiplicity formula).
The shifted dominant weight is strictly dominant, and (Positive coroot pairings of a dominant integral weight). Every orbit in the real root span has exactly one point in the closed dominant chamber. Its stabilizer is generated by reflections in the simple walls through that point. Consequently a regular has a strictly dominant representative and a unique element sending it there; uniqueness of the element is asserted only for regular points (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Finite Weyl root system, lattice and chamber conventions). In particular is integral; if regular, all simple-coroot pairings of are positive integers, so subtracting leaves nonnegative integral pairings and .
Length parity: for every reflection (the sign is a homomorphism), so (The sign of the Weyl length is multiplicative).
Proof
Rewrite the Steinberg sum by the second argument. For put and , so that by [F1], the sum being finite. Fix a weight of and let where . This set is nonempty exactly when is -conjugate to .
Regular weights contribute one term each. Suppose is regular, so that has trivial stabilizer. If , then is strictly dominant for any , so by the uniqueness in [F2] there is exactly one such , namely where is the unique element with strictly dominant; in that case , and the contribution of to is . If , or if , the weight contributes nothing to .
Irregular weights cancel. Suppose is not regular: is fixed by some reflection . Then is stable under right multiplication by , because for every ; the map is a fixed-point-free involution of , and by [F3] the signs of paired terms are opposite. Since the multiplicity is the same for paired terms, the total contribution of the group to the sum of step 1.1 is .
Combining step 1.2 and 2.1, the value of is the sum of over the regular weights of with , which is the displayed Racah--Speiser formula; the sum is finite because has finitely many weights. If , the displayed sum is nonzero, so at least one regular weight satisfies ; this proves the final assertion.
Depends on
- Positive coroot pairings of a dominant integral weight
- The Axiom of Choice
- Tensor-product multiplicities for finite-dimensional simple modules
- Steinberg's tensor-product multiplicity formula
- The sign of the Weyl length is multiplicative
- Finite Weyl closed chambers and stabilizers
- Integral, dominant, and strictly dominant weights
- Finite Weyl root system, lattice and chamber conventions
- Root reflections and the Weyl group action
- Weight and weight space
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
- A. W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Birkhäuser 2002 (standard reference, not scraped)
- D. E. Littlewood and A. R. Richardson / G. Racah and J. Speiser, as presented in R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, GTM 255, Springer 2009 (standard reference, not scraped)
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes (standard reference, not scraped)