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.

Tensor Product Multiplicities and Littlewood Richardson

1 · Prerequisites

2 · Summary

The page turns character multiplication into a general alternating tensor-multiplicity formula and then specializes it to type A, proving the Littlewood–Richardson and Pieri rules. Tensor-product multiplicities of finite-dimensional simple modules are first named and shown to be the structure constants of formal characters in the completed character ring; the weight-multiplicity formula and the equivalent Schur-lemma description of each multiplicity are recorded on the same footing. Weyl alternation then extracts the multiplicity of any simple summand from the alternation of the product of characters, and multiplying by the Weyl numerator and comparing coefficients yields Steinberg's alternating multiplicity formula and its Racah–Speiser regrouping, in which each weight of one factor is reflected to the dominant chamber and wall weights are discarded.

Minuscule weights are treated next: the definition by coroot pairings, its equivalence with the Weyl orbit of the highest weight, and the orbit-sum character are proved in full, giving the multiplicity-free tensor rule for minuscule weights as a corollary.

The type-A half of the page starts from the classification of polynomial representations of GL⁡r by partitions with at most r parts. Schur modules are identified as the multiplicity spaces of Schur–Weyl duality, their characters are expanded in semistandard tableaux by Schur–Weyl and Young's rule, and the Littlewood–Richardson tableaux are defined by the lattice-word condition on the reading word. Bender–Knuth involutions supply the symmetry of the tableau generating series; the sign-reversing-involution and bi-alternant argument then counts admissible tableaux. The lattice-word Littlewood–Richardson count is supplied by the explicitly cited theorem and complete proof in Macdonald §I.9; equality of character coefficients relates the two counts and gives the tensor-product rule. No tableau bijection is constructed on this page. The horizontal and vertical Pieri rules, the translation of highest weights by determinant twists, and the stabilization of the coefficients with the rank of the tensor factors are consequences proved here as well.

The companion gives complete direct calculations: the Clebsch–Gordan decomposition for sl2 with its Racah–Speiser sum, the sl3 computation 3⊗3=6⊕3ˉ by the minuscule rule, the Pieri product s(2,1)s(1), the smallest coefficient greater than one, and the two boundary counterexamples on the lattice-word condition and the rank bound.

The Axiom of Choice is stated where the general arguments use the character ring and the classification of finite-dimensional simple modules; the tableau-theoretic items (the Littlewood–Richardson definition, the Bender–Knuth involutions and the tableau-only counterexample) are choice-free and carry no such assumption.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Tensor-product multiplicities for finite-dimensional simple modules

Definition

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h, positive system Φ+ with base α1,…,αr, positive cone Q+=∑iZ≥0αi, Weyl vector ρ, weight lattice P and set of dominant integral weights Λ+={λ∈P:⟨λ,αi∨⟩≥0 for all i} (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights).

For λ∈Λ+ let L(λ) denote the finite-dimensional simple g-module of highest weight λ (Highest-weight classification), and let L(λ)⊗L(μ) carry the tensor-product action x⋅(v⊗w)=xv⊗w+v⊗xw (Direct-sum, dual, Hom, and tensor representations). By Weyl's complete reducibility theorem (Weyl's complete reducibility theorem) and the classification of finite-dimensional simple modules there is a decomposition L(λ)⊗L(μ)≅⨁ν∈Λ+L(ν)⊕cλμν with uniquely determined integers cλμν≥0. The direct sum is finite because L(λ)⊗L(μ) is finite-dimensional, so its completely reducible decomposition has only finitely many nonzero simple summands. Each constituent highest weight is a weight and lies below λ+μ in the partial order of weights: every tensor-product weight is a sum of a weight of L(λ), which lies in λ−Q+, and a weight of L(μ), which lies in μ−Q+ (Highest weight modules lie below the top weight).

The integers cλμν=[L(λ)⊗L(μ):L(ν)] are the tensor-product multiplicities of g. More generally, for a finite-dimensional completely reducible g-module V we write [V:L(ν)] for the number of summands isomorphic to L(ν) in any decomposition of V into simple modules; this number does not depend on the chosen decomposition. By Schur's lemma (Schur’s lemma for irreducible Lie-algebra representations) the multiplicity has the equivalent hom-space description cλμν=dim⁡Hom⁡g(L(ν),L(λ)⊗L(μ)).

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

Tensor-product multiplicities are character structure constants

Statement

Assume the Axiom of Choice. In the notation of Tensor-product multiplicities for finite-dimensional simple modules, for all λ,μ∈Λ+ the following hold in the completed character ring R of The completed formal character ring:

(i) ch⁡(L(λ)⊗L(μ))=∑ν∈Λ+cλμνch⁡L(ν), a finite sum; (ii) if V is any finite-dimensional g-module and ch⁡V=∑ν∈Λ+aνch⁡L(ν) with integers aν (finitely many nonzero), then aν=[V:L(ν)] for every ν, so the expansion coefficients of the character are exactly the composition multiplicities and the elements ch⁡L(ν), ν∈Λ+, are linearly independent in R; (iii) for every weight γ∈h∗ one has the weight-multiplicity formula dim⁡(L(λ)⊗L(μ))γ=∑σ+τ=γmλ(σ)mμ(τ), a finite sum, where mλ(σ)=dim⁡L(λ)σ and mμ(τ)=dim⁡L(μ)τ (The formal character of a finite-dimensional weight module, Weight and weight space).

Facts & Assumptions

Given: AC and dominant integral weights λ,μ∈Λ+, with the decomposition L(λ)⊗L(μ)≅⨁νL(ν)⊕cλμν of Tensor-product multiplicities for finite-dimensional simple modules.

[F1]

Every finite-dimensional g-module is the direct sum of its weight spaces, the tensor product of two finite-dimensional modules has weight spaces (V⊗W)γ=⨁σ+τ=γVσ⊗Wτ, and the formal character is additive over direct sums and multiplicative over tensor products in the completed ring R (Finite-dimensional modules decompose into weight spaces, Weight and weight space, Formal characters are additive and multiplicative, The completed formal character ring).

[F2]

For each ν∈Λ+ the module L(ν) is the unique simple module of highest weight ν, its highest weight space is one-dimensional, and every weight of L(ν) lies in ν−Q+, so ν is the maximum of the weights of L(ν) in the root order; moreover every finite-dimensional module is completely reducible (Highest-weight classification, Highest weight modules lie below the top weight, Root order on weights, Tensor-product multiplicities for finite-dimensional simple modules).

Proof

1.1F1givenalgebra

Part (i) is the multiplicativity and additivity of the formal character applied to the decomposition: the tensor product distributes over the direct sum, so ch⁡(L(λ)⊗L(μ))=∑νcλμνch⁡L(ν) in R; the sum is finite by Tensor-product multiplicities for finite-dimensional simple modules.

1.2F1F2givenalgebra

Part (ii), comparison of coefficients. Let V be finite-dimensional with decomposition V≅⨁νL(ν)⊕aν′, aν′=[V:L(ν)]. Then ch⁡V=∑νaν′ch⁡L(ν). Suppose also ch⁡V=∑νaνch⁡L(ν) with integers aν, both sums finite. Let ν0 be maximal in the root order among the indices with aν0≠aν0′ (if there is none, the two families are equal). Evaluating both characters in the weight ν0 and using that mη(ν0)=0 unless ν0≤η with equality only for η=ν0, while mν0(ν0)=1 [F2], gives 0=dim⁡Vν0−dim⁡Vν0=∑η≥ν0(aη−aη′)mη(ν0)=(aν0−aν0′)≠0, a contradiction. Hence aν=aν′=[V:L(ν)] for all ν.

2.1F1F2step 1.1step 1.2algebra

Part (ii), linear independence. Suppose ∑ν∈Fbνch⁡L(ν)=0 with a finite nonempty set F and integers bν, not all zero. Split at the ν with bν>0 and bν<0 and let V+=⨁ν∈F, bν>0L(ν)⊕bν and V−=⨁ν∈F, bν<0L(ν)⊕(−bν); the vanishing of the alternating sum gives ch⁡V+=ch⁡V− in R. Both are characters of finite-dimensional modules, so by step 1.2 the multiplicity families (bν)ν: bν>0 and (−bν)ν: bν<0 agree on every ν, forcing bν=0 against the choice of F. Hence the characters ch⁡L(ν) are linearly independent.

3.1F1givenalgebra∎

Part (iii): by the tensor-product weight-space formula of [F1], (L(λ)⊗L(μ))γ=⨁σ+τ=γL(λ)σ⊗L(μ)τ, and taking dimensions gives dim⁡(L(λ)⊗L(μ))γ=∑σ+τ=γmλ(σ)mμ(τ); only the finitely many pairs of weights of L(λ) and L(μ) can contribute, so the sum is finite.

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

Weyl alternation extracts a dominant highest-weight coefficient

Statement

Assume the Axiom of Choice. Let V be a finite-dimensional g-module with formal character ch⁡V∈R, the completed character ring of The completed formal character ring, and let A be the Weyl alternation operator of The Weyl alternation operator, with A(η)=∑w∈W(−1)ℓ(w)ewη for η∈h∗ and A(ρ) the Weyl denominator. For every ν∈Λ+ the coefficient of eν+ρ in A(ρ)ch⁡V∈R equals the multiplicity [V:L(ν)] of Tensor-product multiplicities for finite-dimensional simple modules. Explicitly, ch⁡V=∑μ∈Λ+[V:L(μ)]ch⁡L(μ)andA(ρ)ch⁡V=∑μ∈Λ+[V:L(μ)] A(μ+ρ), and [eν+ρ]A(μ+ρ)=δμν for μ,ν∈Λ+.

Facts & Assumptions

Given: AC, a finite-dimensional g-module V with decomposition V≅⨁μ∈Λ+L(μ)⊕[V:L(μ)] and a dominant integral weight ν.

[F1]

Weyl character formula: ch⁡L(μ)=A(μ+ρ)/A(ρ) for μ∈Λ+, i.e. A(ρ)ch⁡L(μ)=A(μ+ρ); the alternants have finite support, the completed ring R contains A(ρ) as an invertible element with inverse the Weyl-denominator geometric series, and A(η)=∑w∈W(−1)ℓ(w)ewη (The Weyl character formula, The Weyl alternation operator, Geometric series are invertible in the completed character ring, The completed formal character ring).

[F2]

