Alphabeta Math
Pipeline-generated
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

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 g(λ,μ,ν) is the multiplicity of Sν in the internal tensor product Sλ⊗CSμ, a diagonal Sn-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 g(λ,μ,ν)=1n!∑σχλ(σ)χμ(σ)χν(σ) (The Kronecker coefficient is a three-character inner product). The multiplicity definition makes the coefficients nonnegative integers; the character formula makes them fully S3-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 hn (The internal (Kronecker) product on symmetric functions). In the power-sum basis this product is diagonal, pρ∗pσ=δρ,σzρpρ, and in the Schur basis it has the structure constants g(λ,μ,ν) (Power sums diagonalize the internal product). The stability route begins with first-row padding α[n]=(n−∣α∣,α1,α2,… ), defined exactly from the threshold n≥∣α∣+α1, 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 s=n−ν1 forces g(λ,μ,ν)=0, or the coefficient equals that of an explicitly reduced triple, with the size bound r≤2sℓ2 (The Kronecker reduction lemma of Pak and Panova). Its corrected row shear retains a 2s 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 min⁡{λk,μk}≥max⁡{λk+1,μk+1}+(n−ν1) one has g(λ+(tk),μ+(tk),ν+(tk))=g(λ,μ,ν) for all t≥0, 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 t 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Kronecker coefficients and the internal tensor product

Definition

Fix an integer n≥0 and work over C. Let λ,μ⊢n be partitions of n (Partitions, English diagrams, and conjugation), and let Sλ⊗CSμ be the tensor product of their complex Specht modules, a finite-dimensional complex Sn-module (The tensor product of two complex representations, Column antisymmetrizers, polytabloids, and Specht modules). The Kronecker coefficient g(λ,μ,ν) of a third partition ν⊢n is the multiplicity of Sν in this tensor product:

g(λ,μ,ν):=dim⁡C(Sλ⊗CSμ)(Sν)dim⁡CSν,

where (Sλ⊗CSμ)(Sν) is the isotypic component of type Sν (The isotypic component of a completely reducible representation).

Well-definedness. The module Sλ⊗CSμ is finite-dimensional, and char⁡C=0 does not divide the order of the finite group Sn, so complex Maschke's theorem gives complete reducibility (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣, If char⁡k∤∣G∣, every finite-dimensional representation of G is completely reducible, A completely reducible representation as a finite direct sum of irreducible subrepresentations). The complex Specht modules Sν, ν⊢n, are a complete list of pairwise inequivalent irreducible Sn-modules (Complex Specht modules are irreducible, Specht modules classify the complex irreducibles of Sn, Distinct complex Specht modules are inequivalent). Consequently a decomposition into irreducibles has the form Sλ⊗CSμ≅⨁ν⊢nmνSν with nonnegative integer multiplicities mν, and the isotypic component of type Sν is the direct sum of exactly the mν copies of Sν 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 dim⁡C(Sλ⊗CSμ)(Sν)=mνdim⁡CSν and dim⁡CSν>0 because Sν is irreducible. Hence g(λ,μ,ν)=mν is a nonnegative integer, independent of the chosen decomposition, and g(λ,μ,ν) is by definition the multiplicity of Sν in Sλ⊗CSμ.

The internal product. For partitions λ,μ⊢n call (λ,μ)⟼Sλ⊗CSμ the internal (Kronecker) product of the Sn-representations Sλ and Sμ. Unlike the outer induction product Ind⁡Sa×SbSa+b(Sα⊠Sβ) of The outer Littlewood–Richardson rule, which takes a pair of modules of degrees a and b to a module of degree a+b, the internal product keeps the rank: both inputs and the output are Sn-modules of the same degree n. 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Complex Specht modules are self-dual with real-valued characters

Statement

For every n≥0 and λ⊢n the complex Specht module Sλ carries a nondegenerate symmetric Sn-invariant bilinear form b(x,y)=∑TxTyT given by the coefficientwise product in the tabloid basis, so v↦b(v,−) is an isomorphism of CSn-modules Sλ→(Sλ)∗; equivalently Sλ is self-dual. Consequently χλ(g−1)=χλ(g) for every g∈Sn, that is, every irreducible character of Sn is real-valued.

Facts & Assumptions

Given: An integer n≥0, a partition λ⊢n, the tabloid module Mλ with its tabloid basis, and the complex Specht module Sλ⊆Mλ.

[F1]

The tabloid module Mλ has the finite tabloid basis, and Sλ is the complex span of the polytabloids es=κs⋅{s}, where κs=∑γ∈Cssgn⁡(γ)γ acts through the permutation action on tabloids (Column antisymmetrizers, polytabloids, and Specht modules, Young subgroups, tabloids, and permutation modules).

[F2]

The tabloid-basis Hermitian form ⟨x,y⟩=∑TxT‾yT is positive definite, the tabloid basis is orthonormal for it, and it is Sn-invariant (Invariant Hermitian product on a tabloid module).

[F4]

The dual representation acts by (g⋅f)(v)=f(g−1⋅v), and χV∗(g)=χV(g)‾ for a finite-dimensional complex representation V (The dual or contragredient complex representation, Characters add on direct sums, multiply on tensor products, and conjugate on duals).

[F5]

