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.

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.

Depends on

Used by

Dependency tree · two levels

55 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