The formal character is additive over direct sums and multiplicative over tensor products, and it determines the multiplicities: the coefficient of ch⁡L(μ) in ch⁡V=∑μaμch⁡L(μ) satisfies aμ=[V:L(μ)] (Formal characters are additive and multiplicative, Tensor-product multiplicities are character structure constants, Weyl's complete reducibility theorem, Highest-weight classification).

[F3]

For each ν∈Λ+, ν+ρ is strictly dominant (Positive coroot pairings of a dominant integral weight). Each real Weyl orbit has one closed-dominant representative, and the stabilizer of that representative is generated by the simple reflections whose walls contain it. Thus the stabilizer of ν+ρ is trivial, and if w(μ+ρ)=ν+ρ for dominant integral μ,ν, uniqueness first gives μ=ν, then triviality of the stabilizer gives w=1 (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Finite Weyl root system, lattice and chamber conventions).

Proof

1.1F1F2givenalgebra

The decomposition of V into simple summands and the additivity of the formal character [F2] give ch⁡V=∑μ∈Λ+[V:L(μ)]ch⁡L(μ), a finite sum. Multiplying by the ring element A(ρ) and using A(ρ)ch⁡L(μ)=A(μ+ρ) from [F1] gives A(ρ)ch⁡V=∑μ∈Λ+[V:L(μ)]A(μ+ρ).

1.2F1F3givenalgebra

Coefficient of a dominant translate. For ν∈Λ+ and any μ∈Λ+, [eν+ρ]A(μ+ρ)=[eν+ρ]∑w∈W(−1)ℓ(w)ew(μ+ρ)=∑w∈W(−1)ℓ(w)[w(μ+ρ)=ν+ρ], a finite sum. The term w=1 contributes 1 when μ=ν. If w≠1 and w(μ+ρ)=ν+ρ, then μ+ρ=w−1(ν+ρ) would be a strictly dominant weight conjugate to the strictly dominant weight ν+ρ, which by [F3] forces w=1, a contradiction; hence all such terms are 0 and [eν+ρ]A(μ+ρ)=δμν.

2.1F1F2step 1.1step 1.2algebra∎

Extraction. Taking the coefficient of eν+ρ in step 1.1 and using step 1.2 gives [eν+ρ]A(ρ)ch⁡V=∑μ∈Λ+[V:L(μ)] δμν=[V:L(ν)], which is the asserted extraction formula; here the sum over μ is finite because V is finite-dimensional.

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

Steinberg's tensor-product multiplicity formula

Statement

Assume the Axiom of Choice. For all dominant integral weights λ,μ,ν∈Λ+ the tensor-product multiplicity of Tensor-product multiplicities for finite-dimensional simple modules is cλμν=∑w∈W(−1)ℓ(w) mμ(w(ν+ρ)−(λ+ρ)), where mμ(σ)=dim⁡L(μ)σ is the weight multiplicity (The formal character of a finite-dimensional weight module) and W is the Weyl group with length function ℓ; only finitely many summands are nonzero. Equivalently, after the substitution w↦w−1 and Weyl-invariance of the weight multiplicities (Characters of finite-dimensional modules are Weyl-invariant), cλμν=∑w∈W(−1)ℓ(w) mμ(ν+ρ−w(λ+ρ)).

Facts & Assumptions

Given: AC, dominant integral weights λ,μ,ν∈Λ+, the alternation operator A with A(η)=∑w(−1)ℓ(w)ewη and A(ρ) the Weyl denominator, and the finite-dimensional module L(λ)⊗L(μ).

[F1]

Coefficients of a character in the completed ring R are the tensor multiplicities: with V=L(λ)⊗L(μ), cλμν=[V:L(ν)] and ch⁡V=∑ν∈Λ+cλμνch⁡L(ν) (Tensor-product multiplicities for finite-dimensional simple modules, Tensor-product multiplicities are character structure constants).

[F2]

Alternation extraction: for every finite-dimensional module V and ν∈Λ+, [eν+ρ]A(ρ)ch⁡V=[V:L(ν)]; in particular cλμν=[eν+ρ]A(ρ)ch⁡(L(λ)⊗L(μ)) (Weyl alternation extracts a dominant highest-weight coefficient).

[F3]

Weyl character formula and linearity: A(ρ)ch⁡L(λ)=A(λ+ρ)=∑w(−1)ℓ(w)ew(λ+ρ), the formal character is multiplicative over tensor products, and ch⁡L(μ)=∑σmμ(σ)eσ with finitely many nonzero weights, each weight lying in μ−Q+ (The Weyl character formula, Formal characters are additive and multiplicative, The formal character of a finite-dimensional weight module, Finite-dimensional modules decompose into weight spaces, Weight and weight space, The completed formal character ring, Geometric series are invertible in the completed character ring).

[F4]

The Weyl group is finite and acts on weights by the reflection action; its length function satisfies (−1)ℓ(w−1)=(−1)ℓ(w), the weight multiplicities of a finite-dimensional module are Weyl-invariant, i.e. mμ(wσ)=mμ(σ) for all w∈W, and the set of weights of L(μ) is finite (The Weyl group is finite and faithful, Root reflections and the Weyl group action, Characters of finite-dimensional modules are Weyl-invariant, The sign of the Weyl length is multiplicative).

Proof

1.1F3F4givenalgebra

Let V=L(λ)⊗L(μ). By multiplicativity and the character formula [F3], A(ρ)ch⁡V=A(λ+ρ)ch⁡L(μ). Expanding gives ∑w,σ(−1)ℓ(w)mμ(σ)ew(λ+ρ)+σ. For each fixed w, put σ=wτ; Weyl invariance [F4] gives mμ(wτ)=mμ(τ). The finite double sum is therefore ∑w,τ(−1)ℓ(w)mμ(τ)ew(λ+ρ+τ)=∑τmμ(τ)A(λ+ρ+τ).

2.1F1F2F3step 1.1algebra

Extract the coefficient of eν+ρ using [F2]: cλμν=[eν+ρ]A(ρ)ch⁡V=∑σmμ(σ) [eν+ρ]A(λ+ρ+σ), and [eν+ρ]A(λ+ρ+σ)=∑w∈W(−1)ℓ(w)[w(λ+ρ+σ)=ν+ρ]. Hence cλμν=∑w∈W(−1)ℓ(w)mμ(w−1(ν+ρ)−(λ+ρ)), because the condition w(λ+ρ+σ)=ν+ρ is equivalent to σ=w−1(ν+ρ)−(λ+ρ), and terms with σ outside the finite weight set of L(μ) contribute mμ(σ)=0.

3.1F1F4step 1.1step 2.1algebra∎

Equivalent form. Substituting w↦w−1 in step 2.1 and using (−1)ℓ(w−1)=(−1)ℓ(w) gives cλμν=∑w(−1)ℓ(w)mμ(w(ν+ρ)−(λ+ρ)), which is the first displayed formula. Applying to mμ the Weyl-invariance of weight multiplicities [F4] with the group element w−1 gives mμ(w(ν+ρ)−(λ+ρ))=mμ(ν+ρ−w−1(λ+ρ)); relabelling w′↦w−1 in the sum yields the equivalent form cλμν=∑w∈W(−1)ℓ(w)mμ(ν+ρ−w(λ+ρ)). Only finitely many summands are nonzero in either form, since W is finite [F4] and mμ has finite support.

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

The Racah--Speiser tensor-product algorithm

Statement

Assume the Axiom of Choice. Let λ,μ∈Λ+. For every weight φ of L(μ) with multiplicity mμ(φ)>0 put ψ=φ+λ and say that φ is regular relative to λ when ψ+ρ is fixed by no reflection of W, equivalently ⟨ψ+ρ,α∨⟩≠0 for every root α. If φ is regular relative to λ, there is a unique u∈W with u(ψ+ρ) strictly dominant (Finite Weyl closed chambers and stabilizers), and then ν(φ):=u(ψ+ρ)−ρ=u⋅ψ is a dominant integral weight (the shifted action being u⋅ξ=u(ξ+ρ)−ρ). The Racah--Speiser algorithm computes the multiplicities of Steinberg's tensor-product multiplicity formula as cλμν=∑φ weight of L(μ)φ regular relative to λ, ν(φ)=ν(−1)ℓ(u(φ)) mμ(φ), the sum being finite; a weight φ for which ψ+ρ is not regular is discarded, and every ν∈Λ+ with cλμν≠0 occurs as ν(φ) for some regular weight φ of L(μ).

Facts & Assumptions

Given: AC, dominant integral weights λ,μ,ν, the weight set of L(μ) with multiplicities mμ(φ)=dim⁡L(μ)φ (Weight and weight space), and the Weyl group W acting on h∗ by the reflection action (Root reflections and the Weyl group action).

[F1]

Steinberg's formula: cλμν=∑w∈W(−1)ℓ(w)mμ(w−1(ν+ρ)−(λ+ρ)), the sum being finite (Steinberg's tensor-product multiplicity formula).

[F2]

The shifted dominant weight ν+ρ is strictly dominant, and ⟨ρ,αi∨⟩=1 (Positive coroot pairings of a dominant integral weight). Every orbit in the real root span E has exactly one point in the closed dominant chamber. Its stabilizer is generated by reflections in the simple walls through that point. Consequently a regular ξ∈E has a strictly dominant representative and a unique element u sending it there; uniqueness of the element is asserted only for regular points (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Finite Weyl root system, lattice and chamber conventions). In particular ξ=φ+λ+ρ is integral; if regular, all simple-coroot pairings of uξ are positive integers, so subtracting ρ leaves nonnegative integral pairings and uξ−ρ∈Λ+.

[F3]

Length parity: ℓ(ws)≡ℓ(w)+1(mod2) for every reflection s∈W (the sign ε(w)=(−1)ℓ(w) is a homomorphism), so (−1)ℓ(ws)=−(−1)ℓ(w) (The sign of the Weyl length is multiplicative).

Proof

1.1F1givenalgebra

Rewrite the Steinberg sum by the second argument. For w∈W put φw:=w−1(ν+ρ)−(λ+ρ) and ψw+ρ:=w−1(ν+ρ)=φw+λ+ρ, so that cλμν=∑w(−1)ℓ(w)mμ(φw) by [F1], the sum being finite. Fix a weight φ of L(μ) and let W(φ)={w∈W:φw=φ}={w:w−1(ν+ρ)=ψ+ρ} where ψ=φ+λ. This set is nonempty exactly when ψ+ρ is W-conjugate to ν+ρ.

1.2F1F2givenalgebra