For a finite-dimensional complex representation of a finite group, χ(g−1)=χ(g)‾ (For a complex character, χ(1)=dim⁡V, χ is a class function, and ∣χ(g)∣≤χ(1) with equality exactly at scalars).

Proof

technique · direct
1.1F1F2algebra

Define b(x,y)=∑TxTyT for x=∑TxTT and y=∑TyTT in Mλ. The expression is a finite sum of products of two complex numbers, so b is a symmetric bilinear form; writing x‾=∑TxT‾T for the coefficientwise conjugate, b(x,y)=∑TxTyT=∑TxT‾‾yT=⟨x‾,y⟩ by [F2]. If σ∈Sn permutes the tabloid basis, then the coefficient of T in σx is xσ−1T, so b(σx,σy)=∑Txσ−1Tyσ−1T=∑TxTyT=b(x,y) after reindexing the finite basis. Hence b is Sn-invariant.

1.2F1algebra

The Specht module is stable under coefficientwise conjugation: Sλ‾=Sλ. Each polytabloid is a finite integer combination of tabloid basis vectors, since κs permutes the tabloid basis with signs ±1, so es‾=es by [F1]. For x=∑scses∈Sλ one has x‾=∑scs‾es∈Sλ; the conjugation map is an involution of the complex vector space Mλ, so applying it twice gives equality.

2.1F2F3step 1.1step 1.2

The form b is nondegenerate on Sλ. Let x∈Sλ with b(x,y)=0 for all y∈Sλ. By step 1.1 this says ⟨x‾,y⟩=0 for all y∈Sλ, so x‾∈(Sλ)⊥. Since x‾∈Sλ by step 1.2, [F3] forces x‾=0, hence x=0. Conversely, if x≠0 then x‾≠0 and the same identity exhibits some y∈Sλ with b(x,y)≠0, because x‾∉(Sλ)⊥ by [F3] and the orthogonal complement is defined by vanishing against every vector of the subspace (Orthogonality and the orthogonal complement).

3.1F4step 1.1step 2.1algebra

The map Φ:Sλ→(Sλ)∗, Φ(v)=b(v,−), is C-linear and Sn-equivariant for the dual action of [F4]: for w∈Sλ, Φ(σv)(w)=b(σv,w)=b(v,σ−1w)=Φ(v)(σ−1w)=(σ⋅Φ(v))(w) by Sn-invariance of b from step 1.1. By nondegeneracy from step 2.1 and finite-dimensionality of Sλ, Φ is injective; since dim⁡C(Sλ)∗=dim⁡CSλ, it is an isomorphism. Thus Sλ≅(Sλ)∗ as CSn-modules.

4.1F4F5step 3.1algebra∎

By step 3.1 the character of Sλ equals the character of its dual, so for every g∈Sn the dual-character formula [F4] gives χλ(g)=χ(Sλ)∗(g)=χλ(g)‾; hence χλ(g) is real. Combining with [F5] gives χλ(g−1)=χλ(g)‾=χλ(g) for every g∈Sn. Every irreducible complex character of Sn is a Specht character χλ by Specht modules classify the complex irreducibles of Sn, 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 C.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Kronecker coefficient is a three-character inner product

Statement

For all partitions λ,μ,ν⊢n, g(λ,μ,ν)=⟨χλχμ,χν⟩=1n!∑σ∈Snχλ(σ)χμ(σ)χν(σ), 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 n≥0 and partitions λ,μ,ν⊢n; the Specht characters χλ,χμ,χν and the Sn-module Sλ⊗CSμ.

[F1]

g(λ,μ,ν) is the multiplicity of Sν in the completely reducible module Sλ⊗CSμ (Kronecker coefficients and the internal tensor product).

[F2]

For finite-dimensional complex representations V,W of a finite group, χV⊗W(g)=χV(g)χW(g) for every g (Characters add on direct sums, multiply on tensor products, and conjugate on duals).

[F3]

If V is a finite-dimensional complex representation of a finite group G with irreducible decomposition V≅⨁jmjVj and characters χj, then mj=⟨χV,χj⟩G (The multiplicity of an irreducible summand is a character inner product).

[F4]

The standard inner product of class functions on Sn is ⟨φ,ψ⟩=1n!∑σ∈Snφ(σ)ψ(σ)‾ (The standard inner product on cf(G)).

[F5]

Every Specht character is real-valued: χν(σ)=χν(σ)‾ for every σ∈Sn (Complex Specht modules are self-dual with real-valued characters).

Proof

technique · direct
1.1F2given

For every σ∈Sn the tensor-product character is χSλ⊗CSμ(σ)=χλ(σ)χμ(σ) by [F2], so the character of Sλ⊗CSμ is the pointwise product χλχμ.

2.1F1F3step 1.1

By [F1] the module Sλ⊗CSμ is completely reducible with irreducible decomposition ⨁ν⊢ng(λ,μ,ν)Sν; applying [F3] to this decomposition and using step 1.1 gives g(λ,μ,ν)=⟨χλχμ,χν⟩.

3.1F4F5step 2.1algebra∎

By definition [F4] the inner product is ⟨χλχμ,χν⟩=1n!∑σ∈Snχλ(σ)χμ(σ)χν(σ)‾; by real-valuedness [F5] the factor χν(σ)‾ equals χν(σ), so the average of the plain triple product is displayed. Combining with step 2.1 gives g(λ,μ,ν)=1n!∑σ∈Snχλ(σ)χμ(σ)χν(σ).

