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 and Internal Products
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Characters and the Orthogonality Relations
- Clifford Theory over Normal Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Frobenius Characteristic and the Symmetric-Group Character Dictionary
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Induced Representations, Frobenius Reciprocity and Applications
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Products, Skew Specht Modules, and Littlewood–Richardson Coefficients
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Specht Modules and the Irreducibles of the Symmetric Group
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Functions, the Hall Inner Product, and Schur Bases
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Product Multiplicities and Littlewood Richardson
- Tensor Products of Modules
- The Branching Rule and the Young Graph
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
Objective. This page defines the Kronecker coefficients of the symmetric
group, transports them to the internal product of symmetric functions, proves
the exact character, reduction and stability statements available on this
route, and marks the open boundary: no general positive combinatorial rule is
claimed. The page is a child of the character dictionary, the Specht-module
theory and the outer-product theory of
frobenius-characteristic-and-the-symmetric-group-character-dictionary,
specht-modules-and-the-irreducibles-of-the-symmetric-group and
outer-products-skew-specht-modules-and-littlewood-richardson; the outer
product is used only for contrast and for Littlewood's identity below.
The coefficient is the multiplicity of in the internal tensor product , a diagonal -module that keeps the rank, unlike the outer induction product (Kronecker coefficients and the internal tensor product). Complex Specht modules are self-dual with real-valued characters (Complex Specht modules are self-dual with real-valued characters), so the multiplicity is computed by the three-character inner product (The Kronecker coefficient is a three-character inner product). The multiplicity definition makes the coefficients nonnegative integers; the character formula makes them fully -symmetric, and invariant under conjugating exactly two of the three partitions (Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries); no positive combinatorial rule is asserted anywhere on the page (No general positive combinatorial rule for Kronecker coefficients is known).
Transporting the same-rank tensor product through the Frobenius characteristic defines the internal (Kronecker) product on symmetric functions, a degree-preserving bilinear product with degreewise unit (The internal (Kronecker) product on symmetric functions). In the power-sum basis this product is diagonal, , and in the Schur basis it has the structure constants (Power sums diagonalize the internal product). The stability route begins with first-row padding , defined exactly from the threshold , and with the padded Kronecker coefficient sequences built on the common domain of three padded families (First-row padding of a partition, Padded Kronecker coefficient sequences). These are neutral definitions: they assert no constancy of any coefficient along a padded family.
Littlewood's identity expresses the internal product against an outer product as a sum over Littlewood–Richardson coefficients (Littlewood's identity - the internal product against an outer product), and it drives the reduction lemma: either a row difference larger than forces , or the coefficient equals that of an explicitly reduced triple, with the size bound (The Kronecker reduction lemma of Pak and Panova). Its corrected row shear retains a separation at each shortened cut and supplies a complete proof of the bounded reduction. Applying the same Littlewood–Richardson coefficient identity and first-row Jacobi–Trudi expansion directly at a single cut gives row-gap reduction: under the separation hypothesis one has for all , and consequently the padded family is eventually constant for every triple (Row-gap reduction and conditional k-stability of Kronecker coefficients). Monotonicity, boundedness for all and a limit formula are not claimed; the page stops at eventual constancy, and the companion page shows that eventual constancy is not immediacy.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Kronecker coefficients and the internal tensor product
Definition
Fix an integer and work over . Let be partitions of (Partitions, English diagrams, and conjugation), and let be the tensor product of their complex Specht modules, a finite-dimensional complex -module (The tensor product of two complex representations, Column antisymmetrizers, polytabloids, and Specht modules). The Kronecker coefficient of a third partition is the multiplicity of in this tensor product:
where is the isotypic component of type (The isotypic component of a completely reducible representation).
Well-definedness. The module is finite-dimensional, and does not divide the order of the finite group , so complex Maschke's theorem gives complete reducibility (Maschke's theorem for finite groups over fields whose characteristic does not divide , If , every finite-dimensional representation of is completely reducible, A completely reducible representation as a finite direct sum of irreducible subrepresentations). The complex Specht modules , , are a complete list of pairwise inequivalent irreducible -modules (Complex Specht modules are irreducible, Specht modules classify the complex irreducibles of , Distinct complex Specht modules are inequivalent). Consequently a decomposition into irreducibles has the form with nonnegative integer multiplicities , and the isotypic component of type is the direct sum of exactly the copies of appearing in any such decomposition, by The isotypic decomposition of a completely reducible representation is unique (Proof step 2.1 identifies each grouped block with the defining isotypic sum). In particular and because is irreducible. Hence is a nonnegative integer, independent of the chosen decomposition, and is by definition the multiplicity of in .
The internal product. For partitions call the internal (Kronecker) product of the -representations and . Unlike the outer induction product of The outer Littlewood–Richardson rule, which takes a pair of modules of degrees and to a module of degree , the internal product keeps the rank: both inputs and the output are -modules of the same degree . The two operations are different constructions on different data; the outer product is mentioned here only for contrast and is not used in this definition.
No form of the Axiom of Choice is used: the tensor product, Maschke's theorem, the Specht classification and the isotypic decomposition are finite-dimensional complex representation theory of a finite group.
Complex Specht modules are self-dual with real-valued characters
Statement
For every and the complex Specht module carries a nondegenerate symmetric -invariant bilinear form given by the coefficientwise product in the tabloid basis, so is an isomorphism of -modules ; equivalently is self-dual. Consequently for every , that is, every irreducible character of is real-valued.
Facts & Assumptions
Given: An integer , a partition , the tabloid module with its tabloid basis, and the complex Specht module .
The tabloid module has the finite tabloid basis, and is the complex span of the polytabloids , where acts through the permutation action on tabloids (Column antisymmetrizers, polytabloids, and Specht modules, Young subgroups, tabloids, and permutation modules).
The tabloid-basis Hermitian form is positive definite, the tabloid basis is orthonormal for it, and it is -invariant (Invariant Hermitian product on a tabloid module).
The dual representation acts by , and for a finite-dimensional complex representation (The dual or contragredient complex representation, Characters add on direct sums, multiply on tensor products, and conjugate on duals).
For a finite-dimensional complex representation of a finite group, (For a complex character, , is a class function, and with equality exactly at scalars).
Proof
Define for and in . The expression is a finite sum of products of two complex numbers, so is a symmetric bilinear form; writing for the coefficientwise conjugate, by [F2]. If permutes the tabloid basis, then the coefficient of in is , so after reindexing the finite basis. Hence is -invariant.
The Specht module is stable under coefficientwise conjugation: . Each polytabloid is a finite integer combination of tabloid basis vectors, since permutes the tabloid basis with signs , so by [F1]. For one has ; the conjugation map is an involution of the complex vector space , so applying it twice gives equality.
The form is nondegenerate on . Let with for all . By step 1.1 this says for all , so . Since by step 1.2, [F3] forces , hence . Conversely, if then and the same identity exhibits some with , because by [F3] and the orthogonal complement is defined by vanishing against every vector of the subspace (Orthogonality and the orthogonal complement).
The map , , is -linear and -equivariant for the dual action of [F4]: for , by -invariance of from step 1.1. By nondegeneracy from step 2.1 and finite-dimensionality of , is injective; since , it is an isomorphism. Thus as -modules.
By step 3.1 the character of equals the character of its dual, so for every the dual-character formula [F4] gives ; hence is real. Combining with [F5] gives for every . Every irreducible complex character of is a Specht character by Specht modules classify the complex irreducibles of , so all of them are real-valued.
No form of the Axiom of Choice is used: the tabloid form, coefficientwise conjugation and the character comparison are finite-dimensional over .
The Kronecker coefficient is a three-character inner product
Statement
For all partitions , where is the pointwise product of class functions and the sum uses the real-valuedness of the irreducible characters, so that no conjugation appears on the third factor.
Facts & Assumptions
Given: An integer and partitions ; the Specht characters and the -module .
is the multiplicity of in the completely reducible module (Kronecker coefficients and the internal tensor product).
For finite-dimensional complex representations of a finite group, for every (Characters add on direct sums, multiply on tensor products, and conjugate on duals).
If is a finite-dimensional complex representation of a finite group with irreducible decomposition and characters , then (The multiplicity of an irreducible summand is a character inner product).
The standard inner product of class functions on is (The standard inner product on ).
Every Specht character is real-valued: for every (Complex Specht modules are self-dual with real-valued characters).
Proof
For every the tensor-product character is by [F2], so the character of is the pointwise product .
By [F1] the module is completely reducible with irreducible decomposition ; applying [F3] to this decomposition and using step 1.1 gives .
By definition [F4] the inner product is ; by real-valuedness [F5] the factor equals , so the average of the plain triple product is displayed. Combining with step 2.1 gives .
No form of the Axiom of Choice is used: this is finite-dimensional complex character theory of a finite group.
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 .
The internal (Kronecker) product on symmetric functions
Definition
Let be the Frobenius characteristic restricted to the graded ordinary representation ring of the symmetric groups (The Frobenius characteristic map, The graded ordinary representation ring of the symmetric groups). By The Frobenius characteristic is an isometric graded ring isomorphism it is a degree-preserving -module isomorphism onto the stable symmetric function ring , so its restriction is an isomorphism for every .
For and define where is the pointwise (internal tensor) product of class functions on ; extend bilinearly to all of . Call the internal (Kronecker) product of symmetric functions.
Well-definedness. For the class functions and lie in , the integral span of the irreducible characters of (The graded ordinary representation ring of the symmetric groups). The pointwise product of two honest characters of is again an honest character, namely the character of the tensor product of the underlying representations (Characters add on direct sums, multiply on tensor products, and conjugate on duals), and products of -combinations of characters are computed bilinearly; hence the pointwise product of two elements of lies in , and applying the isomorphism lands in . The product is therefore well defined and takes to .
Basic properties. The product is bilinear by construction and inherits commutativity and associativity from the pointwise product of class functions. It preserves degrees, in the sense that for and is for . On the unit is for , and in degree zero it is , because the trivial character is the unit for pointwise multiplication on (The characteristic of a Specht character is a Schur function identifies ). The graded direct sum has no global unit for : if had finite degree support and were a degree with while , then , so ; a global unit would require to be a unit of for every . In particular the ordinary product unit is not a unit for on the positive degrees.
Schur expansion. For partitions , the definition and the Specht character dictionary (The characteristic of a Specht character is a Schur function) give because is the character of and its decomposition has multiplicities (Kronecker coefficients and the internal tensor product).
No form of the Axiom of Choice is used: the transport goes through the choice-free Frobenius characteristic isomorphism and finite-dimensional representation theory of finite groups.
Power sums diagonalize the internal product
Statement
For partitions one has where is the number of parts of equal to . Consequently for all . The internal product on is therefore diagonal in the power-sum basis after extension to , with the diagonal scalars, and it has the integer structure constants in the Schur basis.
Facts & Assumptions
Given: An integer , partitions , and the class function equal to on the conjugacy class of cycle type and to elsewhere.
Cycle type determines the conjugacy class, so is a well-defined class function and for the pointwise product (The Frobenius characteristic map, Class functions and the complex vector space ).
For , ; in particular , and is a positive integer (The Frobenius characteristic map).
The internal product is defined by for of the same degree, it is bilinear, and for partitions one has (The internal (Kronecker) product on symmetric functions).
Each Kronecker coefficient is a nonnegative integer (Kronecker coefficients and the internal tensor product).
The Specht characters form an orthonormal basis of , are real-valued, and the standard inner product is after grouping by cycle type (The irreducible complex characters form an orthonormal basis of , The standard inner product on , The Frobenius characteristic is an isometry, Complex Specht modules are self-dual with real-valued characters). All values are integers (The characteristic of a Specht character is a Schur function).
Proof
Put . By [F6], , and expansion in the orthonormal character basis gives . Thus its characteristic from [F2] is an admissible integral input for [F3].
The indicators have pointwise product by [F1]. Hence .
Apply [F3] to the integral virtual characters from step 1.1. Linearity of the characteristic and step 2.1 give . This is an identity in , without applying to a rational input.
Extend the integral bilinear product uniquely to by for and positive integers . Bilinearity and clearing denominators prove independence of these presentations. The rational power-sum basis supplied by [F2] then makes step 3.1 the asserted diagonalization.
The Schur-basis form is the defining expansion quoted in [F3], which is consistent with the definition through and from [F4]; the structure constants are nonnegative integers by [F5]. This proves the stated Schur expansion.
No form of the Axiom of Choice is used.
First-row padding of a partition
Definition
Let be a partition with (Partitions, English diagrams, and conjugation), and let be an integer. Read and when . Whenever
define the first-row padding of to size to be
The threshold is exact.
Above the threshold. Suppose . Then , so every entry of the displayed sequence is a nonnegative integer, the entries sum to , and the sequence is weakly decreasing because and is weakly decreasing (Partitions, English diagrams, and conjugation). If is nonempty then , hence and the displayed sequence is a partition of with positive parts. If then the displayed sequence is ; this is a partition of for every , while for one takes , the unique partition of . Thus the padding is defined and is a partition of on the whole displayed range.
Below the threshold. If is nonempty and , then ; if also the leading entry is nonnegative but smaller than the second entry , and if it is negative. In both cases the displayed sequence is not a partition, so is left undefined. The threshold is therefore the exact size at which the padded family begins: for nonempty , at the padding equals , which is a partition with a repeated first part when is nonempty.
Neutrality of the notation. This definition records a family of partitions; it asserts no constancy of any quantity along the family and no stability property. The same notation is used by the FI-module and representation-stability developments; no FI-module structure or generation degree is asserted here.
Padded Kronecker coefficient sequences
Definition
Let be partitions (Partitions, English diagrams, and conjugation) and put where the first part of the empty partition is read as . For every integer the three first-row paddings , , are partitions of , by First-row padding of a partition and the choice of as the maximum of the three thresholds. On that range define the size-indexed padded Kronecker coefficients by the Kronecker coefficient of three partitions of (Kronecker coefficients and the internal tensor product).
Domain. The threshold is exactly where the common domain of the three padded families starts: for all three padded sequences are partitions of , while for at least one of the three padded sequences is not a partition of and the expression is left undefined. The padded Kronecker coefficient sequence, indexed from on , is Every term is defined since . The notation retains as the common size of the padded partitions: it is defined only for , and no values at smaller sizes are introduced by reindexing.
No constancy is asserted. This definition introduces notation only. It asserts neither that is eventually constant, nor any bound on it, nor any comparison between different values of ; Murnaghan stability is a theorem about this sequence proved elsewhere, and this definition is available as its noncircular input.
Littlewood's identity - the internal product against an outer product
Statement
Let , and . Then, in , where is the Littlewood–Richardson coefficient. Both sides have degree and the sum is finite.
Facts & Assumptions
Given: Integers , partitions , , , and the ordered two-block subgroup .
Outer Littlewood–Richardson rule: for , , the induced module decomposes as ; equivalently (The outer Littlewood–Richardson rule, Littlewood--Richardson tableaux and coefficients).
The external product is , and the outer product of characters is , -bilinear (The outer induction product of symmetric-group characters, The induced character of a complex character).
Frobenius reciprocity: for a finite group , a subgroup and complex characters, (Frobenius reciprocity for complex characters).
Frobenius' formula: (Frobenius' formula for the character of an induced representation).
As range over partitions of and , the external products are pairwise distinct and form an orthonormal -basis of ; every honest character of is a nonnegative integral combination of them (The character ring of a direct product is the tensor product of the factor character rings). Hence the multiplicity of in an honest character of is , and for an honest character of the multiplicity of in it is its inner product with (The multiplicity of an irreducible summand is a character inner product).
For of the same degree , , and for every (The internal (Kronecker) product on symmetric functions, The characteristic of a Specht character is a Schur function).
is injective on (The Frobenius characteristic is an isometry, The Frobenius characteristic map).
Proof
For fixed , write and , so that by [F2]. By [F1] the multiplicity of in is . By [F5] the multiplicity of in is , which by Frobenius reciprocity [F3] equals ; by [F5] again this is the multiplicity of in , namely . Since the form a nonnegative integral basis of the honest characters of by [F5] and is an honest character, the expansion follows.
Put . Multiplying step 1.1 pointwise on by and using the value formula [F2] for both factors gives , so the product of the two external products is the external product ; hence .
Projection formula: for every , . Indeed, by [F4] the left side is ; the character is constant on conjugacy classes, so for every term, and the sum factors as by [F4] again. Applying the -linear induction operator of [F2] to step 2.1 and using this identity for the left factor gives, as class functions on , , since and by [F2].
Translate step 3.1 through . By [F7] and [F6], , so ; by the definition [F6] of the internal product, . Likewise and by [F6], and [F7] gives . Step 3.1 therefore says that of the two sides of the claimed identity are equal; since is injective [F8], the claimed identity holds in .
No form of the Axiom of Choice is used: induction, Frobenius reciprocity and the outer Littlewood–Richardson rule are finite-group constructions.
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.
Row-gap reduction and conditional k-stability of Kronecker coefficients
Statement
Fix and an integer . Write for parts equal to and for the one-part partition of size , and read missing parts as zero. Put , with if .
(i) Suppose and Then for every integer , All shifted arguments are partitions of . For , this is the first-row padding of the three tails to size (First-row padding of a partition).
(ii) For arbitrary and , the sequence is eventually constant. More precisely, it is constant for every integer , where The proof of the row-gap identity does not require first-part ordering, so the threshold also covers when . No monotonicity is asserted.
Facts & Assumptions
Given: The partitions, and in the Statement, the shifted partitions , and of size ; a fixed common length bound for these partitions.
Steps 1.1 and 2.1 of The Kronecker reduction lemma of Pak and Panova establish, for and , , where . They express as a finite signed combination of these coefficients whose weights depend only on the tail . Every nonzero term has , with and .
The coefficient counts semistandard skew tableaux of shape and content with lattice reading word, and vanishes outside containment and size compatibility (Littlewood--Richardson tableaux and coefficients, The Littlewood–Richardson rule for products of Schur functions).
Intersection and union are rowwise minimum and maximum. Thus , with , and (Partitions, English diagrams, and conjugation).
Proof
Assume the row-gap inequality ; first-part ordering will not be used. The shifted parameter is , and the shifted tail is unchanged. Fix . The map is a bijection from partitions of size to partitions of size . In the forward direction the shift preserves the partition order. Conversely a partition in the second set has total deficit , so . Consequently subtracting in its first rows produces a partition of size , with nonnegative th part since . All other boundary and row inequalities are preserved. If , both sets are empty.
Shift each cell in the first rows of horizontally by , leaving lower rows fixed. The image is . There are no shared skew columns across the cut in either shape: originally , and after shifting . Partition inequalities give the same separation for all rows on either side. Within each side, every horizontal shift is the same, so shared columns and their strict inequalities are preserved. Row order, content and the right-to-left, top-to-bottom reading word are unchanged. This is a bijection of LR tableaux, so for every , and the same proof gives for every .
Use the bijection of step 1.1 and the LR equalities of step 2.1 in the finite coefficient sum [F2]. The small partitions and their Kronecker coefficient are unchanged, so for every . The first-row expansions [F2] for and use the same cofactors because they have the same tail. Their signed sums are therefore equal, giving for every . This proves part (i) and also proves that the equality holds under the row-gap inequality without the first-part ordering.
For an arbitrary triple, and . Thus the row-gap inequality with parameter holds at and for every larger . Apply the ordering-free identity established in step 3.1 to the triple at with further shift . It gives for every , proving part (ii) with the stated threshold for all .
Remarks
The proof uses the locally proved Littlewood–Richardson coefficient identity and Jacobi–Trudi expansion from The Kronecker reduction lemma of Pak and Panova. Its corrected bounded-reduction map retains gaps, so equality of compacted images is not assumed for the sharper -gap theorem.
The row-gap condition cannot be omitted: Row padding need not preserve a Kronecker coefficient before stability ↗ gives , and , for which but for every .
No general positive combinatorial rule for Kronecker coefficients is known
Statement
The results of this page are exact but do not amount to a general positive combinatorial rule. The definition (Kronecker coefficients and the internal tensor product) computes as the multiplicity of a tensor-product decomposition; the three-character formula (The Kronecker coefficient is a three-character inner product) expresses it as a closed average over ; the internal product (The internal (Kronecker) product on symmetric functions) and the reduction and row-gap results (The Kronecker reduction lemma of Pak and Panova, Row-gap reduction and conditional k-stability of Kronecker coefficients) reduce and stabilize the coefficient. None of these is a combinatorial interpretation of the numbers , and no general such rule is known: as recorded by the sources cited below, obtaining a combinatorial interpretation of, or a meaningful positive formula for, all Kronecker coefficients is a well-known open problem in algebraic combinatorics, and the general computation with binary-encoded partition parts is #P-hard. Panova (2025), Abstract and Introduction (pp. 1–2), also records the general combinatorial-interpretation problem as open.
Claim boundary of this page. This page claims no positive combinatorial rule for the Kronecker coefficients, no polynomial-time algorithm for computing them, and no general criterion deciding their positivity. It also does not claim that such a rule is impossible; the sources record a hard open problem, not a proved nonexistence theorem.
Status of the statement. This is a record of the judgment of the cited literature, not a theorem proved on this page; it has no proof section and no items below depend on it as a mathematical supplier.
Remarks
(a) What the page does supply, and what it does not. The character formula computes as an exact finite average, but over all elements of , which is not a method of combinatorial enumeration; the internal product turns the problem into multiplication in the ring of symmetric functions; the reduction lemma either returns or transports the coefficient to partitions of strictly bounded size; and -stability of row padding says that the padded sequence is eventually constant, without exhibiting the limit as a count of objects. These are structural and computational statements about , and they are consistent with the continued absence of a general positive rule.
(b) The one classical positive case. By Murnaghan and Littlewood, the Littlewood-Richardson coefficients are the Kronecker coefficients of a special stable family, and they do have the Littlewood-Richardson rule; this is the known case in which a positive combinatorial interpretation exists, and it does not extend to the general coefficient. Beyond it, positive rules are known only for restricted families of triples, and the sources record that outside such special cases there is no combinatorial interpretation.
(c) Complexity context. The source notes that computing is #P-hard in general. Counting hardness alone does not imply hardness of deciding positivity. The source also explains that a positive combinatorial interpretation analogous to the Littlewood-Richardson rule "would likely show that the decision problem is in NP and the counting problem in #P". The character formula of this page does not contradict this: its displayed sum has terms, so it gives no polynomial-time bound in the partition input size.
(d) Individual computations are not a rule. The worked examples of the companion examples page evaluate individual coefficients, and the counterexamples there detect a stability boundary; an individual evaluation or a stability statement is not a general rule, and none of the examples on this pair is presented as one.
No form of the Axiom of Choice is used: this remark records the status of a problem and cites no choice-dependent construction.
5 · Examples, counterexamples and false statements
None yet.
Sources
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford University Press 1995
- Igor Pak and Greta Panova, Bounds on the Kronecker coefficients, arXiv:1406.2988v2 (2014)
- Charlotte Chan, Representation Theory of Symmetric Groups (complete lecture notes)
- Peter Webb, A Course in Finite Group Representation Theory (complete author-hosted textbook, 294 pp.)
- Igor Pak and Greta Panova, On the complexity of computing Kronecker coefficients, arXiv:1404.0653v3 (2015)
- Thomas Church, Jordan S. Ellenberg and Benson Farb, FI-modules and stability for representations of symmetric groups, arXiv:1204.4533v4 (2014), published in Duke Math. J. 164 (2015)
- Emmanuel Briand, Rosa Orellana and Mercedes Rosas, The stability of the Kronecker product of Schur functions, arXiv:0907.4652v2 (2009)
- Thomas Church, Jordan S. Ellenberg and Benson Farb, FI-modules and stability for representations of symmetric groups, arXiv:1204.4533v4 (2014)
- Igor Pak and Greta Panova, On the complexity of computing Kronecker coefficients, arXiv:1404.0653v3 (2015); published in Computational Complexity 26 (2017) 1-36
- Greta Panova, Polynomial time classical versus quantum algorithms for representation theoretic multiplicities, arXiv:2502.20253v2 (2025)