Complex general linear group
Tensor representation
Let Γ be the defining representation of GL𝑁(ℂ).
A tensor representation of GL𝑁(ℂ) is a subrepresentation of Γ⊗𝑛 for some 𝑛 ∈ℕ. #m/def/rep/lie
Weyl's construction associates every tensor irrep for fixed 𝑁 to a Young diagram.
Weyl's construction
Let 𝑉 =ℂ𝑁, GL𝑁(ℂ) act on 𝑉⊗𝑛 by Γ⊗𝑛 and 𝑆𝑛 act on 𝑉⊗𝑛 by the permutation representation 𝐷.
In addition let ℂ[𝑆𝑛] act by the corresponding ∗-representation.
Let 𝑌 be the set of Young diagrams of 𝑛 boxes and at most 𝑁 rows.
For each 𝜆 ∈𝑌 let 𝐿𝜆 =ℂ[𝑆𝑛] ∗𝔢𝜆 be the corresponding minimal left ideal with basis {𝑓𝛽𝜆}𝑑𝜆𝛽=1.
For a given |𝑣⟩ ∈𝑉⊗𝑛, {𝑓𝛽𝑣}𝑑𝜆𝛽=1 either vanish or transform in the irrep 𝐷𝜆 (see below).
Let {|𝑣𝛼𝜆⟩}𝑚𝜆𝛼=1 be a complete1 set of tensors such that each 𝑓𝛽𝜆|𝑣𝛼𝜆⟩ is unique.
Then
|𝜆,𝛼,𝛽⟩=𝑓𝛽𝜆|𝑣𝛼𝜆⟩
form an irreducible orthonormal basis under both GL𝑁(ℂ) and 𝑆𝑛,
where
𝑇𝜆(𝛼)=span{𝜆,𝛼,𝛽}𝑑𝜆𝛽=1
is a 𝑑𝜆-dimensional irreducible invariant subspace under 𝑆𝑛 and
𝑇′𝜆(𝛽)=span{𝜆,𝛼,𝛽}𝑚𝜆𝛼=1
is a 𝑚𝜆-dimensional irreducible invariant subspace transforming under GL𝑁(ℂ) in an irrep henceforth labeled Γ𝜆.
Thus
𝑉⊗𝑛=⨁𝜆∈𝑌𝑚𝜆⨁𝛼=1𝑇𝜆(𝛼)=⨁𝜆∈𝑌𝑑𝜆⨁𝛽=1𝑇′𝜆(𝛽)
where 𝑑𝜆 is given by the Hook length formula and 𝑚𝜆 is given by Stanley's hook content formula.
Proof of vanishing property
For |𝑣⟩ ∈𝑇𝜆(𝛼) there exists some 𝑟 ∈𝐿𝜆 s.t. |𝑣⟩ =𝑟|𝑣𝛼𝜆⟩.
Then 𝑝|𝑣𝛼𝜆⟩ =𝑝𝑟|𝑣𝛼𝜆⟩ ∈𝑇𝜆(𝛼) for 𝑝 ∈𝑆𝑛 since 𝑝𝑟 ∈𝐿𝜆, giving invariance.
Clearly {𝑓𝛽𝜆|𝑣𝛼𝜆⟩}𝑑𝜆𝛽=1 is a basis of 𝑇𝜆(𝛼).
We define a matrix representation 𝐷𝜆𝑖𝑗 by
𝑝𝑓𝑖𝜆=𝑓𝑗𝜆𝐷𝜆𝑗𝑖(𝑝)with summation convention.
Then
𝑝𝑓𝑖𝜆|𝑣𝛼𝜆⟩=𝑓𝑗𝛼𝐷𝜆𝑗𝑖(𝑝)|𝑣𝛼𝜆⟩=𝑓𝑗𝜆|𝑣𝛼𝜆⟩𝐷𝜆𝑗𝑖(𝑝)as required.
Proof
Tensor representations of U(𝑁) and SU(𝑁)
Every irrep of GLₙ(ℂ) is an irrep of U(n) and SU(n), so tensor irreps given above are also tensor irreps for these subgroups.
However, since each column of length 𝑁 corresponds to the determinant representation, which is trivial for SU(𝑁), such columns may be removed without changing the representation up to equivalence.
Properties
#state/develop | #lang/en | #SemBr