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 coefficients stabilise with rank
Statement
Assume the Axiom of Choice. Let be partitions, padding their row-length coordinates by zeros when needed, and let be the Littlewood--Richardson coefficients of Littlewood--Richardson tableaux and coefficients.
(i) If , then and ; in particular and .
(ii) For every the tensor product over decomposes as with the same coefficients for every such ; if no coefficient visible at a larger rank is lost, and for every such one has with for (Stable Schur functions from bialternants).
Facts & Assumptions
Given: AC, partitions , and the LR coefficients defined as counts of LR tableaux of skew shapes and content (Littlewood--Richardson tableaux and coefficients).
The LR coefficient counts semistandard skew tableaux of shape with content whose reading word is a lattice word; such a tableau exists only when and has exactly boxes, and its entries lie in because the letter occurs times for (Littlewood--Richardson tableaux and coefficients, Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux).
Column contains a box in every row for which . A column of a skew diagram has its boxes in consecutive rows, and strict increase down that column gives distinct letters (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers).
Littlewood--Richardson tensor rule: for , for , and the character identity holds with for (The Littlewood--Richardson tensor-product rule, Schur modules and their characters, Stable Schur functions from bialternants).
Proof
Suppose and let be an LR tableau of shape and content . The containment and the size identity are part of [F1]. For the first row, read from right to left: the reading word of begins with the entries of the first row (weak increase becomes weak decrease read right to left), where is the number of boxes of the first row of the skew diagram. If , the lattice condition at the first letter forces : otherwise that prefix has one and no . Hence for every ; if , the desired inequality holds immediately, so all first-row entries equal and because contains only copies of . Hence , i.e. .
Row bound. Suppose has a box in row . Since , we have for every ; since row occurs in the partition , we also have for every . Thus each row contributes a box in column to , giving at least boxes in that column. Strict increase down the column makes their entries distinct, and all entries lie in because the tableau has content [F1]; hence , contradicting . Therefore .
Part (ii) for the tensor product is exactly [F3], applied at each rank ; the coefficients appearing are the rank-independent tableau counts of Littlewood--Richardson tableaux and coefficients, so they are the same for every such . If , then every with satisfies by step 1.2, so no coefficient disappears when the rank is lowered to from a larger rank; equivalently no coefficient visible at a larger rank is lost.
The character identity is the character form of the decomposition in [F3], with the convention for ; it holds for every by [F3]; once , the set of partitions with nonzero coefficients and those coefficients are independent of by step 2.1. The Schur polynomials themselves are evaluated in the rank-dependent variables .
Depends on
- The Axiom of Choice
- The Littlewood--Richardson tensor-product rule
- Littlewood--Richardson tableaux and coefficients
- Schur modules and their characters
- Stable Schur functions from bialternants
- Partitions, English diagrams, and conjugation
- Semistandard tableaux and Kostka numbers
- Skew diagrams and semistandard skew tableaux
- Highest weight modules lie below the top weight
Used by
- A partition with too many rows vanishes at fixed rank Counterexample
Dependency tree · two levels
29 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)
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes (standard reference, not scraped)