Math 545 EXERCISES (page 52): Problems:

Homework #1 (SOLUTIONS) DUE: October 4, 2010

11. Prove that the set of all 2 2 matrices with entries from R and determinant +1 is a group under matrix multiplication. Let G be the set of all 2 2 matrices with entries from R and determinant +1. Verify that the matrices in G satisfy the axioms of the denition of a group under matrix multiplication. 1 ). Let A, B G. Then the product AB is a 2 2 matrix with entries from R. Since det(AB) = det(A) det(B) = 1 . 1 = 1, AB G. 1) The operation of matrix multiplication is associative on G. 2) The 2 2 identity matrix I is in G since det(I) = 1. 3) Let A G. Since det(A) = 1 = 0, A1 exists and is a 2 2 matrices with entries from R. Also, 1 det(A1 ) = det(A) = 1. Therefore, A1 G. 14. Let G be a group with the following property: If a, b, c belong to G and ab = ca, then b = c. Prove that G is Abelian. Let x, y G. Prove: xy = yx. Since G is a group and x, y G, and x(yx) = (xy)x Now a = x, b = yx, c = xy G, and ab = ca gives b = c. Thus yx = b = c = xy. 19. For any elements a and b from a group and any integer n, prove that (a1 ba)n = a1 bn a. First prove: (a1 ba)n = a1 bn a n Z+ . This can be done in two ways. 1). Let n Z+ . Then (a1 ba)n = (a1 ba)(a1 ba) . . . (a1 ba) (n times) = a1 b(aa1 )b(aa1 ) . . . b(aa1 )ba = a1 bn a. 2) Induction on n. For n=1, (a1 ba)1 = a1 ba (notation) Assume (a1 ba)k = a1 bk a k 1. (IH) Then (a1 ba)k+1 = (a1 ba)k (a1 ba)(notation) = (a1 bk a) (a1 ba) (by IH) = (a1 bk (aa1 )ba) = (a1 bk eba) = (a1 bk ba) = (a1 bk+1 a). Next (a1 ba)0 = a1 b0 a (since both are id, by def.). Now assume that n is a negative integer. Then (a1 ba)n = ((a1 ba)n )1 = (a1 bn a)1 (from 1) or 2) above, since n Z). = a1 (bn )1 (a1 )1 ) = a1 (b1 )n a = a1 bn a. 20. If a1 , a2 , . . . , an belong to a group, what is the inverse of a1 a2 . . . an ? abb1 a1 = a(bb1 )a1 = aa1 = e = (ab)1 = b1 a1 and (abc)(c1 b1 a1 ) = ab(cc1 )b1 a1 = a(bb1 )a1 = aa1 = e = (abc)1 = c1 b1 a1 . In general, (a1 a2 . . . an )1 = a1 . . . a1 a1 , since n 2 1 (a1 a2 . . . an1 an )1 (a1 a1 . . . a1 a1 ) = a1 a2 . . . an1 (an a1 )a1 . . . a1 a1 = n n n1 2 1 n1 2 1 a1 a2 . . . (an1 a1 ) . . . a1 a1 = . . . = e. n1 2 1 26. Prove that if (ab)2 = a2 b2 in a group G, then ab = ba. (ab)2 = a2 b2 = (ab)(ab) = aabb (notation) = abab = aabb (associative law) = bab = abb (left cancellation of a) = ba = ab (right cancellation of b) 28. Prove that the set of all rational numbers of the form 3m 6n , where m and n are integers, is a group under multiplication. Let G be the set of all rational numbers of the form 3m 6n , where m and n are integers. Verify that the elements in G satisfy the axioms of the denition of a group under multiplication. 1 ). Let 3m 6n , 3m 6n G (Notice that m, n, m , n must be integers) . Then 3m 6n 3m 6n = 3m 3m 6n 6n = 3m+m 6n+n G since m + m , n + n Z. 1). The operation of multiplication is associative on G. 2). The multiplicative identity 1 G, since 1 = 30 60 . 3). Let 3m 6n G. Then (3m 6n )1 = 3m 6n G since -m, -n Z. 35. Prove the assertion made in Example 19 that the set {1, 2, . . . , n 1} is a group under multiplication modulo n if and only if n is prime. (=) Given: {1, 2, . . . , n 1} is a group under multiplication modulo n. Prove: n is prime Proof by Contradiction: Let n be composite. Then n = rs, 1 < r, s < n. Now r,s {1, 2, . . . , n 1} but the product rs = n 0 ( mod ) n and 0 {1, 2, . . . , n 1}. Thus rs {1, 2, . . . , n 1} and so / / {1, 2, . . . , n 1} is not closed under multiplication modulo n, a contradiction to the given. (=) Given: n is prime Prove: {1, 2, . . . , n 1} is a group under multiplication modulo n. If n is prime then U(n) = {1, 2, . . . , n 1} is a group under multiplication modulo n.