No form of the Axiom of Choice is used: this is finite-dimensional complex character theory of a finite group.

CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries

Statement

For all partitions λ,μ,ν⊢n:

(a) g(λ,μ,ν) is a nonnegative integer;

(b) g is invariant under every permutation of the three arguments, that is g(λ,μ,ν)=g(μ,λ,ν)=g(λ,ν,μ)=⋯ for all six orderings;

(c) conjugating exactly two of the three partitions preserves the coefficient: g(λ,μ,ν)=g(λ′,μ′,ν)=g(λ′,μ,ν′)=g(λ,μ′,ν′), where λ′ denotes the conjugate partition.

No positive combinatorial rule for the coefficients is asserted.

Facts & Assumptions

Given: An integer n≥0 and partitions λ,μ,ν⊢n with conjugates λ′,μ′,ν′.

[F1]

g(λ,μ,ν) is the multiplicity of Sν in the completely reducible module Sλ⊗CSμ, hence a nonnegative integer (Kronecker coefficients and the internal tensor product).

[F2]

g(λ,μ,ν)=1n!∑σ∈Snχλ(σ)χμ(σ)χν(σ) (The Kronecker coefficient is a three-character inner product).

[F3]

For every ρ⊢n and σ∈Sn, χρ′(σ)=sgn⁡(σ)χρ(σ), and sgn⁡(σ)2=1 (Sign twist corresponds to the omega involution).

Proof

technique · direct
1.1F1given

Claim (a): by [F1], g(λ,μ,ν) is the multiplicity of an irreducible summand in a completely reducible finite-dimensional module, so it is a nonnegative integer.

1.2F2givenalgebra

Claim (b): by [F2], g(λ,μ,ν) is the average over σ∈Sn 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.

2.1F2F3algebra∎

Claim (c): by [F3], χλ′(σ)=sgn⁡(σ)χλ(σ), χμ′(σ)=sgn⁡(σ)χμ(σ) and χν′(σ)=sgn⁡(σ)χν(σ) for every σ∈Sn. Substituting the first two of these into the formula [F2] for g(λ′,μ′,ν) gives 1n!∑σsgn⁡(σ)2χλ(σ)χμ(σ)χν(σ)=1n!∑σχλ(σ)χμ(σ)χν(σ)=g(λ,μ,ν), since sgn⁡(σ)2=1 for every σ. The same computation with exactly two of the three substitutions gives g(λ′,μ,ν′)=g(λ,μ′,ν′)=g(λ,μ,ν).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The internal (Kronecker) product on symmetric functions

Definition

Let ch⁡:RS→Λ 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 Z-module isomorphism onto the stable symmetric function ring Λ=⨁m≥0Λm, so its restriction ch⁡:R(Sm)→Λm is an isomorphism for every m≥0.

