QUIZ/HOMEWORK 10 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR.

ZHENBO QIN

PRINT YOUR NAME: 1. (i) Up to isomorphisms, classify all abelian groups of order 1800. (ii) Point out which one is cyclic. Answer. (i) Note that 1800 = 23 32 52 . So up to isomorphisms, all the abelian groups of order 1800 are: Z2 Z2 Z2 Z3 Z3 Z5 Z5 , Z2 Z2 Z2 Z3 Z3 Z52 , Z2 Z2 Z2 Z32 Z5 Z5 , Z2 Z2 Z2 Z32 Z52 , Z2 Z22 Z3 Z3 Z5 Z5 , Z2 Z22 Z3 Z3 Z52 , Z2 Z22 Z32 Z5 Z5 , Z2 Z22 Z32 Z52 , Z23 Z3 Z3 Z5 Z5 , Z23 Z3 Z3 Z52 , Z23 Z32 Z5 Z5 , Z23 Z32 Z52 . (ii) Z23 Z32 Z52 is cyclic. 2. Let n 3. Prove that the only element of Sn satisfying = for all Sn is = , the identity permutation. Answer. Let = for all Sn . Assume that = . We want to draw a contradiction. Since = , (i) = j for some i = j in S = {1, 2, 3, . . . , n}. Without loss of generality, we may assume that i = 1 and j = 2. So (1) = 2. Applying (12) = (12) to 1 S , we obtain (2) = 1. Applying (23) = (23) to 1 S , we see that 2 = 3 which is a contradiction. 3. Let n 2 and H Sn . Prove that either all permutations in H are even or exactly half of them are even. Answer. Assume that not all permutations in H are even. Then there exists an odd permutation H . Let A (respectively, B ) be the subsets of H consisting of even (respectively, odd) permutations in H . Then, H=A
1

B.

Now, since is odd, all the permutations in A are odd. So A B . Hence |A| |B |. Since |A| = |A|, we have |A| |B |. Similarly, |B | |A|. It follows that |A| = |B |.

QUIZ/HOMEWORK 9 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Prove that a direct product of abelian groups is abelian. Answer. Let G = G1 G2 where both G1 and G2 are abelian. Then for any two elements (a1 , a2 ), (b1 , b2 ) G, we have (a1 , a2 ) (b1 , b2 ) = (a1 b1 , a2 b2 ) = (b1 a1 , b2 a2 ) = (b1 , b2 ) (a1 , a2 ). So G is abelian. 2. Prove that a group of order 65 must be isomorphic to Z65 . Answer. Let G be a group of order 65. Then, |G| = pq where p = 13 and q = 5 are primes. Since q |(p 1), G must be cyclic. Hence, G = Z65 . 3. Show that a nite abelian group is not cyclic if and only if it contains a subgroup isomorphic to Zp Zp for some prime p. Answer. (i) Let G be a nite abelian group which is not cyclic. Then, G (2.1) = Z r1 . . . Zprn
p1
n

where p1 , . . . , pn are primes. Note that the direct product Zpr 1 . . . Zprn is cyclic n 1 r1 rn if and only if p1 , . . . , pn are pair-wise coprime. Since G is not cyclic, pi = pj for some i = j . For simplicity, let i = 1 and j = 2. Now take the subgroup Zp1 of Zpr 1, 1 and the subgroup Zp2 of Zpr 2 . Then Zp1 Zp2 {1} . . . {1} is a subgroup of 1 Zpr 1 . . . Zprn . Via the isomorphism (2.1), G has a subgroup H isomorphic to n 1 the subgroup Zp1 Zp2 {1} . . . {1}, which in turn is isomorphic to the group Zp1 Zp2 . Finally, putting p = p1 = p2 , we see that H is isomorphic to Zp Zp . (ii) Conversely, suppose that G contains a subgroup isomorphic to Zp Zp for some prime p. Note that Zp Zp is not cyclic. So G is not cyclic since every subgroup of a cyclic group is cyclic.

