Math 210A: Algebra, Homework 1

Transcription

1 Math 210A: Algebra, Homework 1 Ian Coley October 9, 2013 Problem 1. Let a 1, a 2,..., a n be elements of a group G. Define the product of the a i s by induction: a 1 a 2 a n = (a 1 a 2 a n 1 )a n. (a) Prove that a 1 a 2 a n b 1 b 2 b m = (a 1 a 2 a n )(b 1 b 2 b m ). (b) Prove that a 1 a 2 a n is equal to the product of the a i s with the parentheses inserted arbitrarily. (a) We proceed by induction on m. Clearly a 1 a n b 1 = (a 1 a n )(b 1 ). Now assume the case of m = k. Then a 1 a n b 1 b k b k+1 = (a 1 a n b 1 b k )b k+1 = (a 1 a n )(b 1 b k )b k+1 = (a 1 a n )(b 1 b k b k+1 ). This completes the argument. (b) Write a 1 a 2 a n = a 1 a m a m+1 a n for any 1 < m < n. Then by 1(a), a! a n = (a 1 a m )(a m+1 a n ). We may continue this process for either of the terms, hence the general product is equal to one with arbitrarily many parentheses inserted. Problem 2. (a) Prove that for any n N, the set of all complex nth roots of unity forms a group with respect to complex multiplication. Show that this group is cyclic. (b) Prove that if G is a cyclic group of order n and k divides n, then G has exactly one subgroup of order k. (a) Let µ denote the nth roots of unity, and let ζ 1, ζ 2 µ. Then (ζ 1 ζ 2 ) n = ζ n 1 ζ n 2 = 1 C, so ζ 1 ζ 2 µ as well. Further, 1 n = 1 C so 1 µ. Thus µ is a subgroup under multiplication in C. Suppose µ is a primitive nth root unity, i.e. ord(ζ) = n. Then ζ = n = µ and ζ µ, so ζ = µ so µ is cyclic. 1

2 (b) First, we claim that a subgroup of a cyclic group is still cyclic. Let H G = a be a subgroup. Let m be the smallest positive integer such that a m H. We claim that a m = H. Let h H, and let h = a s. By the division algorithm, we may write s = mq + r where 0 r < m. Therefore h = (a m ) q a r. Since a m H, (a m ) q H, and since H is closed we have (a m ) q h = a r H. Since r < m by assumption, this would contradict minimality if r > 0, so we have r = 0. We conclude h = (a m ) q for all h H, hence a m generates H. Now let a m and a m be two subgroups of order k. Without loss of generality, we may let m = n/k, since this subgroup does have k elements. Since a m = d, we know (a m ) d = e, so n m d. Therefore write qn = m k = m = q n k = qm. Therefore a m a m and since these subgroups have equal order, a m = a m. Hence there is only one subgroup for each k n. Problem 3. (a) Show that if K and N are two finite subgroups of G of relatively prime orders, then K N = {e}. (b) Show that if a group G has only finitely many subgroups, then G is finite. (a) Let K = m and N = n so that (m, n) = 1. Then since K N is a subgroup of both K and N, we have K N divides both m and n (again by Lagrange), hence it divides their gcd. But (m, n) = 1, so K N = 1, so K N = {e}. (b) Note that G = g, ranging over all cyclic subgroups of G. This is because g g for every g G. Suppose every element of g has finite order. Then g is finite for every g G. Since there are only a finite number of subgroups, G is a finite union of finite subgroups, hence is finite itself. Suppose now that g G is of infinite order. Then g = Z. Z has infinitely many subgroups (namely of the form nz), and so g has infinitely many subgroups as well, which contradicts our assumption. This completes the proof. Problem 4. (a) Let G be a group of order n. Show that a n = e for all a G. (b) Prove that a group G is cyclic if and only if there is an element a in G with ord(a) = G. (c) Show that every group of prime order is cyclic. 2

3 (a) Assume a G such that a n e. Because G = n, we cannot have ord(a) > n, else {e, a,..., a n } would all be distinct and this contradicts the order of G. Let ord(a) = m n. Then a = m, the cyclic subgroup generated by a. By Lagrange s theorem, a G = m n. Therefore write n = dm. Then This completes the proof. a n = (a m ) d = e d = e. (b) If G is cyclic, then G = a. Therefore G = {1, a,..., a n 1 }, where each power of a is different. Further, a n = 1 by the previous statement. Hence ord(a) = n. Conversely, suppose there exists a with order n. Then a = G and a G, so a = G and hence G is cyclic. (c) Suppose G = p with p a prime. Let a e. Then a is a subgroup of G, so by Lagrange s theorem a divides p. Since p is prime, a = 1 or p, and it is not 1 by assumption that a e. Since ord(a) = G, by the previous statement G is cyclic. Problem 5. (a) Show that if a 2 = e for all elements a of a group G, then G is abelian. (b) Prove that if G is a finite group of even order, then G contains an element a e such that a 2 = e. (c) Show that every subgroup of index 2 is normal. (a) If a 2 = e for all a G, then let a, b G be two elements. Then aba 1 b 1 = abab = (ab)(ab) = e ab = ba, where the implication follows by left multiplication by b and then a. Therefore G is abelian. (b) We may associate for every a G its inverse a 1 G. If a 2 e for all a, then a a 1, hence this pairing exhausts all non-identity elements. Therefore the number of elements of the group is 2n + 1, where n is the number of pairings and 1 is the identity element e. However, we assumed G was a group of even order, so this is a contradiction. Hence G contains an element of order 2. (c) Let H G such that G : H = 2. Then there are two left cosets H and gh for any g G \ H, and two right cosets H and Hg for any g G \ H. Since H Hg, we must have gh = Hg for all g G \ H, and this holds for g H as well. gh = Hg ghg 1 = H, so H is normal in G. 3

