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 support of the reduced Kronecker coefficients satisfies the size triangle inequalities
Statement
If then (Murnaghan's inequalities). Hence the support of the nonzero reduced coefficients with fixed lies in the triangle region of the weight lattice.
Facts & Assumptions
Given: Partitions with and a nonzero summand of the expansion.
, a sum of nonnegative integers, and for every nonzero summand , , and (The nonnegative expansion of a reduced Kronecker coefficient).
Proof
Since is a sum of nonnegative integers, some summand is positive; fix such a summand, whose four coefficients are positive and whose sizes satisfy the degree equations of [F1].
The three differences. Using the degree equations and , compute ; next ; and symmetrically . Each difference is a sum of nonnegative integers, giving the three inequalities for this summand.
Since these inequalities depend only on the sizes of and not on the chosen positive summand, they hold whenever , that is, for every . This is precisely the assertion that the support lies in the triangle region cut out by the three size inequalities. The argument is a finite computation with nonnegative integers and uses no choice principle; the empty partition is allowed, and then the corresponding inequality is the trivial nonnegativity bound.
Depends on
Used by
Dependency tree · two levels
10 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.