Regular weights contribute one term each. Suppose φ is regular, so that ψ+ρ has trivial stabilizer. If W(φ)≠∅, then ν+ρ=w(ψ+ρ) is strictly dominant for any w∈W(φ), so by the uniqueness in [F2] there is exactly one such w, namely w=u(φ) where u(φ) is the unique element with u(φ)(ψ+ρ) strictly dominant; in that case ν(φ)=u(φ)(ψ+ρ)−ρ=ν, and the contribution of φ to cλμν is (−1)ℓ(u(φ))mμ(φ). If W(φ)=∅, or if ν(φ)≠ν, the weight φ contributes nothing to cλμν.

2.1F1F3step 1.1algebra

Irregular weights cancel. Suppose φ is not regular: ψ+ρ is fixed by some reflection s. Then W(φ) is stable under right multiplication by s, because (ws)−1(ν+ρ)=s w−1(ν+ρ)=s(ψ+ρ)=ψ+ρ for every w∈W(φ); the map w↦ws is a fixed-point-free involution of W(φ), and by [F3] the signs of paired terms are opposite. Since the multiplicity mμ(φ) is the same for paired terms, the total contribution of the group W(φ) to the sum of step 1.1 is 0.

3.1F1step 1.1step 1.2step 2.1algebra∎

Combining step 1.2 and 2.1, the value of cλμν is the sum of (−1)ℓ(u(φ))mμ(φ) over the regular weights φ of L(μ) with ν(φ)=ν, which is the displayed Racah--Speiser formula; the sum is finite because L(μ) has finitely many weights. If cλμν≠0, the displayed sum is nonzero, so at least one regular weight φ satisfies ν(φ)=ν; this proves the final assertion.

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

Minuscule weights

Definition

Assume the Axiom of Choice. Let g be a finite-dimensional complex simple Lie algebra, with Cartan subalgebra h, root system Φ⊆h∗, positive system Φ+, set of dominant integral weights Λ+={λ∈P:⟨λ,α∨⟩≥0 ∀α∈Φ+} and coroots α∨∈h of roots α (Integral, dominant, and strictly dominant weights, Coroot of a Lie-algebra root, Finite Weyl root system, lattice and chamber conventions). Here ⟨λ,α∨⟩=λ(hα) is the natural pairing, and the coroots of Φ form the dual root system Φ∨={α∨:α∈Φ} (The root set is a reduced crystallographic root system, Fundamental weights).

A dominant integral weight ω∈Λ+ is minuscule if ⟨ω,β∨⟩≤1for every β∈Φ+. Since the coroot of a negative root is the negative of the coroot of the positive root, Φ∨=−Φ∨ at the level of the sets {β∨}, and since ω is dominant integral the pairing ⟨ω,β∨⟩ is a nonnegative integer for β∈Φ+; hence the displayed condition is equivalent to ∣⟨ω,β∨⟩∣≤1for every β∈Φ. The zero weight is minuscule, and the Weyl group acts on weights by the reflection action λ↦wλ (Root reflections and the Weyl group action).

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

Minuscule weights have exactly the Weyl orbit as their weights

Statement

Assume the Axiom of Choice. For a dominant integral weight ω∈Λ+ of a finite-dimensional complex simple Lie algebra g, the following are equivalent (Minuscule weights):

  1. ω is minuscule;
  2. every weight of the finite-dimensional simple module L(ω) belongs to the Weyl orbit Wω;
  3. every dominant integral weight λ with ω−λ∈Q+ equals ω.

Consequently, if ω is minuscule, then each weight space of L(ω) is at most one-dimensional, L(ω) has exactly ∣Wω∣ distinct weights, and ch⁡L(ω)=∑γ∈Wωeγ.

Facts & Assumptions

Given: AC, a finite-dimensional complex simple Lie algebra g with Cartan subalgebra h, root system Φ, positive system Φ+, Weyl group W, root lattice Q=∑iZαi with positive cone Q+, weight lattice P, dominant integral weights Λ+, and a dominant integral weight ω (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights, Minuscule weights).

[F1]

ω is minuscule exactly when ∣⟨ω,β∨⟩∣≤1 for every root β; for dominant integral ω this forces ⟨ω,αi∨⟩∈{0,1} for each simple root. If ω≠0 is minuscule, let θ be the highest root and write its coroot as θ∨=∑iciαi∨, with each ci a positive integer. Here is the needed support argument. Write θ=∑iniαi with ni≥0. Its support is nonempty. If it omitted a simple root, connectedness of the irreducible Dynkin graph would give an omitted vertex j adjacent to the support. All off-diagonal simple-root inner products are nonpositive, with a negative one along that edge, so (θ,αj)<0, contradicting the dominance of θ. Thus every ni>0. Since θ∨=∑ini(αi,αi)/(θ,θ) αi∨ and simple coroots form an integral basis of the coroot group, every ci is a positive integer. Then 1≥⟨ω,θ∨⟩=∑ici⟨ω,αi∨⟩≥#{i:⟨ω,αi∨⟩=1}≥1, so exactly one simple coroot, say αi∨, pairs nontrivially with ω, and its pairing is 1. Thus ω=ωi and ci=⟨ωi,θ∨⟩=1. This proves that every nonzero minuscule weight is a fundamental weight; it does not assert that every fundamental weight is minuscule. (Minuscule weights, Height and highest root, Existence and uniqueness of the highest root, Coroot and dual root system, Fundamental weights).

[F2]

There is a W-invariant positive definite inner product (⋅,⋅) on the real span of Φ with ⟨λ,α∨⟩=2(λ,α)/(α,α); in particular ⟨ω,α∨⟩=2(ω,α)/(α,α) and W-conjugate weights have equal norms (Finite Weyl root system, lattice and chamber conventions, The root set is a reduced crystallographic root system, Positive coroot pairings of a dominant integral weight).

[F3]

Every weight of a highest weight module with highest weight ω lies in ω−Q+; the weights in the Weyl orbit Wω occur in L(ω) with multiplicity exactly one (Highest weight modules lie below the top weight, Extremal Weyl-orbit weights).

[F4]

Every Weyl orbit in the real span of the roots meets the closed dominant chamber; for integral weights the representative is dominant integral, because W permutes the roots and preserves the weight lattice and the pairings (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Fundamental weights).

[F5]

For a root α, the root vectors xα, x−α and hα span a subalgebra isomorphic to sl2 (The root sl_2 triple). Finite-dimensional sl2-modules are direct sums of the irreducible modules with h-eigenvalues m,m−2,…,−m, and the space of vectors of a fixed eigenvalue has dimension the multiplicity of that eigenvalue; root vectors shift weight spaces by ±α (Finite-dimensional representations of sl_2, Root vectors shift weights).

[F6]

If J is a subset of the simple roots, then ΦJ:=Φ∩span⁡RJ is a root subsystem with positive simple system J: reflections in roots of ΦJ preserve Φ and span⁡J, and a positive root supported in J can only decompose into positive roots supported in J. Write J=⨆CC for the connected components of its induced Dynkin graph. The spans of distinct C are orthogonal; the simple-reflection generation and root-orbit property show that every root of ΦJ lies in the span of one such C. Each resulting subsystem is irreducible, since an orthogonal decomposition would partition its simple roots into nonempty orthogonal sets and disconnect the graph. Thus these are exactly the irreducible components (Positive systems and simple roots, Simple roots form a signed integral basis, Reducible and irreducible root systems, Unique irreducible decomposition, Finite Weyl positive roots and simple reflections).

Proof

1.1F1F6givenalgebra

First suppose that ω is minuscule and nonzero; by [F1] it is a fundamental weight ωi. We argue by induction on the rank of the irreducible root system. Let λ be dominant integral and write β:=ωi−λ=∑jmjαj∈Q+. If some k≠i has mk=0, delete the vertex k from the Dynkin diagram. By [F6], the root subsystem generated by the remaining simple roots is the orthogonal direct sum of the subsystems ΦC for the connected components C of the deleted diagram; their spans are mutually orthogonal, and β is the sum of its component projections βC. In each component not containing i, the projection of ωi is zero, so βC=−λC, where λC is dominant for that component. Writing βC=∑j∈Cmjαj, we have (βC,βC)=−∑j∈Cmj(λC,αj)≤0 because (λC,αj)=12(αj,αj)⟨λC,αj∨⟩≥0. Positive definiteness gives βC=λC=0. The component Ci containing i has smaller rank; the projection of ωi is its fundamental weight, still minuscule, and λCi is dominant integral with ωi∣Ci−λCi=βCi∈Q+(Ci). The induction hypothesis applies to the irreducible lower-rank system ΦCi and gives βCi=0, hence β=0. Thus, if β≠0, then mj>0 for every j≠i.

1.2F1F2givenalgebra

A root-lattice element with all pairings bounded by 1 vanishes: if ξ∈Q satisfies ∣⟨ξ,β∨⟩∣≤1 for every coroot β∨, then ξ=0. Suppose not, and choose a counterexample ξ=∑kmkαk with ∑k∣mk∣ minimal. Then (ξ,ξ)=∑kmk(ξ,αk)>0 by positive definiteness, so some k has mk≠0 and (ξ,αk) of the same sign as mk; replacing ξ by −ξ if necessary, we may assume mk>0 and (ξ,αk)>0, so ⟨ξ,αk∨⟩=2(ξ,αk)/(αk,αk)=1 by the bound. Then skξ=ξ−αk is again a counterexample, since ∣⟨skξ,β∨⟩∣=∣⟨ξ,skβ∨⟩∣≤1 for all coroots (the set of coroots is W-stable), and it has coordinate sum ∑j∣mj∣−1, contradicting minimality. Hence ξ=0.

1.3F5givenalgebra

The weight set of a finite-dimensional module is W-stable. Let M be such a module, let μ be a weight, and let α=αk be simple with t=⟨μ,α∨⟩. The subalgebra sl2(α) acts on M. Decompose it into irreducibles and write a nonzero weight vector v as the sum of its components in their weight-t spaces. In each irreducible summand where that component is nonzero, the highest weight is some m≥∣t∣ with m≡t(mod2). If t≥0, lowering that component by t steps is nonzero and has weight −t; if t<0, raising it by −t steps is nonzero and has weight −t. Their direct sum is nonzero and has weight μ−tα=skμ. Thus each simple reflection preserves the set of weights, and these reflections generate W.

1.4F1F2F5givenalgebra