For f∈Λm and g∈Λn define f∗g:={ch⁡(ch⁡−1(f)⋅ch⁡−1(g)),m=n,0,m≠n, where ⋅ is the pointwise (internal tensor) product of class functions on Sm; extend ∗ bilinearly to all of Λ. Call ∗ the internal (Kronecker) product of symmetric functions.

Well-definedness. For m=n the class functions ch⁡−1(f) and ch⁡−1(g) lie in R(Sm), the integral span of the irreducible characters of Sm (The graded ordinary representation ring of the symmetric groups). The pointwise product of two honest characters of Sm 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 Z-combinations of characters are computed bilinearly; hence the pointwise product of two elements of R(Sm) lies in R(Sm), and applying the isomorphism ch⁡ lands in Λm. The product is therefore well defined and takes Λm×Λm to Λm.

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 Λm∗Λn⊆Λm for m=n and is 0 for m≠n. On Λn the unit is hn=s(n)=ch⁡(trivial character of Sn) for n>0, and in degree zero it is h0=s∅=1, because the trivial character is the unit for pointwise multiplication on R(Sn) (The characteristic of a Specht character is a Schur function identifies ch⁡(χ(n))=s(n)=hn). The graded direct sum Λ has no global unit for ∗: if e∈Λ had finite degree support and n were a degree with en=0 while Λn≠0, then (e∗hn)n=en∗hn=0≠hn, so e∗hn≠hn; a global unit would require en to be a unit of (Λn,∗) for every n. In particular the ordinary product unit 1∈Λ0 is not a unit for ∗ on the positive degrees.

Schur expansion. For partitions λ,μ⊢n, the definition and the Specht character dictionary ch⁡(χλ)=sλ (The characteristic of a Specht character is a Schur function) give sλ∗sμ=ch⁡(χλ⋅χμ)=ch⁡(∑ν⊢ng(λ,μ,ν)χν)=∑ν⊢ng(λ,μ,ν) sν, because χλχμ is the character of Sλ⊗CSμ and its decomposition has multiplicities g(λ,μ,ν) (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.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Power sums diagonalize the internal product

Statement

For partitions ρ,σ⊢n one has pρ∗pσ=δρ,σ zρ pρ,zρ=∏i≥1imi(ρ)mi(ρ)!, where mi(ρ) is the number of parts of ρ equal to i. Consequently sλ∗sμ=∑ν⊢ng(λ,μ,ν) sν for all λ,μ⊢n. The internal product on Λn is therefore diagonal in the power-sum basis after extension to ΛQn, with zρ the diagonal scalars, and it has the integer structure constants g(λ,μ,ν) in the Schur basis.

Facts & Assumptions

Given: An integer n≥0, partitions ρ,σ,λ,μ⊢n, and the class function 1ρ∈cf(Sn) equal to 1 on the conjugacy class of cycle type ρ and to 0 elsewhere.

[F1]

Cycle type determines the conjugacy class, so 1ρ is a well-defined class function and 1ρ⋅1σ=δρ,σ1ρ for the pointwise product (The Frobenius characteristic map, Class functions and the complex vector space cf(G)).

[F2]

For f∈cf(Sn), ch⁡(f)=∑τ⊢nf(τ) pτ/zτ; in particular ch⁡(1ρ)=pρ/zρ, and zρ=∏iimi(ρ)mi(ρ)! is a positive integer (The Frobenius characteristic map).

[F3]

The internal product is defined by f∗g=ch⁡(ch⁡−1(f)⋅ch⁡−1(g)) for f,g of the same degree, it is bilinear, and for partitions λ,μ⊢n one has sλ∗sμ=∑ν⊢ng(λ,μ,ν)sν (The internal (Kronecker) product on symmetric functions).

[F4]

ch⁡(χλ)=sλ for every λ⊢n (The characteristic of a Specht character is a Schur function).

[F5]

Each Kronecker coefficient g(λ,μ,ν) is a nonnegative integer (Kronecker coefficients and the internal tensor product).

[F6]

The Specht characters form an orthonormal basis of cf(Sn), are real-valued, and the standard inner product is ⟨f,g⟩=∑τ⊢nf(τ)g(τ)‾/zτ after grouping by cycle type (The irreducible complex characters form an orthonormal basis of cf(G), The standard inner product on cf(G), 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

technique · direct
1.1F2F6algebra

Put uρ:=zρ1ρ. By [F6], ⟨uρ,χλ⟩=χλ(ρ)∈Z, and expansion in the orthonormal character basis gives uρ=∑λ⊢nχλ(ρ)χλ∈R(Sn). Thus its characteristic ch⁡(uρ)=pρ from [F2] is an admissible integral input for [F3].

2.1F1step 1.1algebra

The indicators have pointwise product 1ρ1σ=δρ,σ1ρ by [F1]. Hence uρuσ=δρ,σzρuρ.

3.1F2F3step 1.1step 2.1algebra

Apply [F3] to the integral virtual characters from step 1.1. Linearity of the characteristic and step 2.1 give pρ∗pσ=ch⁡(uρuσ)=δρ,σzρpρ. This is an identity in Λn, without applying ∗ to a rational input.

4.1F2F3step 3.1algebra

Extend the integral bilinear product uniquely to ΛQn by (f/a)∗(g/b):=(f∗g)/(ab) for f,g∈Λn and positive integers a,b. 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.

5.1F3F4F5step 4.1∎

The Schur-basis form is the defining expansion sλ∗sμ=∑νg(λ,μ,ν)sν quoted in [F3], which is consistent with the definition through ch⁡(χλ)=sλ and ch⁡(χμ)=sμ from [F4]; the structure constants g(λ,μ,ν) are nonnegative integers by [F5]. This proves the stated Schur expansion.

No form of the Axiom of Choice is used.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

First-row padding of a partition

Definition

Let α=(α1,…,αk) be a partition with ∣α∣=α1+⋯+αk (Partitions, English diagrams, and conjugation), and let n≥0 be an integer. Read ∣∅∣=0 and α1=0 when α=∅. Whenever

n  ≥  ∣α∣+α1,

define the first-row padding of α to size n to be α[n]:=(n−∣α∣, α1, α2, …, αk).

The threshold is exact.

Above the threshold. Suppose n≥∣α∣+α1. Then n−∣α∣≥α1≥0, so every entry of the displayed sequence is a nonnegative integer, the entries sum to (n−∣α∣)+∣α∣=n, and the sequence is weakly decreasing because n−∣α∣≥α1 and α is weakly decreasing (Partitions, English diagrams, and conjugation). If α is nonempty then α1≥1, hence n−∣α∣≥1 and the displayed sequence is a partition of n with positive parts. If α=∅ then the displayed sequence is (n); this is a partition of n for every n≥1, while for n=0 one takes ∅[0]:=∅, the unique partition of 0. Thus the padding is defined and is a partition of n on the whole displayed range.

Below the threshold. If α is nonempty and n<∣α∣+α1, then n−∣α∣<α1; if also n≥∣α∣ the leading entry is nonnegative but smaller than the second entry α1, and if n<∣α∣ it is negative. In both cases the displayed sequence is not a partition, so α[n] is left undefined. The threshold ∣α∣+α1 is therefore the exact size at which the padded family begins: for nonempty α, at n=∣α∣+α1 the padding equals (α1,α1,α2,… ), 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.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Padded Kronecker coefficient sequences

Definition

Let α,β,γ be partitions (Partitions, English diagrams, and conjugation) and put n0:=max⁡{∣α∣+α1, ∣β∣+β1, ∣γ∣+γ1}, where the first part of the empty partition is read as 0. For every integer n≥n0 the three first-row paddings α[n], β[n], γ[n] are partitions of n, by First-row padding of a partition and the choice of n0 as the maximum of the three thresholds. On that range define the size-indexed padded Kronecker coefficients by gn(α,β,γ):=g(α[n], β[n], γ[n]), the Kronecker coefficient of three partitions of n (Kronecker coefficients and the internal tensor product).

Domain. The threshold n0 is exactly where the common domain of the three padded families starts: for n≥n0 all three padded sequences are partitions of n, while for n<n0 at least one of the three padded sequences is not a partition of n and the expression is left undefined. The padded Kronecker coefficient sequence, indexed from 0 on N, is k⟼gn0+k(α,β,γ)(k∈N). Every term is defined since n0+k≥n0. The notation gn retains n as the common size of the padded partitions: it is defined only for n≥n0, and no values at smaller sizes are introduced by reindexing.

No constancy is asserted. This definition introduces notation only. It asserts neither that gn(α,β,γ) is eventually constant, nor any bound on it, nor any comparison between different values of n; Murnaghan stability is a theorem about this sequence proved elsewhere, and this definition is available as its noncircular input.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Littlewood's identity - the internal product against an outer product

Statement

Let λ⊢n, τ⊢r and θ⊢n−r. Then, in Λn, sλ∗(sτsθ)=∑α⊢r, β⊢n−rcαβλ (sα∗sτ)(sβ∗sθ), where cαβλ is the Littlewood–Richardson coefficient. Both sides have degree n and the sum is finite.

Facts & Assumptions

Given: Integers n≥r≥0, partitions λ⊢n, τ⊢r, θ⊢n−r, and the ordered two-block subgroup H:=Sr×Sn−r≤Sn.

[F1]

Outer Littlewood–Richardson rule: for α⊢r, β⊢n−r, the induced module decomposes as Ind⁡HSn(Sα⊠Sβ)≅⨁λ⊢n(Sλ)⊕cαβλ; equivalently ch⁡(χα∘χβ)=sαsβ (The outer Littlewood–Richardson rule, Littlewood--Richardson tableaux and coefficients).

[F2]

The external product is (χ⊠ψ)(σ,τ)=χ(σ)ψ(τ), and the outer product of characters is f∘g=Ind⁡HSn(f⊠g), Z-bilinear (The outer induction product of symmetric-group characters, The induced character Ind⁡HGχ of a complex character).

[F3]

Frobenius reciprocity: for a finite group G, a subgroup H≤G and complex characters, ⟨Ind⁡HGχ,ψ⟩G=⟨χ,Res⁡HGψ⟩H (Frobenius reciprocity for complex characters).

[F4]

Frobenius' formula: Ind⁡HGχ(g)=1∣H∣∑x∈G: x−1gx∈Hχ(x−1gx) (Frobenius' formula for the character of an induced representation).

[F5]

As α,β range over partitions of r and n−r, the external products χα⊠χβ are pairwise distinct and form an orthonormal Z-basis of R(H); every honest character of H 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 H is ⟨φ,χα⊠χβ⟩H, and for an honest character of Sn the multiplicity of Sλ in it is its inner product with χλ (The multiplicity of an irreducible summand is a character inner product).

[F6]

For f,g of the same degree m, f∗g=ch⁡(ch⁡−1(f)⋅ch⁡−1(g)), and ch⁡(χρ)=sρ for every ρ⊢m (The internal (Kronecker) product on symmetric functions, The characteristic of a Specht character is a Schur function).

[F7]

ch⁡(f∘g)=ch⁡(f)ch⁡(g) for f∈R(Sm), g∈R(Sp) (The Frobenius characteristic preserves outer products).

Proof

technique · direct
1.1F1F2F3F5

For fixed α⊢r, β⊢n−r write φαβ:=χα⊠χβ and Vαβ:=Ind⁡HSn(Sα⊠Sβ), so that χVαβ=Ind⁡HSnφαβ by [F2]. By [F1] the multiplicity of Sλ in Vαβ is cαβλ. By [F5] the multiplicity of φαβ in Res⁡HSnχλ is ⟨Res⁡HSnχλ,φαβ⟩H, which by Frobenius reciprocity [F3] equals ⟨Ind⁡HSnφαβ,χλ⟩Sn; by [F5] again this is the multiplicity of Sλ in Vαβ, namely cαβλ. Since the φαβ form a nonnegative integral basis of the honest characters of H by [F5] and Res⁡HSnχλ is an honest character, the expansion Res⁡HSnχλ=∑α⊢r, β⊢n−rcαβλ φαβ follows.

2.1F2step 1.1algebra

Put ξ:=φτθ=χτ⊠χθ. Multiplying step 1.1 pointwise on H by ξ and using the value formula [F2] for both factors gives (χα⊠χβ)(σ,ρ)(χτ⊠χθ)(σ,ρ)=χα(σ)χβ(ρ)χτ(σ)χθ(ρ)=(χαχτ)(σ)(χβχθ)(ρ), so the product of the two external products is the external product (χαχτ)⊠(χβχθ); hence Res⁡HSn(χλ)⋅ξ=∑α,βcαβλ (χαχτ)⊠(χβχθ).

3.1F2F4step 2.1algebra

Projection formula: for every g∈Sn, Ind⁡HSn(Res⁡HSn(χλ)⋅ξ)(g)=χλ(g) Ind⁡HSnξ(g). Indeed, by [F4] the left side is 1∣H∣∑x∈Sn: x−1gx∈Hχλ(x−1gx)ξ(x−1gx); the character χλ is constant on conjugacy classes, so χλ(x−1gx)=χλ(g) for every term, and the sum factors as χλ(g)⋅1∣H∣∑x: x−1gx∈Hξ(x−1gx)=χλ(g) Ind⁡HSnξ(g) by [F4] again. Applying the C-linear induction operator of [F2] to step 2.1 and using this identity for the left factor gives, as class functions on Sn, χλ⋅(χτ∘χθ)=∑α,βcαβλ (χαχτ)∘(χβχθ), since Ind⁡HSnξ=χτ∘χθ and Ind⁡HSn((χαχτ)⊠(χβχθ))=(χαχτ)∘(χβχθ) by [F2].

4.1F6F7F8step 3.1∎

Translate step 3.1 through ch⁡. By [F7] and [F6], ch⁡(χτ∘χθ)=sτsθ, so ch⁡−1(sτsθ)=χτ∘χθ; by the definition [F6] of the internal product, ch⁡−1(sλ∗(sτsθ))=χλ⋅ch⁡−1(sτsθ)=χλ⋅(χτ∘χθ). Likewise ch⁡−1(sα∗sτ)=χαχτ and ch⁡−1(sβ∗sθ)=χβχθ by [F6], and [F7] gives ch⁡−1((sα∗sτ)(sβ∗sθ))=(χαχτ)∘(χβχθ). Step 3.1 therefore says that ch⁡−1 of the two sides of the claimed identity are equal; since ch⁡ is injective [F8], the claimed identity holds in Λn.

No form of the Axiom of Choice is used: induction, Frobenius reciprocity and the outer Littlewood–Richardson rule are finite-group constructions.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Kronecker reduction lemma of Pak and Panova

Statement

Let n≥0 and ℓ≥0, and let λ,μ,ν⊢n have lengths at most ℓ. Read missing parts as zero and put s:=n−ν1, with ν1=0 for the empty partition.

(i) If ∣λi−μi∣>s for some i≤ℓ, then g(λ,μ,ν)=0.

(ii) Otherwise put ρ:=λ∩μ, ω:=λ∪μ, ωℓ+1:=0, and define δi:=max⁡{0,ρi−ωi+1−2s},Dj:=∑i=jℓδi,φ(θ)j:=θj−Dj(1≤j≤ℓ). For every partition θ with at most ℓ parts satisfying ρj−s≤θj≤ωj for each j, the image φ(θ) is a partition after deletion of zero parts. In particular φ(λ) and φ(μ) have a common size r, and φ(ν):=(r−s,ν2,ν3,…) is a partition of r after deletion of zero parts; in particular, φ(ν)=∅ when r=s=0. Then g(λ,μ,ν)=g(φ(λ),φ(μ),φ(ν)),r≤2sℓ2.

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), ∣λi−μi∣≤s, the vectors ρ,ω,δ,D and the map φ above; g0:=n−∣ρ∣.

[F1]

The internal product is bilinear, hm=s(m) for m>0 and h0=s∅=1 are its degreewise units, sλ∗sμ=∑ξg(λ,μ,ξ)sξ, and g 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).

