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 vertical Pieri rule
Statement
Assume the Axiom of Choice. Let , , let be a partition with and let . Then the sum over those partitions of with and for which the skew diagram is a vertical strip (at most one box in each row, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently in the rank- Schur basis, where is the -th exterior power (Symmetric and exterior powers over an arbitrary field).
Facts & Assumptions
Given: AC, with basis , a partition with , and an integer .
The one-column Specht module is the sign representation: its column stabilizer is all of , and the signed sum of its distinct tabloids spans a line on which every permutation acts by its sign. Therefore is the subspace of alternating tensors. It is isomorphic to the quotient exterior power in Symmetric and exterior powers over an arbitrary field via . The displayed multilinear map vanishes when two inputs agree (pair permutations by their transposition), so it factors through the quotient. Conversely the quotient of this signed average is the original wedge, since a transposition changes a wedge's sign by expanding a repeated input ; the signed average fixes every alternating tensor. These are inverse equivariant maps (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For , means and both spaces are ; for both spaces vanish (If , then ).
Littlewood--Richardson rule: for partitions with , , where is the number of LR tableaux of shape and content , vanishing unless and (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).
Let be a semistandard skew tableau of shape and content , i.e. with entries each occurring once. Its reading word is a permutation of ; it is a lattice word exactly when , because the first letter of a lattice word of content must be , and inductively the -th letter must be . If contains two boxes in the same row, at columns , then the right cell is read before the left cell in the reading order, while semistandardness gives the strictly smaller entry on the left, so in the reading word the larger entry precedes the smaller entry and the word is not . Hence an LR tableau of content exists only if is a vertical strip; conversely, if is a vertical strip, filling the boxes with in the order in which they are read (equivalently, from top row to bottom row, since each row has at most one box) makes every column strictly increasing downward and gives the reading word , so the filling is the unique LR tableau of shape and content (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).
The elementary symmetric polynomial equals by the one-column tableau expansion; and for . It is the character of , and the Schur characters , , are linearly independent (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).
Proof
If , the tensor product is zero by [F1], and the proposed sum is empty because a vertical strip inside at most rows has at most boxes. For , apply the Littlewood--Richardson rule [F2] with and use from [F1]:
By [F3] the coefficient is when is a vertical strip and otherwise, and it vanishes unless and by [F2]. Substituting into step 1.1 gives the decomposition, summed over precisely the vertical strips; for the left-hand side is zero by [F1], and indeed a vertical strip of size inside the rank- page has , which is impossible with boxes at most one per row.
Taking characters in step 2.1 and using and [F4] gives in the rank- Schur basis, the two statements being equivalent by the linear independence of the Schur characters [F4].
Depends on
- The Axiom of Choice
- The Littlewood--Richardson tensor-product rule
- Littlewood--Richardson tableaux and coefficients
- Schur modules and their characters
- Column antisymmetrizers, polytabloids, and Specht modules
- Symmetric and exterior powers over an arbitrary field
- If $k>\dim V$, then $\Lambda^kV=0$
- Skew diagrams and semistandard skew tableaux
- Partitions, English diagrams, and conjugation
- Semistandard tableaux and Kostka numbers
- Semistandard tableaux expand Schur characters
- Stable Schur functions from bialternants
Used by
- A partition with too many rows vanishes at fixed rank Counterexample
Dependency tree · two levels
35 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)
- R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, Graduate Texts in Mathematics 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)