Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Commuting symmetric-group and linear actions on a tensor power

Definition

Let V be a finite-dimensional complex vector space and let n≥0. Write End⁡(V) for the C-vector space of all linear maps V→V, and GL⁡(V)⊆End⁡(V) for the invertible ones (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree). All tensor products below are over C.

The tensor power. For n≥1 fix the parenthesization En  :=  V⊗n  :=  V⊗C⋯⊗CV⏟n factors,V⊗0  :=  C, and write v1⊗⋯⊗vn for the elementary tensor of (v1,…,vn)∈Vn; for n=0 the unique elementary tensor is 1∈C. By Finite iterated tensor products represent multilinear maps independently of parenthesization the assignment (v1,…,vn)↦v1⊗⋯⊗vn is C-multilinear and every element of En is a finite C-linear combination of elementary tensors; for n=0 this means c=c⋅1 for c∈C. If e1,…,ed is a C-basis of V, then by iterating The elementary tensors of two bases form the product basis of the tensor product the dn tensors ei1⊗⋯⊗ein form a C-basis of En, so En is finite-dimensional.

Place permutations: the left Sn-action. Let Sn be the symmetric group of the set {1,…,n} (The symmetric group Sym⁡(X): the bijections of a set X under composition). For σ∈Sn define, on elementary tensors, σ⋅(v1⊗⋯⊗vn)  :=  vσ−1(1)⊗⋯⊗vσ−1(n). The right-hand side depends C-multilinearly on (v1,…,vn), so by the universal property in Finite iterated tensor products represent multilinear maps independently of parenthesization there is a unique C-linear map En→En with this value on every elementary tensor. Uniqueness is what makes the rule well defined on all of En, since the elementary tensors span. The identity permutation acts trivially, and for σ,τ∈Sn and every elementary tensor, (στ)⋅(v1⊗⋯⊗vn)=v(στ)−1(1)⊗⋯⊗v(στ)−1(n)=vτ−1(σ−1(1))⊗⋯⊗vτ−1(σ−1(n)), while τ⋅(v1⊗⋯⊗vn)=vτ−1(1)⊗⋯⊗vτ−1(n) and hence σ⋅(τ⋅(v1⊗⋯⊗vn))=vτ−1(σ−1(1))⊗⋯⊗vτ−1(σ−1(n)). The two agree, so the assignments constitute a left action of the group Sn on En; equivalently En is a left module over Sn (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree). For n=0 the group S0 is trivial and acts on E0=C by the identity.

Diagonal linear action. For g∈GL⁡(V) define, on elementary tensors, g⊗n⋅(v1⊗⋯⊗vn)  :=  gv1⊗⋯⊗gvn, again first on elementary tensors by multilinearity and then uniquely on En. Since g and h are linear, the two assignments compose in the expected way: on elementary tensors, (gh)⊗n⋅(v1⊗⋯⊗vn)=g(hv1)⊗⋯⊗g(hvn)=g⊗n⋅(h⊗n⋅(v1⊗⋯⊗vn)), and (idV)⊗n is the identity. In particular (g−1)⊗n is the inverse of g⊗n. For n=0 every diagonal operator is the identity on C. Thus g↦g⊗n is a group homomorphism GL⁡(V)→GL⁡(En), that is, a finite-dimensional representation of the group GL⁡(V) on En.

The two actions commute. For σ∈Sn, g∈GL⁡(V) and an elementary tensor, σ⋅(g⊗n⋅(v1⊗⋯⊗vn))=gvσ−1(1)⊗⋯⊗gvσ−1(n)=g⊗n⋅(σ⋅(v1⊗⋯⊗vn)), so the two linear maps σ⋅(−) and g⊗n⋅(−) commute; equivalently, every g⊗n is an Sn-equivariant endomorphism of En (Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations).

The diagonal infinitesimal operator. For T∈End⁡(V) put Δ(T)  :=  ∑i=1n1⊗(i−1)⊗T⊗1⊗(n−i) ∈ End⁡(En), where 1=idV and the sum is 0 for n=0. Each summand lies in End⁡(En), and Δ:End⁡(V)→End⁡(En) is C-linear. It is the first coefficient of the diagonal action along the line t↦1+tT. In this polynomial calculation, (1+tT)⊗n is the tensor power of the endomorphism 1+tT; it agrees with the GL⁡(V) action whenever that endomorphism is invertible. For every t∈C one computes, on elementary tensors, (1+tT)⊗n⋅(v1⊗⋯⊗vn)=∑k=0ntk∑1≤i1<⋯<ik≤nwi1,…,ik,(wi1,…,ik)j={Tvj,j∈{i1,…,ik},vj,otherwise the coefficient of t being Δ(T)⋅(v1⊗⋯⊗vn) (zero when n=0); both sides are polynomials in t with values in the finite-dimensional space En described on a spanning set. Finally let An  :=  the unital C-subalgebra of End⁡(En) generated by {Δ(T):T∈End⁡(V)}; this is the image of the diagonal action of the universal enveloping algebra U(gl(V)) on En, defined here as that generated algebra, with no Lie-theoretic input.

Remarks

  • Why the inverse is in the place action. Using vσ(1)⊗⋯⊗vσ(n) would give a right action, (στ)⋅x=τ⋅(σ⋅x), because then the permutation acts on the positions by i↦σ(i). The convention above is arranged so that Sn acts on the left, which is the direction needed for the permutation-module and Specht-module conventions of this library.

  • Degenerate cases. For n=0, E0=C is the trivial representation of the trivial group S0 and of GL⁡(V), Δ(T)=0 is the empty sum, and A0=C idC is one-dimensional. For n=1, E1=V, the group S1 is trivial, g⊗1=g, and Δ(T)=T; thus A1=End⁡(V). If V=0 then En=0 for n≥1 and E0=C, and all statements below about these spaces remain true with the zero space.

  • Δ is not multiplicative. In general Δ(TT′)≠Δ(T)Δ(T′) for dim⁡V>1: the product expands to include cross terms 1⊗(a−1)⊗T⊗1⊗(b−a−1)⊗T′⊗1⊗(n−b) with a<b, and the commutator relation is [Δ(T),Δ(T′)]=Δ([T,T′]), which is not used below. What is used is that An contains Δ(T) for every T, hence every polynomial in these operators; the centralizer statement that uses this algebra is proved later on this page.

  • No choice. All sums are finite sums over n places and over the finite group Sn, and the multilinear universal property produces the maps directly; no selection principle is used.

Depends on

Used by

Dependency tree · two levels

22 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