[F2]

Littlewood's identity is sλ∗(sτsθ)=∑α,βcαβλ(sα∗sτ)(sβ∗sθ), with ∣α∣=∣τ∣ and ∣β∣=∣θ∣ (Littlewood's identity - the internal product against an outer product).

[F3]

The Schur-product coefficient cαβλ 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).

[F4]

Jacobi–Trudi gives sξ=det⁡(hξi−i+j)1≤i,j≤ℓ for a partition ξ of length at most ℓ, with h0=1 and ha=0 for a<0. 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).

[F5]

Intersection and union are componentwise minimum and maximum and are partitions; in case (ii), 0≤ωi−ρi≤s and g0=∑i(λi−ρi) (Partitions, English diagrams, and conjugation).

Proof

technique · preserve the small skew tableaux by an explicit row shear and apply the first-row Jacobi–Trudi expansion
1.1F1F2F3F5algebra

For 0≤q≤n and η⊢q, apply [F2] to hn−qsη and use the unit in [F1], then extract [sμ] using [F3]. This gives the finite coefficient identity Kn(q,η):=[sμ](sλ∗(hn−qsη))=∑α⊢n−q, β,γ⊢qcαβλcαγμg(β,η,γ). Every nonzero summand has α⊆ρ; writing ei:=ρi−αi gives ∑iei=q−g0, so 0≤ei≤q−g0≤q. If ℓ=0, then n=s=r=0, all three partitions are empty, and the degree-zero unit gives g(∅,∅,∅)=1, proving the claim; hence assume ℓ≥1 for the rest of the proof.

