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.

The Schur-Weyl mutual centralizer theorem on tensor powers

Statement

Let V be a finite-dimensional complex vector space, let n≥0, and let E:=V⊗n carry the left place action of Sn (Commuting symmetric-group and linear actions on a tensor power). Let A be the image of the algebra homomorphism C[Sn]→End⁡(E) extending the place action, and let B:=span⁡C{g⊗n:g∈GL⁡(V)} be the linear span of the diagonal operators g⊗n(v1⊗⋯⊗vn)=gv1⊗⋯⊗gvn. Then:

  1. (Mutual centralizers.) B={F∈End⁡(E):Fa=aF for all a∈A} and A={F∈End⁡(E):Fb=bF for all b∈B}.
  2. (Uniqueness of the identification.) B is a unital C-subalgebra of End⁡(E) and equals the image of the diagonal action of the universal enveloping algebra U(gl(V)), that is the unital subalgebra generated by the operators Δ(T)=∑i=1n1⊗(i−1)⊗T⊗1⊗(n−i), T∈End⁡(V) (Diagonal tensor operators span the symmetric centralizer).

All statements include n=0, where E=C.

Facts & Assumptions

Given: a finite-dimensional complex vector space V, an integer n≥0, E=V⊗n with its left Sn-action, the algebra A and the space B of the Statement.

[F1]

The left place action of Sn on E and the diagonal action of g∈GL⁡(V) commute, and Δ(T)=∑i=1n1⊗(i−1)⊗T⊗1⊗(n−i) is linear in T (Commuting symmetric-group and linear actions on a tensor power). It is a Lie algebra homomorphism: operators in distinct tensor positions commute, and in each position the commutator is [T,U]=TU−UT, so [Δ(T),Δ(U)]=Δ([T,U]).

[F2]

The map Ψ:(End⁡V)⊗n→End⁡(E) is a linear isomorphism, equivariant for the place action and conjugation, and End⁡Sn(E)=Ψ(span⁡{T⊗n:T∈End⁡(V)})=Ψ(span⁡{g⊗n:g∈GL⁡(V)})=An, where End⁡Sn(E) is the centralizer of the place action and An is the unital subalgebra generated by the Δ(T), which is the image of the diagonal action of U(gl(V)) (Diagonal tensor operators span the symmetric centralizer).

[F3]

Every finite-dimensional C[Sn]-module is completely reducible (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣).

[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).

[F5]

A nonzero intertwiner between irreducible representations is an isomorphism, and every endomorphism of an irreducible representation over an algebraically closed field is 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).

[F6]

For a finite-dimensional completely reducible representation of a group the isotypic decomposition into the sums of copies of the distinct irreducible subrepresentations is unique; and for an irreducible S and an S-isotypical module U, evaluation S⊗Hom⁡Sn(S,U)→U, s⊗f↦f(s), is an isomorphism under which every Sn-map U→U′ is uniquely of the form EU′(1S⊗a)EU−1 for a linear a:Hom⁡Sn(S,U)→Hom⁡Sn(S,U′), with Hom⁡-spaces carrying the trivial action and composition preserved (The isotypic decomposition of a completely reducible representation is unique, Isotypical evaluation and multiplicity subspaces).

[F7]

C[Sn]≅∏i=1rMni(C) for positive integers ni, and the simple left modules over such a product are the column modules Cni, one isomorphism class per factor, each supported on exactly one factor (If k is algebraically closed and char⁡k∤∣G∣, then k[G]≅∏i=1rMni(k), Simple modules over a product of matrix rings over division rings).

[F8]

Under the correspondence between k-linear G-actions and compatible left k[G]-module structures, the subrepresentations of a representation V are exactly the k[G]-submodules and V is irreducible if and only if it is simple as a k[G]-module; G-equivariant maps are exactly the k[G]-module homomorphisms (For a commutative ring R, R-linear G-actions are exactly the compatible left R[G]-module structures, Under the dictionary, subrepresentations are exactly submodules and irreducible representations are exactly simple modules).

Proof

technique · direct
1.1F1givenconstructalgebra