1. Let a, b, and c be elements of a group. Show the following: (a) (a1 )1 = a a G = (a)1 G. Thus aa1 = e. Then aa1 (a1 )1 = e(a1 )1 (right multiplication by (a1 )1 ) = a(a1 (a1 )1 ) = (a1 )1 (associative law) = ae = (a1 )1 . Hence (a1 )1 = a. (b) (ab)1 = b1 a1 a, b G = ab G = (ab)1 G. Thus (ab)(ab)1 = e. Also note that (ab)(b1 a1 ) = e. So (ab)(ab)1 = (ab)(b1 a1 ) (both sides have value e). Hence (ab)1 = b1 a1 (left cancellation of ab in G). (c) (abc)1 = c1 b1 a1 a, b, c G = abc G = (abc)1 G. Thus (abc)(abc)1 = e. Also note that (abc)(c1 b1 a1 ) = e. So (abc)(abc)1 = (abc)(c1 b1 a1 ) (both sides have value e). Hence (abc)1 = c1 b1 a1 (left cancellation of abc in G). 2. Let a and b be elements of a group. Show that (ab)1 = a1 b1 i ab = ba. (=) Assume (ab)1 = a1 b1 . We will show ab = ba. Now (ab)1 = a1 b1 (given) and (ab)1 = b1 a1 (always). Thus a1 b1 = b1 a1 (the same left side). a1 b1 = b1 a1 = a1 b1 ba = b1 a1 ba = e = b1 a1 ba = abe = abb1 a1 ba = ab = ba. (=) Assume ab = ba. Show (ab)1 = a1 b1 . Now ab = ba (given) = (ab)1 = (ba)1 . But (ba)1 = a1 b1 (always). So (ab)1 = a1 b1 . 3. Let a be an element of a group G and let H be a subset of G consisting of all an with n an integer. Prove the following statements. (a) If h, h H, then hh H. h, h H = m, n Z such that h = am , and h = an (denition of H). Now hh = am an = am+n H, since m + n Z. (b) The identity of G is in H. a0 H (denition of H). But a0 = e (notation). So e, the identity of G, is in H. (c) If h H, then h1 H. h H = n Z such that h = an (denition of H). Then, h1 = (an )1 . But (an )1 = an (notation). So, h1 = an and h H, since n Z. 4. Let g 2 = e for all g in a group G. Prove that G is abelian. Let a, b G. Then, from the given, a2 = e and b2 = e. So a2 b2 = ee = e. Also, a, b G = ab G (closure). Thus, (ab)2 = e (given). Now (ab)2 = e = a2 b2 . Thus, (ab)2 = a2 b2 . = abab = aabb (notation) = bab = abb (left-cancellation of a) = ba = ab (right-cancellation of b). 5. Given that abc = e in a group G, prove that bca = e = cab. abc = e = a1 (abc)a = a1 (e)a = (a1 a)bca = a1 a = ebca = e = bca = e. abc = e = c(abc)c1 = c(e)c1 = cab(cc1 ) = cc1 = cabe = e = cab = e. 6. Show that abcd = e implies bcda = e in a group G. abcd = e = a1 (abcd)a = a1 (e)a = (a1 a)bcda = a1 a = ebcda = e = bcda = e. 7. Let a be an element of a group G. Let a and a2 be dierent from the identity e but let a3 = e. Let m and n be integers. Show the following: (a) am = e i 3|m. (=) Assume am = e. Now by the division algorith, q, r Z such that m = 3q + r, where 0 r < 3. Thus e = am = a3q+r = (a3 )q ar = eq ar = ear = ar . So ar = e, with 0 r < 3, with a1 = e and a2 = e, = r = 0. So m = 3q. So, 3 divides m. (=) Assume 3 divides m. Then q Z such that m = 3q. Then, am = a3q = (a3 )q = eq = e.

(b) am = an i 3|(m n). am = an am (an )1 = an (an )1 am an = e amn = e. Thus, am = an amn = e. But amn = e 3|m n(part (a) above). Hence, amn = e 3|m n (since [(P Q) (Q R)] (P R)]). (c) There are exactly three dierent elements among the powers . . . , a4 , a3 , a2 , a1 , e, a, a2 , a3 , a4 , . . .. Let S = {e, a, a2 } and T = {. . . , a4 , a3 , a2 , a1 , e, a, a2 , a3 , a4 , . . .}. Prove S=T. We will show S T and T S. Since e, a, a2 T , we have S T . Let ak T . Then, by the Division Algorithm, unique q, r Z such that k = 3q + r, where 0 r < 3. Thus ak = a3q+r = a3q ar = (a3 )q ar = eq ar = ear = ar . Thus ak {a0 = e, a, a2 } = S. Hence, T S.