Homework Solution 7
Homework Solution 7
Homework 7 Solution
Chapter 7.
6. Let n be a positive integer. Let H = {0, ±n, ±2n, ±3n, · · · }. Find all left cosets of
H in Z. How many are there?
Note that H = hni. We claim that H, 1 + H, 2 + H, · · · , (n − 1) + H are all distinct
cosets of H.
Step 1. They are distinct.
If a + H = b + H for 0 ≤ a, b ≤ n − 1, then a ∈ b + H = {b, b ± n, b ± 2n, · · · }.
Because b is the only positive integer in b + H less than n, a = b. Therefore they
are distinct.
Step 2. They are all of them.
If c + H is a coset containing c ∈ Z, then by division algorithm, there are q and r
such that c = qn + r and 0 ≤ r < n. Then c ∈ r + H and c + H = r + H.
In summary, there are n distinct cosets.
1
MATH 3005 Homework Solution Han-Bom Moon
8. Suppose that a has order 15. Find all of the left cosets of ha5 i in hai.
Because |hai : ha5 i| = 15/3 = 5, there are 5 distinct cosets. Let H = ha5 i. We claim
that H, aH, a2 H, a3 H, a4 H are all cosets. They are distinct, because the smallest
positive n such that an is in the coset is 5, 1, 2, 3, and 4 respectively.
12. Let a and b be nonidentity elements of different orders in a group G of order 155.
Prove that the only subgroup of G that contains a and b is G itself.
Let H be a non-trivial subgroup of G containing both a and b. By Lagrange’s
theorem, |H| = 5, 31, or 155. If |H| = 5, then it is cyclic and all non-identity
elements have the same order 5. Similarly, if |H| = 31, all non-identity elements
are of order 31. Therefore |H| = 155 and H = G.
18. Recall that, for any integer n greater than 1, φ(n) denotes the number of posi-
tive integers less than n and relatively prime to n. Prove that if a is any integer
relatively prime to n, then aφ(n) mod n = 1.
Let a mod n = b. Because a is relatively prime to n, b ∈ U (n). Because |U (n)| =
φ(n), bφ(n) = b|U (n)| = 1 mod n. Therefore aφ(n) = bφ(n) = 1 mod n.
20. Use Corollary 2 of Lagrange’s Theorem (Theorem 7.1) to prove that the order of
U (n) is even when n > 2.
Because gcd(n − 1, n) = 1, n − 1 ∈ U (n). If n > 2, then n − 1 6= 1. Now
(n−1)2 = n2 −2n+1 = 1 mod n. Therefore |n−1| = 2. Because 2 = |n−1|||U (n)|,
|U (n)| is even.
27. Let |G| = 15. If G has only one subgroup of order 3 and only one of order 5, prove
that G is cyclic. Generalize to |G| = pq, where p and q are prime.
Note that for a non-identity element a ∈ G, |a| = 3, 5, or 15. Let A = {a ∈
G | |a| = 3} and B = {a ∈ G | |a| = 5}. For b ∈ A, hbi = {e, b, b2 } is a subgroup of
order 3. Because there is only one subgroup of order 3, A = {b, b2 } and |A| = 2.
Similarly, for c ∈ B, hci = {e, c, c2 , c3 , c4 } is the unique subgroup of order 5 and
B = {c, c2 , c3 , c4 }. Therefore |B| = 4. This implies that there are 15 − 2 − 4 − 1 = 8
elements of order 15 (The one is for the identity). Hence G is cyclic.
The argument can be generalized in a straightforward way. If we define Sp =
{a ∈ G | |a| = p} and Sq = {a ∈ G | |a| = q}, then |Sp | = p − 1 and |Sq | = q − 1.
Because (p − 1)(q − 1) > 0, |G| = pq > p − 1 + q − 1 + 1 = p + q − 1. Thus there is
an element of order pq and G is cyclic.
2
MATH 3005 Homework Solution Han-Bom Moon
42. Let G be a group of order n and k be any integer relatively prime to n. Show that
the mapping from G to G given by g → g k is one-to-one. If G is also Abelian,
show that the mapping given by g → g k is an automorphism of G.
Let φ : G → G is defined by φ(g) = g k . Because n and k are relatively prime, there
are two integers a, b such that an + bk = 1. If φ(g) = φ(h), then g k = hk . So
Therefore G is one-to-one.
Now suppose that G is Abelian. Then φ is one-to-one as above. Moreover, φ is
onto because an one-to-one map between two finite sets with the same number
of elements is onto as well. Finally, because G is Abelian,
Therefore φ is an automorphism.
45. Let G = {(1), (12)(34), (1234)(56), (13)(24), (1432)(56), (56)(13), (14)(23), (24)(56)}.
57. Let G = GL(2, R) and H = SL(2, R). Let A ∈ G and suppose that det A = 2.
Prove that AH is the set of all 2 × 2 matrices in G that have determinant 2.
Let D = {A ∈ GL(2, R) | det A = 2}.
If B ∈ AH, then B = AC where C ∈ H = SL(2, R). So det B = det AC =
det A det C = 2 · 1 = 2. Therefore B ∈ D and AH ⊂ D.
On the other hand, if B ∈ D, then B = AA−1 B and det A−1 B = det A−1 det B =
1/2 · 2 = 1. Therefore A−1 B ∈ SL(2, R) = H and B ∈ AH. Hence D ⊂ AH and
D = AH.