Koushik Pal

Math 403, Midterm I

February 21, 2013

Problem 1. Consider the group U15 = {n Z | 0 n < 15 & (n, 15) = 1} with multiplication modulo 15. Compute the following: (a) 7 , the cyclic subgroup of U15 generated by 7 (b) The distinct right cosets of 7 (c) o(2), the order of 2. (5 + 5 + 5 = 15 points) Solution. Note that U15 = {1, 2, 4, 7, 8, 11, 13, 14}. (a) 71 = 7, 72 = 49 4 (mod 15), 73 = 72 7 4 7 = 28 13 (mod 15), 7 = 72 72 4 4 = 16 1 (mod 15). Thus, 7 = {1, 4, 7, 13}.
4

(b) Index of 7 in U15 = |U15 |/| 7 | = 8/4 = 2. Thus, there are two distinct right cosets of 7 in U15 , namely 7 and 7 2, where 7 7 2 = {1, 4, 7, 13}, and = {2, 8, 14, 11}, since 13 2 = 26 11 (mod 15).

(c) 21 = 2, 22 = 4, 23 = 8, 24 = 16 1 (mod 15). Thus, o(2) = 4.

Problem 2. Prove that a nonempty subset H of a group G is a subgroup if for all x, y H the element xy 1 is also in H . (15 points) Solution. H is given to be nonempty. Associativity comes for free from G. Thus, all we have to check is that H is closed under products and inverses. Suppose x H . Then, by the given condition, e = xx1 H . And so, 1 x = e x1 H . Hence, H is closed under inverses. Now, suppose x, y H . Then, by above y 1 H . And hence, by the given condition again, xy = x(y 1 )1 H . Thus, H is closed under products.

Problem 3. (a) Prove that every subgroup of a cyclic group is cyclic. (b) If G is a cyclic group of order n, how many generators does it have? (15 + 15 = 30 points) Solution. (a) Let G = a be a cyclic group and H be a subgroup of G. If H = (e), there is nothing to prove.

Koushik Pal

Math 403, Midterm I

February 21, 2013

So assume H = (e). Let k be the smallest positive integer such that ak H ; such an integer exists by the well-ordering property of the positive integers, because H contains some nontrivial power aq of a where q = 0, hence also its inverse aq , and one of q, q is positive. We claim that H = ak . To show this, let an be some other element of H . Then there exist q, r Z, with 0 r < k , such that n = qk + r. Observe that ar = an (ak )q H , and r < k . By minimality of k , r = 0. Thus, k |n, so an ak . Hence, H = ak is cyclic. (b) Let G = {e, a, a2 , a3 , . . . , an1 }. We show that there are (n) many generators of G by proving the following two claims. Claim 1: For any k , if (k, n) = 1, then ak is a generator of G. Reason: Since (k, n) = 1, we have kl + nm = 1 for some l, m Z. Thus, as = as(kl+nm) = (ak )sl (an )sm = (ak )sl (since an = e). Hence, ak is a generator of G. Claim 2: For any k , if (k, n) = 1, then ak is not a generator of G. Reason: Let (k, n) = d > 1. Then, (ak )n/d = (an )k/d = e (since an = e and k/d Z). Thus, the cyclic subgroup generated by ak has size n/d < n, and hence is not the whole of G, i.e., ak is not a generator of G.

Problem 4. Let G be an innite abelian group. Prove that the set of elements of nite order is a subgroup. (20 points) Solution. Let H = {g G | o(G) is nite}. Since o(e) = 1, e belongs to H , and hence H is nonempty. Associativity comes for free from G. So, all we have to check is that H is closed under products and inverses. Let x, y H . Say o(x) = m and o(y ) = n, i.e., xm = y n = e. Then, (xy )mn = xmn y mn = (x ) (y )
m n n m

since G is abelian

= en em = e. Thus, o(xy )|mn, i.e., o(xy ) is nite. Hence, xy H and H is closed under products. Finally, let x H . Say o(x) = m. Thus, xm = e. Hence, (xm )1 = e, i.e., (x1 )m = e. So, o(x1 )|m. In particular, o(x1 ) is nite. (In fact, o(x1 ) = o(x)). Hence, x1 H and H is closed under inverses.

Koushik Pal

Math 403, Midterm I

February 21, 2013

Problem 5. Let G be a group, Z = {g G | gz = zg for all z G} be its center, and S = {Zg | g G} be the set of right cosets of Z in G. Then S is a group under the product Zg1 Zg2 = Zg1 g2 . Suppose that S is cyclic. Show that G is abelian. (20 points) Solution. Since S is cyclic, it has a generator, say Zg . Thus, S = Zg = {Zg i | i Z}. Now, let x, y G. Then, x and y belong to some cosets of Z , say Zg i and j Zg respectively. Thus, x = z1 g i and y = z2 g j for some z1 , z2 Z . So, we have xy = z1 g i z2 g j = z1 z2 g i g j = z1 z2 g
i+j

since z2 Z since i + j = j + i, addition is commutative on Z since z2 Z since z1 Z

= z1 z2 g j +i = z1 z2 g j g i = z2 z1 g j g i = z2 g z1 g = yx
j i

Since x and y are arbitrary, it follows that G is abelian.