4 Problem 6. Find all groups (up to isomorphism) of order 5. What is the smallest order of a non-cyclic group? Up to isomorphism, there is only one trivial group. By 4(b), every group of prime order is cyclic. By the fundamental theorem of cyclic groups, every cyclic group is unique up to isomorphism. Therefore there is only one group each of order 2, 3, and 5. However, for order 4, there is the cyclic group Z/4Z and the non-cyclic group V = {1, a, b, ab} such that a 2 = b 2 = 1 and ab = ba. Suppose G is a different group of order 4 (up to isomorphism). G is not cyclic by assumption, and by 5(b) G contains an element of order 2, say x. Since G does not contain any elements of order 4 and only the identity has order 1, it must contain two other elements of order 2, call them y, z. Then we must have xy = z and xz = y. Therefore there exists an isomorphism ϕ : G V such that x a, y b, and z ab so G = V. Therefore there are only these two groups of order 4. The smallest order of a non-cyclic group is because there is only one trivial group and every group of prime order is cyclic by 4(b). Problem 7. Find a non-normal subgroup in the symmetric group S 3. Consider the subgroup H = {(1), (1 2)}. Note that (1 3)(1 2)(3 1) = (3 2) H, so H (1 3)H(3 1). Therefore H is not normal. Problem 8. Let n N. Show that the map f : Q/Z Q/Z, f(a + Z) = na + Z is a well-defined homomorphism. Find ker f and im f. Let a + Z and b + Z be in Q/Z. Then f((a + Z) + (b + Z)) = f(a + b + Z) = n(a + b) + Z = na + nb + Z = (na + Z) + (nb + Z) = f(a + Z) + f(b + Z). Further, f(0 + Z) = n0 + Z = 0 + Z, so f is properly a homomorphism. Now let a + Z, a + Z be two representatives of the same coset, so that a + b = a for b Z. Then f(a + Z) = na + Z = n(a + b) + Z = na + nb + Z = na + Z = f(a + Z), where nb + Z = Z because nb Z. Thus f is a well-defined homomorphism. Now, if f(a+z) = 0+Z, then we must have na Z. Thus ker f is all cosets representable by a = p/n where p Z. For the image, fix the coset b Z. Then clearly f(b/n+z) = b+z, and since b/n Q, we see every element of the codomain has a nontrivial preimage. Hence im f = Q/Z. Problem 9. (a) Show that Z/6Z = Z/2Z Z/3Z. (b) Prove that nz/mnz = Z/mZ. 4

5 (a) Define an map ϕ : Z/6Z Z/2Z Z/3Z by 1 (1, 1). Since 1 is a generator for Z/6Z, this defines the entire map. We claim this is an isomorphism. First, ϕ(0) = ϕ(6 1) = 6 (1, 1) = (0, 0). Second, ϕ(a + b) = ϕ((a + b) 1) = (a + b) ϕ(1) = a ϕ(1) + b ϕ(1) = (a + b) ϕ(1), so ϕ is a homomorphism. Note that (1, 1) is a generator for Z/2Z Z/3Z. Therefore ϕ(a 1) = a ϕ(1) b ϕ(1) = ϕ(b 1) for any a b with 1 a, b 6. This shows that ϕ is injective. Since Z/6Z = 6 = Z/2Z Z/3Z, ϕ is surjective as well. Hence ϕ is an isomorphism. (b) Note that both groups are cyclic, viz. Z/mZ = 1 and nz/mnz = n. Further, they each have order m. We claim that ϕ : nz/mnz Z/mZ given by n 1 is an isomorphism. Since ϕ maps a generator to a generator, ϕ is injective and surjective. Therefore ϕ is an isomorphism and we are done. Problem 10. Let f : G H be a surjective group homomorphism, let H be a normal subgroup in H. Show that G = f 1 (H ) is a normal subgroup in G and G/G = H/H. We would like to show that xgx 1 G for every g G and g G. We know that f(xgx 1 ) = f(x)f(g)f(x) 1. Since f(g) H and f(x), f(x) 1 H, we know that f(x)f(g)f(x) 1 H. Therefore xgx 1 f 1 (H ) = G, so G is normal. Now we claim f induces an isomorphism f : G/G H/H. f is a homomorphism because f is. Since f 1 (H ) = G, and H is the identity element in H/H, f is injective. Further, since f was surjective to begin with, the induced map f is also surjective. Therefore f is an isomorphism and we are done. 5