Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

Schur-Weyl decomposition and highest weights

Statement

Let V be a finite-dimensional complex vector space of dimension d≥0, let n≥0, and let E:=V⊗n carry the commuting left place action of Sn and diagonal action of GL⁡(V) (Commuting symmetric-group and linear actions on a tensor power). Let B:=span⁡C{g⊗n:g∈GL⁡(V)}, and for λ⊢n put Mλ:=Hom⁡Sn(Sλ,E), on which GL⁡(V) acts by postcomposition (g⋅ψ)(s):=g⊗nψ(s) and B acts by b⋅ψ:=b∘ψ. Then:

  1. (Decomposition.) There is an isomorphism of (Sn×GL⁡(V))-modules E≅⨁λ⊢n, ℓ(λ)≤dSλ⊗Mλ, where Sn acts on the first factor and trivially on Mλ and GL⁡(V) acts on Mλ by postcomposition and trivially on Sλ. The sum runs over exactly the partitions λ⊢n with at most d rows.
  2. (Nonzero irreducible factors.) For every λ⊢n with ℓ(λ)≤d the space Mλ is nonzero and irreducible as a module over B by postcomposition, hence also irreducible as a GL⁡(V)-module and as a gl(V)-module under x↦Δ(x) (Irreducible, completely reducible, and faithful representations); for ℓ(λ)>d one has Mλ=0.
  3. (Pairwise inequivalence of the nonzero factors.) If λ≠μ are partitions of n with ℓ(λ)≤d and ℓ(μ)≤d, then Mλ and Mμ are non-isomorphic as B-modules, as GL⁡(V)-modules and as gl(V)-modules. Thus the nonzero factors in the decomposition of claim 1 are pairwise inequivalent, and a nonzero Mλ is not isomorphic to a zero Mμ with ℓ(μ)>d because their dimensions differ; no assertion is made about two zero factors.
  4. (Highest weight λ.) For every λ⊢n with ℓ(λ)≤d, writing λi:=0 for i>ℓ(λ), the module Mλ has highest weight λ with respect to the Borel of upper triangular matrices: it contains a nonzero vector φ with Δ(Eii)∘φ=λiφ for all i and Δ(Eij)∘φ=0 for all i<j, and every nonzero ψ∈Mλ killed by all raising operators Δ(Eij), i<j, and satisfying Δ(Eii)∘ψ=μiψ for scalars μ1,…,μd satisfies μ=λ and lies in Cφ.
  5. (Homogeneous polynomial module of degree n.) Fix a basis e1,…,ed of V and write gej=∑igijei for the matrix entries of g∈GL⁡(V). For every λ⊢n with ℓ(λ)≤d and every basis of Mλ, each matrix coefficient g↦⟨ψ∗,g⋅ψ⟩ of the action on Mλ is a homogeneous polynomial of degree n in the entries gij.

All statements are over C.

Facts & Assumptions

Given: a finite-dimensional complex vector space V of dimension d, an integer n≥0, the module E=V⊗n with its place Sn-action and diagonal GL⁡(V)-action, the algebra B=span⁡C{g⊗n}, and the spaces Mλ=Hom⁡Sn(Sλ,E) with the postcomposition actions.

[F1]

The place action σ⋅(v1⊗⋯⊗vn)=vσ−1(1)⊗⋯⊗vσ−1(n) and the diagonal action g⊗n(v1⊗⋯⊗vn)=gv1⊗⋯⊗gvn are well-defined linear actions that commute with each other, E=C for n=0, the assignment Δ(X)=∑a=1n1⊗(a−1)⊗X⊗1⊗(n−a) is linear in X, and if e1,…,ed is a basis of V then the assignment (v1,…,vn)↦v1⊗⋯⊗vn is multilinear, so g⊗n is computed on basis tensors by expanding each factor (Commuting symmetric-group and linear actions on a tensor power, Finite iterated tensor products represent multilinear maps independently of parenthesization).

[F2]

The dn elementary tensors ea1⊗⋯⊗ean form a basis of E (The elementary tensors of two bases form the product basis of the tensor product).

[F4]

The modules {Sλ:λ⊢n} form a complete irredundant list of the finite-dimensional irreducible complex Sn-representations (Specht modules classify the complex irreducibles of Sn, Column antisymmetrizers, polytabloids, and Specht modules).

[F5]

For a finite-dimensional completely reducible representation U of Sn the isotypic components U(λ), the sums of all irreducible subrepresentations isomorphic to Sλ, are defined and satisfy U=⨁λ⊢nU(λ) with the decomposition independent of choices; each U(λ) is a direct sum of copies of Sλ (The isotypic component of a completely reducible representation, The isotypic decomposition of a completely reducible representation is unique).

