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 horizontal 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 horizontal strip (at most one box in each column, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently in the rank- Schur basis, where is the -th symmetric power (Symmetric and exterior powers over an arbitrary field).
Facts & Assumptions
Given: AC, , a partition with and an integer .
For , the one-row Specht module is trivial: its tabloid module has one basis element and all column stabilizers are trivial. Thus . This is isomorphic to the quotient symmetric power of Symmetric and exterior powers over an arbitrary field: the averaging operator annihilates every coinvariance relation and induces the inverse to the quotient map restricted to invariants, because and fixes invariant tensors. These maps commute with (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For , use the empty partition in place of ; its Schur module, and are all .
Littlewood--Richardson rule: for partitions with , , with the number of LR tableaux of shape and content , and unless and (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).
A semistandard skew tableau of shape and content has all its entries equal to ; weak increase along rows is automatic, and strict increase down columns forces every column of to contain at most one box, so such a tableau exists if and only if is a horizontal strip, and then it is unique; its reading word is the constant word , a lattice word (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).
The complete symmetric polynomial equals by the one-row tableau expansion (and ), and the Schur polynomials , , are linearly independent: after multiplying a finite relation by , the coefficient of the strictly decreasing exponent vector is exactly that relation’s coefficient of (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).
Proof
Apply the Littlewood--Richardson rule [F2] with for and for , and use from [F1]:
For , the unique empty tableau gives the single summand . For , the coefficient counts LR tableaux of shape and content ; by [F3] this number is when is a horizontal strip and otherwise, and it vanishes unless and by [F2]. Substituting into step 1.1 gives the direct-sum decomposition, the sum being over precisely those horizontal strips.
Taking characters in step 2.1 and using and [F4] gives in the rank- Schur basis; the two displayed statements are 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
- 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
- The product s(2,1)s(1) by Pieri Example
Dependency tree · two levels
31 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)
- R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, Graduate Texts in Mathematics 255, Springer 2009 (standard reference, not scraped)