Alphabeta Math
LemmaStatement: 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.

Diagonal tensor operators span the symmetric centralizer

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). Write W:=End⁡(V) and let End⁡Sn(E):={F∈End⁡(E):σF=Fσ for all σ∈Sn} be the centralizer of the action. Then:

  1. (Canonical identification.) The linear map Ψ:W⊗n→End⁡(E) with Ψ(T1⊗⋯⊗Tn)(v1⊗⋯⊗vn)=T1v1⊗⋯⊗Tnvn on elementary tensors is a linear isomorphism, and it is equivariant for the place action of Sn on W⊗n and conjugation F↦σFσ−1 on End⁡(E). Hence Ψ restricts to an isomorphism from the invariant tensors, that is from the image of the symmetrization operator 1n!∑σ∈Snσ on W⊗n (the n-th symmetric tensor power of W), onto End⁡Sn(E).
  2. (Spans.) The subspaces span⁡{T⊗n:T∈W} and span⁡{g⊗n:g∈GL⁡(V)} of W⊗n are both equal to the invariant tensors; equivalently, with Δ(T)=∑i=1n1⊗(i−1)⊗T⊗1⊗(n−i) and An the unital C-subalgebra of End⁡(E) generated by all Δ(T) (the image of the diagonal action of U(gl(V)) as defined there, Commuting symmetric-group and linear actions on a tensor power), End⁡Sn(E)=Ψ(span⁡{T⊗n:T∈W})=Ψ(span⁡{g⊗n:g∈GL⁡(V)})=An.

All statements include n=0, where W⊗0=C and E=C, and the case V=0.

Facts & Assumptions

Given: A finite-dimensional complex vector space V, an integer n≥0, E=V⊗n with its left Sn-action, and W=End⁡(V).

[F1]

σ⋅(v1⊗⋯⊗vn)=vσ−1(1)⊗⋯⊗vσ−1(n) defines a left Sn-action on E by linear maps, E=C for n=0; the diagonal operators Δ(T) and the algebra An are as displayed, with Δ linear in T (Commuting symmetric-group and linear actions on a tensor power).

[F2]

If e1,…,ed is a basis of V, the elementary tensors ea1⊗⋯⊗ean form a basis of E, and for n=0 the single element 1 is a basis of E=C (The elementary tensors of two bases form the product basis of the tensor product, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F3]

The assignment (v1,…,vn)↦v1⊗⋯⊗vn is multilinear, so linear maps out of E are the same as multilinear maps on Vn (Finite iterated tensor products represent multilinear maps independently of parenthesization).

[F4]

For finite-dimensional V one has dim⁡CEnd⁡(V)=d2 with d=dim⁡CV, and matrix representation relative to bases is a vector-space isomorphism (dim⁡FMm×n(F)=mn and dim⁡FL(V,W)=(dim⁡FV)(dim⁡FW) for finite-dimensional V,W, T↦[T]BC is a vector-space isomorphism L(V,W)≅Mm×n(F)).

[F5]

Every nonzero polynomial over an integral domain of degree m has at most m distinct roots. The characteristic polynomial of −T is χ−T(t)=det⁡(t 1V+T), a monic polynomial of degree d=dim⁡CV; an operator is invertible if and only if its determinant is nonzero (A nonzero polynomial of degree n over an integral domain has at most n distinct roots, The basis-independent characteristic polynomial χT of an endomorphism of a finite-dimensional space, including χT=1 in dimension zero, A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero).

[F6]

C is an infinite field.

[F7]

In n variables the elementary symmetric polynomial en is x1⋯xn, with e0=1 for n=0; if n! 1R is a unit in a commutative ring R, then en is a polynomial in the power sums ∑ixik with coefficients in R (The elementary symmetric polynomials e0,e1,…,en, If n! is invertible, then p1,…,pn freely generate the symmetric-polynomial ring).

[F8]

A unital ring homomorphism from a polynomial ring on generators x1,…,xm over a commutative ring R into a commutative R-algebra S exists uniquely with prescribed images of the xi (Universal property of a polynomial ring on an arbitrary family of indeterminates).

Proof

technique · constructive
1.1F1F3constructalgebra

