Homework 5
MATH 301/601
Test #5 is on Wednesday, April 23
Instructions. Read the Homework Guide to make sure you understand how to successfully complete the assignment. Click here for a pdf version of the homework.
Exercise 1.
Let be a group. Define the relation on as follows: if and only if is conjugate to (that is, there exists such that ). Prove that is an equivalence relation.
Exercise 2.
Prove that the 3-cycles and are not conjugate in .
Exercise 3.
In http://abstract.ups.edu/aata/cosets-exercises.html of the textbook, complete Exercises 1, 2, 3, 4, 5(a)-(f), and 6.
*Exercise 4.
Let be a subgroup of a group and let .
-
(a)
Prove that if , then .
-
(b)
Prove that if , then .
*Exercise 5.
Let be a subgroup of . Prove that if for all and for all , then for all .
Exercise 6.
Let be a group and a subgroup of . Suppose that . Prove that if are not in , then .
*Exercise 7.
Let be a group and let be a subgroup of . Prove that if , then for all .
*Exercise 8.
Let . Use Fermat’s Little Theorem to show that if is prime, then there is no solution to the equation .
Exercise 9.
Let be prime. How many subgroups does have? Prove it.
Exercise 10.
Let be an isomorphism of groups.
-
(a)
Prove that . (Hint: usse the fact that .)
-
(b)
Prove that for all .
-
(c)
Prove that for all and for all .
-
(d)
Prove that is an isomorphism.
*Exercise 11.
Prove that is isomorphic to the subgroup of consisting of matrices of the form .
Exercise 12.
Prove that is not isomorphic to .
Definition 1.
An automorphism of a group is an isomorphism .
*Exercise 13.
Let be a finite abelian group of order . Suppose is relatively prime to . Prove that given by is an automorphism of . (This says that every element of has an -root.)
Exercise 14.
Let be a group. Prove that the set of automorphisms of , denoted , is a group with respect to function composition (this group is called the automorphism group of .).
*Exercise 15.
-
(a)
Let be a cyclic group, and let . Prove that if is a generator of and , then .
-
(b)
Use part (a) to compute .
**Exercise 16.
Use part (a) of the previous exercise, together with Exercise 13, to show that is isomorphic to .
Double-star problem set up111See Section 14.1
Definition 2.
Let be a group, and let be a set. A group action of on is a function satisfying:
-
(i)
for all , and
-
(ii)
for all and for all .
Usually the group action is clear from context and we simply write or instead of . In this notation, (i) says for all , and (ii) says . Again suppressing the function , we generally write to denote the fact that the group is acting on the set .
In the “real world”, we generally think about a group by the way it acts on some set. For example, we think about the dihedral groups via their action on regular polygons, and we think of matrix groups via their action on vector spaces.
Definition 3.
Let . Given , the orbit of , denoted , is the subset of given by
and the stabilizer of , denoted is the subgroup222You should convince yourself that this is indeed a subgroup. of given by
The goal of the next exercise is to prove the following:
Theorem 4 (Orbit–Stabilizer Theorem).
Let be a group acting on a set . If , then .
The orbit–stabilizer theorem should be viewed as a generalization of Lagrange’s theorem (which we will use to prove the orbit–stabilizer theorem). Indeed, let be a subgroup of , and let be the left cosets of . Then acts on by , with and .
**Exercise 17.
Let be a group acting on a set . Let .
-
(a)
Let . Prove that if and only if .
-
(b)
Let be the set of left cosets of in . Let be given by .
-
(i)
Prove that is a well-defined, that is, prove that if , then .
-
(ii)
Prove that is bijective.
-
(i)
The previous part implies that . Lagrange’s theorem tells us that , yielding the orbit-stabilizer theorem.
**Exercise 18.
Let be a finite group. Use the orbit–stabilizer theorem to show that, for , the cardinality of the set (that is, the conjugacy class of ) divides .