4 Induced representations

4.1 Definition

Suppose that H is a subgroup of G. Given a representation of G, we may construct a representation of H by restriction. What about the other direction — given a representation of H, is there a natural way to construct a representation of G? The answer is yes, and this is the induced representation.

More precisely, we start with a representation (σ,W) of H and want to construct a representation (ρ,V) of G which contains W as an H-subrepresentation. Suppose we have such a thing. Then, for each g∈G,

g⁢W={ρ⁢(g)⁢w:w∈W}

is a subspace of W (not necessarily an H-subrepresentation!). We should have that, if g=g′⁢h for some h∈H, then

g⁢W=g′⁢h⁢W=g′⁢W

so that g⁢W only depends on the left coset g⁢H. The representation is induced if there are “no more relations”. Formally:

Definition 4.1.

Let G be a finite group and let H be a subgroup. Let V be a representation of H and let W be a representation of G. We say that W is induced from V if:

  1. 1.

    There is an H-subrepresentation V0 of W that is isomorphic to V; and

  2. 2.

    If g1,…,gr are a set of left coset representatives for H in G, then

    W=g1⁢V0⊕…⊕gr⁢V0.

The action of G is determined by the direct sum decomposition: if g∈G and gi⁢v∈gi⁢V0 then we may write g⁢gi=gj⁢h for some j and some h∈H, and then

g⁢(gi⁢v)=(g⁢gi)⁢v=(gj⁢h)⁢v=gj⁢(h⁢v)∈gj⁢V0

and h⁢v is known since we have that V0 is isomorphic to V as an H-representation.

One can show that induced representations always exist (we didn’t do this in class). Here is one construction: Let

W={f:G→V such that f⁢(g⁢h)=h⁢f⁢(g) for all h∈H,g∈g}

with G-action (g⁢f)⁢(x)=f⁢(g−1⁢x) for all g,x∈G, f∈W. For any f∈W we can define its support

supp⁡(f)={g∈G:f⁢(g)≠0}

which will be a union of left cosets of H. We can then take V0={f:supp⁡(f)⊂H}; then gi⁢V0={f:supp⁡(f)⊂gi⁢H} and W=⨁i=1rgi⁢V0.

Lemma 4.2.

If V is a representation of H then any two representation of G induced from V are isomorphic.

Proof.

We defer this proof until after the discussion of Frobenius reciprocity below. ∎

The significance of the lemma is that we can talk about ‘the’ induced representation, since it is unique up to isomorphism.

Example 4.3.

Let (σ,ℂ2) be the two-dimensional representation of G=Dn such that σ⁢(r)=(ω00ω−1) and σ⁢(s)=(0110) — irreducible if ω≠±1. Let (χ,ℂ) be the one-dimensional representation of the subgroup H=⟨r⟩≅Cn with χ⁢(r)=ω.

The cosets of Cn in Dn are Cn,s⁢Cn. If V0=⟨e1⟩⊂ℂ2 then V0 is a Cn-subrepresentation isomorphic to χ, and s⁢V0=⟨e2⟩. We clearly have ℂ2=V0⊕s⁢V0, so this shows

IndCnDn⁡χ≅σ.
Example 4.4.

Suppose that V=ℂ is the trivial representation of H. Then the induced representation IndHG⁡(ℂ) coincides with the permutation representation associated to the left action of G on G/H. Indeed, IndHG⁡(ℂ) contains a vector v fixed by H (that is, a copy of the trivial representation of H), and if g1⁢H,…,gr⁢H are the left cosets of H in G then

g1⁢v,…,gr⁢v

are a basis for IndHG⁡(ℂ). Moreover, if g⁢(gi⁢H)=gj⁢H then g⁢gi=gj⁢h for some h∈H and so

g⁢gi⁢v=gj⁢h⁢v=gj⁢v.

This shows that G acts on these basis vectors ‘in the same way’ as it acts on the elements G/H, which is what we have to prove.

Proposition 4.5.

Inducing multiplies the dimension by the index of the subgroup:

dimIndHGV=[G:H]dimV.
Proof.

If g1⁢H,…,gr⁢H are the cosets of H in G then

IndHG⁡V=g1⁢V0⊕…⊕gr⁢V0

for some copy V0 of V in G. The dimension formula follows. ∎

4.2 Frobenius reciprocity

Theorem 4.6.