QUIZ/HOMEWORK 8 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Let G be an abelian group (possibly innite). Let T = {a G| am = e for some m 1 depending on a}. (i) Prove that T G; (ii) Prove that G/T has no elementother than its identity element-of nite order. Answer. (i) Since e1 = e, we have e T . So T is nonempty. Next, let a, b T . Then, m a = e and bn = e for some integers m, n 1. Since G is abelian, (ab1 )mn = amn (b1 )mn = (am )n (bn )m = en em = e. So ab1 T . Hence T is a subgroup of G. (ii) If the element T a G/T is of nite order, then (T a)n = T for some n 1. So T (an ) = T , and an T . By the denition of T , there exists m 1 such that (an )m = e. So anm = e. By the denition of T again, we conclude that a T . Hence T a = T , i.e., the element T a G/T is the identity element T in G/T . 2. Let H G, and let N be a normal subgroup of G. If |H | = 2006 and |N | = 5, compute |H N | and |HN |. Answer. By the Second Isomorphism Theorem, H N and HN are subgroups of G; moreover, H/(H N ) (4.1) = (HN )/N. Since H N are subgroups of both H and N , |H N | divides both |H | and |N |. So |H N | divides gcd(|H |, |N |). Since |H | = 2006 and |N | = 5, we have gcd(|H |, |N |) = 1. Hence |H N | = 1. By (4.1), |H/(H N )| = |(HN )/N |. So we obtain |H |/|H N | = |HN |/|N |. It follows that |HN | = |N | |H |/|H N | = 5 2006/1 = 10130. 3. Let G = (R , ) and N = {1, 1}. Prove that G/N = (R+ , ) where R+ denote the set of all positive real numbers. Answer. Dene : G R+ by (r) = |r|. Then is a group homomorphism since (r1 r2 ) = |r1 r2 | = |r1 | |r2 | = (r1 ) (r2 ).

It is clear that is surjective. By the First Isomorphism Theorem, G/ker() = R+ . Now, ker() = {r G| (r) = 1} = {r G| |r| = 1} = {1, 1} = N . Hence, G/N = R+ .

QUIZ/HOMEWORK 7 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Show that any group homomorphism : G G where |G| is a prime must be either the trivial homomorphism or a one-to-one map. Answer. Let H = ker(). By Lagranges Theorem, |H | | |G|. Since |G| is a prime, either |H | = 1 or |H | = |G|. When |H | = 1, H = {e} where e denotes the identity of G; by Corollary 3.1.18, is one-to-one. When |H | = |G|, we have H = G, i.e., ker() = G; so maps every element of G to the identity of G , i.e., is the trivial homomorphism. 2. Let G be an abelian group. Let H and K be nite cyclic subgroups with |H | = r and |K | = s. Prove that if r and s are relatively prime, then G contains a cyclic subgroup of order rs. Answer. Assume that H = a and K = b . We claim that the cyclic subgroup ab is of order rs, i.e., ord(ab) = rs. Indeed, let m = ord(ab). Since H = a and |H | = r, ord(a) = r. In particular, r a = e. Similarly, ord(b) = s and bs = e. Noticing that G is abelian, we obtain (ab)rs = ars brs = (ar )s (bs )r = es er = e. So m rs since m = ord(ab). On the other hand, we have e = er = ((ab)m )r = (ab)rm = arm brm = (ar )m brm = em brm = brm . So rm is a multiple of s since ord(b) = s. Since r and s are coprime, m is a multiple of r. Similarly, we can prove that m is a multiple of s. Since r and s are coprime, the least common multiple of r and s is rs. In particular, m rs. Therefore, m = rs, i.e., ord(ab) = rs. 3. Let G be a group of order pq where p and q are primes. Prove that every proper subgroup of G is cyclic. Answer. Let H be a proper subgroup of G. Since |H | divides |G|, |H | is either 1 or a prime (i.e., p or q ). If |H | = 1, then H = {e} = e is cyclic. Next, assume that |H | is a prime. Let a H and a = e. Then, the order of the cyclic subgroup a is either 1 or equal to |H |. In the later case, H = a is cyclic. In the former case, a = {e} contradicting to a = e.

4. Let p and q be prime numbers. Find the number of generators of the cyclic group Zpq . (Hint: consider separately p = q and p = q ) Answer. Recall that s Zpq is a generator if and only if gcd(s, pq ) = 1. So when p = q , s = 0, p, 2p, . . . , (p 1)p. Hence the number of generators is p2 p = p(p 1). Next, assume that p < q . Then s = 0, p, 2p, . . . , (q 1)p, q, 2q, . . . , (p 1)q . Hence the number of generators is pq q (p 1) = (p 1)(q 1).