1.2F5algebra

For part (ii) only, and put Dℓ+1=0, ρℓ+1=0. One has δi≤ρi−ρi+1. If Dj>0, let b≥j be the last index with δb>0; telescoping gives Dj≤ρj−ρb+δb≤ρj−2s. Hence φ(θ)j≥s when Dj>0, and when Dj=0 its value is θj≥0. If δj=0, consecutive parts of φ(θ) have the same difference as those of θ. If δj>0 and j<ℓ, then φ(θ)j−φ(ω)j+1=θj−ωj+1−δj=θj−ρj+2s≥s≥0. Since θ⊆ω, this proves weak decrease at every remaining boundary. Thus φ maps the stated domain to partitions, is injective, and satisfies ∣φ(θ)∣=∣θ∣−∑jDj.

2.1F1F4F5step 1.1algebra

Independently of case (ii), expand the Jacobi–Trudi determinant for ν=(n−s,ν2,…) along the first row. Its jth cofactor Bj, indexed by 0≤j≤ℓ−1, depends only on (ν2,…,νℓ) and is homogeneous of degree s−j, since every product in that minor has that degree. Thus sν=∑j=0ℓ−1(−1)jhn−s+jBj, with Bj=0 when j>s; for j≤s, expand Bj in the Schur basis of degree q=s−j. By symmetry [F1], g(λ,μ,ν)=[sμ](sλ∗sν) is therefore a signed sum of Kn(q,η) with 0≤q≤s. If ∣λi−μi∣>s for some i, then g0≥∣λi−μi∣>s: the sums of the positive row differences in either direction agree because ∣λ∣=∣μ∣. Step 1.1 then has no contributing α for any q≤s. Every term vanishes, proving part (i).

