Good luck to everyone taking the January TST for the IMO 2015 tomorrow!
Now that we have products of irreducibles under our belt,
I’ll talk about the finite regular representation and use it to derive the
following two results about irreducibles.
- The number of (isomorphsim classes) of irreducibles ρα is equal
to the number of conjugacy classes of G.
- We have ∣G∣=∑α(dimρα)2.
These will actually follow as corollaries from the complete decomposition of the
finite regular representation.
In what follows k is an algebraically closed field, G is a finite group,
and the characteristic of k does not divide ∣G∣.
As a reminder, here are the representations we’ve already seen in the order we met them,
plus two new ones we’ll introduce properly below.
RepresentationρFun(X)trivGρ1⊕ρ2ρ1⊠ρ2ResHG(ρ)ρ1⊗ρ2Reg(G)ρ∨GroupVGGGG1×G2HGG×GV∨SpaceGFun(X)kV1⊕V2V1⊗V2VV1⊗V2Fun(G)GActionG→g⋅ρV(g⋅f)(x)=f(g−1⋅x)g⋅a=ag⋅(v1+v2)=(g⋅ρ1v1)+(g⋅ρ2v2)(g1,g2)⋅(v1⊗v2)=(g1⋅ρ1v1)⊗(g2⋅ρ2v2)h⋅v=h⋅ρvg⋅(v1⊗v2)=(g⋅ρ1v1)⊗(g⋅ρ2v2)(g1,g2)⋅f(g)=f(g2gg1−1)(g⋅ξ)(v)=ξ(g−1⋅ρv)
1. The regular representation
Recall that Fun(G) is the vector space of functions from G to k,
with addition being defined canonically. It has a basis of functions δg for each g∈G, where
δg(x)={10x=gotherwise
for every x∈G. (Throughout this post,
I’ll be trying to use x to denote inputs to a function from G to k.)
Definition. Let G be a finite group.
Then the finite regular representation,
Reg(G) is a representation on G×G defined on the vector space Fun(G),
with the following action for each f∈Fun(G) and (g1,g2)∈G×G:
(g1,g2)⋅f(x):=f(g2xg1−1).
Note that this is a representation of the
product G×G, not G!
(As an aside, you can also define this representation for infinite groups G by
replacing Fun(G) with Func(G),
the functions which are nonzero at only finitely many g∈G.)
In any case, we now can make Reg(G) into a representation of G by this restriction,
giving ResGG×G(Reg(G)),
which I will abbreviate as just Reg∗(G) through out this post
(this is not a standard notation). The action for this is
(g⋅Reg∗(G)f)(x):=((g,g)⋅Reg(G)f)(x)=f(g−1xg).
Exercise. Consider the invariant subspace of Reg∗(G), which is
(Reg∗(G))G={f:G→V∣f(g−1xg)=f(x)∀x,g∈G}.
Prove that the dimension of this space is equal to the number of conjugacy classes of G.
(Look at the δg basis.)
Recall that in general, the invariant subspace ρG is defined as
ρG:={v∈V∣g⋅ρv=v∀g∈G}.
2. Dual representations
Before I can state the main theorem of this post, I need to define the dual representation.
Recall that given a vector space V, we define the dual space by
V∨:=Hom(V,k)
i.e. it is the set of maps from V to k.
If V is finite-dimensional, we can think of this as follows:
if V consists of the column vectors of length m, then V∨ is the row vectors of length m,
which can be multiplied onto elements of V.
(This analogy breaks down for V infinite dimensional.) Recall that if V is
finite-dimensional then there is a canonical isomorphism
V≃(V∨)∨ by the map v↦evv,
where evv:V∨→k sends ξ↦ξ(v).
Now we can define the dual representation in a similar way.
Definition. Let ρ=(V,⋅ρ) be a G-representation.
Then we define the dual representation ρ∨ by
ρ∨=(V∨,⋅ρ∨)where(g⋅ρ∨ξ)(v)=ξ(g−1⋅ρv).
Lemma 1. If ρ is finite-dimensional then (ρ∨)∨≃ρ by the same isomorphism.
Proof: We want to check that the isomorphism V=(V∨)∨ by
v↦evv respects the action of G. That’s equivalent to checking
evg⋅ρv=g⋅(ρ∨)∨evv.
But
evg⋅v(ξ)=ξ(g⋅ρv)
and
(g⋅(ρ∨)∨evv)(ξ)=evv(g−1⋅ρ∨ξ)=(g−1⋅ρ∨ξ)(v)=ξ(g⋅ρv).
So the functions are indeed equal. □
Along with that lemma, we also have the following property.
Lemma 2. For any finite-dimensional ρ1,
ρ2 we have HomG(ρ1,ρ2)≃HomG(ρ1⊗ρ2∨,trivG).
Proof: Let ρ1=(V1,⋅ρ1) and ρ2=(V2,⋅ρ2).
We already know that we have an isomorphism of vector homomorphisms
HomVect(V1,V2)≃HomVect(V1⊗V2∨,k)
by sending each T∈HomVect(V1,V2) to the map
T′∈HomVect(V1⊗V2∨,k) which has T′(v⊗ξ)=ξ(T(v)).
So the point is to check that T respects the G-action if and only if T′ does.
This is just a computation. □
You can deduce as a corollary the following.
Exercise. Use the lemma to show
HomG(ρ,trivG)≃HomG(trivG,ρ∨).
Finally, we want to talk about when ρ∨ being irreducible. The main result is the following.
Lemma 3. Consider a representation ρ, not necessarily finite-dimensional.
If ρ∨ is irreducible then so is ρ.
When ρ is finite dimensional we have (ρ∨)∨≃ρ,
and so it is true for finite-dimensional irreducible ρ that ρ∨ is also irreducible.
Interestingly, this result fails for infinite-dimensional spaces as this
math.SE thread shows.
Proof: Let ρ=(V,⋅ρ). Let W be a ρ-invariant subspace of V. Then consider
W⊥={ξ∈V∨:ξ(w)=0}.
This is a ρ∨-invariant subspace of V∨, so since ρ∨ is irreducible,
either W⊥=V∨ or W⊥={0}. You can check that these imply W=0 and W=V, respectively.
□
3. Main result
Now that we know about the product of representations and dual modules,
we can state the main result of this post: the complete decomposition of Reg(G).
Theorem 4. We have an isomorphism
Reg(G)≃α⨁ρα⊠ρα∨.
Before we can begin the proof of the theorem we need one more lemma.
Lemma 5. Let π be a representation of G×G. Then there is an isomorphism
HomG×G(π,Reg(G))≃HomG(ResGG×G(π),trivG).
Proof: Let π=(V,⋅π).
Given a map T:V→Fun(G) which respects the G×G action,
we send it to the map ξT:V→k with ξT(v)=T(v)(1).
Conversely, given a map ξ:V→k which respects the G action,
we send it to the map Tξ:V→Fun(G) so that
Tξ(v)(x)=ξ((x,x−1)⋅v).
Some very boring calculations show that the two maps are mutually inverse and respect the action.
We’ll just do one of them here:
let us show that ξT(v) respects the G action given that T respects the G×G action.
We want to prove
ξT((g,g)⋅πv)=g⋅trivξT(v)=ξT(v).
Using the definition of ξT
ξT((g,g)⋅π(v))=T((g,g)⋅πv)(1)=((g,g)⋅Fun(G)T(v))(1)=T(v)(g1g−1)=T(v)(1)=ξT(v).
The remaining computations are left to a very diligent reader. □
Now let’s prove the main theorem!
Proof: We have that Reg(G) is the sum of finite-dimensional
irreducibles ρα⊠ρβ, meaning
Reg(G)=α,β⨁(ρα⊠ρβ)⊗HomG×G(ρα⊠ρβ,Reg(G)).
But using our lemmas, we have that
HomG×G(ρα⊠ρβ,Reg(G))≃HomG(ρα⊗ρβ,trivG)≃HomG(ρα,ρβ∨).
We know that ρβ∨ is also irreducible,
since ρβ is (and we’re in a finite-dimensional situation). So
HomG(ρα,ρβ∨)≃{k{0}ρβ∨=ραotherwise.
Thus we deduce
Reg(G)≃α⨁(ρα⊠ρα∨)⊗k≃α⨁(ρα⊠ρα∨)
and we’re done. □
4. Corollaries
Recall that Fun(G), the space underlying Reg(G),
has a basis with size ∣G∣.
Hence by comparing the dimensions of the isomorphsims, we obtain the following corollary.
Theorem 6. We have ∣G∣=∑α(dimρα)2.
Moreover, by restriction to G we can obtain the corollary
Reg∗(G)≃α⨁ResGG×G(ρα⊗ρα∨)=α⨁ρα⊗ρα∨.
Now let us look at the G-invariant spaces in this decomposition. We claim that
(ρα⊗ρα∨)G≃k.
Indeed, {Proposition 1} in {Part 1} tells us that we have a bijection of vector spaces
(ρα⊗ρα∨)G≃HomG(trivG,ρα⊗ρα∨).
Then we can write
HomG(trivG,ρα⊗ρα∨)≃HomG(trivG,(ρα∨⊗ρα)∨)≃HomG(ρα∨⊗ρα,trivG)≃HomG(ρα⊗ρα∨,trivG)≃HomG(ρα,ρα)≃k
by the lemma, where we have also used Schur’s Lemma at the last step.
So that means the dimension of the invariant space (Reg∗(G))G
is just the number of irreducibles.
But we already showed that the invariant space of (Reg∗(G))G
has dimension equal to the conjugacy classes of G. Thus we conclude the second result.
Theorem 7. The number of conjugacy classes of G equals the number of
irreducible representations of G.
Hooray!
Time permitting I might talk about the irreducibles of Sn in subsequent posts. No promises here though.
Thanks to Dennis Gaitsgory, who taught me this in his course Math 55a.
My notes for Math 55a can be found at my website.