[construct] Fix T1,…,Tn∈W. For fixed (v1,…,vn)∈Vn the assignment Ti↦Tivi is linear in each variable, so (T1,…,Tn)↦T1v1⊗⋯⊗Tnvn is multilinear in the Ti and its values in E are linear in (v1,…,vn) separately in each vi; hence there is a unique linear map Φ(T1,…,Tn)∈End⁡(E) with the displayed value on every elementary tensor by [F3], and Φ is multilinear in the Ti because both sides of every identity are checked on the spanning elementary tensors by [F3]. By the representing property of the tensor product [F3] there is a unique linear Ψ:W⊗n→End⁡(E) with Ψ(T1⊗⋯⊗Tn)=Φ(T1,…,Tn), which is the map of the Statement; in particular Ψ is linear and is given on elementary tensors as displayed. For n=0 one has W⊗0=C and Ψ(1)=idC by the same universal property.

1.2F1algebraconstruct

Let p:=1n!∑σ∈Snσ∈End⁡(W⊗n), a well-defined operator because n!≠0 in C; then p2=p, since each group element occurs n! times in the product sum, and p commutes with the action, since left multiplication permutes the summands. Its image is exactly the invariant subspace (W⊗n)Sn: pX is invariant for every X, and pX=X whenever X is invariant. Thus the invariant tensors are the image of the symmetrization operator. Pure tensors span W⊗n, so their symmetrizations span the image of p. For T1,…,Tn∈W, inclusion-exclusion gives ∑σ∈SnTσ(1)⊗⋯⊗Tσ(n)=∑J⊆{1,…,n}(−1)n−∣J∣(∑j∈JTj)⊗n. Indeed, after expanding the right side, an ordered tensor survives exactly when every index 1,…,n occurs, which in a tensor with n factors means each occurs once. Hence each symmetrized pure tensor is a linear combination of powers T⊗n, and (W⊗n)Sn=span⁡{T⊗n:T∈W}. For n=0 this equality is immediate in W⊗0=C.

1.3F5F6algebra

The two spans of the Statement are equal. One inclusion is clear, since GL⁡(V)⊆W. For the reverse let T∈W and consider the W⊗n-valued polynomial t↦(T+t 1V)⊗n; expanding the tensor power of a sum gives (T+t 1V)⊗n=∑k=0ntkck with c0=T⊗n, so it is a polynomial of degree at most n in t. The function t↦det⁡(t 1V+T) is a monic polynomial of degree d=dim⁡CV by [F5], hence nonzero with at most d roots by [F5], so by [F6] there exist n+1 distinct scalars t1,…,tn+1 with T+ti1V invertible for all i by [F5] (if d=0 then W={0} and T=0 is invertible, so any distinct scalars work). For the Lagrange polynomials Li(t):=∏j≠i(t−tj)/(ti−tj) one has tk=∑itikLi(t) for every t and every 0≤k≤n, because it holds at the n+1 distinct points and both sides have degree at most n; multiplying by ck and summing gives T⊗n=c0=∑iLi(0) (T+ti1V)⊗n∈span⁡{g⊗n:g∈GL⁡(V)}. Hence the two spans are equal.

2.1F2F4step 1.1constructalgebra

The matrix units of W with respect to a basis e1,…,ed of V form a basis of W: define Eab∈W by Eabec:=δbcea; every S∈W satisfies S=∑a,bsabEab with sab the coefficients in S(eb)=∑asabea, because the two sides agree on each basis vector of V, and a relation ∑a,bλabEab=0 evaluated at eb gives ∑aλabea=0, so all λab=0. Likewise the endomorphisms fab of E defined by fab(ec1⊗⋯⊗ecn):=δb1c1⋯δbncn ea1⊗⋯⊗ean for words a,b∈[d]n form a basis of End⁡(E), indexed by the finite set [d]n×[d]n; for n=0 this is the single endomorphism idC of the one-dimensional space C, and for d=0 and n≥1 all these sets of words are empty and both spaces are zero. By [F2] and [F3] the d2n tensors Ea1b1⊗⋯⊗Eanbn form a basis of W⊗n, and Ψ sends such a tensor to fab by the formula of step 1.1; a linear map that carries a basis bijectively onto a basis is an isomorphism, so Ψ is a linear isomorphism.

2.2F1F2step 1.1algebra

Ψ is Sn-equivariant for the place action on W⊗n and conjugation on End⁡(E): for σ∈Sn and T1,…,Tn∈W the place action gives σ⋅(T1⊗⋯⊗Tn)=Tσ−1(1)⊗⋯⊗Tσ−1(n) by [F1], so by step 1.1 both Ψ(σ⋅(T1⊗⋯⊗Tn)) and σΨ(T1⊗⋯⊗Tn)σ−1 map v1⊗⋯⊗vn to Tσ−1(1)v1⊗⋯⊗Tσ−1(n)vn; two linear maps agreeing on the spanning elementary tensors agree, so the identity Ψ(σ⋅X)=σΨ(X)σ−1 holds for all X∈W⊗n by linearity.

