Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 Littlewood--Richardson tensor-product rule

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1, and let λ,μ be partitions with ℓ(λ),ℓ(μ)≤r. Then Sλ(V)⊗Sμ(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλμν, the finite direct sum over partitions ν with at most r rows, where cλμν is the Littlewood--Richardson coefficient of Littlewood--Richardson tableaux and coefficients; cλμν=0 unless λ⊆ν and ∣ν∣=∣λ∣+∣μ∣. Equivalently in characters sλ(x1,…,xr) sμ(x1,…,xr)=∑ν: ℓ(ν)≤rcλμν sν(x1,…,xr), with sν(x1,…,xr)=0 for ℓ(ν)>r (Stable Schur functions from bialternants); the coefficients cλμν do not depend on r.

Facts & Assumptions

Given: AC, V=Cr, partitions λ,μ with ℓ(λ),ℓ(μ)≤r, and the tensor product Sλ(V)⊗Sμ(V) with its GL⁡(V)-action.

[F1]

The modules Sν(V) with ℓ(ν)≤r are nonzero pairwise non-isomorphic irreducible polynomial GL⁡(V)-modules with characters sν(x1,…,xr), and Sν(V)=0 for ℓ(ν)>r; distinct Schur characters sν, ℓ(ν)≤r, are linearly independent (Schur modules and their characters, Semistandard tableaux expand Schur characters, Schur-Weyl decomposition and highest weights parts (2) and (3), Polynomial representations of GL_r and their highest weights).

[F2]

The tensor product Sλ(V)⊗Sμ(V) is a polynomial GL⁡(V)-module of finite length whose character is sλsμ, and the multiplicity of Sν(V) in it equals cλμν for every ν with ℓ(ν)≤r (The admissible-tableau count equals the Littlewood--Richardson coefficient, Schur modules and their characters).

[F3]

A skew shape ν/λ is nonempty only if [λ]⊆[ν] and ∣ν∣>∣λ∣; a LR tableau of shape ν/λ has content μ with ∣μ∣=∣ν∣−∣λ∣, so cλμν=0 unless λ⊆ν and ∣ν∣=∣λ∣+∣μ∣ (Littlewood--Richardson tableaux and coefficients, Partitions, English diagrams, and conjugation).

[F4]

Only finitely many partitions have the fixed size ∣λ∣+∣μ∣, since their parts and lengths are bounded by that size; the size condition in [F3] therefore makes the sum finite (Partitions, English diagrams, and conjugation, Littlewood--Richardson tableaux and coefficients).

Proof

1.1F1F2F3F4algebra

Decomposition. By [F2] the multiplicity of Sν(V) in Sλ(V)⊗Sμ(V) equals cλμν for every partition ν with ℓ(ν)≤r. The module is completely reducible by the tensor-power retraction proved in the supplier of [F2], and its irreducible summands are among the pairwise non-isomorphic simple modules Sν(V) with ℓ(ν)≤r by [F1]; therefore Sλ(V)⊗Sμ(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλμν, where the sum is finite by [F4] and the vanishing statement of [F3] removes all ν with λ⊈ν or ∣ν∣≠∣λ∣+∣μ∣.

2.1F1F2step 1.1algebra

Characters. Taking characters in step 1.1 and using additivity and multiplicativity of the character together with ch⁡Sν(V)=sν [F1] gives sλsμ=∑ν:ℓ(ν)≤rcλμνsν(x1,…,xr), where terms with ℓ(ν)>r are 0 by definition of sν(x1,…,xr) and Sν(V)=0.

3.1F1F2F3step 1.1algebra∎

Independence of r. The coefficient of sν in step 2.1 is cλμν, the number of LR tableaux of shape ν/λ and content μ (Littlewood--Richardson tableaux and coefficients); this is a count of tableaux of a fixed skew shape and content, so it does not mention the rank r at all, and the multiplicity statement of step 1.1 identifies the same integer as the multiplicity in the tensor product for every r with ℓ(λ),ℓ(μ)≤r. Hence the coefficients cλμν appearing in the decomposition are independent of r, as claimed.

Depends on

Used by

Dependency tree · two levels

50 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