[F6]

If U is a finite-dimensional Sλ-isotypical Sn-module and Nλ=Hom⁡Sn(Sλ,U), then evaluation EU:Sλ⊗Nλ→U, s⊗f↦f(s), is an Sn-isomorphism; if U,U′ are such modules, every Sn-map U→U′ is uniquely EU′(1⊗a)EU−1 for a linear a:Nλ→Nλ′, and these identifications preserve composition (Isotypical evaluation and multiplicity subspaces).

[F7]

A nonzero Sn-intertwiner between irreducible complex Sn-representations is an isomorphism, and every endomorphism of an irreducible complex representation is a scalar (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and End⁡G(V) is a division ring, Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).

[F8]

B is a unital C-subalgebra of End⁡(E) equal to the centralizer End⁡Sn(E) of the place action, and B is also the unital subalgebra generated by {Δ(T):T∈End⁡(V)} (The Schur-Weyl mutual centralizer theorem on tensor powers).

[F9]

For every λ⊢n one has Hom⁡Sn(Sλ,E)≠0 if and only if ℓ(λ)≤d (Column antisymmetrization gives the exact Schur–Weyl length cutoff).

[F10]

Assume ℓ(λ)≤d and let t be a λ-tableau. The row-labelled map Φ:Mλ→E, Φ(σ⋅{t})=σ⋅wt with wt carrying er(a) in the place labelled a, restricts to a nonzero φ=Φ∣Sλ∈Mλ with Δ(Eii)∘φ=λiφ for all i (where λi:=0 for i>ℓ(λ)) and Δ(Eij)∘φ=0 for all i<j; and if Mλ is irreducible over B by postcomposition, then every nonzero ψ∈Mλ with Δ(Eij)∘ψ=0 for all i<j and Δ(Eii)∘ψ=μiψ for scalars μi satisfies μ=λ and ψ∈Cφ (The row-labelled polytabloid map has highest weight lambda).

[F11]

Let r≥1, let every mi≥1 and let every Di be a division ring. Every simple left module over R=∏i=1rMmi(Di) is supported on exactly one factor and is isomorphic to that factor's column module Dimi, these column modules representing all simple left R-module isomorphism classes, one per factor (Simple modules over a product of matrix rings over division rings).

[F12]

A subspace of a gl(V)-module is a submodule when it is stable under Δ(x) for every x∈gl(V); the module is irreducible when it is nonzero and has no proper nonzero submodule (Irreducible, completely reducible, and faithful representations).

Proof

technique · constructive
1.1F3F4F5F6constructalgebra

[construct] By [F3] the Sn-module E is completely reducible, so by [F5] and [F4] its isotypic decomposition E=⨁λ⊢nEλ over the classes Sλ is defined and unique, with Eλ a (possibly zero) direct sum of copies of Sλ. If ψ:Sλ→E is Sn-linear, then ker⁡ψ is a submodule of the irreducible Sλ, so ψ=0 or ψ is injective with image isomorphic to Sλ, hence contained in Eλ; therefore Hom⁡Sn(Sλ,E)=Hom⁡Sn(Sλ,Eλ)=Mλ. Applying [F6] to the isotypical module Eλ gives an Sn-isomorphism Sλ⊗Mλ→Eλ, s⊗ψ↦ψ(s), so dim⁡CEλ=dim⁡CSλ⋅dim⁡CMλ and Eλ=0 if and only if Mλ=0.

1.2givenF1constructalgebra

Fix a basis s1,…,sk of Sλ and consider the evaluation map ev:Mλ→Ek, ψ↦(ψ(s1),…,ψ(sk)). It is C-linear and injective, because an Sn-linear map is determined by its values on a basis; and it intertwines the postcomposition action on Mλ with the componentwise diagonal action on Ek, since (g⋅ψ)(sl)=g⊗nψ(sl) for every l.

1.3F1F2algebra

Fix the basis e1,…,ed of V and write gej=∑igijei. By the multilinearity of the tensor product in [F1], for all b1,…,bn∈{1,…,d} one has g⊗n(eb1⊗⋯⊗ebn)=(geb1)⊗⋯⊗(gebn)=∑a1,…,an(∏l=1ngalbl)ea1⊗⋯⊗ean; hence each matrix entry of g⊗n in the elementary tensor basis [F2] is either 0 or a monomial ∏l=1ngalbl of degree n in the entries gij.

2.1givenF1F6step 1.1algebra

