Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 nonnegative expansion of a reduced Kronecker coefficient

Statement

For all partitions α,β,γ one has the finite nonnegative expansion gˉα,βγ=∑μ,λ,η,ρ,θ,πcμ,θ,πγ cρ,λ,θα cρ,η,πβ gλ,ημ, the sum over all six-tuples of partitions (only finitely many summands are nonzero), where the c's are the threefold Schur coefficients (Threefold Schur coefficients ca,b,cδ) and the g's are the ordinary Kronecker coefficients (Kronecker coefficients and the internal tensor product).

Consequences.

  1. gˉα,βγ>0 if and only if there exist partitions μ,λ,η,ρ,θ,π with all four coefficients cμ,θ,πγ, cρ,λ,θα, cρ,η,πβ and gλ,ημ positive.
  2. For every nonzero summand the degree equations ∣α∣=∣ρ∣+∣λ∣+∣θ∣, ∣β∣=∣ρ∣+∣η∣+∣π∣, ∣γ∣=∣μ∣+∣θ∣+∣π∣ and ∣μ∣=∣λ∣=∣η∣ hold.
  3. For fixed α,β the index set is finite: for a nonzero summand ρ,λ,θ are contained in α, ρ,η,π are contained in β, and ∣μ∣=∣λ∣.
  4. All summands are nonnegative integers, so no cancellation occurs.

Facts & Assumptions

Given: Partitions α,β,γ and six-tuples of partitions (μ,λ,η,ρ,θ,π).

[F1]

gˉα,βγ=⟨sα[X]sβ[Y] ∣ σ[XY]sγ[XY+X+Y]⟩X,Y (Brion's formula for the reduced Kronecker coefficients).

[F2]

sλ[U+V]=∑μ,νcμνλsμ[U]sν[V] and sλ[UV]=∑μ,νgμνλsμ[U]sν[V] for all specializations (Schur functions on sums and products of alphabets), and σ[XY]=∑ρsρ[X]sρ[Y] degreewise (The series σ: product formula, Cauchy identity, adjunction and reproducing kernel).

[F3]

cμ,θ,πγ=⟨sγ,sμsθsπ⟩H=[sγ]sμsθsπ, and cμ,θ,πγ=∑νcμ,νγcθ,πν (Threefold Schur coefficients ca,b,cδ).

[F4]

The Schur basis is orthonormal (Schur functions form an orthonormal integral basis), the coefficients c and g are nonnegative integers, and cμνλ=0 unless μ⊆λ and ∣λ∣=∣μ∣+∣ν∣, while gμνλ=0 unless ∣λ∣=∣μ∣=∣ν∣ (Littlewood--Richardson tableaux and coefficients, The Littlewood–Richardson rule for products of Schur functions, Kronecker coefficients and the internal tensor product).

Proof

technique · direct
1.1F1F2F3F4

Expanding Brion's pairing. Insert the four expansions of [F2] into the pairing of [F1]: σ[XY]=∑ρsρ[X]sρ[Y], and by the coproduct identity at the sum XY+(X+Y), sγ[XY+X+Y]=∑μ,νcμνγsμ[XY]sν[X+Y], with sμ[XY]=∑λ,ηgλημsλ[X]sη[Y] and sν[X+Y]=∑θ,πcθπνsθ[X]sπ[Y]. Multiplying out and pairing with sα[X]sβ[Y] using orthonormality [F4] extracts ⟨sα,sρsλsθ⟩H=cρ,λ,θα and ⟨sβ,sρsηsπ⟩H=cρ,η,πβ by [F3], so gˉα,βγ=∑μ,ν,λ,η,ρ,θ,πcμνγcθπνgλημcρλθαcρηπβ.

2.1F2F3step 1.1

Collapsing the middle index. By the iterated identity of [F3], ∑νcμνγcθπν=cμ,θ,πγ; substituting into step 1.1 and relabelling the summation indices gives the displayed expansion. The threefold coefficients are symmetric in their three subscripts by their definition as coefficients of the commutative product sμsθsπ, so the displayed index pattern is the same as the source's equation (8) with the four factors assigned to the four faces of the index tetrahedron in a different order. All coefficients are nonnegative integers, so no cancellation occurs in the sum.

3.1F4step 2.1

Consequences (2) and (4). A nonzero summand has all four coefficients positive (they are nonnegative integers), and then the degree equations of (2) follow from the size constraints in [F4]: ∣γ∣=∣μ∣+∣θ∣+∣π∣, ∣α∣=∣ρ∣+∣λ∣+∣θ∣, ∣β∣=∣ρ∣+∣η∣+∣π∣ and ∣μ∣=∣λ∣=∣η∣; conversely, any summand with all four coefficients positive contributes positively, giving the criterion (1) since the total is a sum of nonnegative integers.

4.1F3F4step 3.1∎

Consequence (3), finiteness. If cρ,λ,θα>0 then, by the iterated form of [F3], there is a partition ϕ with cρ,λϕ>0 and cϕ,θα>0; by [F4] this forces ρ⊆ϕ⊆α, λ⊆ϕ⊆α and θ⊆α, so ρ,λ,θ range over the finitely many subpartitions of α. Similarly cρ,η,πβ>0 forces ρ,η,π⊆β, and gλ,ημ>0 forces ∣μ∣=∣λ∣, so μ ranges over the finitely many partitions of the bounded number ∣λ∣. Hence only finitely many six-tuples contribute, and the expansion is a finite sum; the proof uses finite expansions and no choice principle.

Depends on

Used by

Dependency tree · two levels

48 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