(Frobenius reciprocity) Let H⊂G be finite groups, let V be a representation of H, and let W be a representation of G induced from V. Then, for any representation U of G, there is an isomorphism of vector spaces

HomG⁡(W,U)→∼HomH⁡(V,U).
Proof.

We use the decomposition of W as

⨁gi⁢H∈G/Hgi⁢V0.

Since V0 is isomorphic to V as an H-representation, and the right hand side only depends on V up to isomorphism, we may as well assume that V is actually a subrepresentation of IndHG⁡V.

If ϕ~:W→U is a G-homomorphism, then the restriction ϕ of ϕ~ to V is an element of HomH⁡(V,U). We show that the map ϕ~↦ϕ is a (linear) bijection, which will prove the theorem.

Given ϕ:V→U an H-homomorphism, we must show that there is a unique G-homomorphism ϕ~:W→U such that ϕ~|V=ϕ.

Let g1⁢H,…,gr⁢H be the left cosets as usual. We must have

ϕ~⁢(gi⁢v)=gi⁢ϕ⁢(v)

for all i=1,…,r and v∈V, which shows the uniqueness of ϕ~. To show existence, define ψ:W→U by ψ⁢(gi⁢v)=gi⁢ψ⁢(v) for all i=1,…⁢r and v∈V; since W=⨁i=1rgi⁢V this defined a unique linear map. Since we may take g1=e, we see that ψ extends ϕ. To show it ψ is a G-homomorphism it is enough to show that ψ⁢(g⁢gi⁢v)=g⁢ψ⁢(gi⁢v) for all v∈V, i=1,…,r, and g∈G. Then g⁢gi=gj⁢h for some j∈{1,…,r} and h∈H and we have

ψ⁢(g⁢gi⁢v) =ψ⁢(gj⁢h⁢w)
=gj⁢ϕ⁢(h⁢w)
=gj⁢h⁢ϕ⁢(w)
as ϕ is an H-homomorphism
=g⁢gi⁢ϕ⁢(w)
=g⁢ψ⁢(gi⁢w).

This shows the existence of ϕ~=ψ, and we are done. ∎

Corollary 4.7.

Any two representations induced from isomorphic representations of H are isomorphic.

Proof.

If W,W′ are both induced from V, and V0,V0′ are their respective H-subrepresentations isomorphic to V, then let ϕ:V0→V0′ be an H-isomorphism. Then the construction in the previous proof provides a G-homomorphism ϕ~:W→W′ such that ϕ~⁢(v)=ϕ⁢(v) if v∈V0. As ϕ~ then defines an isomorphism of vector spaces gi⁢V0→gi⁢V0′ for each left coset representative gi⁢H and each of W and W′ is the direct sum of these, ϕ~ is an isomorphism. ∎

Corollary 4.8.

Let (ρ,V) be a representation of H with character χ, and let ψ be any class function on G. Then

⟨IndHG⁡χ,ψ⟩G=⟨χ,ResHG⁡ψ⟩H.
Proof.

This is true when ψ is the character of a representation of G by Frobenius reciprocity. In general, we can write χ as a linear combination of characters of representations of G, and deduce the result by linearity. ∎

If X and Y are vector spaces with inner products, then the adjoint of a linear map T:X→Y is a linear map T∗:Y→X such that

⟨T⁢x,y⟩=⟨x,T∗⁢y⟩

for all x∈X, y∈Y. Thus we say that induction is adjoint to restriction.

Exercise 4.9.

If W1,W2 are representations of H, then

IndHG⁡(W1⊕W2)≅IndHG⁡W1⊕IndHG⁡W2.
Exercise 4.10.

If H⊂K⊂G are subgroups, and W is a representation of H, then

IndHG⁡W≅IndKG⁡(IndHK⁡W).
Exercise 4.11.

If V is a representation of G and H is a subgroup, then

IndHG⁡ResHG⁡V≅V⊗IndHG⁡𝟙.

4.2.1 Example: S3 to S4

Table 3 below shows the irreducible characters ψi of S4 and χi of S3.

e(12)(12)⁢(34)(123)(1234)ψ011111ψ11−111−1ψ2202−1−1ψ331−10−1ψ43−1−101χ011N⁢A1N⁢Aχ11−1N⁢A1N⁢Aχ220N⁢A−1N⁢A
Table 3: Characters of S3 and S4

