Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Littlewood--Richardson coefficients stabilise with rank

Statement

Assume the Axiom of Choice. Let λ,μ be partitions, padding their row-length coordinates by zeros when needed, and let cλμν be the Littlewood--Richardson coefficients of Littlewood--Richardson tableaux and coefficients.

(i) If cλμν≠0, then λ⊆ν and ∣ν∣=∣λ∣+∣μ∣; in particular ν1≤λ1+μ1 and ℓ(ν)≤ℓ(λ)+ℓ(μ).

(ii) For every r≥max⁡(1,ℓ(λ),ℓ(μ)) the tensor product over V=Cr decomposes as Sλ(V)⊗Sμ(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλμν, with the same coefficients cλμν for every such r; if r≥ℓ(λ)+ℓ(μ) no coefficient visible at a larger rank is lost, and for every such r one has sλ(x1,…,xr)sμ(x1,…,xr)=∑ν:ℓ(ν)≤rcλμνsν(x1,…,xr) with sν(x1,…,xr)=0 for ℓ(ν)>r (Stable Schur functions from bialternants).

Facts & Assumptions

Given: AC, partitions λ,μ, and the LR coefficients defined as counts of LR tableaux of skew shapes ν/λ and content μ (Littlewood--Richardson tableaux and coefficients).

[F1]

The LR coefficient counts semistandard skew tableaux of shape ν/λ with content μ whose reading word is a lattice word; such a tableau exists only when [λ]⊆[ν] and has exactly ∣ν∣−∣λ∣=∣μ∣ boxes, and its entries lie in {1,…,ℓ(μ)} because the letter j occurs μj=0 times for j>ℓ(μ) (Littlewood--Richardson tableaux and coefficients, Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux).

[F2]

Column 1 contains a box in every row j>ℓ(λ) for which νj>0. A column of a skew diagram has its boxes in consecutive rows, and strict increase down that column gives distinct letters (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers).

[F3]

Littlewood--Richardson tensor rule: for r≥max⁡(1,ℓ(λ),ℓ(μ)), Sλ(V)⊗Sμ(V)≅⨁ℓ(ν)≤rSν(V)⊕cλμν for V=Cr, and the character identity sλsμ=∑ℓ(ν)≤rcλμνsν holds with sν(x1,…,xr)=0 for ℓ(ν)>r (The Littlewood--Richardson tensor-product rule, Schur modules and their characters, Stable Schur functions from bialternants).

Proof

1.1F1givenalgebra

Suppose cλμν≠0 and let U be an LR tableau of shape ν/λ and content μ. The containment [λ]⊆[ν] and the size identity ∣ν∣=∣λ∣+∣μ∣ are part of [F1]. For the first row, read from right to left: the reading word of U begins with the entries b1≥b2≥⋯≥bk of the first row (weak increase becomes weak decrease read right to left), where k=ν1−λ1 is the number of boxes of the first row of the skew diagram. If k>0, the lattice condition at the first letter forces b1=1: otherwise that prefix has one b1 and no b1−1. Hence bj=1 for every j; if k=0, the desired inequality holds immediately, so all first-row entries equal 1 and k≤μ1 because U contains only μ1 copies of 1. Hence ν1−λ1≤μ1, i.e. ν1≤λ1+μ1.

1.2F1F2givenalgebra

Row bound. Suppose ν has a box in row i>ℓ(λ)+ℓ(μ). Since i>ℓ(λ), we have λj=0 for every j>ℓ(λ); since row i occurs in the partition ν, we also have νj≥1 for every j≤i. Thus each row j=ℓ(λ)+1,…,i contributes a box in column 1 to ν/λ, giving at least i−ℓ(λ) boxes in that column. Strict increase down the column makes their entries distinct, and all entries lie in {1,…,ℓ(μ)} because the tableau has content μ [F1]; hence i−ℓ(λ)≤ℓ(μ), contradicting i>ℓ(λ)+ℓ(μ). Therefore ℓ(ν)≤ℓ(λ)+ℓ(μ).

2.1F1F3step 1.1step 1.2algebra

Part (ii) for the tensor product is exactly [F3], applied at each rank r≥max⁡(1,ℓ(λ),ℓ(μ)); the coefficients appearing are the rank-independent tableau counts cλμν of Littlewood--Richardson tableaux and coefficients, so they are the same for every such r. If r≥ℓ(λ)+ℓ(μ), then every ν with cλμν≠0 satisfies ℓ(ν)≤r by step 1.2, so no coefficient disappears when the rank is lowered to r from a larger rank; equivalently no coefficient visible at a larger rank is lost.

3.1F3step 2.1algebra∎

The character identity is the character form of the decomposition in [F3], with the convention sν(x1,…,xr)=0 for ℓ(ν)>r; it holds for every r≥max⁡(1,ℓ(λ),ℓ(μ)) by [F3]; once r≥ℓ(λ)+ℓ(μ), the set of partitions with nonzero coefficients and those coefficients are independent of r by step 2.1. The Schur polynomials themselves are evaluated in the rank-dependent variables x1,…,xr.

Depends on

Used by

Dependency tree · two levels

29 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