(2)⇒(1): suppose (2) holds and ω is not minuscule. Then by [F1] there is a positive root α with ⟨ω,α∨⟩≥2. Let vω≠0 be a highest weight vector; the root vector x−α of the sl2(α)-triple [F5] satisfies x−αvω≠0, because vω is annihilated by all positive root vectors and spans the highest weight space of the sl2(α)-module it generates, of highest weight ⟨ω,α∨⟩≥1; this vector has weight ω−α (Root vectors shift weights). By (2) there is w∈W with ω−α=wω, and the W-invariance of the form [F2] gives (ω−α,ω−α)=(ω,ω), while (ω−α,ω−α)=(ω,ω)−2(ω,α)+(α,α)<(ω,ω) because 2(ω,α)=⟨ω,α∨⟩(α,α)≥2(α,α)>(α,α). This contradiction proves (2)⇒(1).

2.1F1F2step 1.1algebra

Suppose ⟨ωi−λ,αi∨⟩≤0. For every j≠i, ⟨ωi−λ,αj∨⟩=−⟨λ,αj∨⟩≤0, since ωi is the ith fundamental weight and λ is dominant. Together with the assumed nonpositivity at i, all simple-coroot pairings of β=ωi−λ=∑kmkαk are nonpositive. Therefore (β,β)=∑kmk(β,αk)=∑kmk(αk,αk)2⟨β,αk∨⟩≤0, because each mk≥0. Positive definiteness gives β=0 and λ=ωi.

2.2F1F2step 1.1algebra

It remains to exclude the case ⟨ωi−λ,αi∨⟩>0, which is 1 because ωi pairs by 1 and λ is dominant integral. Write β=ωi−λ=∑kmkαk. Then mk>0 for k≠i by step 1.1, and the Cartan-integer formula gives 1=⟨β,αi∨⟩=2mi+∑j≠imj⟨αj,αi∨⟩. The off-diagonal Cartan integers are nonpositive, so 2mi≥1 and the integer mi is positive; hence every mj≥1. Let θ be the highest root and write θ∨=∑jcjαj∨ with all cj>0 as in [F1]. By Existence and uniqueness of the highest root, (θ,αj)≥0 for every simple root. Since θ∨ is a positive scalar multiple of θ, this gives ⟨αj,θ∨⟩=2(αj,θ)/(θ,θ)≥0; at least one is positive because the simple roots span and θ≠0. Therefore β(θ∨)=∑jmj⟨αj,θ∨⟩>0. By [F1], ⟨ωi,θ∨⟩=ci=1, so λ(θ∨)=1−β(θ∨)<1. This is a nonnegative integer because λ is dominant integral and every cj>0; hence it is zero, all simple-coroot pairings of λ vanish, and λ=0. Thus β=ωi; since β was in Q+, this proves ωi∈Q before applying the root-lattice lemma.

2.3F3F4step 1.3algebra

(3)⇒(2): let μ be a weight of L(ω). By [F4] choose w∈W with λ:=wμ dominant; by step 1.3 and induction on a decomposition of w into simple reflections, λ is again a weight of L(ω), hence ω−λ∈Q+ by [F3]. Assumption (3) gives λ=ω, so μ=w−1ω∈Wω.

3.1F1F2step 1.1step 2.1step 2.2step 1.2algebra

Conclusion of (1)⇒(3): if the case of step 2.2 occurs, it gives λ=0 and β=ωi∈Q. The nonzero minuscule weight ωi has all coroot pairings bounded in absolute value by 1, so step 1.2 now applies and forces ωi=0, a contradiction. Together with step 2.1, this proves β=0 and λ=ωi=ω. If ω=0 and −λ=∑kmkαk∈Q+ with mk≥0, then (λ,λ)=−∑kmk(λ,αk)≤0 because λ is dominant; positive definiteness gives λ=0. This proves (1)⇒(3).

4.1F3step 3.1step 2.3step 1.4algebra∎

Consequences. Assume ω is minuscule. By (2) every weight of L(ω) lies in Wω, and by [F3] every element of Wω occurs with multiplicity exactly one; hence every weight space is one-dimensional (in particular at most one-dimensional), there are exactly ∣Wω∣ distinct weights, and ch⁡L(ω)=∑γ∈Wωeγ.

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

Tensor product with a minuscule representation

Statement

Assume the Axiom of Choice. Let ω∈Λ+ be a minuscule weight (Minuscule weights) of a finite-dimensional complex simple Lie algebra g, and let λ∈Λ+. Then L(ω)⊗L(λ)≅⨁γ∈WωL(λ+γ), where L(λ+γ) is read as 0 when λ+γ∉Λ+; equivalently the sum runs over those γ∈Wω with λ+γ dominant integral and each such summand occurs once. In characters, ch⁡(L(ω)⊗L(λ))=∑γ: λ+γ∈Λ+ch⁡L(λ+γ).

Facts & Assumptions

Given: AC, a minuscule weight ω∈Λ+, a dominant integral weight λ, the Weyl orbit Wω, and the alternation operator A with A(η)=∑w∈W(−1)ℓ(w)ewη in the completed character ring R (The Weyl alternation operator, The completed formal character ring).

[F1]

Orbit-sum character: ch⁡L(ω)=∑γ∈Wωeγ (Minuscule weights have exactly the Weyl orbit as their weights, Minuscule weights).

[F2]

Weyl character formula: A(ρ)ch⁡L(λ)=A(λ+ρ) and, for every η∈Λ+, A(ρ)ch⁡L(η)=A(η+ρ); formal characters are multiplicative on tensor products, A(ρ) is invertible in R, and in any finite-dimensional module the coefficients of the simple characters are their multiplicities. Every finite-dimensional g-module is completely reducible (The Weyl character formula, Formal characters are additive and multiplicative, Geometric series are invertible in the completed character ring, Tensor-product multiplicities are character structure constants, Weyl's complete reducibility theorem).

[F3]

Alternant vanishing on walls: if a reflection s∈W fixes η, then A(η)=0; equivalently A is skew-invariant, A(sη)=−A(η) for s a reflection, so A(η)=0 whenever η lies on a wall (Weyl alternants are skew-invariant, The Weyl alternation operator).

[F4]

For every γ∈Wω one has ⟨γ,α∨⟩≥−1 for every positive root α: by Minuscule weights the pairing of ω with every coroot lies in {−1,0,1}, and γ=wω with ⟨wω,α∨⟩=⟨ω,w−1α∨⟩, a pairing of ω with a coroot. If a weight η has ⟨η,αi∨⟩=−1 for a simple coroot, then ⟨η+ρ,αi∨⟩=0: the positive-root half-sum definition of ρ and the fact that si permutes the positive roots other than αi give siρ=ρ−αi and therefore ⟨ρ,αi∨⟩=1 (The Weyl vector rho for a chosen positive system, Finite Weyl positive roots and simple reflections). Hence η+ρ is fixed by si and lies on its wall (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights, Finite Weyl closed chambers and stabilizers).

Proof

1.1F1F2givenalgebra

By [F1], [F2] and multiplicativity, A(ρ)ch⁡(L(ω)⊗L(λ))=(∑γ∈Wωeγ)A(λ+ρ)=∑w∈W∑γ∈Wω(−1)ℓ(w)eγ+w(λ+ρ). For each fixed w, the map γ↦wγ permutes the orbit Wω, so the inner sum is unchanged when eγ is replaced by ewγ. Reindexing the finite double sum therefore gives ∑w∈W∑γ∈Wω(−1)ℓ(w)ew(λ+ρ+γ)=∑γ∈WωA(λ+γ+ρ).

1.2F2F3F4givenalgebra

Non-dominant translates vanish. Let γ∈Wω with λ+γ∉Λ+. Since λ∈Λ+ and by [F4] ⟨γ,α∨⟩≥−1 for every positive root, there is a simple coroot αi∨ with ⟨λ+γ,αi∨⟩<0; then ⟨λ+γ,αi∨⟩=−1, because ⟨λ,αi∨⟩≥0 and ⟨γ,αi∨⟩≥−1, and hence ⟨λ+γ+ρ,αi∨⟩=0. Thus λ+γ+ρ is fixed by the reflection si, and A(λ+γ+ρ)=0 by [F3].

2.1F1F2step 1.1step 1.2algebra

For a translate with λ+γ∈Λ+, A(λ+γ+ρ)=A(ρ)ch⁡L(λ+γ) by the character formula [F2]. Substituting these dominant terms and the vanishing terms of step 1.2 into step 1.1 gives A(ρ)ch⁡(L(ω)⊗L(λ))=A(ρ)∑γ: λ+γ∈Λ+ch⁡L(λ+γ). Cancelling the invertible element A(ρ) in the ring R [F2] gives the asserted character identity ch⁡(L(ω)⊗L(λ))=∑γ: λ+γ∈Λ+ch⁡L(λ+γ); the sum is finite because Wω is finite.

3.1F2step 2.1algebra∎

Decomposition. By Weyl complete reducibility, both finite-dimensional modules in the character identity of step 2.1 decompose as finite direct sums of the pairwise non-isomorphic simples L(ν). The right-hand side is finite because Wω is finite. Equality of their characters, together with the multiplicity-uniqueness clause of [F2], forces the multiplicities of each L(ν) to agree. This gives the asserted module isomorphism, with every surviving summand occurring once.

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

Polynomial representations of GL_r and their highest weights

Definition

Assume the Axiom of Choice. Let V be a finite-dimensional complex vector space of dimension r≥1 and put G=GL⁡(V); fixing a basis, identify G with GL⁡r(C) and let gij denote the matrix entries of g∈G. A finite-dimensional representation ρ ⁣:G→GL⁡(W) is polynomial if in some pair of bases (equivalently, in every pair of bases) the matrix coefficients of ρ are polynomial functions of the gij; it is rational if these coefficients are rational functions defined on all of G.

For the diagonal torus T={diag⁡(t1,…,tr):ti∈C×} a polynomial representation is a direct sum of weight spaces Wα={w∈W:ρ(t)w=tαw for all t∈T},α=(α1,…,αr)∈Zr,tα=t1α1⋯trαr, the eigenvalues α with Wα≠0 being the weights of W (Etingof §27.3; Goodman--Wallach Ch. 8 §8.1.2). A weight of a polynomial representation has nonnegative entries, α∈Z≥0r: the matrix coefficients are polynomial and t↦tα occurs as a polynomial character, so αi<0 is impossible. Consequently the highest weight of a polynomial irreducible representation of G (with respect to the Borel subgroup of upper triangular matrices) is a partition λ=(λ1≥⋯≥λr≥0) padded by zeros, that is, a partition with at most r parts (Partitions, English diagrams, and conjugation).

For every partition λ with ℓ(λ)≤r put n=∣λ∣ and let Sλ(V):=Hom⁡Sn(Sλ,V⊗n) be the Schur--Weyl module of Schur-Weyl decomposition and highest weights, where Sλ is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules) and Sn acts on V⊗n by place permutations (Commuting symmetric-group and linear actions on a tensor power). Then Sλ(V) is a nonzero polynomial irreducible representation of G of highest weight λ, and distinct partitions with at most r parts give non-isomorphic modules (Schur-Weyl decomposition and highest weights parts (1)--(4)). Conversely every polynomial irreducible representation of G is isomorphic to Sλ(V) for exactly one partition λ with ℓ(λ)≤r: this is the classical type-A highest-weight classification of polynomial representations (Etingof §27.3--27.4; Goodman--Wallach Theorem 5.5.22 for the corresponding rational classification; see Schur modules and their characters for the module notation used below).

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