We regard S3 as the subgroup of S4 of elements that fix 4, and use Frobenius reciprocity to compute IndS3S4⁡χ2.

For each i, Frobenius reciprocity implies that

⟨IndS3S4⁡χ2,ψi⟩S4=⟨χ2,ψi|S3⟩S3.

The right hand side is easily seen to be zero for i=0,1 and one for i=2,3,4. We therefore have

IndS3S4⁡χ2=ψ2+ψ3+ψ4.

4.3 Characters

Let H⊂G be finite groups, and let (ρ,V) be a representation of H with character χ. We use Frobenius reciprocity to determine the character IndHG⁡χ of IndHG⁡ρ.

Theorem 4.12.

Suppose that we are in the above situation. Suppose that 𝒞 is a conjugacy class of G, and let 𝒞∩H=𝒟1∪…∪𝒟n where 𝒟1,…,𝒟n are conjugacy classes of H. Then

(IndHG⁡χ)⁢(𝒞)=|G||H|⁢∑i=1n|𝒟i||𝒞|⁢χ⁢(𝒟i).
Proof.

Let 1𝒞 be the indicator function of 𝒞. Then for any class function χ on G,

⟨χ,1𝒞⟩G=|𝒞||G|⁢χ⁢(𝒞).

So, combining this with Frobenius reciprocity,

(IndHG⁡χ)⁢(𝒞) =|G||𝒞|⁢⟨IndHG⁡χ,1𝒞⟩G
=|G||𝒞|⁢⟨χ,1𝒞⟩H
=|G||𝒞|⁢∑i=1n⟨χ,1𝒟i⟩H
=|G||𝒞|⁢∑i=1n|𝒟i||H|⁢χ⁢(𝒟i)
=|G||H|⁢∑i=1n|𝒟i||𝒞|⁢χ⁢(𝒟i)

which gives the claimed formula. ∎

Remark 4.13.

We derived the character formula from Frobenius reciprocity. It is also possible to go the other way around: prove the character formula directly, then derive Frobenius reciprocity as a consequence. Personally, I find that knowing Frobenius reciprocity is the easiest way to remember the character formula.

Remark 4.14.

If g∈G, we write CG⁢(g) for the centralizer of g:

CG⁢(g)={x∈G:x−1⁢g⁢x=g}.

By the orbit-stabiliser theorem, if 𝒞⁢(g) is the conjugacy class of g, then

|G||𝒞⁢(g)|=|CG⁢(g)|

giving an interpretation for some of the factors in the above formula.

Exercise 4.15.

Let H⊂G be groups and let χ be a character of H. If χ˙⁢(g)=χ⁢(g) if g∈H and 0 otherwise.

  1. 1.

    Show that the formula for the induced character may be rewritten

    (IndHG⁡χ)⁢(g)=1|H|⁢∑x∈Gχ˙⁢(x−1⁢g⁢x).
  2. 2.

    If g1⁢H,…,gr⁢H are the left cosets of H in G, show that

    (IndHG⁡χ)⁢(g)=∑i=1rχ˙⁢(gi−1⁢g⁢gi).
Example 4.16.

We continue with the example of the dihedral group. Let H=Cn⊂G=Dn, and let ψ:H→ℂ× be a homomorphism with ψ⁢(r)=ω. Then:

  • •

    IndHGψ(e)=[G:H]=2.

  • •

    IndHG⁡ψ⁢(s)=IndHG⁡ψ⁢(r⁢s)=0 as the conjugacy class of s or r⁢s does not intersect H.

  • •

    If 0<i<n/2, then the conjugacy class {r,r−1} of G splits into two conjugacy classes, {r} and {r−1}, of H. We have

    IndHG⁡(ψ)⁢(ri)=2⁢(12⁢ψ⁢(ri)+12⁢ψ⁢(r)−i)=ωi+ω−i.
  • •

    If i=n/2, then the conjugacy class {rn/2} of G remains as a single conjugacy class of H and

    IndHG⁡(ψ)⁢(rn/2)=2⁢ψ⁢(rn/2)=2⁢ωn/2.

Taking ω≠±1 we again obtain all the irreducible two-dimensional characters of Dn.

4.4 Example: D4 to S4

Let H be the subgroup of G=S4 isomorphic to D4, obtained by labeling the vertices of a square 1, …, 4 and letting D4 act on them. In other words, H is the image of the injective homomorphism D4→S4 sending

r↦(1234),s↦(12)⁢(34).

Recall that D4 has five irreducible representations with characters as shown:

Table 4: Character table of D4.
e r=(1234) r2=(13)⁢(24) s=(12)⁢(34) r⁢s=(13)
1 2 1 2 2
𝟙 1 1 1 1 1
δ 1 1 1 −1 −1
ϕ+ 1 −1 1 1 −1
ϕ− 1 −1 1 −1 1
θ 2 0 −2 0 0

while recall that S4 has character table

e(12)(12)⁢(34)(123)(1234)16386𝟙11111ϵ1−111−1χ31−10−1χ⁢ϵ3−1−101ψ202−10

We want to first find out how the conjugacy classes of S4 intersect with D4. The result is as follows, writing C⁢(g) for the conjugacy class of C⁢(g) in S4 or D4.

g∈S4C⁢(g)∩D4sizeseC⁢(e)1(12)C⁢(r⁢s)2(12)⁢(34)C⁢(r2)∪C⁢(s)1,2(123)∅−(1234)C⁢(r)2

We use this and the character formula to determine IndHG⁡ϕ+. The factor |G|/|H| is constant, equal to 3. We obtain:

IndHG⁡ϕ+e13(12)63⋅2/6⋅(−1)=−1(12)⁢(34)33⁢(1/3+2/3)=3(123)80(1234)63⁢(−2/6)=−1

Decomposing this character, we see that

IndHG⁡ϕ+=ϵ+ψ.

But note that we did not need to know the character table of S4 to find the induced character.

We check that this is consistent with Frobenius reciprocity: the restriction of ϵ to D4 is ϕ+, so

⟨ResHG⁡ϵ,ϕ+⟩=⟨ϵ,IndHG⁡ϕ+⟩=1

as required. The restriction of ψ to D4 is 𝟙+ϕ+ so

⟨ResHG⁡ψ,ϕ+⟩=⟨ψ,IndHG⁡ϕ+⟩=1

(we could also check that the restrictions of the other irreducible characters of S4 to D4 do not contain ϕ+).

4.5 Mackey’s formula — nonexaminable

We want to come up with a criterion for IndHG⁡χ to be irreducible. This is equivalent to

⟨IndHG⁡χ,IndHG⁡χ⟩G=1

which is in turn equivalent, by Frobenius reciprocity, to

⟨ResHG⁡IndHG⁡χ,χ⟩H=1.

So we try to solve the more general problem of decomposing ResHG⁡IndHG⁡V, as a representation of H. In fact, we will solve the more general problem of finding

ResHG⁡IndKG⁡V

for H and K arbitrary subgroups of G.

4.5.1 Double cosets

Let G be a group and let H,K be subgroups. A double coset H⁢g⁢K is a set of the form

H⁢g⁢K={h⁢g⁢k:h∈H,k∈K}.

Like cosets, any two double cosets are either equal or disjoint, so they partition the group. Unlike cosets, they do not have to have the same size. A sequence g1,…,gr such that G is the disjoint union

G=∐i=1rH⁢gi⁢K

is called a set of double coset representatives for H and K in G. We write H\G/K for the set of double cosets of H and K in G.

Lemma 4.17.

The double cosets H⁢g⁢K are the in bijection with the orbits of H acting on G/K.

Proof.

Two cosets g⁢K and g′⁢K are in the same H-orbit, if and only if h⁢g⁢K=g′⁢K for some h∈H, if and only if

H⁢g⁢K=H⁢g′⁢K.

So we have a bijection which takes the double coset H⁢g⁢K to the H-orbit of g⁢K. ∎

Example 4.18.

Let H=K=Sn−1⊂G=Sn, n≥3, thinking of H as the set of elements that fix the number n. Then H=H⁢e⁢H is one double coset. I claim that G=H∪H⁢(n−1⁢n)⁢H. Indeed, a complete set of left coset representatives for H in G is

{e,(1⁢n),(2⁢n),…,((n−1)⁢n)}.

As I can write (i⁢n)=(i⁢n−1)⁢(n−1⁢n)⁢(i⁢n−1)∈H⁢(n−1⁢n)⁢H for i≤n−1, we see that the left cosets (1⁢n)⁢H,…,(n−1⁢n)⁢H are all contained in the same double coset H⁢(n−1⁢n)⁢H, as required.