[construct] Recall that A is a unital subalgebra of End⁡(E), because it is the image of a unital algebra homomorphism, and that B is a unital subalgebra, because g⊗nh⊗n=(gh)⊗n for g,h∈GL⁡(V); both contain 1E (for B take g=1V, and for n=0 note g⊗0=idC for every g and GL⁡(V) is nonempty).

1.2F3F4F6constructalgebra

By [F3] the C[Sn]-module E is completely reducible, so by [F4] and the uniqueness of the isotypic decomposition in [F6] there are subspaces Eλ for λ in the finite set Λ:={λ⊢n:Hom⁡Sn(Sλ,E)≠0} with E=⨁λ∈ΛEλ, each Eλ is λ-isotypical, and the evaluation maps of [F6] give Sn-isomorphisms Eλ≅Sλ⊗Mλ with Mλ:=Hom⁡Sn(Sλ,E) carrying the trivial action; consequently the action of σ∈Sn on Eλ corresponds to ρλ(σ)⊗1Mλ, where ρλ is the action on the irreducible Sλ.

1.3F4F7F8algebra

The simple left C[Sn]-modules are, by [F7], the column modules of the factors of a decomposition C[Sn]≅∏i=1rMni(C), one class per factor and each supported on one factor; by [F8] the irreducible complex representations of the group Sn are exactly the simple left C[Sn]-modules, so by [F4] the isomorphism classes of simple left C[Sn]-modules are exactly the classes [Sλ], λ⊢n. Hence the factors are indexed by the partitions of n, with ni=dim⁡CSλ for the factor attached to λ, and dim⁡CC[Sn]=∑λ⊢n(dim⁡CSλ)2.

1.4constructalgebra

An endomorphism T∈End⁡(S⊗M) of a tensor product, S,M finite-dimensional over C with M≠0, commuting with 1S⊗b for all b∈End⁡(M) is of the form T=x⊗1M for a unique x∈End⁡(S): choose bases s1,…,sp of S and m1,…,mq of M (both finite, with q≥1), write T(s⊗m1)=∑j=1qxj(s)⊗mj with well-defined linear maps xj:S→S; for each j let bj∈End⁡(M) be given on the basis by bj(m1)=mj and bj(mi)=0 for i≥2; then T(s⊗mj)=T((1⊗bj)(s⊗m1))=(1⊗bj)T(s⊗m1)=x1(s)⊗mj, so T=x1⊗1M on all basis vectors, and conversely every x⊗1M commutes with the operators 1⊗b.

2.1F2step 1.1algebra

The first displayed identity of claim 1 holds: a map F∈End⁡(E) commutes with every a∈A exactly when it commutes with σ for every σ∈Sn, because A is the linear span of the place operators σ; hence the centralizer of A is End⁡Sn(E), which equals B by [F2]. The same fact of [F2] identifies B with the image of the diagonal action of U(gl(V)), so claim 2 holds; in particular B is a subalgebra, in agreement with step 1.1.

2.2F7F8step 1.3constructalgebra

The canonical algebra homomorphism Φ:C[Sn]→∏λ⊢nEnd⁡(Sλ), Φ(x)=(ρλ(x))λ, is an isomorphism. It is injective: if x acts as 0 on every Sλ, then under the product decomposition of step 1.3 the element x has a component in each factor which annihilates that factor's own column module, and so is 0, so x=0; here [F8] identifies the column module of the factor attached to λ with the simple module Sλ, on which x acts as ρλ(x) by definition of Φ. It is then bijective because, by step 1.3 and dim⁡CEnd⁡(Sλ)=(dim⁡CSλ)2, source and target have the same finite dimension ∑λ⊢n(dim⁡CSλ)2.

3.1F4F5F6step 2.1step 1.2algebra

The algebra End⁡Sn(E) is ∏λ∈ΛEnd⁡(Mλ): an Sn-endomorphism of E maps each isotypic component Eλ into itself, since the image of a copy of Sλ is 0 or a copy of Sλ by [F5] and [F4]; on Eλ it is, by [F6] and step 1.2, exactly the operator induced by a unique aλ∈End⁡(Mλ) on the second tensor factor; maps between distinct components Eλ→Eμ are zero by [F5] and [F4] because Sλ and Sμ are non-isomorphic for λ≠μ; and the identifications preserve composition, so this is an algebra isomorphism under which aλ corresponds to the operator 1Sλ⊗aλ on Eλ. In particular, by step 2.1, B is exactly the set of operators ⨁λ∈Λ(1Sλ⊗bλ) with bλ∈End⁡(Mλ).