Schur modules and their characters

Definition

Assume the Axiom of Choice. Let V=Cr with r≥1, and let λ be a partition with at most r parts (Partitions, English diagrams, and conjugation). Put n=∣λ∣ and define the Schur module Sλ(V):=Hom⁡Sn(Sλ,V⊗n), where Sλ is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules) and Sn acts on V⊗n by place permutations (Commuting symmetric-group and linear actions on a tensor power); the GL⁡(V)-action is by postcomposition, (g⋅φ)(s)=g⊗nφ(s). By Schur-Weyl decomposition and highest weights the space Sλ(V) is a nonzero irreducible polynomial GL⁡(V)-module of highest weight λ in the sense of Polynomial representations of GL_r and their highest weights; for a partition with ℓ(λ)>r we define Sλ(V):=0.

Let T={diag⁡(t1,…,tr)}⊆GL⁡(V) be the diagonal torus as in Polynomial representations of GL_r and their highest weights. The character of a finite-dimensional polynomial GL⁡(V)-module W is the polynomial ch⁡W=∑α∈Zrdim⁡Wα xα∈Z[x1,…,xr],xα=x1α1⋯xrαr, where Wα is the weight space of T. Characters are additive over direct sums, and ch⁡(W⊗W′)=ch⁡W⋅ch⁡W′ for finite-dimensional polynomial modules, because (W⊗W′)α=⨁β+γ=αWβ⊗Wγ′. The character of a polynomial module is a symmetric polynomial: conjugation by a permutation matrix gσ carries diag⁡(t1,…,tr) to diag⁡(tσ(1),…,tσ(r)), and characters of representations of a group are class functions, so ch⁡W is invariant under permuting x1,…,xr. In particular ch⁡Sλ(V) is a symmetric polynomial for ℓ(λ)≤r, homogeneous of degree n because the Schur--Weyl decomposition of Schur-Weyl decomposition and highest weights exhibits Sλ(V) as a direct summand of V⊗n, all of whose weights have total degree n; it is 0 for ℓ(λ)>r.

Remarks. The module Sλ(V) is the multiplicity space Mλ of Schur-Weyl decomposition and highest weights; the two notations denote the same object. The character ch⁡Sλ(V) is computed explicitly in Semistandard tableaux expand Schur characters as the sum over semistandard tableaux of shape λ with entries in {1,…,r}, and it is the rank-r Schur polynomial sλ(x1,…,xr) of Stable Schur functions from bialternants.

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

Semistandard tableaux expand Schur characters

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1 (Schur modules and their characters), and let λ be a partition with ℓ(λ)≤r (Partitions, English diagrams, and conjugation). Then ch⁡Sλ(V)=∑Txwt⁡(T), the sum over all semistandard tableaux T of shape λ with entries in {1,…,r}, where wt⁡(T)=(a1,…,ar) records the multiplicity of each entry (Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux). Moreover this polynomial is the rank-r Schur polynomial sλ(x1,…,xr) of Stable Schur functions from bialternants, i.e. sλ(x1,…,xr)=aλ+δr(x1,…,xr)aδr(x1,…,xr)=∑Txwt⁡(T) for ℓ(λ)≤r, while sλ(x1,…,xr):=0 and ch⁡Sλ(V)=0 when ℓ(λ)>r. In particular Sλ(V)≠0 if and only if ℓ(λ)≤r, and the multiplicity of the weight α in Sλ(V) equals the number of semistandard tableaux of shape λ and weight α; by Bender--Knuth involutions permute the weights of semistandard tableaux this polynomial is symmetric in x1,…,xr.

Facts & Assumptions

Given: AC, V=Cr with basis e1,…,er, a partition λ with n=∣λ∣ and ℓ(λ)≤r, and the module Sλ(V)=Hom⁡Sn(Sλ,V⊗n) of Schur modules and their characters.

[F1]

Schur--Weyl decomposition: V⊗n≅⨁μ⊢n, ℓ(μ)≤rSμ⊗Sμ(V) as (Sn×GL⁡(V))-modules, and for every μ with ℓ(μ)≤r the module Sμ(V) is a nonzero irreducible polynomial GL⁡(V)-module, while Sμ(V)=0 for ℓ(μ)>r (Schur-Weyl decomposition and highest weights parts (1) and (2), Polynomial representations of GL_r and their highest weights).

[F2]