This may be clearer from the orbits point of view. There is a bijection G/H→{1,…,n} which respects the action of G — the bijection takes g⁢H to g⁢(n). The orbits of H=Sn−1 acting on {1,…,n} are {n} and {1,…,n−1}, which gives the two double cosets.

If s⁢K is a left coset of K, we write Hs=H∩s⁢K⁢s−1; note that this is independent of choice of representative s. The notation is motivated by the fact that Hs is the stabiliser of s⁢K for the action of H on G/K discussed above. This leads to the following lemma.

Lemma 4.19.

If s∈G, then as a disjoint union of cosets of K we have

H⁢s⁢K=h1⁢s⁢K∪h2⁢s⁢K⁢…∪hr⁢s⁢K

where h1,…,hr are a complete set of left coset representatives for Hs in H.

4.5.2 Mackey’s formula

Suppose that K⊂G, that s∈G, and that (ρ,V) is a representation of K. Then we can define a representation (ρs,V) of Hs=s⁢H⁢s−1 by taking Vs=V (same vector space) and ρs⁢(h)=ρ⁢(s−1⁢h⁢s) for h∈Hs.

Theorem 4.20.

(Mackey’s formula) Let H,K be subgroups of G and let (ρ,V) be a representation of K. Let s1,…,sr be a set of double coset representatives for H and K in G.

Then

ResHG⁡IndKG⁡V≅⨁s∈{s1,…,sr}IndHsH⁡ResHsKs⁡Vs.
Proof.

Let g1,…,gn be the left coset representatives for K in G. Then

IndKG⁡V=g1⁢V⊕…⊕gn⁢V.

The action of H permutes the gi⁢V among themselves, with gi⁢V and gj⁢V in the same H-orbit if and only if H⁢gi⁢K=H⁢gj⁢K. Therefore for each double coset H⁢s⁢K we have an H-subrepresentation

Ws=⨁i:gi⁢K⊂H⁢s⁢Kgi⁢V.

Now, by lemma 4.19 above, these gi have the form hi⁢s for hi a set of left coset representatives for Hs in H. From the decomposition

Ws=⨁hi⁢Hs∈H/Hshi⁢s⁢V

we see that

Ws≅IndHsH⁡s⁢V.

It remains to show that s⁢V, as a representation of Hs, is isomorphic to Vs. The map Vs→s⁢V taking v to s⁢v is the required isomorphism, because

ρ⁢(h)⁢(s⁢v)=ρ⁢(h)⁢ρ⁢(s)⁢v=ρ⁢(s)⁢ρ⁢(s−1⁢h⁢s)⁢v=s⁢ρs⁢(h)⁢v.

∎

4.5.3 Irreducibility criterion

Theorem 4.21.

Let ρ be an irreducible representation of H⊂G. Then IndHG⁡ρ is irreducible if and only if, for every g in a set of double coset representatives of H\G/H, with g∉H,

HomHg⁡(ρ,ρg)=0

where Hg=H∩g⁢H⁢g−1.

Proof.

Indeed, let S=g0,…,gr be such a set of double coset representatives, with g0∈H. By Mackey’s formula and Frobenius reciprocity,

⟨IndHG⁡ρ,IndHG⁡ρ⟩G =⟨ρ,ResHG⁡IndHG⁡ρ⟩H
=⟨ρ,⨁g∈SIndHgH⁡ρg⟩H
=⟨ρ,ρ⟩H+∑g∈{g1,…,gr}⟨ρ,IndHgH⁡ρg⟩H
=⟨ρ,ρ⟩H+∑g∈{g1,…,gr}⟨ρ,ρg⟩Hg.

Since ρ is irreducible, the first term on the right is equal to 1 and all the other terms are at least 0. So

⟨IndHG⁡ρ,IndHG⁡ρ⟩G≥1

with equality if and only if HomHg⁡(ρ,ρg)=0 for all g∈S∖H. The result follows. ∎

Corollary 4.22.

If H⊲G and ρ is an irreducible representation of H, then

IndHG⁡ρ

is irreducible if and only if ρ≇ρg for all g in a set of coset representatives of H in G with g∉H.

Proof.

If H is normal, then double cosets, left cosets, and right cosets are all the same. For g∈G, ρg is another irreducible representation of H so

HomH⁡(ρ,ρg)≠0

