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.
Conjugation and exchange symmetries of the Littlewood–Richardson coefficients
Statement
For all partitions , with primes denoting conjugate partitions, where each is the Littlewood–Richardson coefficient of the inherited tableau definition (Littlewood--Richardson tableaux and coefficients). No choice principle is used.
Facts & Assumptions
Given: Partitions and their LR coefficients.
The coefficient is the number of LR tableaux of shape and content , and it is zero unless and (Littlewood--Richardson tableaux and coefficients).
For every pair of partitions, , a finite sum in the stable symmetric-function ring (The Littlewood–Richardson rule for products of Schur functions).
The graded -algebra involution satisfies for every partition (The omega involution conjugates Schur functions).
In every degree the Schur functions form an orthonormal -basis, so coefficients in a Schur expansion are unique (Schur functions form an orthonormal integral basis).
Conjugation transposes Young diagrams, preserves size, and is an involution; in particular iff and (Partitions, English diagrams, and conjugation).
Multiplication in is coordinatewise multiplication of symmetric polynomials, hence is associative, commutative, and graded (The stable graded ring of symmetric functions).
Proof
By [F6], . Expanding each side by [F2] and comparing coefficients in the Schur basis [F4] gives for every .
Apply the ring homomorphism [F3] to the expansion in [F2]. Since , this gives , where the reindexing is valid by [F5]. The LR expansion [F2] applied to also gives . Uniqueness in [F4] implies ; taking and using proves .
If a partition is empty, the LR expansion [F2] includes the unit and all other coefficients are zero by [F1], so both symmetries still hold. If a coefficient is zero because its containment or size condition fails, [F1] gives zero and conjugation preserves those conditions by [F5]; when the LR set is empty despite valid containment and size, step 1.2 already proves the conjugate coefficient is equal to it. Thus the zero, unit, and boundary cases, including , require no strict-containment assumption. All coefficient comparisons are in finite homogeneous degrees. No tableau representatives, bases, or other objects are chosen, and no axiom of choice is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I §§2–3 (standard reference, not scraped)