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 Littlewood--Richardson tensor-product rule
Statement
Assume the Axiom of Choice. Let , , and let be partitions with . Then the finite direct sum over partitions with at most rows, where is the Littlewood--Richardson coefficient of Littlewood--Richardson tableaux and coefficients; unless and . Equivalently in characters with for (Stable Schur functions from bialternants); the coefficients do not depend on .
Facts & Assumptions
Given: AC, , partitions with , and the tensor product with its -action.
The modules with are nonzero pairwise non-isomorphic irreducible polynomial -modules with characters , and for ; distinct Schur characters , , are linearly independent (Schur modules and their characters, Semistandard tableaux expand Schur characters, Schur-Weyl decomposition and highest weights parts (2) and (3), Polynomial representations of GL_r and their highest weights).
The tensor product is a polynomial -module of finite length whose character is , and the multiplicity of in it equals for every with (The admissible-tableau count equals the Littlewood--Richardson coefficient, Schur modules and their characters).
A skew shape is nonempty only if and ; a LR tableau of shape has content with , so unless and (Littlewood--Richardson tableaux and coefficients, Partitions, English diagrams, and conjugation).
Only finitely many partitions have the fixed size , since their parts and lengths are bounded by that size; the size condition in [F3] therefore makes the sum finite (Partitions, English diagrams, and conjugation, Littlewood--Richardson tableaux and coefficients).
Proof
Decomposition. By [F2] the multiplicity of in equals for every partition with . The module is completely reducible by the tensor-power retraction proved in the supplier of [F2], and its irreducible summands are among the pairwise non-isomorphic simple modules with by [F1]; therefore where the sum is finite by [F4] and the vanishing statement of [F3] removes all with or .
Characters. Taking characters in step 1.1 and using additivity and multiplicativity of the character together with [F1] gives , where terms with are by definition of and .
Independence of . The coefficient of in step 2.1 is , the number of LR tableaux of shape and content (Littlewood--Richardson tableaux and coefficients); this is a count of tableaux of a fixed skew shape and content, so it does not mention the rank at all, and the multiplicity statement of step 1.1 identifies the same integer as the multiplicity in the tensor product for every with . Hence the coefficients appearing in the decomposition are independent of , as claimed.
Depends on
- Stable Schur functions from bialternants
- The Axiom of Choice
- The admissible-tableau count equals the Littlewood--Richardson coefficient
- Semistandard tableaux expand Schur characters
- Schur modules and their characters
- Littlewood--Richardson tableaux and coefficients
- Polynomial representations of GL_r and their highest weights
- Schur-Weyl decomposition and highest weights
- Commuting symmetric-group and linear actions on a tensor power
- Partitions, English diagrams, and conjugation
- Highest weight modules lie below the top weight
Used by
- The horizontal Pieri rule Corollary
- The vertical Pieri rule Corollary
- A partition with too many rows vanishes at fixed rank Counterexample
- A Littlewood--Richardson coefficient greater than one Example
- The product s(2,1)s(1) by Pieri Example
- Littlewood--Richardson coefficients stabilise with rank Proposition
Dependency tree · two levels
50 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
- J. R. Stembridge, A Concise Proof of the Littlewood--Richardson Rule, Electronic Journal of Combinatorics 9 (2002), #N5, 4 pp. (standard reference, not scraped)
- T. Seynnaeve, Representation Theory (lecture notes, Bern) (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)