QUIZ/HOMEWORK 6 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Let H be a subgroup of index 2 in a group G. Prove that xH = Hx for every x G. Answer. If x H , then xH = H = Hx. In the following, we assume x H . Since x H , xH = H . So H and xH are two dierent left cosets. Since the index of H in G is 2, we must have G=H Similarly, G=H It follows that xH = Hx. 2. Let G be a group, and a G be the unique element of order 2. Show that ax = xa for all x G. Answer. Note that (xax1 )2 = xax1 xax1 = xa2 x1 = xx1 = e, and that xax1 = e since a = e. So xax1 is also an element of order 2. By the uniqueness, xax1 = a. Hence xa = ax for every x G. 3. Let G be an abelian group. Dene the map f : G G by f (g ) = g 1 for g G. Prove that f is an automorphism of G (i.e., you need to show that f is both a homomorphism and a bijection). Answer. Let g, h G. Then, f (gh) = (gh)1 = h1 g 1 . Since G is abelian, f (g )f (h) = g 1 h1 = h1 g 1 . Hence, f (gh) = f (g )f (h). So f is a homomorphism. Next, if f (g ) = f (h), then g 1 = h1 and so g = h. This shows that f is injective. Finally, let g G, then f (g 1 ) = (g 1 )1 = g . So f is surjective. Therefore, f is bijective and hence an automorphism of G. Hx. xH.

QUIZ/HOMEWORK 5 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. If G is a nite group of even order, show that there exists an element a = e such that a2 = e. Answer. Assume that a2 = e whenever a = e. We want to draw a contradiction. Note that a2 = e if and only if a = a1 . So the elements in G can be listed as:
1 1 1 e, a1 , a 1 , a2 , a2 , . . . , ak , ak

for some nonnegative integer k . In particular, |G| = 1+2k is odd. This contradicts to the assumption that |G| is even. 2. Let G be a group and a G. Assume that the order m = ord(a) is nite. Prove that as = at if and only if s t (mod m). Answer. (i) If s t (mod m), then s t = rm for some r Z. So s = t + rm. It follows that as = at+rm = at (am )r = at er = at . (ii) Now suppose as = at . Then, ast = e. By the Division Algorithm, (s t) = mq + r where q Z and 0 r < m. So e = ast = amq+r = (am )q ar = eq ar = ar , i.e., ar = e. Since 0 r < m and m is the smallest positive integer such that am = e, we must have r = 0. Hence (s t) = mq , i.e., (s t) is a multiple of m. Therefore, s t (mod m). 3. Let a, b be elements of a group G. Show that if the order of ab is n, then the order of ba is also n (i.e., ab and ba have the same order). Answer. Assume that the order of ba is m. We want to show that m = n. Since the order of ab is n, we have (ab)n = e, i.e., (ab) (ab) . . . (ab) = e. Multi(n1) copies

plying a

from left, we obtain b (ab) . . . (ab) = a . Now multiplying a from right,

we see that b (ab) . . . (ab) a = e, i.e., (ba) = e. So we must have m n.

By symmetry, we also have n m. Therefore, m = n.

10

QUIZ/HOMEWORK 4 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Let G be an abelian group with identity e. Fix a positive integer n. Prove that all the elements x of G satisfying the equation xn = e form a subgroup H of G. Answer. Since en = e, e H . So H is not empty. Next, let x, y H . Then xn = e and y n = e. Since G is abelian, we see that (xy 1 )n = xn (y 1 )n = xn (y n )1 = ee1 = e. So xy 1 H . Therefore, H is a subgroup of G.

2. Let H G. Dene, for a, b G, a b if a1 b H . Prove that this denes an equivalence relation on G, and show that [a] = aH = {ah| h H }. The sets aH are called left cosets of H in G. Answer. (i) Since a1 a = e H , a a. So is reexive. If a b, then a1 b H . Since H is a group, b1 a = (a1 b)1 H . Thus, is symmetric. Next,assume that a b and b c. Then a1 b, b1 c H . Since H is closed, a1 c = (a1 b)(b1 c) H . So a c. Thus is transitive. It follows that is an equivalence relation on G. (ii) Note that b [a] if and only if a b if and only if a1 b H if and only if b aH . Hence, [a] = aH .

11

QUIZ/HOMEWORK 3 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Let G be a group. Prove that if (ab)2 = a2 b2 for all a, b G, then G is abelian.

12

QUIZ/HOMEWORK 2 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Let G be the set of integers with the operation dened by: a b = a b. Is G with the operation a group? If YES, write down your proof. If NOT, state a group axiom which fails for G.

13

QUIZ/HOMEWORK 1 MATHEMATICS 4720INTRODUCTION TO ABSTRACT ALGEBRA I INSTRUCTOR: DR. ZHENBO QIN

PRINT YOUR NAME: 1. Let a = 120 and b = 72. Express gcd(a, b) as ma + nb for some integers m and n. Show details. ANSWER: