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 reduced (stable) Kronecker coefficient
Definition
For partitions define the reduced (stable) Kronecker coefficient to be the eventual value of the padded sequence furnished by Murnaghan stability for Kronecker coefficients; equivalently where the sequence is defined for and set to below by the convention in Murnaghan stability for Kronecker coefficients (the size-indexed coefficients of Padded Kronecker coefficient sequences themselves are defined only on that common domain; see also Kronecker coefficients and the internal tensor product).
Well-definedness. The sequence is eventually constant by the Murnaghan stability theorem, and the eventual value of an eventually constant sequence of nonnegative integers is a unique nonnegative integer; no choice is involved. Two immediate conventions: (i) for all , because and the Kronecker coefficients are symmetric in their two lower indices; (ii) for fixed only finitely many have , because the finite set of the stability theorem carries the whole support. The values used later and verified in the source's introduction for are and ; they are read off from the displayed stable row and are not used as logical inputs anywhere on this page.
Depends on
Used by
- A global product threshold is not a per-coefficient sharpness claim Counterexample
- Murnaghan stability for α=β=(2), ranks 4 to 9 Example
- The nonnegative expansion of a reduced Kronecker coefficient Lemma
- Brion's formula for the reduced Kronecker coefficients Theorem
- The exact global stabilization threshold for a fixed Kronecker product Theorem
- The Murnaghan expansion at every admissible rank Theorem
Dependency tree · two levels
21 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.