Let G be the group of order 21 generated by two elements a, b with the relations a^7 = 1, b^3 = 1, and bab^−1 = a^2. Construct the irreducible complex representations of G, and compute its character table.
1
Expert's answer
2013-02-13T11:27:57-0500
In preparation for the computation of the character table of G, we first note that G has five conjugacy classes, represented by 1,a,a3,b,b2. (This is an easy group-theoretic computation, which we omit.) Thus, we expect to have five irreducible complex representations. Obviously, [G,G]=<a>, so G/[G,G]∼<b>. This shows that there are three 1-dimensional representations χi:G→C∗, which are trivial on <a>, with χ1(b)=1, χ2(b)=ω, and χ3(b)=ω2, where ω is a primitive cubic root of unity. Next, we construct a 3-dimensional C-representation D:G→GL3(C) by taking
D(a)=⎝⎛ζζ2ζ4⎠⎞, and D(b)=⎝⎛001100010⎠⎞,
where ζ is a primitive 7th root of unity. (It is straightforward to check that the relations between a and b are respected by D.) If D is a reducible representation, it would have to "contain" a 1-dimensional representation. This is easily checked to be not the case. Thus, D is irreducible, and we get another irreducible 3-dimensional C-representation D′ by taking
D′(a)=D(a)=⎝⎛ζ6ζ5ζ3⎠⎞, and D′(b)=D(b)=⎝⎛001100010⎠⎞.
Note that we have D≅D′, since they have different characters, say χ4 and χ5. We have now computed all complex irreducible representations of G, arriving at the following character table:
(where α=ζ+ζ2+ζ4)
From the first column of this character table, we see that the Wedderburn decomposition of CG is: CG∼C×C×C×M3(C)×M3(C).
Comments