3.2step 1.2step 2.2algebra

Under the isomorphism Φ of step 2.2 and the isomorphisms Eλ≅Sλ⊗Mλ of step 1.2, the action of x∈C[Sn] on E=⨁λ∈ΛEλ is ⨁λ∈Λ(ρλ(x)⊗1Mλ), the factors with λ∉Λ acting on no summand; hence the image A of this action map is exactly A=⨁λ∈Λ(End⁡(Sλ)⊗1Mλ)⊆End⁡(E), the direct sum of the indicated block subalgebras indexed by Λ: indeed the projection ∏λ⊢nEnd⁡(Sλ)→∏λ∈ΛEnd⁡(Sλ) is surjective and Φ is an isomorphism.

4.1F6step 1.2step 3.1algebra

Claim 1's second identity holds. Let F∈End⁡(E) commute with every element of B; decompose F as a block matrix (Fμλ)μ,λ∈Λ with Fμλ∈Hom⁡(Sλ⊗Mλ,Sμ⊗Mμ) using the decomposition of step 1.2. Commuting with the operator 1Sλ⊗bλ on the λ-block and 1Sμ⊗bμ on the μ-block gives Fμλ(1Sλ⊗bλ)=(1Sμ⊗bμ)Fμλ. If μ≠λ, use bλ=1Mλ, bμ=0 (available in B by step 3.1 and λ,μ∈Λ), obtaining Fμλ=0. Thus every off-diagonal block vanishes. For each λ, the diagonal block Fλλ commutes with 1Sλ⊗b for every b∈End⁡(Mλ), since B contains the operators supported on that single block by step 3.1.

5.1step 3.2step 4.1step 1.4algebra

By steps 4.1 and 1.4 the centralizer of B consists exactly of the elements ⨁λ∈Λ(xλ⊗1Mλ) with xλ∈End⁡(Sλ), which is exactly A by step 3.2; this proves the second identity of claim 1, and claim 2 was proved in step 2.1.

6.1F2F6step 1.2step 4.1step 1.4given∎

Boundary and choice audit. For n=0 one has E=V⊗0=C, A=B=C idC=End⁡(E) and both centralizers equal the whole of End⁡(E), in agreement with claims 1 and 2; the case is covered by the argument with Λ={(∅)} when Hom⁡S0(S∅,C)=C. For V=0 and n≥1 one has E=0, so End⁡(E)=0=A=B by [F2] and all assertions hold; here Λ=∅, the products over Λ are the zero algebra, and steps 4.1 and 1.4 are vacuous. For V≠0 and n≥1, every λ∈Λ has Mλ≠0 by definition, so step 1.4 applies with M=Mλ. All bases and decompositions used are attached to finite-dimensional spaces and to the finitely many partitions of n; the decomposition of E and the factors of C[Sn] are canonical, and no choice principle is invoked.

Remarks

  • Two halves, two mechanisms. The identity End⁡A(E)=B is the polarization lemma (Diagonal tensor operators span the symmetric centralizer), a direct computation with symmetric tensors. The reverse identity End⁡B(E)=A goes through the semisimple structure of C[Sn]: the isotypic decomposition of E makes both centralizers products of full matrix algebras, and the two products are exchanged by the evaluation isomorphism (Isotypical evaluation and multiplicity subspaces).

  • No Lie machinery is imported. The only Lie-theoretic input is the identification of B with the image of the diagonal U(gl(V))-action, which is proved inside Diagonal tensor operators span the symmetric centralizer by Newton identities; no classification or highest-weight theory is used here.

  • What the theorem does not say. Nothing is asserted about the multiplicity spaces Mλ beyond their occurrence: their irreducibility, pairwise inequivalence and highest weights are proved via the length cutoff and the local highest-weight computation later on this page.

Depends on

Used by

Dependency tree · two levels

65 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