2.3F1F7F8step 1.1algebra

For T∈W one has Ψ(T⊗n)∈An. For n=0 this is idC∈A0, since A0 is unital. Assume n≥1 and put Ti:=1⊗(i−1)⊗T⊗1⊗(n−i)∈End⁡(E) for 1≤i≤n; these operators commute pairwise and Ψ(T⊗n)=T1T2⋯Tn, while ∑i=1nTik=Δ(Tk) for every k≥1, all by the tensor formula of step 1.1 and [F1]. By [F7] with R=C (where n! is a unit) there is a polynomial Q in n variables over C with en(x1,…,xn)=Q(p1,…,pn) in C[x1,…,xn], where pk=∑ixik. The operators T1,…,Tn commute, so the C-subalgebra they generate is commutative, and the universal property of the polynomial ring [F8] gives a C-algebra homomorphism sending xi↦Ti; it sends en(x1,…,xn) to T1⋯Tn by [F7] and pk to Δ(Tk), so T1⋯Tn=Q(Δ(T),…,Δ(Tn))∈An, since each Δ(Tk) lies in the generating algebra An and Q has coefficients in C.

3.1F1step 1.1step 2.2algebra

For T∈W put dT:=∑i=1n1⊗(i−1)⊗T⊗1⊗(n−i)∈W⊗n (the empty sum for n=0, giving dT=0∈C). Then Ψ(dT)=Δ(T) by step 1.1, and dT is invariant under the place action: a permutation sends the i-th summand, which has T in position i, to the same kind of summand with T in position σ(i) by [F1], and σ permutes the index set, so σ⋅dT=dT. By the equivariance of step 2.2, Δ(T)=Ψ(dT) is fixed by conjugation by every σ∈Sn, that is Δ(T)∈End⁡Sn(E); since End⁡Sn(E) is closed under addition and composition and An is generated by the Δ(T), this gives An⊆End⁡Sn(E).

4.1F1step 2.1step 2.2step 1.2step 3.1step 1.3step 2.3discharge-construct∎

Combining steps: Ψ induces a bijection from (W⊗n)Sn onto End⁡Sn(E) by step 2.2 and step 2.1, the invariant subspace is span⁡{T⊗n}=span⁡{g⊗n} by steps 1.2 and 1.3, and Ψ(span⁡{T⊗n})⊆An⊆End⁡Sn(E) by steps 3.1 and 2.3, so all four subspaces of the Statement coincide. For n=0: W⊗0=E=C, Ψ is the identity, S0 is trivial, T⊗0=1 for every T, Δ(T)=0 and A0=C idC, and the displayed chain reads C=C=C=C. For V=0 and n≥1: W=0, E=0, both sides of the identity are the zero space, and An=0. This proves both claims.

Remarks

  • What is used where. The basis argument of step 2.1 identifies End⁡(V⊗n) with W⊗n; steps 1.2 and 1.3 are the polarization step, expressing an arbitrary invariant tensor through the powers T⊗n and then through powers of invertible operators; step 2.3 is the Newton-identity argument identifying the algebra generated by the place operators Δ(T) with those powers. The interpolation in step 1.3 is where the field C is used as an infinite field of characteristic zero; the statement is false in characteristic p≤n, where n! is not invertible.

  • The zero and empty cases. For n=0 the symmetric tensor power is the ground field and the whole claim degenerates to C=C; for V=0 and n≥1 both E and W⊗n are the zero space, so End⁡Sn(E)=An=0. These are the only cases in which the basis argument of step 2.1 has no words a,b.

  • Relation to the double centralizer. The equality End⁡Sn(E)=An identifies the commutant of the C[Sn]-image with the image of the diagonal gl(V)-action. The converse commutant equality is the other half of the double-centralizer statement proved on this page (Commuting symmetric-group and linear actions on a tensor power).

  • No choice. All bases, matrix units and the finitely many scalars t1,…,tn+1 are chosen from explicit finite or countable ranges; the multilinear universal property of [F3] produces the maps without any selection, and no selection principle is used.

Depends on

Used by

Dependency tree · two levels

67 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