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 product s(2,1)s(1) by Pieri
Example
Assume the Axiom of Choice. Let , , and let denote the rank- Schur polynomial, with for (Stable Schur functions from bialternants, Semistandard tableaux expand Schur characters). Then where the last term is read as when ; correspondingly, in the notation of Schur modules and their characters, with LR coefficient one for each listed shape; when the final Schur module is zero, so only the first two are nonzero summands (The Littlewood--Richardson tensor-product rule, The horizontal Pieri rule). The three partitions are exactly the partitions of with for which the skew diagram is a horizontal strip, namely the three legal ways of adding one box to the diagram of (Skew diagrams and semistandard skew tableaux). The rank bound is visible in the dimensions: for the identity reads , and for the shape has more rows than variables and drops out, leaving .
Facts & Assumptions
Given: AC, an integer and the rank- Schur polynomials.
Horizontal Pieri: for and , the nonzero Schur summands in are exactly those indexed by horizontal strips with , each with multiplicity one; the character identity is , where terms with are zero. Here and (The horizontal Pieri rule, Schur modules and their characters).
A skew diagram for a partition of is a horizontal strip of size one exactly when is obtained by adding one box to , and additions are legal exactly at the ends of rows, giving the three partitions , , (Skew diagrams and semistandard skew tableaux, Partitions, English diagrams, and conjugation).
For a three-row partition , padded by zeros, deleting all entries from a semistandard tableau leaves a two-row shape with : equal entries cannot share a column. Conversely these inequalities make the removed boxes a horizontal strip, so any tableau of shape on extends uniquely by filling the removed boxes with . Its columns of height two are forced to be above , and the remaining first-row boxes contain a weakly increasing string of 's followed by 's, with choices. Thus . At rank two the same column argument gives . Hence the rank-two values for are , and the rank-three values for are . The shape vanishes at rank two (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants).
Verification
Apply [F1] with and , using and : the summands are the partitions of with whose complement is a horizontal strip of one box.
By [F2] those partitions are exactly , and , and the LR coefficient for each is one. The character identity of the Statement includes all three terms, with at rank ; the module decomposition has only the nonzero Schur summands, so the final term is omitted there by [F3].
Dimension check at : using the values of [F3], ; dimension check at : . Both identities match the displayed decomposition.
Depends on
- The Axiom of Choice
- The Littlewood--Richardson tensor-product rule
- The horizontal Pieri rule
- Schur modules and their characters
- Littlewood--Richardson tableaux and coefficients
- Stable Schur functions from bialternants
- Semistandard tableaux expand Schur characters
- Skew diagrams and semistandard skew tableaux
- Partitions, English diagrams, and conjugation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I §5 (standard reference, not scraped)