2.2F5step 1.2algebra

Return to case (ii) and put r:=∣φ(λ)∣=∣φ(μ)∣. If any δi>0, step 1.2 gives ρ1−D1≥2s and therefore r≥2s, so r−s≥s≥ν2. If every δi=0, then r=n and r−s=ν1≥ν2. Thus φ(ν) is a partition after deletion of zero parts, including ∅ when r=s=0. To bound r, use δi≥ρi−ωi+1−2s and telescope to obtain λj−Dj≤2s(ℓ−j+1)+∑i=jℓ(λi−ρi)+∑i=j+1ℓ(ωi−λi)≤3s(ℓ−j+1); the last two sums together equal (λj−ρj)+∑i=j+1ℓ(ωi−ρi)≤s(ℓ−j+1). Therefore r≤3sℓ(ℓ+1)/2≤2sℓ2 for ℓ≥3. If ℓ=2, equal total sizes imply ω2=ρ2+a and n=ρ1+ρ2+a, where a=∣λ1−μ1∣=∣λ2−μ2∣≤s; then r=n−δ1−2δ2≤(ρ1+ρ2+a)−(ρ1−ρ2−a−2s)−2(ρ2−2s)=6s+2a≤8s. If ℓ=1, then s=0, λ=μ=ν=(n) and δ1=n, giving r=0.

2.3step 1.1step 1.2algebra

Fix q≤s. The map α↦φ(α) is a bijection from partitions α⊆ρ of size n−q to partitions θ⊆φ(ρ) of size r−q. If either set is nonempty, its total deficit from ρ or φ(ρ) is q−g0≤s. For the forward direction this proves αj≥ρj−s, so step 1.2 applies. Conversely, given θ in the second set, set αj:=θj+Dj. These parts are nonnegative and have consecutive differences (θj−θj+1)+δj≥0. They satisfy α⊆ρ, ∣α∣=n−q, and ρj−αj=φ(ρ)j−θj≤q−g0≤s. This is the inverse. Empty index sets, including q<g0, correspond as well.

3.1F3step 1.1step 1.2step 2.3construct

For such an α, shift every cell (j,c) of λ/α to (j,c−Dj). Its image is φ(λ)/φ(α), with each row order and the whole reading word preserved. Within runs of rows with δj=0, consecutive rows share columns in exactly the same way. At a cut δj>0, the original rows have no common skew column across the cut, since αj≥ρj−s>ωj+1≥λj+1. The shifted rows likewise have no common skew column across it, because φ(α)j−φ(ω)j+1=αj−ρj+2s≥s≥0. 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 cαβλ=cφ(α),βφ(λ) for every β⊢q, and the identical argument gives cαγμ=cφ(α),γφ(μ).

4.1step 1.1step 2.2step 2.3step 3.1algebra

Apply step 1.1 to the reduced outer partitions of size r. 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 g(β,η,γ), so Kn(q,η)=[sφ(μ)](sφ(λ)∗(hr−qsη)) for every q≤s. All degrees are nonnegative: if a reduction occurs then r≥2s by step 2.2, and otherwise r=n≥s.

5.1F1F4step 2.1step 2.2step 4.1∎

The first-row Jacobi–Trudi expansion for φ(ν)=(r−s,ν2,…) has exactly the cofactors Bj of step 2.1, since its tail is unchanged. Replacing each Kn(q,η) by its equal reduced coefficient from step 4.1 in that finite signed expansion gives g(λ,μ,ν)=g(φ(λ),φ(μ),φ(ν)). Step 2.2 gives the asserted size bound, completing part (ii).

Remarks

The block map printed in Pak–Panova is not used here. For λ=(13,10,2), μ=(13,7,5), ν=(22,3), ℓ=3, their complexity-paper formula gives (9,10,2) for the first image, which is not a partition. The corrected map above retains a 2s separation at every shortened cut and proves the claimed bounded reduction without weak-decrease assumptions on its outputs.

