Prerequisites
Problem 1. Let be a group. Given , define by
Show that is a group, where .
Solution: We have to verify the group axioms. Firstly, for any ,
showing that is associative (here we used that we know that is associative). Next we verify that is an identity for :
Finally, we show that every element has an inverse: for any ,
(it follows that is also a left inverse of ).
Problem 2. Find all subgroups of .
Solution: Recall that the order of any element and any subgroup must divide the order of the group. Since , there are eight elements, hence any subgroup must have order , or . The subgroup of order one is , and the order eight subgroup is itself. The order two subgroups are all of the form where . Going through the elements one by one, we see that the possibilities are , , , , . Finally, we search for the order four subgroups. Clearly is a cyclic subgroup of order four. Noting that and are the only group elements of order four, the other subgroups of order four must be of the form , where and are two commuting elements of order two, and hence is also of order two. Systematically multiplying together the order two elements gives the subgroups , , and no other possibilities.
Problem 3.
Compute the conjugacy classes of .
Solution: Recall that . The systematic way to find conjugacy classes is to go through the group element by element, repeatedly conjugating by the generators until all elements have been assigned to a conjugacy class. The singleton is a conjugacy class. , so it too is its own conjugacy class. Then taking the element and conjugating by the generators gives , , and Since , and , conjugating by the generators gives no new elements, hence is a conjugacy class. By symmetry in , the remaining conjugacy classes are and .
There are therefore 5 conjugacy classes of : , , , , and .
Problem 4. Compute the conjugacy classes of .
Solution: We proceed as in Problem 3: , with generators and . The singleton is a conjugacy class. Conjugating by the generators gives , and , so is in the same conjugacy class as . Now conjugating by the generators yields , and , hence is a conjugacy class. Conjugating by the generators: , . Since all elements of a conjugacy class have the same order, and and are the only order four elements, no other elements can be in the conjugacy class . Starting with the element : , and . Now conjugating : and , giving the conjugacy class . All that remains is ,
i.e. the conjugacy classes of are as follows: , , , , and .
Problem 5.
Find the conjugacy classes of .
Solution: is of course a conjugacy class. The other elements are all of the form or . Since is cyclic (and hence Abelian), conjugating with an element just returns . On the other hand, conjugating with gives
This shows that is a conjugacy class for (Note that if is even, then is its own conjugacy class.) Now taking an arbitrary and conjugating with gives
Since , we see that if is odd, given any and , we can find s.t. .
Thus, for odd the conjugacy classes are , , , and .
On the other hand, if is even, then we see that repeatedly conjugating with returns all elements with . We also check that conjugating with has the same behaviour:
again since is even, and have the same parity mod . The conjugacy classes for even are therefore , , , , .
Problem 6. Let a group act on a set . Show that the stabiliser of a point , , is a subgroup of . Note that it is often called the stabiliser subgroup.
Solution: Suppose , then
Thus . Also note that, for any ,
and thus . As is clearly nonempty () it is a subgroup of .
Problem 7. Show that . Hint: Label the vertices of the triangle by and consider the action of on them.
Solution: Labelling the vertices of the triangle counterclockwise from (1,0), we see that moves to the position of , to ’s spot, and back to ’s place. on the other hand leaves fixed and swaps and . This suggests we should try to make a homomorphism by defining
In order for this to define a homomorphism, we simply need to verify that and satisfy the same relations as and . is a two-cycle, and is a three-cycle, so . It remains to check the relation . On the one hand,
while using that gives
hence is a homomorphism. In order to show that it is an isomorphism, we compute . All group elements are of the form , where or , and . Looking at the elements , if , then only holds if . For the elements ,
we have , and , hence . Then by the isomorphism theorem, . However, since , we must have .
Problem 8. Identify, with proof, the group given in Example 0.7.
Solution: We will show this by constructing a group homomorphism and then showing it is an isomorphism. Consider the map
|
|
|
|
|
|
|
|
|
|
|
|
This is a groups homomorphism as all relations are preserved by : , and . As both groups have order and the kernel is trivial we have a bijection. Thus the groups are isomorphic
Problem 9. Show that any finite group is isomorphic to a subgroup of .
Solution: Label the elements of . For each group element , we define a permutation by the rule . Since the map is a bijection on , is a well-defined map from to . We claim that it is a homomorphism:
hence for all . We also claim that : note that . Thus .
Problem 10. For a prime , compute the orders of and .
Problem 11. Prove Proposition 0.25.