The evaluation isomorphism of step 1.1 intertwines the postcomposition action of GL⁡(V) on Mλ with the diagonal action on Eλ: for g∈GL⁡(V), s∈Sλ and ψ∈Mλ one has Eλ(s⊗g⋅ψ)=(g⋅ψ)(s)=g⊗nψ(s)=g⊗nEλ(s⊗ψ). It also intertwines the action of Sn, which is ρλ⊗id because Eλ(σs⊗ψ)=ψ(σs)=σψ(s)=σEλ(s⊗ψ); equivalently the conjugation action σ⋅ψ=σψσ−1 is trivial on Mλ, since ψ is Sn-linear. Hence Eλ≅Sλ⊗Mλ as (Sn×GL⁡(V))-modules.

2.2F2step 1.2step 1.3constructalgebra

Let ψ∈Mλ and ψ∗∈Mλ∗. Since ev of step 1.2 is injective, it has a linear retraction: choosing a basis of the image ev(Mλ) and extending it to a basis of the finite-dimensional space Ek, define r:Ek→Mλ on the basis by r(v)=ev−1(v) for v in that basis of the image and r=0 on the added vectors, so that r∘ev=id. Then g⋅ψ=r(ev(g⋅ψ)) and the matrix coefficient is ψ∗(g⋅ψ)=(ψ∗∘r)(g⊗nψ(s1),…,g⊗nψ(sk)). The vectors ψ(sl)∈E are fixed, so their coordinates in the elementary tensor basis [F2] are constants, and by step 1.3 the numbers ψ∗(g⋅ψ) are constant-coefficient linear combinations of monomials of degree n in the entries gij: they are homogeneous polynomials of degree n. This holds for the matrix coefficients of the action with respect to any basis of Mλ, so Mλ is a homogeneous polynomial GL⁡(V)-module of degree n. This proves claim 5.

3.1F9step 1.1step 2.1algebra

By [F9], Mλ≠0 exactly when ℓ(λ)≤d; combined with step 1.1 and step 2.1 this gives the (Sn×GL⁡(V))-isomorphism E=⨁ℓ(λ)≤dEλ≅⨁ℓ(λ)≤dSλ⊗Mλ, the omitted components being exactly the zero ones, and proves claim 1.

4.1F5F6F8step 1.1step 3.1algebra

An Sn-endomorphism F∈End⁡Sn(E) maps each isotypic component Eλ into itself: Eλ is a sum of copies of Sλ by [F5], and the image under F of such a copy is either 0 or, by irreducibility of Sλ, a copy of Sλ, hence lies in Eλ. Restriction gives an isomorphism of C-algebras End⁡Sn(E)→∏λ⊢nEnd⁡Sn(Eλ) (injective, since F is determined on the direct sum, and blockwise surjective, with componentwise composition). For each λ with Mλ≠0, [F6] identifies End⁡Sn(Eλ) with End⁡(Mλ): every Fλ∈End⁡Sn(Eλ) is uniquely Eλ(1⊗aλ)Eλ−1 with aλ∈End⁡(Mλ) and the identification preserves composition. Therefore, by [F8], B=End⁡Sn(E)≅∏ℓ(λ)≤dEnd⁡(Mλ) as C-algebras, the product being over the λ with Mλ≠0 (and B=0 when there are none).

5.1F9F11step 4.1algebra

Under the identification of step 4.1, an element b∈B acts on Eλ as Eλ(1⊗aλ)Eλ−1, where aλ is its λ-component in ∏End⁡(Mλ); hence for ψ∈Mλ one has (b⋅ψ)(s)=b(ψ(s))=Eλ(s⊗aλψ)=(aλψ)(s), that is, b acts on Mλ by aλ. Since Mλ≠0 for ℓ(λ)≤d by [F9], End⁡(Mλ) is the full matrix algebra Mmλ(C) with mλ=dim⁡CMλ≥1, so B≅∏ℓ(λ)≤dMmλ(C) is a product of full matrix algebras over the field C; by [F11] every simple left B-module is supported on exactly one factor and is isomorphic to that factor's column module, and distinct factors have non-isomorphic column modules. The postcomposition module Mλ is the column module of the λ-th factor End⁡(Mλ) (the other factors acting as zero, as step 4.1 shows the action factors through the λ-component), so Mλ is a simple B-module and Mλ≅Mμ as B-modules implies λ=μ.

6.1F8F9F12step 5.1algebra