if and only if ρ≇ρg. ∎

4.5.4 Mackey examples

Example 4.23.

Let G=Dn⊃H=Cn. Let χ:Cn→ℂ× with χ⁢(r)=ω. The previous corollary shows that

IndHG⁡χ

is reducible if and only if χ≅χs. But

χs⁢(r)=χ⁢(s−1⁢r⁢s)=χ⁢(r−1)=ω−1.

So IndHG⁡χ is irreducible if and only if ω≠ω−1 (which we already knew).

Example 4.24.

Let ρ be an irreducible representation of Sn−1⊂Sn with character χ. Then {e,s} is a set of double coset representatives for Sn−1 in Sn, where s=(n−1⁢n). We have

Sn−1s∩Sn−1=Sn−2

of elements fixing n−1 and n.

Moreover, χs≅χ (because elements of Sn−2 are conjugate in Sn−2 if and only if they are conjugate in Sn−1, so they have the same character!) and so we see

⟨IndSn−1Sn⁡χ,IndSn−1Sn⁡χ⟩ =⟨χ,χ⟩Sn−1+⟨χ,χ⟩Sn−2
=1+⟨χ,χ⟩Sn−2.

For example, if χ is the degree 2 irreducible character of S4, then χ|S3 is still irreducible so the right hand side of this formula gives two. And indeed,

IndS4S5⁡χ=ψ+ψ⁢ϵ

where ψ is one of the irreducible five-dimensional representations of S5.

4.5.5 Index two

Let G be a group and let H be a subgroup of index two (necessarily normal). Let s∈G with s∉H. Let ϵ:G→ℂ× be the unique (order two) character with kernel H.

Of course, we have in mind the example H=An, G=Sn.

Theorem 4.25.

Suppose that ρ is an irreducible representation of H. Then

  1. 1.

    if ρ≅ρs, then

    IndHG⁡ρ≅σ⊕ϵ⁢σ

    for some irreducible representation σ of G with ResHG⁡σ≅ρ.

  2. 2.

    if ρ≇ρs, then

    σ=IndHG⁡ρ

    is irreducible, with σ≅ϵ⁢σ.

Proof.

Let ρ have character χ. By the normal subgroup case of Mackey’s theorem,

⟨IndHG⁡χ,IndHG⁡χ⟩G=1+⟨χ,χs⟩H.

It follows that the induction IndHG⁡χ is irreducible if and only if χ≠χs. This gives the second statement, and most of the first (we leave the proof that, in all cases, IndHG⁡χ≅ϵ⁢IndHG⁡χ as an exercise.)

If χ=χs, then we have IndHG⁡χ=ψ+ψ′ for some irreducible characters ψ and ψ′ of G. Restricting to H, we have ψ|H+ψ′|H=2⁢χ so that ψ extends χ. But then we have

IndHG⁡χ=IndHG⁡ResHG⁡ψ=ψ⁢(IndHG⁡𝟙)=ψ⁢(𝟙+ϵ)=ψ+ϵ⁢ψ

so that IndHG⁡χ=ψ+ϵ⁢ψ as required. ∎

4.6 Example: GL2(Fp) — nonexaminable

Let 𝔽p be the field of integers modulo p, with p a prime. We will construct some of the irreducible representation of G=G⁢L2⁢(𝔽p) by induction from the subgroup of upper triangular matrices. We will use Mackey theory to show that these representations are irreducible.

4.6.1 The group GL2(Fp)

Proposition 4.26.

The order of the group G⁢L2⁢(𝔽p) is

p⁢(p+1)⁢(p−1)2.

We let B⊂G⁢L2⁢(𝔽p) be the subgroup of upper triangular invertible matrices:

B={(∗∗0∗)∈G⁢L2⁢(𝔽p)}.

The group B is sometimes called a Borel subgroup.

Proposition 4.27.

The index of B in G is p+1. A set of left coset representatives for G/B is

{(0110)}∪{(10i1):0≤i≤p−1}.

We write w=(0110). We will want to know the double cosets of B in G, and the result is

Proposition 4.28.

We have

B\G/B=B∪B⁢w⁢B.

For later use, we compute

w⁢(xz0y)⁢w−1=(y0zx)

so that

Bw=B∩Bw={(x00y):x,y∈𝔽p×}.

4.6.2 Characters of B and their inductions.

Let χ1 and χ2 be two characters of 𝔽p×. Then there is a character

χ1⋅χ2:B→ℂ×

defined by

(χ1⋅χ2)⁢((xz0y))=χ1⁢(x)⁢χ2⁢(y).

Define

π⁢(χ1,χ2)=IndBG⁡(χ1⋅χ2).

If χ:𝔽p×→ℂ× is a character, then we get a character

χ∘det:G→ℂ×

taking g to χ⁢(det(g)).

Lemma 4.29.

If χ1,χ2,χ:𝔽p×→ℂ× are characters, then

π⁢(χ1⁢χ,χ2⁢χ)≅(χ∘det)⊗π⁢(χ1,χ2).
Lemma 4.30.

On Bw, we have

(χ1⋅χ2)w=χ2⋅χ1.
Theorem 4.31.

If χ1,χ2:𝔽p×→ℂ× are characters, then:

  1. 1.

    If χ1≠χ2, then

    π⁢(χ1,χ2)

    is an irreducible representation of dimension p+1.

  2. 2.

    There is an irreducible representation σ of dimension p such that, for any χ:𝔽p×→ℂ×,

    π⁢(χ,χ)≅(χ∘det)⊗(𝟙⊕σ).
  3. 3.

    There is an isomorphism

    π⁢(χ1,χ2)≅π⁢(χ1′,χ2′)

    if and only if (χ1,χ2)=(χ1,χ2) or (χ2,χ1).

  4. 4.

    For χ≠χ′, the representations (χ∘det)⊗σ and (χ′∘det)⊗σ are not isomorphic.

One can prove the theorem using Mackey theory, but it is also possible to avoid that and directly compute the inner products of the induced characters.

The representations π⁢(χ1,χ2), χ∘det, and χ∘det⊗σ are not all of the irreducible representations of G⁢L2⁢(𝔽p). There is another family of p−1-dimensional representations called the cuspidal representations, which are more difficult to construct: see [MR1153249] Lecture 5, or [MR1864147] Chapter 28.

4.6.3 Computing the induced character

Finally, we can compute the character of π⁢(χ1,χ2).

We will need to know the conjugacy classes of G and of B. The characteristic polynomial almost determines the conjugacy classes; the result is as follows. Recall that the size of the conjugacy class of g∈G is |G||CG⁢(g)| where CG⁢(g) is the centralizer of g in G.

Proposition 4.32.

Every element of G is conjugate to exactly one of the following elements:

  1. 1.

    (x00x),x∈𝔽p×

  2. 2.

    (x10x),x∈𝔽p×

  3. 3.

    (x00y),x,y∈𝔽p×,x≠y

  4. 4.

    (0−d1t),t∈𝔽p,d∈𝔽p× such that X2−t⁢X+d=0 has no solutions in 𝔽p.

For each type of element G, the order of the centralizer subgroup is:

  1. 1.

    |G|=p⁢(p+1)⁢(p−1)2

  2. 2.

    p⁢(p−1)

  3. 3.

    (p−1)2

  4. 4.

    (p−1)⁢(p+1).

Proof.

We sketch the proof. Let X2−t⁢X+d be the characteristic polynomial of an element g∈G. If it has distinct roots in 𝔽p, then g is diagonalizable and we are in case 3. If it has no roots in 𝔽p, then choosing a basis v,g⁢v (for some V∈𝔽p2) puts us in case 4. If the roots are identical, both equal to x, there are two possibilities: either the matrix is a scalar matrix, giving case 1, or v,(g−x⁢I)⁢v is a basis for some v∈𝔽p2 and then we are in case 2.

In each case, the centralizer can be computed explicitly and checked to have the order claimed (the most difficult case is the fourth). ∎

Now let χ:𝔽p×→ℂ× be a character. We compute the character of π⁢(χ,𝟙); after twisting by a character of the form χ′∘det this gives the general case. In the case χ=𝟙, we also record the character of σ.

Theorem 4.33.

The characters are as follows (where x≠y, and X2−t⁢X+d has no solutions in 𝔽p):

(x00x)(x10x)(x00y)(0−d1t)1(p−1)⁢(p+1)p⁢(p+1)p⁢(p−1)π⁢(χ,𝟙)(p+1)⁢χ⁢(x)χ⁢(x)χ⁢(x)+χ⁢(y)0σp01−1