Young's rule: for partitions λ,ν⊢n the multiplicity of the Specht module Sλ in the Young permutation module Mν equals the Kostka number Kλν, the number of semistandard tableaux of shape λ and weight ν (Young's rule for complex permutation modules, Young subgroups, tabloids, and permutation modules, Semistandard tableaux and Kostka numbers); the Specht modules Sλ, λ⊢n, form a complete set of pairwise non-isomorphic simple CSn-modules (Specht modules classify the complex irreducibles of Sn, Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

V⊗n has the basis of elementary tensors ei1⊗⋯⊗ein on which Sn acts by place permutations; the diagonal torus of GL⁡(V) acts on ei1⊗⋯⊗ein by the weight whose j-th component is the number of indices ik equal to j (Commuting symmetric-group and linear actions on a tensor power, Schur modules and their characters).

[F4]

At rank r the tableau expansion sλ(x1,…,xr)=∑Txwt⁡(T) holds over semistandard tableaux of shape λ with entries in {1,…,r} when ℓ(λ)≤r, and sλ(x1,…,xr)=0 when ℓ(λ)>r; the left-hand side is the bialternant quotient of Stable Schur functions from bialternants (Skew Jacobi–Trudi and tableau expansion with μ=∅).

[F5]

A homomorphism between non-isomorphic irreducible CSn-modules is zero. Also End⁡Sn(Sλ)=C: any endomorphism has an eigenvalue z over C, and its difference from zI has a nonzero kernel, so irreducibility makes that difference zero. Consequently the multiplicity of Sλ in a direct sum of simples equals the dimension of its Hom-space into that sum (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and End⁡G(V) is a division ring, Specht modules classify the complex irreducibles of Sn).

Proof

1.1F3givenconstruct

First fix a partition ν⊢n with at most r parts, padded by zeros to length r. By [F3] the weight-ν subspace Eν of V⊗n has as its basis the elementary tensors whose index word has content ν. The group Sn permutes these basis vectors by place permutations, and the action on the basis is transitive (any word with content ν is a rearrangement of 1ν1⋯rνr), with the stabilizer of a word of content ν being the subgroup of permutations preserving the letter classes, a conjugate of the Young subgroup Sν; hence Eν is isomorphic to the Young permutation module Mν (Young subgroups, tabloids, and permutation modules).

2.1F1F2step 1.1algebra

By Young's rule [F2] the multiplicity of the simple module Sλ in Eν≅Mν is the Kostka number Kλν, which by Semistandard tableaux and Kostka numbers is the number of semistandard tableaux of shape λ and weight ν.

3.1F1F2F5step 1.1step 2.1algebra

Compare the Sn-isotypic Sλ-component of V⊗n. By the Schur--Weyl decomposition [F1] and non-isomorphism of distinct Specht modules [F2], the Sλ-isotypic component of V⊗n is Sλ⊗Sλ(V), on which Sn acts on the first factor alone; therefore the Sλ-multiplicity in Eν equals dim⁡Sλ(V)ν, the dimension of the weight-ν space of the GL⁡(V)-module Sλ(V). Combined with step 2.1 this gives dim⁡Sλ(V)ν=Kλν=#{T: T semistandard of shape λ and weight ν}.

4.1F1F4F5step 3.1algebra

For an arbitrary weight α∈Z≥0r of total n, sort its entries into a partition ν. A permutation matrix carries the weight-α space of Sλ(V) isomorphically onto its weight-ν space, by conjugating the diagonal torus. The Bender--Knuth involutions of Bender--Knuth involutions permute the weights of semistandard tableaux likewise give a bijection between tableaux of weights α and ν; use a product of adjacent transpositions sorting α. Thus step 3.1 holds for every composition weight α, with Kλα denoting this tableau count. Summing these weight dimensions over all α and using the definition of the character of Schur modules and their characters gives ch⁡Sλ(V)=∑αKλαxα=∑Txwt⁡(T), summed over semistandard tableaux of shape λ with entries in {1,…,r}. By the tableau expansion of [F4] this equals sλ(x1,…,xr); the case ℓ(λ)>r is the vanishing definition Sλ(V)=0, matched by sλ(x1,…,xr)=0 in [F4]. In particular ch⁡Sλ(V)=0 exactly when ℓ(λ)>r or λ has no semistandard tableau with entries in {1,…,r}; the latter never happens for ℓ(λ)≤r (fill row i with the letter i), so Sλ(V)≠0 if and only if ℓ(λ)≤r, and the multiplicity of each weight α in Sλ(V) is the number of semistandard tableaux of shape λ and weight α.

5.1F4step 4.1algebra∎

The polynomial ∑Txwt⁡(T) is symmetric in x1,…,xr by Bender--Knuth involutions permute the weights of semistandard tableaux, consistently with sλ being the bialternant quotient, whose numerator and denominator are alternating and whose quotient is therefore a symmetric polynomial.

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

Littlewood--Richardson tableaux and coefficients

Definition

Let λ,ν be partitions with [λ]⊆[ν], and let μ be a partition with ∣ν∣=∣λ∣+∣μ∣. Use the conventions of Skew diagrams and semistandard skew tableaux for the skew diagram ν/λ and for semistandard skew tableaux of shape ν/λ, and those of Semistandard tableaux and Kostka numbers for the content of a tableau; recall that entries of a semistandard skew tableau weakly increase along rows and strictly increase down columns (Partitions, English diagrams, and conjugation fixes the English row and column coordinates).

The reading word w(T) of a semistandard skew tableau T of shape ν/λ is the word obtained by reading the rows of T from right to left, beginning with the top row and proceeding to the bottom row. The word w(T)=a1a2⋯aN is a lattice word (a lattice permutation) if in every prefix a1⋯ap and for every i≥1 the number of letters i in the prefix is at least the number of letters i+1; the empty word is a lattice word vacuously.

A Littlewood--Richardson tableau (LR tableau) of shape ν/λ and content μ is a semistandard skew tableau of shape ν/λ and content μ whose reading word is a lattice word. The Littlewood--Richardson coefficient cλμν∈Z≥0 is the number of LR tableaux of shape ν/λ and content μ; it is 0 when [λ]⊈[ν], when ∣ν∣≠∣λ∣+∣μ∣, or when no such tableau exists. For μ=∅ and ν=λ the empty skew tableau is the unique tableau of content ∅, its reading word is empty, and hence cλ∅λ=1; more generally cλμλ=0 unless μ=∅, and cλμν=0 unless λ⊆ν and ∣ν∣=∣λ∣+∣μ∣.

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

Bender--Knuth involutions permute the weights of semistandard tableaux

Statement

Fix r≥1 and a skew shape ν/λ (for a partition shape take λ=∅), let k∈{1,…,r−1}, and let T be a semistandard skew tableau of shape ν/λ with entries in {1,…,r} (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers). Call an entry k or k+1 of T free if there is no k+1 respectively no k in the same column. Then:

(i) the free positions in each row occupy consecutive cells of that row; (ii) replacing in every row the free k's and free k+1's by their complementary counts (if the row has ai free k's and bi free k+1's, then after the replacement it has bi free k's and ai free k+1's in the same free cells, the remaining entries unchanged, the free cells filled from left to right by the bi copies of k followed by the ai copies of k+1) produces again a semistandard skew tableau σk(T) of the same shape, with entries in {1,…,r}; (iii) σk is an involution of the set of semistandard skew tableaux of shape ν/λ with the same set of free positions, and wt⁡(σk(T))=skwt⁡(T), where sk is the transposition of k and k+1 acting on weights (Semistandard tableaux and Kostka numbers, with weights read as vectors in Zr).

Consequently, for every weight α∈Z≥0r the number of semistandard skew tableaux of shape ν/λ and weight α equals the number of weight skα, and the generating function ∑Txwt⁡(T), over semistandard skew tableaux of shape ν/λ with entries in {1,…,r}, is symmetric in x1,…,xr (Partitions, English diagrams, and conjugation).

Facts & Assumptions

Given: r≥1, a skew shape ν/λ with λ,ν partitions and [λ]⊆[ν], an index k∈{1,…,r−1}, and a semistandard skew tableau T of shape ν/λ with entries in {1,…,r}.

[F1]

A semistandard skew tableau fills the cells of the skew diagram ν/λ with positive integers, weakly increasing from left to right in each row and strictly increasing from top to bottom in each column; its weight is wt⁡(T)=(a1,…,ar) with ai the number of entries equal to i, and its monomial is xwt⁡(T) (Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux).

[F2]

The Young diagram [ν] consists of the cells (i,j) with 1≤i, 1≤j≤νi (English coordinates), and its columns are the j's with j≤νi, so a cell (i,c) belongs to ν/λ exactly when λi<c≤νi (Partitions, English diagrams, and conjugation, Skew diagrams and semistandard skew tableaux).

Proof

Given: r, ν/λ, k, T as above.

1.1F2givenalgebra

In a skew diagram, row i consists of the interval λi<c≤νi, and column c consists of the interval λ′c<i≤ν′c. Two rectangle-completion properties will be used. If (i,c),(i,c′),(i′′,c) are cells with i<i′′ and c′<c, then (i′′,c′) is a cell: λi′′≤λi<c′<c≤νi′′. If (i,c),(i,c′),(i′′,c) are cells with i′′<i and c<c′, then (i′′,c′) is a cell: λi′′<c<c′≤νi≤νi′′. These use the weakly decreasing row lengths of both partitions.

1.2F1givenalgebra

No column contains two free cells: a column contains at most one k and at most one k+1 by strict increase, a column containing a free k contains no k+1 at all (freely), and a column containing a free k+1 contains no k at all (freely); so a column cannot contain both a free k and a free k+1, and cannot contain two entries equal to the same letter. Consequently, in the modification of (ii) each column changes in at most one cell.

2.1F1F2givenstep 1.1algebra

Structure of the free cells of a row. Let (i,c) be a cell of T with entry k that is not free. Then some cell (i′′,c) of the same column has entry k+1; by strict increase of the column i′′>i. If (i,c′) is a cell of the same row with c′<c and entry k, then (i′′,c′) is a cell by step 1.1, and inside row i′′ one has T(i′′,c′)≤T(i′′,c)=k+1, while strictly increasing column c′ gives T(i′′,c′)>T(i,c′)=k; hence T(i′′,c′)=k+1 and (i,c′) is not free. So the non-free k's of a row form an initial segment of its block of k's, read from the left. Symmetrically, if the entry k+1 at (i,c) is not free, there is a cell (i′′,c) with i′′<i and entry k; for a cell (i,c′) with c′>c and entry k+1, step 1.1 makes (i′′,c′) a cell, and T(i′′,c′)≥T(i′′,c)=k by weak increase in row i′′ and T(i′′,c′)<T(i,c′)=k+1 by strict increase in column c′, so T(i′′,c′)=k and (i,c′) is not free. Hence the non-free k+1's of a row form a final segment of its block of k+1's. Since the entries of a row are weakly increasing, the cells carrying k precede those carrying k+1, and combining the two statements the unblocked cells carrying k (a final segment of the k-block) and those carrying k+1 (an initial segment of the k+1-block) form one consecutive block of cells of the row, proving (i).

3.1F1step 2.1step 1.2algebra

The modification produces a semistandard tableau. Rows: by step 2.1 the free cells of a row form consecutive cells, the entry immediately left of the block, if present, is a non-free k or a smaller letter, the entries of the block after the modification lie in {k,k+1} and are filled weakly increasingly, and the entry immediately right of the block, if present, is a non-free k+1 or a larger letter; so rows stay weakly increasing. Columns: by step 1.2 only one entry of a column can change. If a free k at (i,c) is replaced by k+1, then column c contains no k+1, so every entry above (i,c) is <k<k+1 and every entry below is >k+1, and strict increase persists; if a free k+1 is replaced by k, column c contains no entry k, so every entry above is <k and every entry below is >k+1>k, and strict increase persists. The entries stay in {1,…,r} because 1≤k<k+1≤r. This proves (ii).

4.1F1step 2.1step 1.2step 3.1algebra

Involution and weight. The modification is reversible: it is performed on the free cells, and by step 1.2 the free cells of σk(T) are the same cells (a cell that was free remains the only cell of its column with an entry in {k,k+1}, hence remains free), while every other cell is unchanged, so no free cell is created or destroyed. Hence σk is an involution with the same free cells. For the weight, let Ak and Ak+1 be the numbers of entries equal to k and to k+1 in T, and let a=∑iai, b=∑ibi be the total numbers of free k's and free k+1's. The non-free k's are in bijection with the non-free k+1's: send a non-free k to the unique k+1 below it in its column (existence is the definition of non-free, uniqueness is strict increase in the column, and the image is non-free because its column contains that k); the inverse sends a non-free k+1 to the unique k above it. Hence Ak−a=Ak+1−b. The modification deletes the a free k's and b free k+1's and inserts b copies of k and a copies of k+1 in their place, so the number of k's in σk(T) is Ak−a+b=Ak+1=(skwt⁡T)k and the number of k+1's is Ak+1−b+a=Ak=(skwt⁡T)k+1, all other letter counts being unchanged. Thus wt⁡(σk(T))=skwt⁡(T).

5.1F1step 3.1step 4.1algebra∎

Consequences. By step 3.1 and 4.1, σk is a weight-sk-equivariant involutive bijection of the set of semistandard skew tableaux of shape ν/λ with entries in {1,…,r}; hence it restricts to a bijection between the tableaux of weight α and those of weight skα, so those two sets have the same cardinality. Consequently the generating function G(x1,…,xr)=∑Txwt⁡(T) satisfies G=∑Txskwt⁡(T), which is G with xk and xk+1 interchanged; thus G is invariant under each adjacent transposition of the variables. Every permutation of {1,…,r} is a product of adjacent transpositions (bubble-sort any ordering), so G is invariant under all permutations of the variables, that is, symmetric.

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

The admissible-tableau count equals the Littlewood--Richardson coefficient

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1, and let λ,μ be partitions with ℓ(λ),ℓ(μ)≤r. Write ρr=(r−1,r−2,…,0), aη=det⁡(xiηj)1≤i,j≤r, and sμ=∑Txwt⁡(T) over semistandard tableaux of shape μ with entries in {1,…,r} (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants). Say that a semistandard tableau T of shape μ with entries in {1,…,r} is admissible for λ if λ+wt⁡(T≥j) is a partition with at most r parts for every j≥1, where T≥j is the subtableau consisting of the entries in columns j,j+1,…. Then:

(i) (bi-alternant expansion) aλ+ρrsμ=∑T admissibleaλ+wt⁡(T)+ρr,equivalentlysλsμ=∑T admissiblesλ+wt⁡(T), the second identity obtained by dividing by aρr and using ℓ(λ+wt⁡(T))≤r for admissible T.

(ii) For every partition ν with ℓ(ν)≤r, the number of admissible tableaux T of shape μ with λ+wt⁡(T)=ν equals the number of Littlewood--Richardson tableaux of shape ν/λ and content μ, namely the Littlewood--Richardson coefficient cλμν (Littlewood--Richardson tableaux and coefficients). This count identity is the classical Littlewood--Richardson comparison; it is cited to Macdonald §I.9, (9.2)--(9.4), whose Littlewood--Robinson algorithm proves it. No bijection between the two tableau sets is asserted here. Moreover the multiplicity of Sν(V) in the polynomial GL⁡(V)-module Sλ(V)⊗Sμ(V) equals cλμν, because the character of that tensor product is ch⁡Sλ(V)ch⁡Sμ(V)=sλsμ (Schur modules and their characters) and the multiplicities are read off from the expansion in the basis sν of characters of pairwise non-isomorphic simple modules (Schur-Weyl decomposition and highest weights parts (2) and (3)).

Facts & Assumptions

Given: AC, r≥1, partitions λ,μ with ℓ(λ),ℓ(μ)≤r, the alternants aη and the bialternant Schur polynomials sη at rank r, and the set of semistandard tableaux of shape μ with entries in {1,…,r}.

[F1]

sμ=∑Txwt⁡(T) over semistandard tableaux of shape μ with entries in {1,…,r}, and this polynomial is symmetric in x1,…,xr; for a partition η with ℓ(η)≤r one has the bialternant formula sη=aη+ρr/aρr (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, Skew Jacobi–Trudi and tableau expansion).

[F2]

Bender--Knuth involutions: for k∈{1,…,r−1} there is an involution σk of the set of semistandard tableaux of shape μ with entries in {1,…,r}, obtained by complementing the counts of free k's and free k+1's in each row, with wt⁡(σk(T))=skwt⁡(T); consequently ∑Txwt⁡(T) is invariant under exchanging xk and xk+1, hence symmetric (Bender--Knuth involutions permute the weights of semistandard tableaux); moreover awη=sgn⁡(w)aη for every w∈Sr and every exponent vector η, since aη is the determinant det⁡(xiηj). A k or k+1 of a subtableau T<j is free in T<j exactly when it is free in T, because a column of a skew tableau consists of all cells of T with that column index.

[F3]

The tensor product M=Sλ(V)⊗Sμ(V) is a direct summand of V⊗(∣λ∣+∣μ∣): each factor is a direct summand of its tensor power by Schur--Weyl decomposition, and tensoring the inclusions and retractions gives a retraction onto M. That larger tensor power is a finite direct sum of the simple Schur modules by Schur-Weyl decomposition and highest weights. A direct summand is again a direct sum of these simples: Schur's lemma makes its equivariant idempotent act by a scalar matrix on each isotypic multiplicity space; each scalar matrix is an idempotent and its image is a vector space of copies of the same simple (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and End⁡G(V) is a division ring; scalarity follows by applying the nonzero-kernel argument to an eigenvalue). The Schur characters at rank r are linearly independent: multiply a finite relation by aρr; the strictly decreasing exponent vector ν+ρr occurs in aη+ρr exactly when η=ν, with coefficient one. Thus character coefficients in a Schur expansion of M are its direct-summand multiplicities (Schur modules and their characters, Stable Schur functions from bialternants).

[F4]

The classical Littlewood--Richardson theorem expands the product sλsμ in the Schur basis with coefficient cλμν equal to the number of semistandard skew tableaux of shape ν/λ, content μ, and lattice reading word, as defined in Littlewood--Richardson tableaux and coefficients. Macdonald's complete Littlewood--Robinson proof in §I.9 establishes this count formula; this item imports that theorem and makes no bijection claim between those tableaux and the admissible tableaux of part (i).

Proof

1.1F1givenalgebra

First identity. Since sμ is symmetric by [F1] and w acts on monomials by w(xα)=xwα, for every w∈Sr one has xw(λ+ρr)sμ=w(xλ+ρrsμ)=∑Txw(λ+ρr+wt⁡(T)). Multiplying by sgn⁡(w), summing over w, and using aη=∑wsgn⁡(w)xwη gives aλ+ρrsμ=∑Taλ+ρr+wt⁡(T).

1.2F1F2givenalgebra

The bad guys cancel. Call T bad if λ+wt⁡(T≥j) fails to be a partition for some j≥1; equivalently λk+wt⁡(T≥j)k<λk+1+wt⁡(T≥j)k+1 for some pair (k,j). Among the pairs (k,j) with j maximal and then k minimal, one has: λ+wt⁡(T>j) is a partition (by maximality of j), the difference wt⁡(T≥j)k−wt⁡(T≥j)k+1 changes by at most one when passing from T>j to T≥j, and hence column j contains a k+1 and no k, with λk+wt⁡(T≥j)k+1=λk+1+wt⁡(T≥j)k+1. Let T∗ be obtained from T by applying the Bender--Knuth involution σk to the subtableau T<j and leaving the rest unchanged. This is well defined and involutive: by the last sentence of [F2] the free cells of T<j are the free cells of T lying in columns <j, so the modification swaps the counts of free k's and free k+1's in each row of T<j; row weak increase within T<j follows from the Bender--Knuth lemma. Across its boundary, only a k changed to k+1 could cause a problem. But column j contains no k, so a boundary neighbour in that column which was at least k is at least k+1. Hence it remains at least the changed entry (Bender--Knuth involutions permute the weights of semistandard tableaux); column strictness is preserved because each column changes in at most one cell, as in the proof of Bender--Knuth involutions permute the weights of semistandard tableaux. Moreover (T∗)≥j=T≥j, so T∗ is bad again, and the same pair (k,j) is selected for T∗: the violation tests at all levels j′≥j are unchanged, so j is still maximal; and the test at level j is unchanged, so k is still minimal. Hence applying σk to T<j∗=σk(T<j) returns T, and T↦T∗ is an involution of the set of bad guys.

2.1F1F2step 1.1step 1.2algebra

Cancellation. By [F2], wt⁡(T<j∗)=skwt⁡(T<j) and wt⁡(T≥j∗)=wt⁡(T≥j). The equality in step 1.2 says that sk fixes λ+wt⁡(T≥j)+ρr, so sk(λ+wt⁡(T)+ρr)=λ+wt⁡(T∗)+ρr. Since awη=sgn⁡(w)aη [F2] and the transposition sk is odd, aλ+wt⁡(T∗)+ρr=ask(λ+wt⁡(T)+ρr)=−aλ+wt⁡(T)+ρr, so the paired terms cancel; if T=T∗, its alternant equals its negative and is zero over Z in the sum of step 1.1. The bad guys therefore contribute 0, and the surviving tableaux are exactly the admissible ones, proving the first identity of (i).

3.1F1step 2.1algebra

Second identity. For admissible T the vector λ+wt⁡(T) is a partition with at most r parts (take j=1), so by the bialternant formula [F1] aλ+wt⁡(T)+ρr=aρrsλ+wt⁡(T). Substituting into step 2.1 and cancelling the nonzero polynomial aρr gives sλsμ=∑T admissiblesλ+wt⁡(T).

4.1F4step 3.1algebra

The admissible-tableau count is the LR coefficient. By step 3.1, the coefficient of sν in sλsμ is the number of admissible tableaux T with λ+wt⁡(T)=ν. The Littlewood--Richardson theorem [F4] says that this same Schur coefficient is cλμν, the number of LR tableaux of shape ν/λ and content μ. Thus the two counts agree.

5.1F1F3step 3.1step 4.1algebra∎

Tensor multiplicities. Combining steps 3.1 and 4.1, the coefficient of sν in sλsμ is cλμν for every partition ν with ℓ(ν)≤r. Since ch⁡(Sλ(V)⊗Sμ(V))=sλsμ and this tensor product is completely reducible with linearly independent Schur characters [F3], the multiplicity of Sν(V) in Sλ(V)⊗Sμ(V) is the coefficient of sν, namely cλμν; the terms with ℓ(ν)>r do not occur because Sν(V)=0 there.

Remarks

Source note. The admissible-tableau/LR-tableau count identity in step 4.1 is imported from the complete Littlewood--Robinson proof in Macdonald §I.9; the exact equation locator remains in the source metadata. Stembridge, printed p. 3, records the comparison as an exercise. The finite checks in the Step 3b report are corroboration only; no explicit bijection is claimed or used.

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

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.

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

The horizontal Pieri rule

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1, let λ be a partition with ℓ(λ)≤r and let d≥0. Then Sλ(V)⊗Sym⁡d(V)≅⨁νSν(V), the sum over those partitions ν of ∣λ∣+d with ℓ(ν)≤r and [λ]⊆[ν] for which the skew diagram ν/λ is a horizontal strip (at most one box in each column, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently sλhd=∑ν/λ horizontalsν in the rank-r Schur basis, where Sym⁡d(V) is the d-th symmetric power (Symmetric and exterior powers over an arbitrary field).

Facts & Assumptions

Given: AC, V=Cr, a partition λ with ℓ(λ)≤r and an integer d≥0.

[F1]

For d>0, the one-row Specht module S(d) is trivial: its tabloid module has one basis element and all column stabilizers are trivial. Thus S(d)(V)≅(V⊗d)Sd. This is isomorphic to the quotient symmetric power of Symmetric and exterior powers over an arbitrary field: the averaging operator P=d!−1∑σ∈Sdσ annihilates every coinvariance relation and induces the inverse to the quotient map restricted to invariants, because q(Pt)=q(t) and P fixes invariant tensors. These maps commute with GL⁡(V) (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For d=0, use the empty partition in place of (d); its Schur module, V⊗0 and Sym⁡0V are all C.

[F2]

Littlewood--Richardson rule: for partitions λ,μ with ℓ(λ),ℓ(μ)≤r, Sλ(V)⊗Sμ(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλμν, with cλμν the number of LR tableaux of shape ν/λ and content μ, and cλμν=0 unless λ⊆ν and ∣ν∣=∣λ∣+∣μ∣ (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).

[F3]

A semistandard skew tableau of shape ν/λ and content (d) has all its entries equal to 1; weak increase along rows is automatic, and strict increase down columns forces every column of ν/λ to contain at most one box, so such a tableau exists if and only if ν/λ is a horizontal strip, and then it is unique; its reading word is the constant word 1 1⋯1, a lattice word (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).

[F4]

The complete symmetric polynomial hd=∑1≤i1≤⋯≤id≤rxi1⋯xid equals s(d) by the one-row tableau expansion (and h0=s∅=1), and the Schur polynomials sν, ℓ(ν)≤r, are linearly independent: after multiplying a finite relation by aδr, the coefficient of the strictly decreasing exponent vector ν+δr is exactly that relation’s coefficient of sν (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).

Proof

1.1F1F2givenalgebra

Apply the Littlewood--Richardson rule [F2] with μ=(d) for d>0 and μ=∅ for d=0, and use S(d)(V)=Sym⁡d(V) from [F1]: Sλ(V)⊗Sym⁡d(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλ,(d)ν.

2.1F2F3step 1.1algebra

For d=0, the unique empty tableau gives the single summand ν=λ. For d>0, the coefficient cλ,(d)ν counts LR tableaux of shape ν/λ and content (d); by [F3] this number is 1 when ν/λ is a horizontal strip and 0 otherwise, and it vanishes unless λ⊆ν and ∣ν∣=∣λ∣+d by [F2]. Substituting into step 1.1 gives the direct-sum decomposition, the sum being over precisely those horizontal strips.

3.1F1F4step 1.1step 2.1algebra∎

Taking characters in step 2.1 and using ch⁡Sν(V)=sν(x1,…,xr) and ch⁡Sym⁡d(V)=hd [F4] gives sλhd=∑ν/λ horizontalsν in the rank-r Schur basis; the two displayed statements are equivalent by the linear independence of the Schur characters [F4].

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

The vertical Pieri rule

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1, let λ be a partition with ℓ(λ)≤r and let d≥0. Then Sλ(V)⊗Λd(V)≅⨁νSν(V), the sum over those partitions ν of ∣λ∣+d with ℓ(ν)≤r and [λ]⊆[ν] for which the skew diagram ν/λ is a vertical strip (at most one box in each row, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently sλed=∑ν/λ verticalsν in the rank-r Schur basis, where Λd(V) is the d-th exterior power (Symmetric and exterior powers over an arbitrary field).

Facts & Assumptions

Given: AC, V=Cr with basis e1,…,er, a partition λ with ℓ(λ)≤r, and an integer d≥0.

[F1]

The one-column Specht module S(1d) is the sign representation: its column stabilizer is all of Sd, and the signed sum of its distinct tabloids spans a line on which every permutation acts by its sign. Therefore S(1d)(V) is the subspace of alternating tensors. It is isomorphic to the quotient exterior power in Symmetric and exterior powers over an arbitrary field via v1∧⋯∧vd↦d!−1∑σ∈Sdsgn⁡(σ)σ(v1⊗⋯⊗vd). The displayed multilinear map vanishes when two inputs agree (pair permutations by their transposition), so it factors through the quotient. Conversely the quotient of this signed average is the original wedge, since a transposition changes a wedge's sign by expanding a repeated input u+v; the signed average fixes every alternating tensor. These are inverse equivariant maps (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For d=0, (10) means ∅ and both spaces are C; for d>r both spaces vanish (If k>dim⁡V, then ΛkV=0).

[F2]

Littlewood--Richardson rule: for partitions λ,μ with ℓ(λ),ℓ(μ)≤r, Sλ(V)⊗Sμ(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλμν, where cλμν is the number of LR tableaux of shape ν/λ and content μ, vanishing unless λ⊆ν and ∣ν∣=∣λ∣+∣μ∣ (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).

[F3]

Let U be a semistandard skew tableau of shape ν/λ and content (1d), i.e. with entries 1,2,…,d each occurring once. Its reading word w(U) is a permutation of 1,…,d; it is a lattice word exactly when w(U)=1 2⋯d, because the first letter of a lattice word of content (1d) must be 1, and inductively the k-th letter must be k. If ν/λ contains two boxes in the same row, at columns c<c′, then the right cell is read before the left cell in the reading order, while semistandardness gives the strictly smaller entry on the left, so in the reading word the larger entry T(i,c′) precedes the smaller entry T(i,c) and the word is not 1 2⋯d. Hence an LR tableau of content (1d) exists only if ν/λ is a vertical strip; conversely, if ν/λ is a vertical strip, filling the boxes with 1,2,…,d in the order in which they are read (equivalently, from top row to bottom row, since each row has at most one box) makes every column strictly increasing downward and gives the reading word 1 2⋯d, so the filling is the unique LR tableau of shape ν/λ and content (1d) (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).

[F4]

The elementary symmetric polynomial ed=∑1≤i1<⋯<id≤rxi1⋯xid equals s(1d) by the one-column tableau expansion; e0=1 and ed=0 for d>r. It is the character of ΛdV, and the Schur characters sν, ℓ(ν)≤r, are linearly independent (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).

Proof

1.1F1F2givenalgebra

If d>r, the tensor product is zero by [F1], and the proposed sum is empty because a vertical strip inside at most r rows has at most r boxes. For 0≤d≤r, apply the Littlewood--Richardson rule [F2] with μ=(1d) and use S(1d)(V)=ΛdV from [F1]: Sλ(V)⊗Λd(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλ,(1d)ν.

2.1F1F2F3step 1.1algebra

By [F3] the coefficient cλ,(1d)ν is 1 when ν/λ is a vertical strip and 0 otherwise, and it vanishes unless λ⊆ν and ∣ν∣=∣λ∣+d by [F2]. Substituting into step 1.1 gives the decomposition, summed over precisely the vertical strips; for d>r the left-hand side is zero by [F1], and indeed a vertical strip ν/λ of size d inside the rank-r page has ℓ(ν)≤r<d, which is impossible with ∣ν/λ∣=d boxes at most one per row.

3.1F1F4step 1.1step 2.1algebra∎

Taking characters in step 2.1 and using ch⁡Sν(V)=sν and ch⁡ΛdV=ed [F4] gives sλed=∑ν/λ verticalsν in the rank-r Schur basis, the two statements being equivalent by the linear independence of the Schur characters [F4].

PropositionStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Determinant twists translate GL_r highest weights

Statement

Assume the Axiom of Choice. Let V=Cr as in Schur modules and their characters, and let det⁡ ⁣:GL⁡(V)→C× be the determinant character. Write λj=0 for j>ℓ(λ) when using row-length coordinates; these zeros are not parts.

(i) For every partition λ with ℓ(λ)≤r and every integer k≥−λr, let λ+(kr) denote the partition obtained from (λ1+k,…,λr+k) by deleting all trailing zeros; the all-zero tuple gives ∅ (Partitions, English diagrams, and conjugation). Then one has Sλ+(kr)(V)≅Sλ(V)⊗det⁡k as rational GL⁡(V)-modules, where det⁡k for k<0 is the ∣k∣-fold tensor power of the dual of the one-dimensional module det⁡=ΛrV (On ΛnV, the induced map ΛnT is multiplication by det⁡T, Determinant multiplicativity follows from the top exterior power).

(ii) Consequently the irreducible rational representations of GL⁡(V) are, up to isomorphism, exactly the twists Sλ(V)⊗det⁡k with λ a partition of at most r parts and k∈Z; the irreducible rational representation of highest weight η=(η1≥⋯≥ηr)∈Zr is Sηˉ(V)⊗det⁡ηr, where ηˉ is obtained from (η1−ηr,…,ηr−ηr) by deleting all trailing zeros, again giving ∅ if every coordinate is zero.

Facts & Assumptions

Given: AC, V=Cr, the diagonal torus and its characters xα, the one-dimensional determinant module det⁡=ΛrV with character x1⋯xr, the Laurent character ring Z[x1±1,…,xr±1] in which characters of rational GL⁡(V)-modules are expanded, and the Schur modules Sλ(V) (Schur modules and their characters, On ΛnV, the induced map ΛnT is multiplication by det⁡T).

[F1]

ch⁡Sλ(V)=sλ(x1,…,xr) for ℓ(λ)≤r and Sλ(V)=0 for ℓ(λ)>r; characters of finite-dimensional rational modules are additive over direct sums and multiplicative over tensor products, and the character of det⁡k is (x1⋯xr)k for every k∈Z (Semistandard tableaux expand Schur characters, Schur modules and their characters, On ΛnV, the induced map ΛnT is multiplication by det⁡T, Determinant multiplicativity follows from the top exterior power).

[F2]

Bialternant description: for a partition η with ℓ(η)≤r, sη(x1,…,xr)=aη+ρr/aρr with ρr=(r−1,…,0) and aζ=det⁡(xiζj) (Stable Schur functions from bialternants).

[F3]

Classification of irreducible rational representations: the irreducible rational GL⁡(V)-modules are exactly the modules Sλ(V)⊗det⁡k with ℓ(λ)≤r, k∈Z, and the highest weight of Sλ(V)⊗det⁡k is λ+k(1r); two irreducible rational modules with the same highest weight are isomorphic (Goodman--Wallach Theorem 5.5.22; Seynnaeve §12.1 Proposition 12.1). Every Sλ(V) is a polynomial irreducible of highest weight λ (Polynomial representations of GL_r and their highest weights).

Proof

1.1F2givenalgebra

Determinant scaling of the alternant. Put τ=λ+(kr) with the zero-removal convention in (i). Since k≥−λr, the shifted coordinates are weakly decreasing and nonnegative, so τ is a partition with at most r parts. After padding its coordinates back to length r, τj=λj+k. Thus every entry in row i of the alternant matrix for λ+ρr is multiplied by xik to obtain the matrix for τ+ρr, giving aτ+ρr=(x1⋯xr)kaλ+ρr. Dividing by aρr in the Laurent rational function field and applying [F2] yields sτ(x1,…,xr)=(x1⋯xr)ksλ(x1,…,xr). This identity is valid also for negative k; the left side is a polynomial because the shifted coordinates are nonnegative.

2.1F1F3step 1.1algebra

By [F1] and step 1.1, ch⁡(Sλ(V)⊗det⁡k)=sλ(x)(x1⋯xr)k=sτ(x)=ch⁡Sτ(V). Tensoring with the one-dimensional character det⁡k preserves invariant subspaces: each representing operator is multiplied by a nonzero scalar. Hence Sλ(V)⊗det⁡k is irreducible, and its highest weight is (λ1+k,…,λr+k), since a highest weight vector is multiplied on the diagonal torus by (x1⋯xr)k and det⁡k is trivial on the upper unipotent subgroup. The polynomial irreducible Sτ(V) has the same padded highest weight by [F3]. Highest-weight uniqueness in [F3] gives the isomorphism in (i).

3.1F3step 2.1algebra∎

By [F3] every irreducible rational module is Sλ(V)⊗det⁡k for a partition λ of at most r parts and k∈Z, and conversely each such twist is irreducible of highest weight (λ1+k,…,λr+k). For a dominant integral highest weight η, take k=ηr and form ηˉ by deleting the trailing zeros of (η1−ηr,…,ηr−ηr). This is a partition, including ∅ when all coordinates vanish, and its padded coordinates satisfy ηˉj+k=ηj. Thus Sηˉ(V)⊗det⁡ηr has highest weight η and is the required irreducible by [F3]. The parametrisation with padded last coordinate λr=0 is unique: then k=ηr and the remaining positive coordinates determine λ. Arbitrary pairs (λ,k) need not be unique.

PropositionStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources