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.
Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries
Statement
For all partitions :
(a) is a nonnegative integer;
(b) is invariant under every permutation of the three arguments, that is for all six orderings;
(c) conjugating exactly two of the three partitions preserves the coefficient: where denotes the conjugate partition.
No positive combinatorial rule for the coefficients is asserted.
Facts & Assumptions
Given: An integer and partitions with conjugates .
is the multiplicity of in the completely reducible module , hence a nonnegative integer (Kronecker coefficients and the internal tensor product).
For every and , , and (Sign twist corresponds to the omega involution).
Proof
Claim (a): by [F1], is the multiplicity of an irreducible summand in a completely reducible finite-dimensional module, so it is a nonnegative integer.
Claim (b): by [F2], is the average over of the product . Permuting the three arguments permutes the three factors of each summand, and complex multiplication is commutative, so every summand and hence the average is unchanged; this gives all six orderings.
Claim (c): by [F3], , and for every . Substituting the first two of these into the formula [F2] for gives , since for every . The same computation with exactly two of the three substitutions gives .
Depends on
Used by
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
- Igor Pak and Greta Panova, Bounds on the Kronecker coefficients, arXiv:1406.2988v2 (2014) (standard reference, not scraped)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford University Press 1995 (standard reference, not scraped)