Lably
Skip to content

Restricted representation

  • 7 min read
  • 5 chapters

Related on Lably

Through Group (mathematics), Physics and Ring (mathematics)

The induced representation is a related operation that forms a representation of the whole group from a representation of a subgroup. The relation between restriction and induction is described by Frobenius reciprocity and the Mackey theorem. Restriction to a normal subgroup behaves particularly well and is often called Clifford theory after the theorem of A. H. Clifford. Restriction can be generalized to other group homomorphisms and to other rings.

For any group G, its subgroup H, and a linear representation ρ of G, the restriction of ρ to H, denoted

ρ|H

is a representation of H on the same vector space by the same operators:

ρ|H(h)=ρ(h).

Classical branching rules

Classical branching rules describe the restriction of an irreducible complex representation (π, V) of a classical group G to a classical subgroup H, i.e. the multiplicity with which an irreducible representation (σ, W) of H occurs in π. By Frobenius reciprocity for compact groups, this is equivalent to finding the multiplicity of π in the unitary representation induced from σ. Branching rules for the classical groups were determined by

The results are usually expressed graphically using Young diagrams to encode the signatures used classically to label irreducible representations, familiar from classical invariant theory. Hermann Weyl and Richard Brauer discovered a systematic method for determining the branching rule when the groups G and H share a common maximal torus: in this case the Weyl group of H is a subgroup of that of G, so that the rule can be deduced from the Weyl character formula. A systematic modern interpretation has been given by Howe (1995) in the context of his theory of dual pairs. The special case where σ is the trivial representation of H was first used extensively by Hua in his work on the Szegő kernels of bounded symmetric domains in several complex variables, where the Shilov boundary has the form G/H. More generally the Cartan-Helgason theorem gives the decomposition when G/H is a compact symmetric space, in which case all multiplicities are one; a generalization to arbitrary σ has since been obtained by Kostant (2004). Similar geometric considerations have also been used by Knapp (2003) to rederive Littlewood's rules, which involve the celebrated Littlewood–Richardson rules for tensoring irreducible representations of the unitary groups. Littelmann (1995) has found generalizations of these rules to arbitrary compact semisimple Lie groups, using his path model, an approach to representation theory close in spirit to the theory of crystal bases of Lusztig and Kashiwara. His methods yield branching rules for restrictions to subgroups containing a maximal torus. The study of branching rules is important in classical invariant theory and its modern counterpart, algebraic combinatorics.

Example. The unitary group U(N) has irreducible representations labelled by signatures

f:f1≥f2≥⋯≥fN

where the fi are integers. In fact if a unitary matrix U has eigenvalues zi, then the character of the corresponding irreducible representation πf is given by

Tr⁡πf(U)=detzjfi+N−i∏i<j(zi−zj).

The branching rule from U(N) to U(N – 1) states that

Example. The unitary symplectic group or quaternionic unitary group, denoted Sp(N) or U(N, H), is the group of all transformations of HN which commute with right multiplication by the quaternions H and preserve the H-valued hermitian inner product

(q1,…,qN)⋅(r1,…,rN)=∑ri∗qi

on HN, where q* denotes the quaternion conjugate to q. Realizing quaternions as 2 x 2 complex matrices, the group Sp(N) is just the group of block matrices (qij) in SU(2N) with

qij=(αijβij−β¯ijα¯ij),

where αij and βij are complex numbers.

Each matrix U in Sp(N) is conjugate to a block diagonal matrix with entries

qi=(zi00z¯i),

where |zi| = 1. Thus the eigenvalues of U are (zi±1). The irreducible representations of Sp(N) are labelled by signatures

f:f1≥f2≥⋯≥fN≥0

where the fi are integers. The character of the corresponding irreducible representation σf is given by

Tr⁡σf(U)=detzjfi+N−i+1−zj−fi−N+i−1∏(zi−zi−1)⋅∏i<j(zi+zi−1−zj−zj−1).

The branching rule from Sp(N) to Sp(N – 1) states that

Here fN + 1 = 0 and the multiplicity m(f, g) is given by

m(f,g)=∏i=1N(ai−bi+1)

where

a1≥b1≥a2≥b2≥⋯≥aN≥bN=0

is the non-increasing rearrangement of the 2N non-negative integers (fi), (gj) and 0.

Example. The branching from U(2N) to Sp(N) relies on two identities of Littlewood:

∑f1≥f2≥fN≥0Tr⁡Πf,0(z1,z1−1,…,zN,zN−1)⋅Tr⁡πf(t1,…,tN)=∑f1≥f2≥fN≥0Tr⁡σf(z1,…,zN)⋅Tr⁡πf(t1,…,tN)⋅∏i<j(1−zizj)−1,

where Πf,0 is the irreducible representation of U(2N) with signature f1 ≥ ··· ≥ fN ≥ 0 ≥ ··· ≥ 0.

∏i<j(1−zizj)−1=∑f2i−1=f2iTr⁡πf(z1,…,zN),

where fi ≥ 0.

The branching rule from U(2N) to Sp(N) is given by

where all the signature are non-negative and the coefficient M (g, h; k) is the multiplicity of the irreducible representation πk of U(N) in the tensor product πg ⊗ πh. It is given combinatorially by the Littlewood–Richardson rule, the number of lattice permutations of the skew diagram k/h of weight g.

There is an extension of Littlewood's branching rule to arbitrary signatures due to Sundaram (1990, p. 203). The Littlewood–Richardson coefficients M (g, h; f) are extended to allow the signature f to have 2N parts but restricting g to have even column-lengths (g2i – 1 = g2i). In this case the formula reads

where MN (g, h; f) counts the number of lattice permutations of f/h of weight g are counted for which 2j + 1 appears no lower than row N + j of f for 1 ≤ j ≤ |g|/2.

Example. The special orthogonal group SO(N) has irreducible ordinary and spin representations labelled by signatures

  • f1≥f2≥⋯≥fn−1≥|fn| for N = 2n;
  • f1≥f2≥⋯≥fn≥0 for N = 2n+1.

The fi are taken in Z for ordinary representations and in ½ + Z for spin representations. In fact if an orthogonal matrix U has eigenvalues zi±1 for 1 ≤ i ≤ n, then the character of the corresponding irreducible representation πf is given by

Trπf(U)=det(zjfi+n−i+zj−fi−n+i)∏i<j(zi+zi−1−zj−zj−1)

for N = 2n and by

Tr⁡πf(U)=det(zjfi+1/2+n−i−zj−fi−1/2−n+i)∏i<j(zi+zi−1−zj−zj−1)⋅∏k(zk1/2−zk−1/2)

for N = 2n+1.

The branching rules from SO(N) to SO(N – 1) state that

for N = 2n + 1 and

for N = 2n, where the differences fi − gi must be integers.

Sign in to keep reading

4 more chapters are free with a Lably account.

More in Statistics