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.
Littlewood--Richardson tableaux and coefficients
Definition
Let be partitions with , and let be a partition with . Use the conventions of Skew diagrams and semistandard skew tableaux for the skew diagram and for semistandard skew tableaux of shape , and those of Semistandard tableaux and Kostka numbers for the content of a tableau; recall that entries of a semistandard skew tableau weakly increase along rows and strictly increase down columns (Partitions, English diagrams, and conjugation fixes the English row and column coordinates).
The reading word of a semistandard skew tableau of shape is the word obtained by reading the rows of from right to left, beginning with the top row and proceeding to the bottom row. The word is a lattice word (a lattice permutation) if in every prefix and for every the number of letters in the prefix is at least the number of letters ; the empty word is a lattice word vacuously.
A Littlewood--Richardson tableau (LR tableau) of shape and content is a semistandard skew tableau of shape and content whose reading word is a lattice word. The Littlewood--Richardson coefficient is the number of LR tableaux of shape and content ; it is when , when , or when no such tableau exists. For and the empty skew tableau is the unique tableau of content , its reading word is empty, and hence ; more generally unless , and unless and .
Depends on
Used by
- The horizontal Pieri rule Corollary
- The vertical Pieri rule Corollary
- A semistandard tableau with non-lattice reading word is not a Littlewood--Richardson tableau Counterexample
- A Littlewood--Richardson coefficient greater than one Example
- The product s(2,1)s(1) by Pieri Example
- The admissible-tableau count equals the Littlewood--Richardson coefficient Lemma
- Littlewood--Richardson coefficients stabilise with rank Proposition
- The Littlewood--Richardson tensor-product rule Theorem
Dependency tree · two levels
5 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)
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes (standard reference, not scraped)