The sharp s-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.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Row-gap reduction and conditional k-stability of Kronecker coefficients

Statement

Fix λ,μ,ν⊢n and an integer k≥1. Write (tk) for k parts equal to t and (tk) for the one-part partition of size tk, and read missing parts as zero. Put s:=n−ν1, with ν1=0 if n=0.

(i) Suppose λ1≤μ1≤ν1 and min⁡{λk,μk}≥max⁡{λk+1,μk+1}+s. Then for every integer t≥0, g(λ+(tk),μ+(tk),ν+(tk))=g(λ,μ,ν). All shifted arguments are partitions of n+tk. For k=1, this is the first-row padding of the three tails to size n+t (First-row padding of a partition).

(ii) For arbitrary λ,μ,ν⊢n and k≥1, the sequence Gk(t):=g(λ+(tk),μ+(tk),ν+(tk)) is eventually constant. More precisely, it is constant for every integer t≥t0, where t0:=max⁡{0, s+max⁡{λk+1,μk+1}−min⁡{λk,μk}}. The proof of the row-gap identity does not require first-part ordering, so the threshold also covers k=1 when ν1<max⁡{λ1,μ1}. No monotonicity is asserted.

Facts & Assumptions

Given: The partitions, k and s in the Statement, the shifted partitions λt:=λ+(tk), μt:=μ+(tk) and νt:=ν+(tk) of size nt:=n+tk; a fixed common length bound ℓ≥k for these partitions.

[F2]

Steps 1.1 and 2.1 of The Kronecker reduction lemma of Pak and Panova establish, for 0≤q≤s and η⊢q, Kn(q,η)=∑α⊢n−q, β,γ⊢qcαβλcαγμg(β,η,γ), where Kn(q,η):=[sμ](sλ∗(hn−qsη)). They express g(λ,μ,ν) as a finite signed combination of these coefficients whose weights depend only on the tail (ν2,…,νℓ). Every nonzero term has α⊆ρ:=λ∩μ, with 0≤ρi−αi≤q−g0≤s and g0:=n−∣ρ∣.

[F3]

The coefficient cαβλ 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).

[F4]

Intersection and union are rowwise minimum and maximum. Thus ρt:=λt∩μt=ρ+(tk), ωt:=λt∪μt=ω+(tk) with ω:=λ∪μ, and nt−∣ρt∣=g0 (Partitions, English diagrams, and conjugation).

Proof

technique · apply the small-skew coefficient identity to the single cut between rows $k$ and $k+1$
1.1F2F4givenalgebra

Assume the row-gap inequality ρk≥ωk+1+s; first-part ordering will not be used. The shifted parameter is nt−(ν1+tk)=s, and the shifted tail is unchanged. Fix q≤s. The map α↦αt:=α+(tk) is a bijection from partitions α⊆ρ of size n−q to partitions θ⊆ρt of size nt−q. In the forward direction the shift preserves the partition order. Conversely a partition θ in the second set has total deficit ∣ρt∣−∣θ∣=q−g0≤s, so θk≥ρk+t−s≥ωk+1+t≥θk+1+t. Consequently subtracting t in its first k rows produces a partition α⊆ρ of size n−q, with nonnegative kth part since θk−t≥ωk+1≥0. All other boundary and row inequalities are preserved. If q<g0, both sets are empty.

2.1F2F3F4step 1.1construct

Shift each cell in the first k rows of λ/α horizontally by t, leaving lower rows fixed. The image is λt/αt. There are no shared skew columns across the cut in either shape: originally αk≥ρk−s≥ωk+1≥λk+1, and after shifting αt,k=αk+t≥λt,k+1. 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 cαβλ=cαt,βλt for every β⊢q, and the same proof gives cαγμ=cαt,γμt for every γ⊢q.

3.1F2step 1.1step 2.1algebra

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 Kn(q,η)=Knt(q,η) for every q≤s. The first-row expansions [F2] for ν and νt use the same cofactors because they have the same tail. Their signed sums are therefore equal, giving g(λt,μt,νt)=g(λ,μ,ν) for every t≥0. This proves part (i) and also proves that the equality holds under the row-gap inequality without the first-part ordering.

4.1F4step 3.1algebra∎

For an arbitrary triple, min⁡{λt,k,μt,k}=min⁡{λk,μk}+t and max⁡{λt,k+1,μt,k+1}=max⁡{λk+1,μk+1}. Thus the row-gap inequality with parameter s holds at t=t0 and for every larger t. Apply the ordering-free identity established in step 3.1 to the triple at t0 with further shift u≥0. It gives Gk(t0+u)=Gk(t0) for every u≥0, proving part (ii) with the stated threshold for all k≥1.

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 2s gaps, so equality of compacted images is not assumed for the sharper s-gap theorem.

The row-gap condition cannot be omitted: Row padding need not preserve a Kronecker coefficient before stability ↗ gives λ=μ=(2,2), ν=(3,1) and k=1, for which G1(0)=0 but G1(t)=1 for every t≥1.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

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 g(λ,μ,ν) 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 Sn; 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 g(λ,μ,ν), 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 g as an exact finite average, but over all n! elements of Sn, 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 0 or transports the coefficient to partitions of strictly bounded size; and k-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 g, 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 g(λ,μ,ν) 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 n! 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