Because B is spanned by the operators g⊗n, a GL⁡(V)-stable subspace of Mλ is stable under every b∈B; because B is the unital subalgebra generated by the operators Δ(T), T∈End⁡(V), a subspace stable under all Δ(T) (that is, a gl(V)-submodule, [F12]) is also B-stable. By step 5.1 the space Mλ is a simple B-module and nonzero, so it has no proper nonzero subspace of either kind: it is irreducible as a GL⁡(V)-module and as a gl(V)-module. This proves claim 2, the case ℓ(λ)>d being [F9].

6.2F8F9step 5.1algebra

Let λ,μ⊢n satisfy ℓ(λ)≤d and ℓ(μ)≤d, so that Mλ≠0 and Mμ≠0 by [F9], and let T:Mλ→Mμ be an isomorphism of GL⁡(V)-modules. For b=∑gcgg⊗n∈B and ψ∈Mλ one has T(b⋅ψ)=∑gcgT(g⊗nψ)=∑gcgg⊗nT(ψ)=b⋅T(ψ), so T is a B-module isomorphism and, both modules being nonzero, step 5.1 forces λ=μ. Likewise an isomorphism of gl(V)-modules intertwines every Δ(T), and since finite sums and products of such operators span B by [F8], it is a B-module isomorphism and again forces λ=μ. If exactly one of ℓ(λ),ℓ(μ) is at most d, then exactly one of Mλ,Mμ is zero by [F9], so the two are not isomorphic even as vector spaces. This proves claim 3.

6.3F10F9step 5.1algebra

Assume ℓ(λ)≤d, so Mλ≠0 by [F9] and Mλ is irreducible over B by step 5.1. The highest weight lemma [F10] then supplies a nonzero φ∈Mλ with Δ(Eii)∘φ=λiφ (with λi=0 for i>ℓ(λ)) and Δ(Eij)∘φ=0 for i<j, and shows that every nonzero ψ∈Mλ killed by all raising operators and of weight μ satisfies μ=λ and ψ∈Cφ. This proves claim 4.

7.1F1F3F9step 3.1step 6.1step 6.2step 6.3step 2.2discharge-construct∎

Boundary and choice audit. For n=0 one has E=C, the only partition is ∅ with ℓ(∅)=0≤d, M∅=Hom⁡(C,C)=C, and claim 1 reads E≅S∅⊗M∅; B=C id, M∅ is a one-dimensional simple B-module, claim 4 holds with λ=(0,…,0) and claim 5 with degree 0 polynomials, the constants. For d=0 and n≥1 one has V=0, E=0 and no partition of n satisfies ℓ(λ)≤0, so the sum in claim 1 is empty and E=0, the assertions of claims 2, 3, 4 and 5 are vacuous since all Mλ=0, and B=End⁡Sn(0)=0 consistently. For d≥1 and n≥1 there are finitely many partitions of n and all spaces are finite-dimensional. The argument uses that C has characteristic 0 not dividing n! ([F3]), that C is algebraically closed ([F6], [F7]), and the fixed basis of V, the fixed basis of Sλ, the fixed tableau t and the finite-dimensional retraction r of step 2.2; finite sums over the partitions of n and over the coordinate index sets occur throughout, and no choice principle is invoked. This proves claims 1, 2, 3, 4 and 5.

Remarks

  • Two actions, two refinements. The Schur-Weyl decomposition refines the isotypic decomposition of E as an Sn-module by the action of the centralizer B=End⁡Sn(E): the double centralizer theorem (The Schur-Weyl mutual centralizer theorem on tensor powers) turns B into a product of full matrix algebras, one factor on each nonzero multiplicity space, which is both why each nonzero Mλ is irreducible and why the distinct nonzero λ-factors are inequivalent. The length cutoff comes from Column antisymmetrization gives the exact Schur–Weyl length cutoff and the weight from The row-labelled polytabloid map has highest weight lambda; no root system, PBW theorem or classification of gl(V)-modules is used.

  • Symmetric and exterior powers. For λ=(n) the factor M(n) is isomorphic to the n-th symmetric power of V, and for λ=(1n), which appears exactly when n≤d, the factor M(1n) is isomorphic to the n-th exterior power; the highest weight vectors of claim 4 are the usual ones, as computed in the remarks of The row-labelled polytabloid map has highest weight lambda.

  • Polynomial degree. The degree n in claim 5 records the polynomiality of g↦g⊗n: the matrix coefficients are homogeneous of degree n because they are combinations of n-fold products of the entries of g. This is the precise content of the phrase that each multiplicity space Mλ is a homogeneous polynomial module of degree n.

Depends on

Used by

Dependency tree · two levels

69 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