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 nonnegative expansion of a reduced Kronecker coefficient
Statement
For all partitions one has the finite nonnegative expansion the sum over all six-tuples of partitions (only finitely many summands are nonzero), where the 's are the threefold Schur coefficients (Threefold Schur coefficients ) and the 's are the ordinary Kronecker coefficients (Kronecker coefficients and the internal tensor product).
Consequences.
- if and only if there exist partitions with all four coefficients , , and positive.
- For every nonzero summand the degree equations , , and hold.
- For fixed the index set is finite: for a nonzero summand are contained in , are contained in , and .
- All summands are nonnegative integers, so no cancellation occurs.
Facts & Assumptions
Given: Partitions and six-tuples of partitions .
and for all specializations (Schur functions on sums and products of alphabets), and degreewise (The series : product formula, Cauchy identity, adjunction and reproducing kernel).
, and (Threefold Schur coefficients ).
The Schur basis is orthonormal (Schur functions form an orthonormal integral basis), the coefficients and are nonnegative integers, and unless and , while unless (Littlewood--Richardson tableaux and coefficients, The Littlewood–Richardson rule for products of Schur functions, Kronecker coefficients and the internal tensor product).
Proof
Expanding Brion's pairing. Insert the four expansions of [F2] into the pairing of [F1]: , and by the coproduct identity at the sum , , with and . Multiplying out and pairing with using orthonormality [F4] extracts and by [F3], so .
Collapsing the middle index. By the iterated identity of [F3], ; substituting into step 1.1 and relabelling the summation indices gives the displayed expansion. The threefold coefficients are symmetric in their three subscripts by their definition as coefficients of the commutative product , so the displayed index pattern is the same as the source's equation (8) with the four factors assigned to the four faces of the index tetrahedron in a different order. All coefficients are nonnegative integers, so no cancellation occurs in the sum.
Consequences (2) and (4). A nonzero summand has all four coefficients positive (they are nonnegative integers), and then the degree equations of (2) follow from the size constraints in [F4]: , , and ; conversely, any summand with all four coefficients positive contributes positively, giving the criterion (1) since the total is a sum of nonnegative integers.
Consequence (3), finiteness. If then, by the iterated form of [F3], there is a partition with and ; by [F4] this forces , and , so range over the finitely many subpartitions of . Similarly forces , and forces , so ranges over the finitely many partitions of the bounded number . Hence only finitely many six-tuples contribute, and the expansion is a finite sum; the proof uses finite expansions and no choice principle.
Depends on
- The reduced (stable) Kronecker coefficient $\bar g^\gamma_{\alpha,\beta}$
- Threefold Schur coefficients $c^\delta_{a,b,c}$
- Brion's formula for the reduced Kronecker coefficients
- Schur functions on sums and products of alphabets
- The series $\sigma$: product formula, Cauchy identity, adjunction and reproducing kernel
- Schur functions form an orthonormal integral basis
- Kronecker coefficients and the internal tensor product
- The Littlewood–Richardson rule for products of Schur functions
- Littlewood--Richardson tableaux and coefficients
Used by
Dependency tree · two levels
48 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
- Emmanuel Briand, Rosa Orellana and Mercedes Rosas, The stability of the Kronecker product of Schur functions, arXiv:0907.4652v2 (2009); Lemma 2.1 and equation (8), pp. 7-8 (nonnegative expansion of the reduced coefficients) (standard reference, not scraped)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford University Press 1995; Chapter I sections 3 and 5 (Littlewood-Richardson coefficients) (standard reference, not scraped)