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 Kronecker reduction lemma of Pak and Panova
Statement
Let and , and let have lengths at most . Read missing parts as zero and put , with for the empty partition.
(i) If for some , then .
(ii) Otherwise put , , , and define For every partition with at most parts satisfying for each , the image is a partition after deletion of zero parts. In particular and have a common size , and is a partition of after deletion of zero parts; in particular, when . Then
This is a corrected reduction map for the bounded-reduction conclusion of Pak–Panova. It retains their Littlewood–Richardson/Jacobi–Trudi proof route and the same size bound; the map is not the block formula printed in their papers.
Facts & Assumptions
Given: The partitions and length bound in the Statement; for part (ii), , the vectors and the map above; .
The internal product is bilinear, for and are its degreewise units, , and is symmetric in its arguments (The internal (Kronecker) product on symmetric functions, Power sums diagonalize the internal product, Kronecker coefficients and the internal tensor product, Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries).
Littlewood's identity is , with and (Littlewood's identity - the internal product against an outer product).
The Schur-product coefficient counts semistandard tableaux of shape and content with lattice reading word, read right to left in each row and top to bottom. It vanishes unless and (The Littlewood–Richardson rule for products of Schur functions, Littlewood--Richardson tableaux and coefficients).
Jacobi–Trudi gives for a partition of length at most , with and for . The Schur functions form an integral basis in each homogeneous degree of the stable graded ring (Jacobi–Trudi and dual Jacobi–Trudi identities, Schur functions form an orthonormal integral basis, The stable graded ring of symmetric functions).
Intersection and union are componentwise minimum and maximum and are partitions; in case (ii), and (Partitions, English diagrams, and conjugation).
Proof
For and , apply [F2] to and use the unit in [F1], then extract using [F3]. This gives the finite coefficient identity . Every nonzero summand has ; writing gives , so . If , then , all three partitions are empty, and the degree-zero unit gives , proving the claim; hence assume for the rest of the proof.
For part (ii) only, and put , . One has . If , let be the last index with ; telescoping gives . Hence when , and when its value is . If , consecutive parts of have the same difference as those of . If and , then . Since , this proves weak decrease at every remaining boundary. Thus maps the stated domain to partitions, is injective, and satisfies .
Independently of case (ii), expand the Jacobi–Trudi determinant for along the first row. Its th cofactor , indexed by , depends only on and is homogeneous of degree , since every product in that minor has that degree. Thus , with when ; for , expand in the Schur basis of degree . By symmetry [F1], is therefore a signed sum of with . If for some , then : the sums of the positive row differences in either direction agree because . Step 1.1 then has no contributing for any . Every term vanishes, proving part (i).
Return to case (ii) and put . If any , step 1.2 gives and therefore , so . If every , then and . Thus is a partition after deletion of zero parts, including when . To bound , use and telescope to obtain ; the last two sums together equal . Therefore for . If , equal total sizes imply and , where ; then . If , then , and , giving .
Fix . The map is a bijection from partitions of size to partitions of size . If either set is nonempty, its total deficit from or is . For the forward direction this proves , so step 1.2 applies. Conversely, given in the second set, set . These parts are nonnegative and have consecutive differences . They satisfy , , and . This is the inverse. Empty index sets, including , correspond as well.
For such an , shift every cell of to . Its image is , with each row order and the whole reading word preserved. Within runs of rows with , consecutive rows share columns in exactly the same way. At a cut , the original rows have no common skew column across the cut, since . The shifted rows likewise have no common skew column across it, because . The partition inequalities imply the same separation for every row above and below the cut. Thus all column comparisons, weak row inequalities, content and lattice-word conditions are preserved in both directions. Consequently for every , and the identical argument gives .
Apply step 1.1 to the reduced outer partitions of size . Because intersection commutes with subtracting the same row vector, their intersection is . Steps 2.3 and 3.1 identify the two finite sums term by term, with the same and unchanged , so for every . All degrees are nonnegative: if a reduction occurs then by step 2.2, and otherwise .
The first-row Jacobi–Trudi expansion for has exactly the cofactors of step 2.1, since its tail is unchanged. Replacing each by its equal reduced coefficient from step 4.1 in that finite signed expansion gives . Step 2.2 gives the asserted size bound, completing part (ii).
Remarks
The block map printed in Pak–Panova is not used here. For , , , , their complexity-paper formula gives for the first image, which is not a partition. The corrected map above retains a separation at every shortened cut and proves the claimed bounded reduction without weak-decrease assumptions on its outputs.
The sharp -gap stability result uses the coefficient identity and first-row expansion of steps 1.1 and 2.1 directly on a single row shift; it need not equate the two compacted images of this corrected map. All constructions and sums here are finite and use no choice principle.
Depends on
- Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries
- Kronecker coefficients and the internal tensor product
- The internal (Kronecker) product on symmetric functions
- Power sums diagonalize the internal product
- Littlewood's identity - the internal product against an outer product
- The Littlewood–Richardson rule for products of Schur functions
- Littlewood--Richardson tableaux and coefficients
- Jacobi–Trudi and dual Jacobi–Trudi identities
- Schur functions form an orthonormal integral basis
- The stable graded ring of symmetric functions
- Partitions, English diagrams, and conjugation
Used by
Dependency tree · two levels
56 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, On the complexity of computing Kronecker coefficients, arXiv:1404.0653v3 (2015); published in Computational Complexity 26 (2017) 1-36 (standard reference, not scraped)
- Igor Pak and Greta Panova, Bounds on the Kronecker coefficients, arXiv:1406.2988v2 (2014) (standard reference, not scraped)