MATH 331

Lab 8

Winter 2004

(1) Suppose that k is a divisor of n. Prove that Zn / < k > Zk . (Hint: Find a homomorphism with kernel < k >) Solution: Note that < k > is a subgroup of Zn with order n/k. Consider the map : Zn Zk where (t) = t mod k. is a function because a b (mod n) n|(a b) k|(a b) a b (mod n) (a) = (b). is a homomorphism since (a + b) = a + b mod k = a mod k + b mod k = (a) + (b). Also, is obviously an onto function. The kernel of is < k >. Hence, by First Isomorphism Theorem, Zn / < k > Zk .

(2) If M and N are normal subgroups of G and N is a subgroup of M , prove that (G/N )/(M/N ) G/M . Solution: Consider the following mapping : G/N G/M where (gN ) = gM. First, we need to show that is well dened. Let a, b G and aN = bN , then aN = bN ab1 N ab1 M because N M aM = bM (a) = (b)

Next, we will show that is a homomorphism. Let g, h G, ((gN )(hN )) = (ghN ) = ghM = (gM )(hM ) = (gN )(hN ). The kernel of is the set {gN | gN G/N and gM = eM }, that is, {gN | g M }, that is, all the cosets of N that are contained in M , which is M/N . Note that N for all m M and mN, N m M . Finally, is onto because for every gM G/M , (gN ) = gM . Hence, by First Isomorphism Theorem, (G/N )/(M/N ) G/M . M since mN = N m

MATH 331

Lab 8

Winter 2004

(3) How many abelian groups (up to isomorphism) are there of order 3500? Solution: Note that 3500 = 22 53 7. By the Fundamental Theorem of Abelian Groups, the abelian groups, up to isomorphism, are: Z4 Z125 Z7 Z4 Z25 Z5 Z7 Z4 Z5 Z5 Z5 Z7 Z2 Z2 Z125 Z7 Z2 Z2 Z25 Z5 Z7 Z2 Z2 Z5 Z5 Z5 Z7 .

(4) Prove that an abelian group of order 2n (n 1) must have an odd number of elements of order 2. Solution: If G is an abelian group of order 2n , then by the Fundamental Theorem of Abelian Groups, G Z2n1 Z2n2 Z2nk for some positive integers n1 , n2 , . . . , nk where n1 + n2 + + nk = n. Notice that for each of the cyclic groups Z2ni , there is one unique element of order 2. Note that for any element (a1 , a2 , . . . ak ) Z2n1 Z2n2 Z2nk , then the order of (a1 , a2 , . . . , ak ) is lcm(|a1 |, |a2 |, . . . , |ak |). The number of ways of generating elements of order 2 is 2k 1 (each of the elements a1 , a2 , . . . , ak can have an order of 1 or 2, except when all of them are 1). Hence, there are 2k 1 elements of order 2.

(5) Given a ring R: (a) If a R and m Z, then m(a) = (ma). Solution: Since m(a) + ma = m(a + a) = m(0R ) = 0R . Therefore, m(a) = ma. (b) Dene the center of R = {x R | ax = xa a R}. Show that the center of R is a subring of R. Solution: Let Z be the center of R. Then, 0R Z. Hence Z is nonempty. Let a, b Z. We need to show that a b, ab Z. For any x R (a b)x = ax bx = xa xb = x(a b) (a b) Z. For any y R (ab)x = a(bx) = a(xb) = (ax)b = (xa)b = x(ab) ab Z. 2

MATH 331

Lab 8

Winter 2004

Hence Z is a subring of R.

(6) Describe all zero-divisors and units of Z Q Z. Solution: Note that there is no zero-divisor in Z or Q. However, a non-zero element of the form (a, b, c) where one or two of a, b, c are zero is a zero-divisor. The only units in Z are 1, while any nonzero element in Q is a unit. Hence, the units of Z Q Z are {(a, b, c) | a, c = 1, b = 0}.

(7) Let d be a negative integer. Prove that Q[ d] = {a + b d | a, b Q} is a eld. Solution: It was discussed in class that Q[ d] is a commutative ring with unity 1. We need to show that every nonzero element is a unit. Let a + b d Q[ d] where a, b Q. We want to show that a + b d is invertible. That is, we want to show that 1 Q[ d]. a+b d We have 1 a+b d = = = 1 ab d a+b d ab d ab d when a2 b2 d = 0 a2 b2 d a b 2 d Q[ d]. 2 b2 d 2d a a b

Note that a2 b2 d = 0 only when a = b = 0. Hence, every nonzero element is a unit.

(8) Let R be a ring with m elements, show that the characteristic of R divides m. Solution: Let x1 , x2 , . . . , xm be the elements of R, and ni be the order of xi under addition for i = 1, ...m. Note that ni xi = 0R , char(R)xi = 0R , mxi = 0R , with ni char(R) m and ni |char(R) and ni |m. Note that char(R) = lcm(n1 , n2 , . . . , nm )|m.

MATH 331

Lab 8

Winter 2004

(9) Let F be a eld with n elements. Prove that xn1 = 1 for all nonzero x F. Solution: Note that the nonzero elements of F form an abelian group under multiplication. Then, by the corollary to Lagranges Theorem, x|F{0F }| = 1F . That is, xn1 = 1F .

(10) In a ring R, suppose that every element x R satises x2 = x, prove that R must be commutative. Solution: We need to show that ab = ba for every a, b R. Consider the element (a + b). We have (a + b)2 = a + b a2 + ab + ba + b2 = a + b a + ab + ba + b = a + b ab = ba.

But ab = (ab)2 = (1)(1)(ab2 ) = ab. Hence ab = ab = ba. That is, R is commutative.