0 оценок0% нашли этот документ полезным (0 голосов)

96 просмотров57 страницSolutions in Groups and Rings

Jun 26, 2015

© © All Rights Reserved

PDF, TXT или читайте онлайн в Scribd

Solutions in Groups and Rings

© All Rights Reserved

0 оценок0% нашли этот документ полезным (0 голосов)

96 просмотров57 страницSolutions in Groups and Rings

© All Rights Reserved

Вы находитесь на странице: 1из 57

William J. DeMeo

November 2, 2010

Abstract

This document contains solutions to some of the problems appearing on comprehensive exams given by the

Mathematics Department at the University of Hawaii over the past two decades. In solving many of these problems,

I benefited greatly from the wisdom and guidance of Professor William Lampe. A number of other professors

provided additional expert advice and assistance, for which I am very grateful. In particular, I thank Professor Ron

Brown for leading an enlightening ring theory seminar in the fall of 2009, and Professor Tom Craven for taking over

this job in the spring of 2010.

Some typographical and mathematical errors have surely found their way into the pages that follow. Nonetheless, I

hope this document will be of some use to you as you explore two of the most beautiful areas of mathematics.

Finally, its no secret that mathematics is best learned by solving problems. The purpose of this document, then, is to

give you some problems to work on in order to locate any gaps in your understanding. The solutions are there to

assist you in filling these gaps, and to provide cautionary notes about typical oversights and points of confusion.

Please send comments, suggestions, and corrections to:

williamdemeo@gmail.com.

Contents

1

Group Theory

1.1 1993 November

1.2 1999 March . .

1.3 2002 November

1.4 2003 November

1.5 2004 November

1.6 2006 April . . .

1.7 2006 November

1.8 2007 April . . .

1.9 2008 January .

1.10 2008 April . . .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

3

3

6

8

11

12

14

17

18

19

20

Ring Theory

2.1 1992 November

2.2 1995 April . . .

2.3 1995 November

2.4 1996 April . . .

2.5 1999 March . .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

22

22

25

26

27

30

CONTENTS

2.6

2.7

2.8

2.9

2.10

2.11

2003 April . . .

2003 November

2004 November

2008 January .

2008 April . . .

2008 November

CONTENTS

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

31

33

35

36

38

41

A.1 Algebras . . . . . . . . . . . . . . . . . . .

A.2 Congruence Relations and Homomorphisms

A.3 Group Theory Basics . . . . . . . . . . . .

A.4 Direct Products . . . . . . . . . . . . . . .

A.5 Ring Theory Basics . . . . . . . . . . . . .

A.6 Factorization in Commutative Rings . . . .

A.7 Rings of Polynomials . . . . . . . . . . . .

A.8 Nakayamas Lemma . . . . . . . . . . . .

A.9 Miscellaneous Results and Examples . . . .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

47

47

48

50

52

53

54

54

55

55

GROUP THEORY

Group Theory

1.1

1993 November

Solution: Let G be a group of order |G| = 36 = 22 32 . Then the Sylow theorem implies that G has a subgroup H

of order |H| = 9. Define G/H = {gH : g G}, the set of left cosets of H in G. This is a group if and only if

H P G, but let us assume that H R G (otherwise were done), in which case G/H is merely a set of subsets of G.

Note that the set G/H contains exactly [G : H] = |G|/|H| = 4 elements. Denote by Sym(G/H) the group

of permutations of elements of G/H, and consider the map : G Sym(G/H), defined for each g G by

(g)(xH) = gxH. The usual trivial calculation shows that this map is a homomorphism of G into Sym(G/H). In

this case, it is obvious that cannot possibly be a monomorphism (embedding, or faithful representation) of G in

Sym(G/H) since the order of Sym(G/H)

= S4 is 4! = 24, while |G| = 36. Therefore, must have a non-trivial

kernel, ker = {g G | (g) = idG/H } = {g G | gxH = xH for all x G}. Thus, (e) 6= ker P G (since

the kernel of a homomorphism is a normal subgroup), so G is not simple.

Remark: A5 (which has order 60) is the smallest non-abelian simple group.

t

u

3. a. State, without proof, the Sylow Theorems.

b. Prove that every group of order 255 is cyclic.

Solution:

Theorem. [L. Sylow (1872)] Let G be a finite group with |G| = pm r, where m is a non-negative integer and r is a

positive integer such that p does not divide r. Then

(i) G has a subgroup of order pm . Such a subgroup is called a Sylow p-subgroup of G.

(ii) If H and J are Sylow p-subgroups of G, then J 6 gHg 1 for some g G. In particular, the Sylow

p-subgroups of G form a single conjugacy class.

(iii) Let np denote the number of Sylow p-subgroups of G and let H be any Sylow p-subgroup of G. Then

np 1

(mod p),

np | [G : H],

and

np = |G : NG (H)|.

b. Let G be a group of order |G| = 255 = 3 5 17. We will show that G must be abelian. Then, the fundamental

theorem of finitely generated abelian groups gives G

= Z3 Z5 Z17

= Z255 (since 3, 5 and 17 are pairwise

relatively prime), whence G is cyclic.

For each p {3, 5, 17}, let np denote the number of Sylow p-subgroups. By the Sylow theorems,

n3 1

n5 1

n17 1

(mod 3)

and

n3 | 85

n3 {1, 85},

(mod 5)

and

n5 | 51

n5 {1, 51},

(mod 17)

and

n17 | 15

n17 = 1.

1 Recall,

1.1

1993 November

GROUP THEORY

For each p {3, 5, 17}, let Pp denote an arbitrary Sylow p-subgroup. Note that Pp Pq = (e) for p 6= q

{3, 5, 17} since each non-identity element of Pq generates Pq . Suppose both n3 = 85 and n5 = 51. Then, since

P3 P5 = (e), a simple counting argument (2 85 + 4 51 = 374 > 255) shows that there are too many distinct

group elements. Therefore, either n3 = 1 or n5 = 1 (or both).

Now note that P17 P G, so G/P17 is a group of order 3 5, hence cyclic.2 Similarly, if P3 P G, then G/P3 is a

group of order 5 17, hence cyclic, while if P5 P G, then G/P5 is a group of order 3 17, hence cyclic.

From here there are (at least) two ways to show that G is abelian and complete the proof. One uses the commutator,

and the other uses the following easily proved

Lemma. If H P G and K P G, then H K P G and the natural map : G/(H K) G/H G/K given

by (g(H K)) = (gH, gK) is a monomorphism.

(For the proof see Problem 3 of November 2004.)

By the lemma, we can embed G/(H K) (as a subgroup) in the group G/H G/K. Thus, take H to be P17 , and

K to be either P3 or P5 (whichever is normal). Then H K = (e), so G itself is (isomorphic to) a subgroup of the

abelian group G/H G/K, and is therefore abelian.

Alternatively, recall that the commutator3 G0 P G is the unique minimal normal subgroup of G such that G/G0

is abelian. (In particular, G is abelian iff G0 = (e).) Therefore, since G/P17 is abelian, G0 6 P17 . For the same

reason, we have at least one of the following: G0 6 P3 or G0 6 P5 . In any case, G0 6 P17 Pq = (e) for some

q {3, 5}. Thus, G is abelian.

t

u

4. Let G be a group and let X be a set. We say that G acts on X (on the left) if there is a multiplication G X X

such that 1x = x and (gh)x = g(hx) for all g, h G and x X.

a. Let H be a subgroup of G. Prove that G acts on the space of left cosets G/H.

b. Let x X and let H be the subgroup of G fixing x. Define the orbit of x under G and prove that there is a

one-to-one correspondence between this orbit and the space of left cosets G/H.

In what sense can this one-to-one correspondence be called an isomorphism?

c. Let g G and let x0 = gx. Let H be the subgroup of G fixing x and let H 0 be the subgroup fixing x0 . Prove

that H and H 0 are conjugate.

Solution: a. Let H be a subgroup of G, and let X = G/H denote the set of left cosets of H in G. Define

(g, xH) 7 gxH = (gx)H for each g G and xH X. This is clearly well-defined. (Proof: If (g1 , xH) =

(g2 , yH), then (g1 x)H = (g2 y)H because (g2 y)1 (g1 x) = y 1 x H.) Also, this map takes G X into X

and satisfies 1xH = xH. Finally, by associativity of multiplication in G, we have (gh)(xH) = ((gh)x)H =

(g(hx))H = g(hx)H = g(hxH). This proves that (g, xH) 7 gxH = (gx)H defines a group action by G on the

space of left cosets G/H.

b. Let x X and let H be the subgroup of G fixing x. (This is called the stabilizer of x, and often denoted by

:= {gx : g G}. We prove

Gx .) That is, H := Gx := {g G : gx = x}. The orbit of x under G is the set Gx

that there is a one-to-one correspondence between this orbit and the set of left cosets G/H. Indeed, consider the

which is clearly surjective, and its kernel is given by the relation

map G 3 g 7 gx Gx,

{(a, b) G G : ax = bx} = {(a, b) : b1 ax = x} = {(a, b) : b1 a H} = {(a, b) : aH = bH}.

2 Recall,

3 The

if |G| = pq with p < q, both odd primes, and p does not divide q 1, then G is cyclic.

commutator, G0 , is the subgroup generated by the set {aba1 b1 : a, b G}.

1.1

1993 November

GROUP THEORY

Equivalently,

In other words, a and b are in the same left H-coset iff they take x to the same element of the orbit Gx.

there is a one-to-one correspondence between the orbit of x and the set of left cosets G/H.

Gi is a transitive G-set, as is the algebra

The bijection is an isomorphism in the following sense: the algebra hGx;

Gi hG/H; Gi given by (ax) = aH is a well-defined bijection (by the argument

hG/H; Gi. The map : hGx;

above) and it respects the (unary) operations of the algebras; that is, for all operation symbols a G, and all

we have (a(bx)) = ((ab)x) = (ab)H = a(bH) = a(bx). Thus, is a (G-set) isomorphism.

bx Gx,

c. Let g G and let x0 = gx. Let H be the subgroup of G fixing x and let H 0 be the subgroup fixing x0 . Then H

and H 0 are conjugate, since

H 0 = {a G : ax0 = x0 } = {a G : agx = gx} = {a G : g 1 agx = x}

= {gbg 1 G : bx = x} = g{b G : bx = x}g 1 = gHg 1 .

t

u

Solution: (See March 1999 Problem 4.)

1.2

1999 March

1.2

GROUP THEORY

1999 March

(a) If G is solvable, then H is solvable.

(b) If G is solvable, then G/N is solvable.

(c) If N and G/N are solvable, then G is solvable

4. Suppose H and K are subgroups of the group G. Then [H, K] is the subgroup generated by {hkh1 k 1 | h

H & k K}. We recursively define Gn by G0 = G and Gn+1 = [Gn , G]. A group is nilpotent iff for some k,

Gk = {1}. Use this definition of nilpotent group in what follows. For the rest of the problem, G is assumed to be

a finite group.

(a) If P is a Sylow subgroup of G, then N (N (P )) = N (P ), where N (P ) denotes the normalizer of P .

(b) If G is a nilpotent group and H is a subgroup of G not equal to G, then N (H) 6= H.

(c) If G is nilpotent and P is a Sylow subgroup of G, then P is a normal subgroup of G.

(d) If each of the Sylow subgroups of G are normal in G, then G is the direct product of its Sylow subgroups.

(e) Every finite, nilpotent group is the direct product of its Sylow subgroups.

Solution: (a) Let P be a Sylow p-subgroup of G. Of course, for any H 6 G, we have H P N (H). In

particular, N (P ) P N (N (P )). To prove the reverse inclusion, fix g N (N (P )). That is, g G and

gN (P )g 1 = N (P ). Then, since P 6 N (P ), it follows that gP g 1 6 N (P ). Also, P and gP g 1 are both

Sylow p-subgroups of G, so they are both Sylow p-subgroups of N (P ). But P P N (P ), so P is the unique

Sylow p-subgroup of N (P ). Thus, gP g 1 = P . That is, g N (P ), which proves N (N (P )) 6 N (P ), as

desired.

(b) G is nilpotent iff there exists n N such that

G = G0 Q G1 Q Q Gn1 Q Gn = (e).

Now Gn = (e) 6 H and, since H is a proper subgroup, G0 = G

H, so there is some 0 6 k < n such that

Gk+1 6 H and Gk

H. Take any x Gk \ H. We complete the proof by showing that x N (H). Indeed,

x Gk implies that, for any h H,

xhx1 h1 [Gk , G] = Gk+1 6 H.

so xhx1 h1 H. Therefore, xhx1 H, for all h H. That is, x N (H).

(c) Assume G is nilpotent and P is a Sylow subgroup of G. We show P P G. By (a), N (N (P )) = N (P ), and

so (b) (with H = N (P )) implies that N (P ) cannot be a proper subgroup of G, so it must be all of G. That is,

N (P ) = G, which means P P G.

1.2

1999 March

GROUP THEORY

(d) Let P1 , . . . , Pr be the Sylow subgroups of G with orders |Pi | = pei i , where p1 , . . . , pr are distinct primes and

e1 , . . . , er are positive integers. Since Pi P G for each 1 6 i 6 r, P1 Pr is a subgroup of G. If a Pi has

e

order o(a), then o(a)|pei i , by Lagranges theorem. Since p1 , . . . , pr are distinct primes, o(a) - pj j , for j 6= i.

Therefore, again by Lagranges theorem, a

/ P1 Pi1 Pi+1 Pr . This proves that, for each 1 6 i 6 r,

Pi (P1 Pi1 Pi+1 Pr ) = (e). Finally, P1 Pr < G and |P1 Pr | = pe11 perr = |G| together

t

u

imply that G = P1 Pr . Therefore, by Corollary D.6. of the appendix, G

= P1 Pr .

1.3

1.3

2002 November

GROUP THEORY

2002 November

1. Let A be a finite abelian group. Let n be the order of A and let m be the exponent of A (i.e., m is the least positive

integer such that ma = 0 for all a A).

a. Show that m | n (i.e., m is a factor of n).

b. Show that A is cyclic if and only if m = n.

a. Show that the number of distinct conjugates of H in G is |G|/|N (H)|, where N (H) is the normalizer of H in

G and | | indicates order.

S

b. Show that G = gG gHg 1 if and only if H = G.

c. Deduce that G is generated by a complete set of representatives of the conjugacy classes of elements of G.

Solution: a. Let G act on Sub[G], the set of subgroups of G, by conjugation. That is, for each g G and

K Sub[G], let K g = gKg 1 . The orbit and stabilizer of the subgroup H under this action are, respectively,

OH = {H g : g G}

and

Stab(H) = {g G : H g = H} = N (H).

I claim that the index of N (H) in G is [G : N (H)] = |OH |. Indeed, there is a one-to-one correspondence between

the left cosets of N (H) and the elements of OH . This is verified as follows: for any x, y G,

xN (H) = yN (H)

x1 y N (H)

x1 yH = Hx1 y

yHy 1 = xHx1 .

This proves that the map xN (H) 7 xHx1 , from the cosets G/N (H) to the orbit OH , is well-defined and oneone. It is clearly onto. Therefore, |OH | = [G : N (H)] = |G|/|N (H)|.

t

u

b. We must show: G =

gG

gHg 1 iff H = G.

For every g G, |H| = |gHg 1 |, so, for any x, y G, |(xHx1 ) (yHy 1 )| 6 (|H| 1) + (|H| 1) + 1 (at

worst they intersect at the identity). More generally,

[

1

gHg 6 |G|(|H| 1) + 1

(1)

gG

But, instead of using |G| as a crude bound on the number of distinct conjugates of H, we can use the result from

part a. That is,

[

|G|

1

gHg

6 |N (H)| (|H| 1) + 1

gG

To finish the proof, we verify that

|G|

(|H| 1) + 1 6 |G|

|N (H)|

with equality if and only if H = G.

1.3

2002 November

GROUP THEORY

Heres a more concise proof which can be found, e.g., in Dixon [1] problem 1.9:

Let [G : H] = h and |G| = n. Since H 6 N (H), therefore, by 1.T.3, H has at most h conjugates in

G. Since all subgroups have the identity element in common, the number of distinct elements in these

conjugates of H is at most 1 + (|H| 1)h = n h + 1 < n.

c. Deduce that G is generated by a complete set of representatives of the conjugacy classes of elements of G.

a. List, up to isomorphism, all abelian groups of order p4 .

b. Up to isomorphism, how many abelian groups of order p4 q 4 r3 are there?

4. Let G be a nonsolvable group of least order among nonsolvable groups. Show that G is simple.

Solution: Let G be a group satisfying the hypothesis and suppose G is not simple. Then there is a proper nontrivial

normal subgroup N P G. Now |N | < |G| and |G/N | < |G|, so N and G/N are both solvable (by the minimality

hypothesis). But this implies that G is solvable. (By Problem 3 of March 1999, G is solvable iff N and G/N are

solvable). This contradiction completes the proof.

t

u

5. Let G be a group of order pn m, where p is a prime number, n > 1 and p is not a factor of m. Let r be the number

of Sylow p-subgroups of G and let E = {K1 , . . . , Kr } be the set of Sylow p-subgroups of G. Let N (Ki ) be the

normalizer of Ki in G, and let G act on E by conjugation.

Tr

a. Show that i=1 N (Ki ) is a normal subgroup of G.

Tr

b. Show that | i=1 N (Ki )| > pn /(r 1)!

c. Deduce that a group of order 48 is not simple.

Solution: a. By definition,

N (Ki ) = {g G : Kig = Ki }

where Kig = gKi g 1 = g (Ki ) are various common notations for the action (on E) of conjugation by G. (The

subgroup N (Ki ) is sometimes called the stabilizer of Ki under this action.) Let : G Sym(E) be the map

which sends each g G to the action g Sym(E), the group of permutations on the set E. It is trivial to check

that Hom(G, Sym(E)), with kernel

ker = {g G : Kig = Ki for all Ki E} =

r

\

N (Ki ).

i=1

Tr

i=1

N (Ki ) P G.

\

G/ N (Ki )

= im 6 Sym(E)

4 In

fact, the set of all kernels of homomorphisms of a group is precisely the set of all normal subgroups of the group.

t

u

1.3

2002 November

Therefore, |G|/|

GROUP THEORY

\

pn m

6 | N (Ki )|.

r!

To finish the proof of part b., then, we need only show pn /(r 1)! 6 pn m/r!; equivalently, r 6 m. In other

words, we must show that the number r of Sylow p-subgroups is at most m. The Sylow theorem implies that r

divides [G : K], for any Sylow p-subgroup K. In the present case |K| = pn , so [G : K] = m. Thus r divides m,

so r 6 m, as desired.

t

u

c. To deduce that a group of order 48 is not simple, suppose |G| = 48 = 24 3, and, as above, let r denote

number

Tthe

r

of Sylow 2-subgroups of G, and denote these subgroups by {K1 , . . . , Kr }. Then the subgroup i=1 N (Ki )

is normal in G (by a.) and has order at least 24 /(r 1)! (by b.).TThe Sylow theorem implies that r divides

[G : T

Ki ] = |G|/|Ki | = 48/24 = 3, so r {1, 3}. In either case, | N (Ki )| > 24 /(r 1)! > 1, which proves

t

u

that N (Ki ) is a nontrivial normal subgroup of G, so G is not simple.

6. Show that a finite group G is nilpotent if and only if G is isomorphic to the product of its Sylow p-subgroups.

10

1.4

1.4

2003 November

GROUP THEORY

2003 November

1. Let H be a finite index subgroup of G. Show that there exists a finite index subgroup K of G such that K H

and K is normal in G.

3. Let G be a group and let A be an abelian normal subgroup of G. Show that there is a nontrivial homomorphism

from G/A to the automorphism group of A.

4. State what it means for a group to be solvable, and show that any group of order 280 is solvable.

11

1.5

2004 November

1.5

GROUP THEORY

2004 November

b. Prove that every group of order p2 q, where p and q are primes with p < q and p does not divide q 1, is abelian.

c. Prove that every group of order 12 has a normal Sylow subgroup.

2. a. Among finite groups, define nilpotent group, in terms of a particular kind of normal series. State two conditions

on G which are equivalent to the condition that G is nilpotent.

b. Prove that the center Z(G) of a nilpotent group is non-trivial.

c. Give an example which shows that N P G with both N and G/N nilpotent is not sufficient for G to be nilpotent.

3. a. If K, L are normal subgroups of G prove that G/K L is isomorphic to a subgroup of G/K G/L (the external

direct product). What is the index of this subgroup in G/K G/L, in terms of [G : K], [G : L] and [G : KL]?

b. Prove either direction of: If N P G, then G is solvable if and only if both N and G/N are solvable.

Solution: a. Define the natural mapping

G/K L 3 g(K L) 7 (gK, gL) G/K G/L.

We must check that this mapping is well-defined and one-to-one, as follows:

x(K L) = y(K L)

x1 y K L

x1 y K and x1 y L

xK = yK and xL = yL

To be clear, the forward implications () prove well-definedness, the reverse implications () one-to-oneness.

Also, it is important to note that these calculations take G/K, G/L, and G/K L to be groups, with multiplications given by xKyK = xyK, etc. This requires that the subgroups K and L, and hence K L, be normal.

If, for example, K were not normal, then G/K would not be a group.

It remains to check that the mapping is a homomorphism. Let denote the mapping, and fix two cosets x(K L)

and y(K L) in G/(K L). Then

(x(K L)y(K L)) = (xy(K L)) = (xyK, xyL) = (xKyK, xLyL)

= (xK, xL) (yK, yL) = (x(K L)) (y(K L)).

By exhibiting a monomorphism : G/K L , G/K G/L, we have proved that G/K L can be embedded

as a subgroup in G/K G/L.

The index of G/K L in G/K G/L, in terms of [G : K], [G : L] and [G : K L], is

|(G/K G/L)|/|G/K L| =

[G : K][G : L]

(|G|/|K|)(|G|/|L|)

=

.

|G|/|K L|

[G : K L]

t

u

5 cf.

12

1.5

2004 November

GROUP THEORY

4. a. If H is a subgroup of G and [G : H] = n > 2, prove that there exists a homomorphism from G into Sn , the

group of all permutations of an n-element set. Show that the kernel of is contained in H, and the image of

is a transitive subgroup of Sn .

b. If [G : H] = n and G is simple, then G is isomorphic to a subgroup of An , the subgroup of all even permutations.

c. Every group of order 23 32 112 is solvable.

5. Let G be a finite group, and suppose the automorphism group of G, Aut(G), acts transitively on G \ {1}. That

is, whenever x, y G \ {1} there exists an automorphism Aut(G) such that (x) = y. Prove that G is an

elementary abelian p-group for some prime p, by proving that:

a. All non-identity elements of G have order p, for some prime p.

b. Here Z(G) 6= 1, and the center of every group is a characteristic subgroup.

c. Thus G 6= Z(G), i.e., G is abelian.

a. Prove that CG (N ) P G, and if CG (N ) = {1} then |G| divides |N |!.

b. If N is also cyclic, prove that G/CG (N ) is abelian, and hence that G0 6 CG (N ), where G0 is the commutator

subgroup of G.

13

1.6

2006 April

1.6

GROUP THEORY

2006 April

Instructions: Do as many problems as you can. You are not expected to do all of the problems. You may use earlier

parts of a problem to solve later parts, even if you cannot solve the earlier part; however, complete solutions are

preferred. Most importantly, give careful solutions.

1. Show that there is no simple group of order 992.

Solution: Suppose G is a group of order |G| = 992 = 25 31. Our goal is to show that G contains a normal

subgroup. By the Sylow theorems, the number np of Sylow p-subgroups satisfies6

np 1

(mod p)

and

np | [G : H]

where H is any Sylow p-subgroup. Therefore, n31 1 (mod 31) and n31 | 32, so n31 {1, 32}. If n31 = 1, this

means there is a unique Sylow 31-subgroup, which must be normal in G (since conjugates of Sylow p-subgroups

are also Sylow p-subgroups).

Suppose n31 = 32. Now, any element of a group of prime order generates the whole group. Therefore, the Sylow

31-subgroups must intersect at the identity. Thus, there are 30 32 = 960 elements of order 31 in G. This leaves

only 32 elements in G that are not of order 31. Also, G must contain a Sylow 2-subgroup of order 25 = 32.

Apparently, only one of these can fit inside G, so n2 = 1 (since this results in exactly 992 = 960 + 32 elements). In

this case, it is the Sylow 2-subgroup that is unique, hence normal in G.

t

u

2. Let G be a nonabelian simple group. Let Sn be the symmetric group of all permutations on an n-element set, and

let An be the alternating group.

a. Show that if G is a subgroup of Sn , n finite, then G is a subgroup of An .

b. Let H be a proper subgroup of G, and, for g G, let g be the map of the set of left cosets of H onto themselves

defined by g (xH) = gxH. Show that the map g 7 g is a monomorphism (injective homomorphism) of G into

the group of permutations of the set of left cosets of H.

c. Let H be a subgroup of G of finite index n and assume n > 1 (so H 6= G). Show that G can be embedded in

An .

d. If G is infinite, it has no proper subgroup of finite index.

e. There is no simple group of order 112.

Solution: a. Suppose G is a subgroup of Sn , n finite, and assume G is nonabelian and simple. Clearly G 6= Sn ,

since Sn is not simple (for example, An P Sn ). Consider GAn . This is easily seen to be a normal subgroup of G.

(Normality: if G An and g G, then gg 1 G and gg 1 An , since An P Sn , so gg 1 G An .)

Therefore, as G is simple, either G An = (e) or G An = G. In fact, G An = (e) never occurs under the

given hypotheses, and two proofs of this fact are given below. In case G An = G, of course, G 6 An and we are

done.

Proof 1: Suppose G An = (e). Then G contains only e and odd permutations. Let G be an odd permutation.

Then 2 is an even permutation in G, so it must be e. Thus, every nonidentity element of G has order 2. Suppose

is another odd permutation in G. Then is an even permutation in G, so = e. Therefore, = e = , so

= . This shows G has only two elements e and . But then G

= Z2 is abelian, contradicting our hypothesis.

6 The

14

1.6

2006 April

GROUP THEORY

Proof 2: If G were not a subgroup of An , then the group GAn 6 Sn would have order larger than |An | = |Sn |/2.

By Lagranges theorem, then, it would have order |Sn |. Therefore, GAn = Sn , and, by the second isomorphism

theorem,

G/(G An )

= GAn /An = Sn /An .

This rules out G An = (e), since that would give G

u

= Sn /An

= Z2 (abelian), contradicting the hypothesis. t

Remark: Although the first proof above is completely elementary, the second is worth noting since it reveals useful

information even when we dont assume G is simple and nonabelian. For example (Rose [6], page 77), if G is a

subgroup of Sn containing an odd permutation, then we can show that exactly half of the elements of G are even

and half are odd. Indeed, under these conditions we easily get that GAn = Sn (as in the second proof above),

and then the second isomorphism theorem implies |G/(G An )| = |Sn /An | = 2. Therefore, |G An | = |G|/2,

which says that half the elements of G belong to An , as claimed.

b. Let H G, and let S denote the set of left cosets of G. Let Sym(S) denote the group of permutations of S.

Then the map : G Sym(S) defined by (g) = g , where g (xH) = gxH is a monomorphism of G

into Sym(S). To prove this, we first show that (g) = g is indeed a bijection of S, then we show that is a

homomorphism of G, and finally we show that ker is (e).

To see that g is injective, observe

g (xH) = g (yH)

gxH = gyH

(gy)1 gx H

y 1 x H

xH = yH.

To see that is a homomorphism, note that, for any xH S,

g1 g2 (xH) = g1 g2 xH = g1 (g2 xH) = g1 g2 (xH).

That is, (g1 g2 ) = (g1 )(g2 ), which proves that is a homomorphism.

Finally, note that ker is a normal subgroup of G. Therefore, as G is simple, either ker = (e), or ker = G. But

ker = {g G : x G, g (xH) = xH} = {g G : x G, x1 gx H} 6 H

(since e G). Therefore, H 6= G, so ker 6= G, so ker = (e). This proves that is a monomorphism.

t

u

c. Let H be a subgroup of G of finite index n and assume n > 1 (so H 6= G). We must show that G can be

embedded into An .

Part b. showed that embeds G into Sym(S), where S is the set of left cosets of H in G. Now [G : H] = |S| = n,

which implies that Sym(S)

= Sn , the group of permutations of n elements. Therefore, G is isomorphic to a

subgroup of Sn . By part a., then, G is isomorphic to a subgroup of An .

t

u

d. Suppose G is infinite. We must show it has no proper subgroup of finite index. If, on the contrary, H 6 G with

[G : H] = n, then, G would be isomorphic to a subgroup of the finite group An . Impossible.

t

u

e. Suppose, by way of contradiction, that G is a simple subgroup with |G| = 112 = 24 7. Clearly, G is

nonabelian. (Proof: |G| is not prime, so G has nontrivial proper subgroups. Also, G is simple, while if G were

abelian, all subgroups would be normal.) Now, the Sylow theorems imply that G has a Sylow 2-subgroup of order

24 , call it H. Then [G : H] = 7, so, by part c., : G , A7 . Thus G is (isomorphic to) a subgroup of A7 and

|A7 | = 7!/2 = 7 5 32 23 . By Lagranges theorem, |G| divides |An |. But, 24 7 does not divide 23 32 5 7.

This contradiction proves that a group of order 112 cannot be simple.

t

u

15

1.6

2006 April

GROUP THEORY

3. a. Let be an element of the symmetric group Sn and let (i1 i2 . . . ik ) be a cycle in Sn . Prove that 1 (i1 i2 . . . ik ) =

(i1 i2 . . . ik ). [Note that it is assumed that permutations act on the right, so maps i to i.]

b. Show that A4 is not simple.

c. Show that any five-cycle S5 and any two-cycle S5 together generate S5 .

4. If A and B are subgroups of a group G, let A B be the smallest subgroup containing both, and let AB = {ab :

a A, b B}.

a. Show that if A is a normal subgroup then AB = A B and that, if both A and B are normal, then A B is

normal.

b. If A, B and C are normal subgroups of G and C A, prove Dedekinds modular law:

A (B C) = (A B) C

a. Show that if G/Z is cyclic then G is abelian.

b. Show that any group of order p2 , where p is a prime, is abelian.

c. Give an example of a non-abelian group G where G/Z is abelian.

d. Let be a homomorphism from G onto K, where K is an abelian group. Let N be the kernel of and suppose

N is contained in Z. Suppose that there is an abelian subgroup H of G such that (H) = K. Show G is

abelian.

6. Let G be a finite group and let H P G be a normal subgroup. Show that G is solvable if and only if H and G/H

are solvable.

16

1.7

2006 November

1.7

GROUP THEORY

2006 November

a. Prove that every proper subgroup H < G is contained in a maximal proper subgroup.

b. Show that the intersection of the maximal proper subgroups of G is a normal subgroup.

b. Prove that every group of order p2 q, where p and q are primes with p < q and p does not divide q 1, is abelian.

5. Let G be a group and H a subgroup of G, N a normal subgroup of G. Show that HN is a subgroup of G, that

H N is a normal subgroup of H, and that HN/N

= H/H N .

7 cf.

17

1.8

2007 April

1.8

GROUP THEORY

2007 April

1. Let H and K be (not necessarily normal) subgroups of a group G. For g an element of G the set HgK is called a

double coset. Show that any two double cosets are either identical or do not intersect.

2. State (without proof) the three Sylow theorems. Show that every group of order 56 contains a proper normal

subgroup.

3. Define G0 , the commutator subgroup of G. Show that G0 is a normal subgroup of G. Show that every homomorphism from G to an abelian group A factors through G/G0 (i.e., given : G A there exists : G/G0 A such

that = where : G G/G0 is natural).

4. Short answers.

a. Give examples of groups K, N , and G with K a normal subgroup of N , N a normal subgroup of G, but K not

a normal subgroup of G.

b. Give an example of a simple group that is not cyclic.

c. Give an example of a solvable group that is not nilpotent.

d. Give an example of a group G that is not abelian but G/C(G) is abelian where C(G) denotes the center of G.

e. Make a list of abelian groups of order 72 such that every abelian group of order 72 is isomorphic to exactly one

group on your list.

f. Give a solvable series for S4 , the symmetric group on four elements.

5. Let H be a finite index subgroup of G. Show there is a normal subgroup of G that is contained in H and has finite

index in G.

18

1.9

2008 January

1.9

GROUP THEORY

2008 January

Instructions: Do as many problems as you can. You may use earlier parts of a problem to solve later parts, even if

you cannot solve the earlier part; however, complete solutions are preferred. Most importantly, give careful solutions.

1. Prove that if H is a subgroup of a finite group G, then |H| divides |G| and use this to show that the order of each

element of a finite group divides the order of the group.

b. Show that there is no simple group of order 56.

c. Show that every group of order 35 has a normal subgroup of order 5 and one of order 7.

d. Is every group of order 35 abelian?

3. How many nilpotent groups of order 360 are there? Justify your answer. Your justification should indicate clearly

which theorems you are applying. If you are not able to find the number of nilpotent groups, at least find the number

of Abelian groups of order 360.

4. Show that every group of order 1000 is solvable. You can use the fact that if G has a normal subgroup N such that

both N and G/N are solvable, then G is solvable.

19

1.10

2008 April

1.10

GROUP THEORY

2008 April

Preliminaries:8 The symmetric group on four letters, S4 , contains the following permutations (here we use {0, 1, 2, 3}

to denote the four letters that the elements of S4 permute):

permutations

type

2-cycles

product of 2-cycles

3-cycles

4-cycles

The set of subgroups of S4 , denoted by Sub[S4 ], contains 30 elements. In particular, there is the alternating group,

A4 , which has 12 elements and is generated by the 3-cycles in the table above. The alternating group consists of the

even permutations, which are the permutations that can be written as a product of an even number of 2-cycles or

transpositions. For example, (012) = (02)(01), e = (01)(01), are even, while (01) and (0123) = (03)(02)(01)

are odd. Thus, the 12 elements of A4 are (from the table above): the eight 3-cycles, the three products of disjoint

2-cycles, and the identity.

Another important subgroup is the Klein four group V4 . This is the subgroup of A4 generated by the three products

of disjoint 2-cycles; that is, V4 = {e, (01)(23), (02)(13), (03)(12)}. It is useful to note that V4

= Z2 Z2 , and

the subgroup lattice Sub[V4 ] is the five element modular lattice M3 . That is, V4 has three subgroups {e, (01)(23)},

{e, (02)(13)}, and {e, (03)(12)}, and each pair meets at the identity and joins to V4 .

Solution: We know that S4 is solvable simply because we can write down a normal series, (e) P {e, (12)} P

V4 P A4 P S4 , with abelian factors:

{e, (12)}/(e)

= Z2 ,

V4 /{e, (12)}

= Z2 ,

A4 /V4

= Z3 ,

S4 /A4

= Z2 .

In fact, the factors of the subnormal series are cyclic, which is more than we need.9

We now prove that S4 is not nilpotent. Let C0 = (e), C1 = Z(G) (=the center of G), and let C2 = 11 (Z(G/C1 ))

where 1 : G G/C1 is the canonical projection epimorphism. That is, C2 is defined to be the (unique) normal

subgroup of G such that C2 /C1 = Z(G/C1 ). Given Cn , define Cn+1 = n1 (Z(G/Cn )). Then, by definition, G

is nilpotent if and only if there is an n N such that Cn = G. The series (e) < C1 < C2 < < Cn = G is

called the ascending central series.

We claim that the center of S4 is trivial. That is, Z(S4 ) = (e). Once we prove this, then it is clear that S4 is not

nilpotent. For the ascending central series never gets off the ground in this case, so it has no chance of ever reaching

S4 .

Recall, if N P G and G/N is cyclic and N Z(G), then G is abelian. Note that |A4 | = 12 = 22 3. If there

exists N P A4 ...

Finish it!

8 This

that we could have used the series (e) P V4 P A4 P S4 to prove that S4 is solvable, and in this case the factor groups are not all cyclic,

since V4 /(e)

= Z2 Z2 is not one-generated.

9 Note

20

1.10

2008 April

GROUP THEORY

2. List all abelian groups of order 100. Prove that your list is complete.

Solution: Since 100 = 22 52 , the (isomorphism classes of) abelian groups of order 100 are

Z22 Z52

= Z100

Z22 Z5 Z5

= Z20 Z5

Z2 Z2 Z52

= Z2 Z50

Z2 Z2 Z5 Z5

= Z10 Z10 .

This list is complete by the fundamental theorem of finitely generated abelian groups.

Elaborate!

Solution: Let G be a group of order |G| = 168 = 23 3 7. If a G and |a| = 7 then (a) is a subgroup of order 7,

and since 7 is the highest power of 7 dividing dividing 168, (a) is a Sylow 7-subgroup of G. We count the number

n7 of Sylow 7-subgroups using the Sylow theorems, which imply

n7 1

(mod 7)

and

n7 | [G : (a)].

Since [G : (a)] = 24, then n7 {1, 8}. If n7 = 1 , then there are only 6 elements of order 7 in G. If n7 = 8, then,

since the Sylow 7-subgroups must intersect at (e), there are 6 8 = 48 elements of order 7...

Finish it!

4. Let G0 < G be the commutator subgroup of a finite group G. Let Z be the center of G. Let p be a prime number.

Suppose that p divides |Z| but does not divide |Z G0 |. Show that G has a subgroup of index p.

5. Assume G is a finite group, p the smallest prime dividing the order of G, and H a subgroup of index p in G. Prove

that H is a normal subgroup of G.

21

RING THEORY

Ring Theory

2.1

1992 November

b. Prove: The module Q is injective if every diagram with exact row

/ P0

/P

Q

with projective P is embeddable in a commutative diagram

/ P0

/P

Q

2. Let R be a commutative ring with identity. Recall that an ideal P R is said to be prime if P 6= R and ab P

implies a P or b P . Let J R be an ideal.

a. Show that J is prime if and only if R/J is an integral domain.

b. Show that J is maximal if and only if R/J is a field.

Solution: This is problem 2 of the April 2008 exam. (See section 2.10 below.)

J1 J2 Ji Ji+1

Show that there is an integer n > 1 such that Ji = Jn for all i > n.

S

Solution: This is simply the statement that a PID is Noetherian. It is proved as follows: Let J = Ji and check

that J is an idealSof R. Since R is a PID, J is principal, or one-generated. That is, J = Ra for some a R.

Now a RaS= Ji implies a Jn for some n N. Therefore, as Ra is the smallest ideal containing a, we have

Ra Jn Ji = Ra, and similarly for all Ji with i > n.

t

u

4. Let R be a ring and M a (left) R-module. Suppose M = K L and is an R-endomorphism of M with the

property that (L) K. Prove that M = K (1M + )(L).

10 Part

b. of this problem makes no sense to me. If it makes sense to you, please email me! williamdemeo@gmail.com

22

2.1

1992 November

RING THEORY

Solution: In fact, if M = K L, then every direct sum decomposition M = K J is of this form. That is,11

J = (1M )(L), for some HomR (L, K). (The proof of this fact is easy, but it is not needed for this

problem.)12

Fix m M . Then m = k + l for some k K and l L, and (l) K. Therefore,

m = k + l = k (l) + l + (l) = k 0 + (1M + )(l).

This shows that we can write any m M as a sum m = u + v with u K and v (1M + )(L). Thus M =

K +(1M +)(L). To show that the sum is direct, suppose m belongs to K (1M +)(L). Then m = k = l+(l),

for some k K and l L. Thus, l = k (l) K, which puts l K L = {0}, so (l) = (0) = 0, since

is a homomorphism. Therefore, m = l + (l) = 0, and we have shown M = K (1M + )(L).

t

u

5. Let R be any ring, M, N, K submodules of some R-module such that N 6 M . Prove that the sequence

0

M

M +K

M K

0

N K

N

N +K

Solution: The natural maps are

f:

M K

3 x 7 x + N M/N

N K

and

M +K

.

N +K

It is easy to check that these are well-defined homomorphisms. To see that f is injective, consider

g : M/N 3 x + N 7 x + (N + K)

K

where the first 0 denotes N (the zero of M/N ), while the second 0 denotes N K (the zero of M

N K ). To see that g

is surjective, consider im(g) = {x+(N +K)|x M } = M/(N +K), and note that x+(N +K) = x+y+(N +K)

for any y K, so M/(N + K) = (M + K)/(N + K).

It remains to show that im(f ) = ker(g), and, as we see below, this turns out to be equivalent to

The Modular Law13 If N, M, K are submodules of some module, and N 6 M , then

M (N + K) = N + (M K).

(2)

This law is easy to prove by checking both inclusions; that is, consider an element of each side of (2) and show it

is contained in the other side.

Finally, observe,

ker(g) = {x + N M/N |x N + K} = {x + N |x M and x N + K}

= {x + N |x M (N + K)} = {x + N |x N + (M K)}

= {x + N |x M K} = im(f ).

t

u

11 I

write 1M instead of 1M + because the former seems a bit more natural to me, but it makes no real difference.

12 See Kasch and Mader [4], page 4, or better yet, work out the details over dinner.

13 In lattice theory, we say that a lattice is modular if it satisfies the modular law: for elements a, b, c of the lattice, if a 6 b, then b (a c) =

a (b c). Not coincidentally, the lattice of submodules of a module satisfies the modular law (where join is + and meet is ). Alas, mathematical

terminology is not always perverse!

23

2.1

1992 November

RING THEORY

Remark: The modular law is sometimes called the Dedekind identity. This identity, and its consequence, im(f ) =

ker(g), is the crux of problem 5. In fact, Kasch and Mader ([4], page 5) call the exact sequence

0

M K

M

M +K

0

N K

N

N +K

6. Let F be a field and let R = F (X, Y ] be the polynomial ring over F in indeterminates X, Y . Let , F , and

let : R F be defined by (f (X, Y )) = f (, ) for all polynomials f (X, Y ) R. Show that ker() =

(x , y ).

7. Let R be a ring which is generated (as a (left) R-module) by its minimal left ideals (i.e., R is semi-simple).

a. Prove that R is the direct sum of a finite number of minimal left ideals.

b. Prove that every simple R-module is isomorphic to a left ideal of R.

Solution: a. Assume the left regular R-module, R R, is semi-simple, by which we mean here that

M

R=

Ai

(3)

iI

for some collection {Ai |i I} of minimal left ideals of R. We assume that all rings are unital, so 1 R. Note

that, although the direct sum (3) may be infinite, each r R is a sum of finitely many elements from the set

S

{Ai |i I}. In particular, 1 = ai1 + + ain for some finite collection of indices {i1 , . . . , in } I and

aij Aij . Therefore,

R = R1 = R(ai1 + + ain )

n

M

j=1

Ln

j=1

Ai j .

Ai j

Ai = R,

iI

t

u

8. Let R be a commutative ring. Prove that an element of R is nilpotent if and only if it belongs to every prime ideal

of R.

Solution: If s R is nilpotent, then sn = 0 for some n N. In particular, sn = 0 P for any ideal P of R. If

P is prime, then sn P implies s P .

To prove the converse, recall the following useful theorem:14

Theorem: If S is a multiplicative subset of a ring R which is disjoint from an ideal I of R, then there exists an ideal

P which is maximal in the set of all ideals R disjoint from S and containing I. Furthermore, any such ideal P is

prime.

If s R is not nilpotent, consider the set S = {s, s2 , s3 , . . . }. Clearly this is a multiplicative set which is disjoint

from the ideal (0). The theorem then gives a prime ideal P disjoint from S. In particular, s

/ P.

t

u

(See also April 08 (2d).)

14 This

24

2.2

1995 April

2.2

RING THEORY

1995 April

1.15 Let R be a commutative ring. Recall that the annihilator of an element x in an R-module is the ideal ann(x) =

{s R : sx = 0}. Let Rx and Ry be cyclic R-modules.

a. Show that Rx R Ry = R(x y).

b. Show that R(x y)

= R/(ann(x) + ann(y)).

c. Show that ann(x y) = ann(x) + ann(y).

2.16 Let R be a ring and suppose that I, J are left ideals of R such that I + J = R. Prove that

R R R

.

=

I J

I

J

3.17 Recall that an ideal I of a ring R is nilpotent if I n = 0 for some positive integer n.

a. Show: If I and J are nilpotent ideals, then so is I + J.

b. Let R = Q[X, Y ]/(X 2 , Y 2 ). Show that R contains a unique largest nilpotent ideal and find it.

4. The injectivity class of an R-module C is defined to be the class Inj(C) consisting of all modules B such that

for every submodule A of B, every R-homomorphism h : A C extends to a homomorphism h0 : B C.

Prove that the injectivity class of C is closed under epimorphic images; i.e., if B Inj(C) and f : B B 0 is an

epimorphism, then B 0 Inj(C).

5.18 Let M and N be finitely generated modules over the polynomial ring Q[x]. Show that M and N are isomorphic

if M is isomorphic to a direct summand of N and N is isomorphic to a direct summand of M .

15 See

also November 95, problem 4.

17 See also November 97, problem 5.

18 See also November 97, problem 2.

16 See

25

2.3

2.3

1995 November

RING THEORY

1995 November

Instructions: Ph.D. students should attempt at least three problems, M.A. students should attempt at least two.

It goes without saying that all rings have an identity. Integral domains are commutative, other rings are not necessarily

commutative unless so specified.

1. Recall that an element r in an integral domain R is called irreducible if whenever r = ab for a, b R, then either

a or b must have an inverse.19

a. Prove that an element r is irreducible if and only if (r) is maximal among principal ideals; i.e., (r) is not properly

contained in any other principal ideal.

b. Prove that a Noetherian integral domain R is a unique factorization domain if and only if all principal ideals

generated by irreducible elements are prime.

/ aR[X] for any proper

ideal a of R.

a. Prove that a polynomial f is primitive if and only if f

/ pR[X] for any prime ideal p of R.

b. Prove that the product of two primitive polynomials is primitive. (This is essentially Gausss Lemma.)

c. Show, in outline, how to use Gausss Lemma to prove that the polynomial ring R[X] is a unique factorization

domain.

3. Prove that an integral domain R has the property that every submodule of a free R-module is free if and only if R

is a principal ideal domain.

4. Let I and J be ideals in a commutative ring R such that I + J = R.

a. Prove that IJ = I J.

b. Prove that R/IJ

= R/I R/J.

5. a. Prove that a ring R is left Noetherian if and only if all submodules of finitely generated left R-modules are

finitely generated.

b. Prove that over any ring, a direct summand of a finitely generated module is finitely generated. (I.e., if M N

is finitely generated, then M is finitely generated.)

c. Prove that over any ring R, a module is finitely generated and projective if and only if it is isomorphic to a direct

summand of a free R-module with finite rank (i.e., of the form Rn for some finite n).

6. Let M be a module over a commutative ring R. Let p be a prime ideal in R and let Mp be the localization of M at

p.

a. Prove that for m M , 0 6= m

1 Mp if and only if ann(m) p, where ann(m) = {r R | rm = 0}.

b. Prove that an R-module M is non-trivial if and only if Mm 6= 0 for some maximal ideal m of R.

19 Actually,

thats not quite the right definition we should also assume r is a nonzero nonunit element of R.

26

2.4

1996 April

2.4

RING THEORY

1996 April

1. Identify the following rings (integral domain, unique factorization domain, principle ideal domain, Dedekind domain, Euclidean domain, etc), citing theorems to justify your answers and giving examples to show why it is not of

a more specialized class.

a. F2 [x, y]

b. F2 [x, y]/(y 2 + y + 1)

c. R[x, y]/(x2 + y 2 )

d. C[x, y]/(x2 + y 2 )

e. Z[ 5]

Solution:

Lemma:20 If D is an integral domain containing an irreducible element c D, then D[x] is not a PID.

Proof: Let c be an irreducible element in D (i.e. c is a nonzero nonunit and c = ab only if a or b is a unit). Suppose

D[x] is a PID, and consider the ideal (c, x) of D[x]. Then (d) = (c, x) for some d D[x]. This implies c (d),

so c = gd, for some g D[x]. By irreducibility of c, either g is a unit or d is a unit. If d is a unit, then (d) would

be all of D[x]. But (d) = (c, x) 6= D[x] (for one thing, 1

/ (c, x)), so d is not a unit. Therefore, g must be a unit,

so we can write d = g 1 c. This implies d (c), so (c, x) = (d) = (c). It follows that x (c), and thus x = f c

for some f D[x]. Finally, x is irreducible,21 so f must be a unit, but this puts both f and c, hence x, in D, which

is impossible.

t

u

Corollary 2.1 If F is a field and n > 2, then F[x1 , . . . , xn ] is not a PID.

This follows from the lemma above since x1 is irreducible in F[x1 , . . . , xn ]. (If x1 = ab for some a, b

F[x1 , . . . , xn ], then, arguing by degree, either a F or b F.)

Theorem 2.1 If D is a UFD, then so is the polynomial ring D[x1 , . . . , xn ].

By corollary 2.1 above, however, D[x1 , . . . , xn ] need not be a PID when n > 2. (Note that a field is trivially a

UFD.)

a. F2 [x, y]

Since F2 is a field, it is a UFD, so theorem 2.1 implies that F2 [x, y] is a UFD. However, as in the corollary

above, F2 [x, y] is not a PID. In particular, (x, y) is a (maximal) ideal in F2 [x, y] which is not principal, as the

reader may easily verify.

b. F2 [x, y]/(y 2 + y + 1)

Letting D = F2 [x], we have F2 [x, y]/(y 2 + y + 1) = D[y]/(y 2 + y + 1). It is easily verified that D is a

Euclidean domain with norm (f ) = deg(f ). Now, if the polynomial g(y) = y 2 + y + 1 is irreducible in D[y],

then (g(y)) is a maximal ideal and so D[y]/(g(y)) is a field. To show that g(y) is, indeed, irreducible, suppose

g(y) = ab, for some a, b D[y]. Then degx (a) = degx (b) = 0 so a, b F2 [y]. If they are to be nonunits, a

and b must have degy (a) = degy (b) = 1. The only choices are a = y and b = y for some , F2 .

That is, g(y) = y 2 + y + 1 must have roots in F2 , which it does not (g(0) = 1 and g(1) = 3 1). Therefore,

g(y) is irreducible in D[y] = F2 [x, y]. We have thus shown that E = F2 [x, y]/(y 2 + y + 1) is a field.

20 This

21 To

see that x is irreducible in D[x], argue by degree.

27

2.4

1996 April

RING THEORY

c. R[x, y]/(x2 + y 2 )

First note that (x2 + y 2 ) is not a maximal ideal of R[x, y]. For, (x2 + y 2 ) ( (x, y) ( R[x, y].

Letting D = R[x],

and p(y) = x2 + y 2 , we have R[x, y]/(x2 + y 2 ) = D[y]/(p(y)). The roots of p(y) are 1x which do not

belong to D. Thus p(y) is irreducible in D[y]. What else can we say about R[x, y]/(x2 + y 2 ) = D[y]/(p(y))?

Finish this one!

d. C[x, y]/(x2 + y 2 )

Let D = C[x] and consider C[x, y]/(x2 + y 2 ) = D[y]/(p(y)), where p(y) = x2 + y 2 . The roots of p(y) in

D[y] = C[x, y] are ix, and so p(y) factors in C[x, y] as x2 +y 2 = (y+ix)(yix). Therefore, C[x, y]/(x2 +y 2 )

has zero divisors: let a = y + ix + (x2 + y 2 ) and b = y ix + (x2 + y 2 ). Then ab = (x2 + y 2 ) =

0

C[x, y]/(x2 + y 2 ). Therefore, C[x, y]/(x2 + y 2 ) is not a domain.

e. Z[ 5]

This is a domain (as a subring of C) which is not a UFD. For example, 9 has a non-unique factorization as a

product of irreducibles:

9 = 3 3 = (2 + 5) (2 5).

Some useful references for problem 1 are Hungerford [2] (in particular, p. 139 and cor. 6.4, p. 159), and Jacobson [3]

(p. 141).

b. Generalize the result of part a. to Q Z A, where A is a divisible abelian group. Note: the group A (written

additively) is called divisible if for any integer n > 2 and any element a A, there exists an element b A

such that nb = a.

3. a. Show that any commutative ring has a maximal ideal.

b. Give an example of a commutative ring with only one maximal ideal.

c. A ring as in b. is called a local ring. Show that a commutative ring is local if and only if the set of nonunits

forms an ideal.

Solution: a. Let J be the set of all proper ideals in R and consider the partially ordered set (J , ). Let

{A : A } be any chain

S in J i.e. A is a totally ordered index set and for all , A , if 6 , then

A A . Define J =

A . We verify that J is a proper ideal of R. Of course, as a union of subgroups of

A

the abelian group reduct hR; +, , 0i, J is a subgroup. Fix r R and j J. Then there exists A J such

that j A , so rj A J. Therefore, J is an ideal. It is a proper ideal because otherwise 1R J, which

would imply that 1R A for some A . But then A = R which contradicts the definition of J .

28

2.4

1996 April

RING THEORY

Thus, we have J J , and J is an upper bound for {A : A }. By Zorns lemma, J has a maximal

element.

t

u

b. For an example of a commutative ring with only one maximal ideal, take the set Z4 = {0, 1, 2, 3} and define

+ and on Z4 to be addition mod 4 and multiplication mod 4, respectively. Then the ideal generated by 2 is

(2) = {0, 2}, and this is the only maximal ideal. For 1 and 3 are units, so (1) = (3) = Z4 . (You should

generalize this argument and convince yourself that, if p is prime and n > 1, then Zpn is a ring with unique

maximal ideal (p).)

c. A ring is called a local ring iff it has a unique maximal ideal. Let R be a commutative ring with 1R . We must

show that R is local iff the set of nonunits forms an ideal. To do so, we prove the equivalence of the following

three statements:

(i) R is a local ring.

(ii) All nonunits of R are contained in some ideal M 6= R.

(iii) The set of all nonunits of R forms an ideal.

Throughout, we let S denote the set of all nonunits in R. We will prove (ii) (iii) (i) (ii).

Suppose (ii) holds so that S M where M is a proper ideal of R. Of course, an ideal is a proper ideal iff it

contains only nonunits. Therefore, S M S, so S = M , which proves (iii).

Suppose (iii) holds, and let S J R be a chain of ideals. Then, as above, J = R unless J S, so S contains

all proper ideals of R. By (iii), S itself is and ideal, so it is the unique maximal ideal, which proves (i).

If (i), then there is a unique maximal ideal M ( R. Fix a S. Now, there is always a maximal ideal of R

which contains the ideal (a) (by Zorns lemma). But M is the unique maximal ideal of R. Therefore, (a) M .

Since a S was arbitrary, this proves that S M and (ii) holds.

t

u

4. a. Let R be a commutative ring and M an R-module. Show that HomR (R, M ) and M are isomorphic as left

R-modules.

b. It is clear that HomR (R, M ) HomZ (R, M ). Give an explicit example of a Z-module homomorphism which

is not an R-module homomorphism.

a. Define what it means for M to be projective.

b. Prove that M is projective if and only if it is a direct summand of a free R-module.

29

2.5

1999 March

2.5

RING THEORY

1999 March

Instructions: Do as many problems as you can. You are not expected to do all of the problems; you should try to have

a collection of solutions balanced among the sections. You may use earlier parts of a problem to solve later parts, even

if you cannot solve the earlier part. Most importantly, give careful solutions.

Ph.D. candidates should not do the starred problems.

1. * Suppose D is a commutative ring (not necessarily with 1) having no zero divisors. Give a definite construction

of a field in which D can be embedded along with the embedding. You dont need to prove anything beyond that

the operations are well defined and that the set of your construction is closed under the operations.

b. Every principal ideal domain satisfies the ascending chain condition for ideals.

c. Give an example of a unique factorization domain that is not a principal ideal domain.

3. Any finitely generated module over a principal ideal domain is the direct sum of its torsion submodule and a free

module.

4. Suppose R is a ring.

a. Suppose A is a right R-module and B is a left R-module. Define the Abelian group A R B.

b. Show that A R R and A are isomorphic Abelian groups.

Q

5. Let I be an infinite set.

P Suppose for each i I that Fi is a field. (Fi : i I) denotes the direct product of the

family of fields, and (Fi : i I) denotes the direct sum, and the latter set consistsQof those sequences

P belonging

to the direct product that have 0 in all but finitely many places. Show that the ring (Fi : i I)/ (Fi : i I)

has a homomorphic image which is a field. (Any assertion you make about the existence of an ideal should be

proved.)

30

2.6

2.6

2003 April

RING THEORY

2003 April

1. Let R be a ring, I a right ideal and J a left ideal of R. The expression I + J stands for the Abelian group generated

by I J. Prove that

R

R R

R

.

=

I

J

I +J

Define your maps carefully with particular attention to well-definedness.

Solution:

Lemma 2.1 Every element of

R

I

R

J

Note that every element can certainly be written as a finite sum of generators, say, (s1 + I) (r1 + J) + +

(sn + I) (rn + J). Also, (si + I) (ri + J) = (1 + I) (si ri + J), so

n

X

(si + I) (ri + J) =

i=1

n

X

X

(1 + I) (si ri + J) = (1 + I) (

si ri ) + J .

i=1

R

R

Now define the map : R

I J I+J by (s + I, r + J) = sr + (I + J). This is clearly a well-defined mapping

from one abelian group to another. For, if (s + I, r + J) = (s0 + I, r0 + J), then s s0 I and r r0 J, so

Therefore, (s + I, r + J) = (s0 + I, r0 + J) implies (s + I, r + J) = (s0 + I, r0 + J).

A routine calculation shows that the mapping is bilinear, and therefore (by the universal property of tensor

R

R

I R J I+J , which is clearly surjective. To show that is also

By lemma 2.1, x = (1 + I) (r + J) for some r R, and

injective, suppose x ker .

0 = (x)

= r + (I + J)

r I +J

r = i + j,

x = (1 + I) (i + j + J) = (1 + I) (i + J) = (i + I) (1 + J) = I (1 + J) = 0.

This shows that ker = 0, so is an isomorphism.

t

u

2. a. Let A1 and A2 be modules over some ring, K1 A1 and K2 A2 be submodules, and 1 : A1 A2 and

2 : A2 A1 and be homomorphisms with the following properties.

i. 1 (K1 ) K2 and 2 (K2 ) K1 , and

ii. (1 2 1 )(A1 ) K1 and (1 1 2 )(A2 ) K2 .

Show that the maps

f : A1 K2 A2 K1 : f ((x1 , y2 )) = (1 (x1 ) y2 , x1 + 2 1 (x1 ) 2 (y2 ))

and

g : A2 K1 A1 K2 : g((x2 , y1 )) = (2 (x2 ) y1 , x2 + 1 2 (x2 ) 1 (y1 ))

are well-defined homomorphisms and that g = f 1 .

31

2.6

2003 April

RING THEORY

b. Let P1 and P2 be projective modules and M a module over some ring R. Suppose that 1 : P1 M and

2 : P2 M are epimorphisms. Show that

P1 ker(2 )

= P2 ker(1 ).

3. Let Mn (R) be the ring of matrices with coefficients in a ring R (with 1), where n is a natural number > 1. For a

(two-sided) ideal I of R, let

Mn (I) = {[aij ] Mn (R) : aij I}.

a. Prove that Mn (I) is an ideal of Mn (R).

b. Prove that every ideal of Mn (R) is of the form Mn (I) for a suitable ideal I of R.

Solution: The first part is very easy. The second part is proved for n = 2 below (see proposition A.1), and for the

general case in Lams book [5].

a. Prove that the endomorphism ring of a simple module is a division ring (= skew field).

b. Prove that a ring R with identity 1 contains a left ideal I such that R/I is a simple left R-module.

c. Let R be a ring with identity 1 and suppose that M = R M is a left R-module with the property that every

submodule is a direct summand (everybody splits). Show that every non-zero submodule K of M contains a

simple submodule.

Solution: a. Let M be a simple R-module, and suppose is an endomorphism of M that is not identically zero.

We must show that is invertible. It suffices to show that is bijective. M is simple, so {0} and M are the

only submodules. Of course, ker and im are both submodules of M (as is easily verified). Since is not the

zero map, it must be the case that im 6= {0} and ker 6= M . Thus, is bijective.

t

u

b. By the standard Zorns lemma argument, we can find a maximal left ideal I in R. It is easily verified that R/I

is a left R-module. Suppose M is a left R-submodule of R/I. Then, in particular, M is a left ideal of R/I.

Recall that the left ideals of R/I are in one-to-one correspondence with the left ideals of R which contain I.

Moreover, each left ideal in R/I has the form J/I for some left ideal J in R containing I (see, e.g., Hungerford

[2], p. 126). Thus, we have a chain of left ideals I J R with M = J/I. Since I is maximal, either J = I,

in which case M is the zero submodule of R/I, or J = R, in which case M = R/I. Since M was an arbitrary

submodule of R/I, this proves that R/I is a simple module.

t

u

c. Let k be a nonzero element of K. Clearly Rk K is also a submodule of M . Therefore, M = Rk N for

some submodule N of M .

t

u

32

2.7

2003 November

2.7

RING THEORY

2003 November

1. Let R be a commutative ring, and let N be the set of all nilpotent elements of R. Prove that

a. N is an ideal of R, and

b. R/N has no nonzero nilpotent elements.

(3 + 3)(3 3) = 12 = 22 3,

t

u

3. Let R be a commutative ring with unit. Show that if R contains an idempotent element e, then there exist ideals S,

T of R such that R = S T .

Solution: Let : R R be defined by (r) = er. Then

(r1 r2 ) = er1 r2 = r1 er2 = r1 (r2 )

and

(r1 + r2 ) = e(r1 + r2 ) = er1 + er2 = (r1 ) + (r2 ).

That is, is an R-module endomorphism (viewing R as a module over itself). Also, is itself an idempotent

element in the ring of endomorphisms EndR R. That is, = , as is easily verified.

Let T = im = {(r) : r R} and let S = ker = {r R : (r) = 0}. Then, for any r R we have

r = r (r) + (r)

with (r) T and, since is idempotent, r (r) S. Thus R = S + T . Now suppose r S T . Then r T

implies r = (r0 ) for some r0 R. On the other hand, r S implies 0 = (r) = ((r0 )) = (r0 ) = r, the

penultimate equality by idempotence of . This proves that S T = 0, so R = S T .

We prove that S and T are ideals by simply checking the required conditions. Fix s1 , s2 S, and r R. First note

that s1 S since is an R-module homomorphism, so (s1 ) = (1R s1 ) 1R (s1 ), where 1R is the unit

of R. It then follows that

(s1 s2 ) = (s1 ) (s2 ) = 0 0 = 0

so s1 s2 S, which proves that S is a subgroup of the abelian group reduct hR, +, , 0i of R. Finally (rs1 ) =

r(s1 ) = r 0 = 0, so rs1 S, which proves that S is an ideal.

The proof that T is an ideal is similar; we verify that T is a subgroup of the abelian group reduct hR, +, , 0i, and

then check that rt T whenever r R and t T .

t

u

33

2.7

2003 November

RING THEORY

4. Prove that if R is a commutative ring and I, J are ideals of R, then there is an R-module isomorphism

R/I R/J

= R/(I + J).

Solution: This is the special case (in which R is commutative) of problem 1 of April 2003.

a. Show that ann(x) is a left ideal of R.

b. Prove that there is an R-module isomorphism Rx

= R/ann(x).

Solution: a. Fix r1 , r2 ann(x) and r R. Then (r1 r2 )x = r1 x r2 x = 0 so r1 r2 ann(x) so ann(x)

is a subgroup of the abelian group reduct hR, +, , 0i. Also, rr1 x = r0 = 0 so rr1 ann(x) which proves

that ann(x) is a left ideal of R.

b. Define : R Rx by (r) = rx. Then is clearly surjective. Also, (r1 r2 ) = r1 r2 x = r1 (r2 ), so is an

R-module epimorphism. Finally,

ker = {r R : rx = 0} = ann(x).

Therefore, by the first isomorphism theorem R/ann(x)

= im = Rx.

34

t

u

2.8

2004 November

2.8

RING THEORY

2004 November

Notation: Z denotes the ring of integers and Q denotes the field of rational numbers.

1. Let R be a commutative ring.

a. Show that if R is an integral domain, then the only units in the polynomial ring R[x] are the units of R.

b. Give counterexamples when R is not an integral domain,

c. Show that R[x] is a principal ideal domain if and only if R is a field.

2. Let f Z[x] be a monic polynomial of degree n with distinct roots 1 , . . . , r , r 6 n. Show that 1 + +r Z.

3. List all the ideals of the quotient ring R[x]/I, where I is the ideal generated by (x 5)2 (x2 + 1). Identify which of

the ideals are prime and which are maximal. Does your answer change if the field R is replaced by C? (Explain.)

4. Let M be a left module over a ring R.

a. Suppose that M is finitely generated and that R is commutative and Noetherian. Sketch a proof that M is

Noetherian; i.e., M satisfies the ascending chain condition on submodules.

b. Suppose that M is Noetherian and that f : M M is a surjective homomorphism. Show that f is an

isomorphism.

5. Let R be a ring with 1 and let M be an R-module. Show that the following are equivalent:

a. There exists a module N such that M N is free.

b. Given any surjection : B M , there exists an R-module homomorphism : M B such that is the

identity on M .

c. Given a homomorphism : M B and a surjection : A B, there exists a homomorphism : M A

such that = .

a. Show that any nontrivial ideal must contain some positive integer.

b. Find all the units in R.

c. If a + bi is not a unit, show that a2 + b2 > 1.

35

2.9

2.9

2008 January

RING THEORY

2008 January

1. State a structure theorem for finitely generated modules over a PID, including uniqueness conditions on the direct

summands.

Solution: If A is a finitely generated module over a PID R, then

(i) A is a direct sum of a free submodule F of finite rank and finitely many cyclic torsion modules. The cyclic

torsion summands (if any) are of orders r1 , . . . , rt where the r1 , . . . , rt are (not necessarily distinct) nonzero

nonunits in R satisfying r1 |r2 | |rt . The rank of F and the ideals (r1 ), . . . , (rt ) are uniquely determined by

A.

(ii) A is a direct sum of a free submodule E of finite rank and a finite number of cyclic torsion modules. The

cyclic torsion summands (if any) are of orders ps11 , . . . , pskk where the p1 , . . . , pk are (not necessarily distinct)

primes in R and the s1 , . . . , sk are positive integer. The rank of E and the ideals (ps11 ), . . . , (pskk ) are uniquely

determined by A (except for the order in which the pi appear).

Symbolically, the situation in part (i) of this theorem is as follows:

A

= F R/(r1 ) R/(rt ),

= F Ra1 Rat

where (ri ) = ann(ai ) = {r R : rai = 0}. Note that r1 |r2 | |rt holds if and only if ann(at ) ann(a1 ),

in which case rt a = 0 for all a Tor(A). The situation in part (ii) of the theorem can be written symbolically as

s

A

= E R/(ps11 ) R/(pkk ).

2. Suppose that f : M N and g : A B are homomorphisms of right and left R-modules, respectively. Prove

that there is a group homomorphism h : M R A N B with h(m a) = f (m) g(a) for all a A and

m M.

3. Let A be an (R, S)-bimodule and B be an (R, T )-bimodule and let M = HomR (A, B).

a. Give the actions of S and T on M making it an S-module and a T -module (left or right, as appropriate). No

proofs required.

b. Assuming your module actions from the first part, prove that M is in fact an (S, T ) or (T, S) bimodule

(whichever is appropriate).

Solution: a. An action of S on M making M into a left S-module is given as follows: for all s S, f 7 sf ,

where (sf )(a) = f (as), for all a A. An action of T on M making M into a right T -module is given as

follows: for all t T , f 7 f t where (f t)(a) = f (a)t, for all a A.

b. That M is an (S, T )-bimodule can be seen by simply checking that it satisfies the definition; i.e., by checking

that M is both a left S-module and a right T -module. Indeed, for all a A, s1 , s2 , s S, f1 , f2 , f M , we

have

((s1 + s2 )f )(a) = f (a(s1 + s2 )) = f (as1 + as2 ) (since A is a right S-module)

= f (as1 ) + f (as2 ) = (s1 f )(a) + (s2 f )(a) = (s1 f + s2 f )(a),

(s(f1 + f2 ))(a) = (f1 + f2 )(as) = f1 (as) + f2 (as) = sf1 (a) + sf2 (a) = (sf1 + sf2 )(a),

36

2.9

2008 January

RING THEORY

and (s1 (s2 f ))(a) = (s2 f )(as1 ) = f ((as1 )s2 ) = f (a(s1 s2 )) = ((s1 s2 )f )(a). The penultimate equality holds,

again, because A is a right S-module. This proves that M is a left S-module. The proof that M is a right

T -module is similar, so we leave it to the reader to check that, since B is a right T -module, the following holds:

For all a A, t1 , t2 , t T, f1 , f2 , f M ,

(f (t1 + t2 ))(a) = (f t1 + f t2 )(a),

((f1 + f2 )t)(a) = (f1 t)(a) + (f2 t)(a),

(f (t1 t2 ))(a) = ((f t1 )t2 )(a).

t

u

a. An injective Z[i, ]-module. (You may assume that is transcendental over Q.)

b. A ring which is a UFD but which does not have the ascending chain condition on ideals.

c. Two nonzero Q-modules M and N with M Q N = 0.

d. A Euclidean domain which is not a PID.

37

2.10

2.10

2008 April

RING THEORY

2008 April

a. Define what it means for R to be Noetherian.

b. Prove that if R is Noetherian, the polynomial ring R[x] is Noetherian.

Solution: a. A commutative ring R is Noetherian provided R satisfies the ascending chain condition (ACC) on

ideals. That is, for any chain I1 I2 of ideals of R, there is an N N such that In = In+1 for all n > N .

(By Zorns lemma, a condition which is equivalent to the ACC is that every nonempty set of ideals contains a

maximal element.) More generally, an R-module is Noetherian provided it satisfies the ACC on submodules.

b. This is the Hilbert Basis Theorem, which can be found in many standard references, for example, Theorem

VIII.4.9 of Hungerford [2]. The proof in Hungerford uses a fundamental theorem ([2], VIII.1.9) which is worth

noting: a module M is Noetherian if and only if every submodule of M is finitely generated. In particular, a

commutative ring R is Noetherian if and only if every ideal of R is finitely generated. Therefore, to show that

R[x] is Noetherian, it suffices to show that every ideal J in R[x] is finitely generated.

2. Let R be a commutative ring with identity. Recall that an ideal P R is prime if P 6= R and ab P a P or

b P . Let J R be an ideal.

a. Show that J is prime if and only if R/J is an integral domain.

b. Show that J is maximal if and only if R/J is a field.

c. Prove that if J 6= R, then J is contained in a maximal ideal.

d. Prove that an element of R is nilpotent if and only if it belongs to every prime ideal of R.

Solution: a. First, note that R/J is a commutative ring with multiplication (a+J)(b+J) = ab+J, for a, b R,

additive identity

0 = J, and multiplicative identity 1R + J. (That the ring axioms are satisfied is easily verified.)

() Suppose J is prime and (a + J)(b + J) = ab + J = 0 = J. Then ab J so either a J and a + J =

0

or b J and b + J =

0. That is, R/J has no zero divisors.

() Suppose R/J is an integral domain. Then, since an integral domain has a (non-zero) multiplicative identity

in this case, 1R + J its clear that J 6= R. Now, suppose ab J. Then (a + J)(b + J) = ab + J =

0. It

follows that either a + J =

0 or b + J = 0, since R/J is a domain. That is, either a J or b J, which proves

that J is prime.

t

u

b. () Suppose J is maximal and a+J 6= 0 in R/J. Then a

/ J. Consider the ideal generated by a and J, denoted

(a, J). Since J ( (a, J) R and J is maximal, it must be the case that (a, J) = R. Whence, 1R (a, J),

so 1R = ab + rj for some j J, r, b R. Therefore, 1R ab J so (a + J)(b + J) = ab + J = 1R + J,

which shows that a + J is a unit in R/J. Since a + J was an arbitrary non-zero element, this proves that R/J

is a field.

() Suppose R/J is a field. Let J I R be a chain of ideals. Suppose there exists an element a I \ J.

Then a + J is non-zero, so there is a b + J R/J such that ab + J = 1R + J. Now, since a I, an ideal,

clearly ab I as well. Also, ab 1R J I. Therefore, 1R I, which implies I = R. This proves that J is

maximal.

t

u

c. Let I be the set of all proper ideals of R which contain J. Then hI , i is a partially ordered set.

S Let {J :

} be a chain of subsets of I indexed by (totally ordered by set inclusion).22 Define M = {J : }.

22 This simply means that, for any , , either J J or J J . Consequently, we can totally order the index set by declaring

6 if and only if J J .

38

2.10

2008 April

RING THEORY

We verify that (1) M is an ideal and (2) M belongs to I : First, a, b M implies a J and b J for some

, . Without loss of generality, suppose J J . Then both a and b are in J , so a b J M ,

which proves that M is a subgroup of hR, +, 0S

R i. If r R, then ra J M , so (1) is proved. To see that M

is proper, note that 1R cannot belong to M = J . For, if 1R M , then 1R J for some . But each

J is a proper ideal, so this cant happen. (Any ideal which contains a unit is all of R.) We have thus shown

that every chain in the poset hI , i has an upper bound in the set I . Therefore, by Zorns lemma,23 I has a

maximal element. That is, J is contained in a maximal ideal.

t

u

d. () Let a R be nilpotent and let P R be a prime ideal. Then P is, in particular, a subgroup of hR, +, 0R i,

so 0R P . Let n N be such that an = 0R . Then an P and, recall the following fact (Corollary A.1) for

prime ideals in a commutative ring: for b1 , b2 , , bk R,

if b1 b2 bk P then bi P for some i {1, . . . , k}.

Applied in the present case, an P implies a P .

() Suppose a is not nilpotent; i.e. for all n N, an 6= 0. Consider the set A = {an : n N}. This is

a multiplicative set which is disjoint from the zero ideal (0). By Theorem A.2, then, there is a prime ideal P

which is disjoint from A, whence a

/ P.

t

u

(See also November 92 (6).)

a. Suppose that A is a right R-module and B is a left R-module. Define the abelian group A R B.

b. Show that Zm Zn

= Zd , where d = gcd(m, n).

Solution: a.24 Let F be the free abelian group on the set A B and let K be the subgroup of F generated by all

elements of the form

(i) (a1 + a2 , b) (a1 , b) (a2 , b)

(ii) (a, b1 + b2 ) (a, b1 ) (a, b2 )

(iii) (ar, b) (a, rb)

where a, a1 , a2 A, b, b1 , b2 B, and r R. The quotient group F/K is an abelian group called the tensor

product of A and B, denoted by A R B. That is, we define A R B = F/K.

b. Define the map : Zm Zn Zd by (x, y) = xy (mod d), for x Zm , y Zn . Then it is easy to check

that is a middle linear map. That is, satisfies, for all x, x1 , x2 Zm , y, y1 , y2 Zn , and r Z,

(x1 + x2 , y) = (x1 , y) + (x2 , y),

(x, y1 + y2 ) = (x, y1 ) + (x, y2 ),

(xr, y) = (x, ry).

23 In proofs involving Zorns lemma, it is often better to use a symbol that signifies an arbitrary index set, like (as opposed to, say, N), as we

typically want the argument to work for uncountable collections of sets. This may seem like a minor point, but examiners are likely to notice this

sort of thing.

24 In my opinion, Hungerford [2] section IV.5, pp. 207209, gives the clearest, most succinct exposition of the tensor product and its basic

properties, and the solution given here reflects this bias.

39

2.10

2008 April

RING THEORY

Therefore, by the universal property, there is a unique (abelian group) homomorphism : Zm Zn Zd such

that

= where is the canonical middle linear map, (a, b) 7 a b. In other words, we have the following

commutative diagram:

/ Zm Zn

Zm ZIn

II

u

II

uu

I

uu

u

II

u

I$

zuu

Zd

The proof is complete if is actually an isomorphism. Equivalently, there should exist a HomR (Zd , Zm

Zn ) such that

= 1Zd and = 1Zm Zn . Indeed, define on Zd to be the mapping x 7 x 1. Then is

a group homomorphism. (Proof: (x + y) = (x + y) 1 = x 1 + y 1 = (x) + (y) for all x, y Zd .)

Also, for all x Zd ,

(x)

= (x

1) = (x,

1) = (x, 1) = x1 mod d = x.

That is,

= 1Zd . Next consider the action of on generators of Zm Zn : for x Zm , y Zn ,

(x

y) = (x, y) = (xy mod d) = xy mod d 1 = x mod d y mod d = x y.

(4)

(

n

X

xi yi ) =

n

X

xi yi .

i=1

i=1

t

u

40

2.11

2.11

2008 November

RING THEORY

2008 November

1. List the ideals of the rings:

a. Z/12Z

b. M2 (R) (the ring of 2 2 real matrices)

c. Z/12Z M2 (R).

Solution: a. An ideal is, in particular, a subgroup of the additive group. Since hZ12 ; +, 0i is cyclic, all subgroups

are cyclic. Thus, the subgroups of hZ12 ; +, 0i are as follows:

(0) = {0}

(1) = {0, 1, . . . , 11}

(2) = {0, 2, 4, 6, 8, 10}

(3) = {0, 3, 6, 9}

(4) = {0, 4, 8}

(6) = {0, 6}

Of course, 5, 7, and 11 are relatively prime to 12, so (1) = (5) = (7) = (11) = Z12 . The remaining generators,

8, 4, and 9, are also redundant: (8) = (4), (9) = (3), and (10) = (2). It is easy to verify that each of the 6

distinct subgroups listed above call them {Gi : 1 6 i 6 6} have the property that, if r Z12 and a Gi ,

then ra Gi . Thus, each Gi , 1 6 i 6 6, is an ideal of Z12 .

(Remark: This also shows Z12 is a PID, hence the proper prime ideals are the maximal ideals, (2) and (3).)

b. By the following lemma, since R is a field (and thus has no non-trivial proper ideals), the only ideals of M2 (R)

are M2 (0) and M2 (R).

Lemma 2.2 Let R be a commutative ring with 1R 6= 0. Then the ideals of M2 (R) are precisely the subsets

M2 (J) M2 (R), where J is an ideal of R.

Proof: Suppose J is an ideal and A1 , A2 M2 (J). Then A1 A2 has all elements in J, since J is, in particular, a

subgroup.P

Therefore M2 (J) is a subgroup of hM2 (R); +, 0i. If M = (mij ) M2 (R) and A = (aij ) M2 (J), then

M A = ( 2k=1 mik akj ). Clearly, all the elements of M A are in J, since J is an ideal and aij J. Similarly, all the

elements of AM are in J. This proves that M2 (J) is an ideal of M2 (R) whenever J is an ideal of R.

Now, let I M2 (R) be an ideal of M2 (R), and let J be the set of all a R such that a is an element of some A I .

Clearly 0 J, since A I implies 0 = A A I . Let a, b J. Suppose a is the ij th entry of A

I and

b is the

a 0

th

th

kl entry of B I . Let Mij be a matrix with 1 in the ij position and 0 elsewhere. Then M1i AMj1 =

I

0 0

b 0

ab 0

and M1k BMl1 =

I . Therefore,

I , so a b J, whence, J is a subgroup. Fix r R. Then

0 0

0

0

r 0

a 0

ra 0

=

I , so ra J, and J is an ideal.

0 0

0 0

0 0

c. By the following lemma, and parts a. and b., the ideals of Z/12Z M2 (R) are all sets of the form I J, where

I {(0), (1), (2), (3), (4), (6)} and J {M2 (0), M2 (R)}.

Lemma 2.3 Let R and R0 rings. Then the ideals of R R0 have the form I J, where I is an ideal of R and

J is an ideal of R0 .

41

2.11

2008 November

RING THEORY

Proof: Let A R R0 be an ideal. I will show (i) A = A1 A2 , for some A1 R and A2 R0 , and (ii) A1 and A2

are ideals of R and R0 , respectively.

(i) Define

A1 = {a R : (a, a0 ) A for some a0 R0 } and

That is, A1 (resp. A2 ) is the set of all first (resp. second) coordinates of elements in A. I claim that A = A1 A2 .25 Fix

a A1 and b0 A2 . We show (a, b0 ) A. Since a A1 , there is some a0 A2 such that (a, a0 ) A. Similarly,

(b, b0 ) A, for some b A1 . Since A is an ideal, (1, 0) (a, a0 ) = (a, 0) A, and (0, 1) (b, b0 ) = (0, b0 ) A. Therefore,

(a, 0) + (0, b0 ) = (a, b0 ) A, as claimed. This proves A1 A2 A. The reverse inclusion is obvious.

(ii) Fix a, b A1 . Then, there exist a0 , b0 A2 such that (a, a0 ) A and (b, b0 ) A. Now, since A is, in particular, a

subgroup of the additive group of R R0 , we have (a, a0 ) (b, b0 ) = (a b, a0 b0 ) A. Therefore, a b A1 , so

A1 is a subgroup of hR, +, 0i. Fix r R. Then (ra, a0 ) = (ra, 1a0 ) = (r, 1) (a, a0 ) A, since A is an ideal of R R0 .

Therefore, ra A1 , which proves that A1 is an ideal of R. The same argument, mutatis mutandis, proves that A2 is an

ideal of R0 . This completes the proof of (ii) and establishes the lemma.

u

t

3. Let R be a commutative ring and let A, B, and C be R-modules with A a submodule of B. Which (if any) of the

following conditions guarantee that the natural map A R C B R C is injective?

(a) C is free,

(b) C is projective.

Solution: I will prove a slightly more general result (as the increased generality comes at no additional cost).

That is, if : A B is an R-module monomorphism, then, under conditions (a) or (b), the natural map 1C :

A R C B R C in injective. (To answer the question above, take to be the inclusion map.)

We begin with the simplest case, where C = R.

Claim 1: If : A B is an R-module monomorphism, then the natural map 1R : A R R B R R is

injective.

Proof 1: Define A : A R R

= A by A (a r) = ar, and B : B R R

= B by B (b r) = br. (See

lemma 2.5 below for proof that these are, indeed, isomorphisms.) I claim that the following diagram of R-module

homomorphisms is commutative:

A R R A A

1R y

y

B R R B B

Fix a A and r R. By definition, ( 1R )(a r) = (a) 1R (r). Therefore, (B ( 1R ))(a r) =

B ((a) r) = (a)r. Following the diagram in the other direction, ( A )(a r) = (ar) = (a)r, since is

an R-module homomorphism. Therefore, (B ( 1R ))(a r) = ( A )(a r). Since a A and r R were

chosen arbitrarily, B ( 1R ) and A agree on generators, so the diagram is commutative.

Now A is an isomorphism, so A and are both injective. Therefore, by lemma 2.7 (below), A is injective.

Then, by commutativity of the diagram, B ( 1R ) is injective. Finally, lemma 2.9 implies that 1R is

injective, which proves claim 1.

25 Although this may seem trivial, and to some extent it is trivial, there is something to verify here, since we could have (a, a0 ) A, (b, b0 ) A,

so that (a, b0 ) A1 A2 , and yet (a, b0 )

/ A. That is, in general, A need not be equal to the product of all first and second coordinates of

elements of A. (Consider, for example, the diagonal {(0, 0), (1, 1), (2, 2)}, which cannot be written as A1 A2 .)

42

2.11

2008 November

RING THEORY

P

P

Next, letP

C be a free R-module. Then C

= iI R, for some index set I. For ease of notation, in the sequel,

denotes iI .

P

P

Claim 2: If : A B is an R-module monomorphism, then the natural map 1P R : AR R B R R

is injective.

P

P

P

Proof 2: Define :

A

B by ({ai }) = {(a

A. Then is an R-module

i )} for each {ai }

P

monomorphism. This is seen as follows: ({ai }, {a0i } A) (r R)

({ai } + {a0i }) = ({ai + a0i }) = {(ai + a0i )} = {(ai ) + (a0i )} = {(ai )} + {(a0i )} = ({ai }) + ({a0i }),

and (r{ai }) = ({rai }) = {(rai )} = {r(ai )} = r{(ai )} = r({ai }).

P

If

B, then {(ai )} = 0, which implies (ai ) = 0 for all i I, and therefore, {ai } = 0

P({ai }) = {0}

A. Thus, is a monomorphism.

P

P

= {ai 1R } is an isomorphism.

By (the proof of) lemma 2.5, the map : A (A P

R R) given by ({ai })P

By (the proof of) lemma 2.6, there is an isomorphism : (A R R) A R R, defined on generators by

(a r, 0, . . . ) = a (r, 0, . . . ),

= (a1 r1 , 0, . . . ) + (0, a2 r2 , 0, . . . ) +

= a1 (r1 , 0, . . . ) + a2 (0, r2 , 0, . . . ) + .

(The sum has finitely many non-zero terms, since {ai } is non-zero for finitely many indices i I.)

Consider the following diagram of R-module homomorphisms:

P

P

A

(A R R) A R R

1P

(5)

R

y

y

P

P

P

B

(B R R) B R R

P

P

where

and are the same maps as their bar-less counterparts, but

Pdefined on 26 B and (B R R), respectively.

I claim that diagram (5) is commutative. Indeed, for any {ai } A, we have

P

= a1 (1R , 0, . . . ) + a2 (0, 1R , 0, . . . ) + .

(

1P

R)

= ( 1P R )(a1 (1R , 0, . . . )) + ( 1P R )(a2 (0, 1R , 0, . . . )) +

= (a1 ) (1R , 0, . . . ) + (a2 ) (0, 1R , 0, . . . ) + .

({ai }) =

({(ai )}) = {(ai ) 1R }, so

({ai }) = ({(ai ) 1R }) = (((a1 ) 1R , 0, . . . ) + (0, (a2 ) 1R , 0, . . . ) + )

= (a1 ) (1R , 0, . . . ) + (a2 ) (0, 1R , 0, . . . ) + ,

26 Again, the sums have finitely many non-zero terms, since {a } is non-zero for finitely many indices i I. The same comment applies to the

i

sums in the following two sets of equations.

43

2.11

2008 November

RING THEORY

and ( 1P R ) agree on generators. Therefore, diagram (5) is commutative.

Now,

and are R-module isomorphisms, and is an R-module monomorphism. Therefore, by lemma 2.7

below,

is an R-module monomorphism, so commutativity of (5) implies that 1P R is also an Rmodule monomorphism. Finally, since and are isomorphisms, so is . Whence, 1P R is injective, by

lemma 2.8. This which proves claim 2 and completes part (a) of the problem.

Claim 3: If C is a projective R-module and : A B is an R-module monomorphism, then the natural map

1C : A R C B R C is injective.

Proof 3: Since C is projective, there exists a free R-module F and a (projective) R-module D such that F = C D

(lemma 2.4). Therefore,

A R F = A R (C D)

= (A R C) (A R D) and B R F = B R (C D)

= (B R C) (B R D),

where the isomorphisms are given by lemma 2.6.

By claim 2 above, the natural map 1F : A R F B R F is injective. Consider the diagram

A R C 1 (A R C) (A R D) A R (C D)

1

1C y

F

y

(6)

B R C 1 (B R C) (B R D) B R (C D)

By (the proof of) lemma 2.6 the map : (A R C) (A R D) A R (C D) given by (a1 c, a2 d) =

a1 (c, 0) + a2 (0, d) is an R-module isomorphism. Given a c A R C, then,

( 1F ) 1 (a c) = ( 1F ) (a c, 0) = ( 1F )(a (c, 0)) = (a) (c, 0).

Similarly, there exists : (B R C)(B R D)

= B R (C D), with (b1 c, b2 d) = b1 (c, 0)+b2 (0, d),

and

1 ( 1C )(a c) = 1 ((a) c) = ((a) c, 0) = (a) (c, 0).

Therefore, ( 1F ) 1 and 1 ( 1C ) agree on generators of A R C, so diagram (6) is commutative.

By lemma 2.7, ( 1F ) 1 is injective, so, by commutativity, 1 ( 1C ) is injective. It now follows from

lemma 2.9 that 1C is injective, which completes the proof of claim 3 and part (b) of the problem.

t

u

The following six lemmas are used in the answer to problem 3 given above. The first is a standard theorem about

projective modules, the proof of which is not hard, and can be found, e.g., in Hungerford. The next two lemmas

(2.5 and 2.6) are also standard, but I havent seen them proved in detail elsewhere and, as the solution given above

makes repeated use of the maps defined in proving these lemmas, I include detailed proofs below. The last three

lemmas are trivial verifications.

Lemma 2.4 Let R be a ring. The following conditions on an R-module P are equivalent:

(i) P is projective;

f

g

(ii) every short exact sequence of R-modules 0 A

B

P 0 is split exact (hence B

= A P );

= A.

44

2.11

2008 November

RING THEORY

Proof: Define : A R A by (a, r) = ar. Since is clearly bilinear, there exists a unique R-module homomorphism

: A R R A such that

= , where : A R A R R is the canonical bilinear map. Define : A A R R by

(a) = a 1R . Then it is easy to verify that is an R-module homomorphism and that

(a

r) = (ar) = ar 1R = a r

(a A)(r R).

Therefore,

is the identity on generators of A R R. Also, (a)

= (a

1R ) = a1R = a, so

= 1A . Therefore,

: A R R

u

t

= A.

Lemma 2.6 Let R be a commutative ring with 1R and let A, B, C be unitary R-modules. Then A R (B C)

=

(A R B) (A R C).

Proof: Recall that if 1 : A1 D and 2 : A2 D are (group) homomorphisms, then there is a unique homomorphism

: A1 A2 D such that i = i (i = 1, 2), where i : Ai A1 A2 are the canonical injections. In other words,

! Hom(A1 A2 , D) such that the following diagram is commutative:

1

A1 I

I

/ A1 A2 o

u

II

uu

II

uu2

u

1 II

I$ zuuu

A2

We can apply this theorem to the Abelian group (A R B) (A R C). Let 1 : A B A R (B C) be given by

1 (a, b) = a (b, 0), and let 2 : A C A R (B C) be given by 2 (a, c) = a (0, c). It is easily verified that i are

bilinear and thus induce R-module homomorphisms 1 : A R B A R (B C) and 2 : A R C A R (B C)

such that i i = i , where 1 : A B A R B and 2 : A C A R C are the canonical bilinear maps. Therefore,

the two universal properties combine to give a unique homomorphism : (A R B) (A R C) A R (B C) such that

the following diagram is commutative:

1

/ (A R B) (A R C) o

A R C

QQQ

mm O

m

QQQ

m

QQQ

mmm

1

2

QQQ

mmm2

1

vmmm

(

/ A R (B C) o

AB

AB

1

2

A O R BQ

Now, for all a A and b B, 1 (a b) = (a b, 0) and 1 (a b) = 1 1 (a, b) = 1 (a, b) = a (b, 0), so,

(a b, 0) = a (b, 0). Similarly, (0, a c) = a (0, c), for all a A and c C. Therefore,

(a b, a0 c) = (a b, 0) + (0, a0 c) = a (b, 0) + a0 (0, c)

(a, a0 A, b B, c C).

unique : A R (B C) (B C) (A R B) (A R C) such that = where : A (B C) A R (B C)

is canonical. To complete the proof, we check that and given the appropriate identity maps:

(a b, 0) = (a (b, 0)) = (a b, a 0) = (a b, 0), and

(0, a c) = (a (0, c)) = (a 0, a c) = (0, a c).

Thus, is the identity on generators of (A R B) (A R C), so = 1(AR B)(AR C) . Finally,

(a (b, c)) = (a b, a c) = ((a b, 0) + (0, a c)) = a (b, 0) + a (0, c) = a (b, c).

Thus is the identity on generators of A R (B C), so = 1AR (BC) . This proves that : (A R B) (A R C)

=

A R (B C).

u

t

Lemma 2.7 If h HomR (A, B), g HomR (B, C), and f HomR (C, D) are injective, then f gh HomR (A, D)

is injective.

45

2.11

2008 November

RING THEORY

Proof: f gh(a) = 0 gh(a) = 0 (since f is injective) h(a) = 0 (since g is injective) a = 0 (since h is injective).

u

t

Lemma 2.8 If g HomR (A, B), f HomR (B, C), if g is surjective, and if f g is injective, then f is injective.

Proof: Suppose f (b) = 0. Since g is surjective, there is an a A such that g(a) = b. Then f g(a) = f (b) = 0, which implies

a = 0, since f g is injective. Therefore, b = g(a) = g(0) = 0 since g is a homomorphism.

u

t

Lemma 2.9 If g HomR (A, B), f HomR (B, C), and if f g is injective, then g is injective.

Proof: ker g = {a A : g(a) = 0} {a A : f g(a) = 0} = ker f g = {0}. The set containment holds since f is a

homomorphism, so f (0) = 0.

u

t

46

A PPENDIX

A

A.1

Algebras

An algebra27 (or universal algebra) A is an ordered pair A = hA, F i where A is a nonempty set and F is a family of

finitary operations on A. The set A is called the universe of A, and the elements f A F are called the fundamental

operations of A. (In practice we prefer to write f for f A when this doesnt cause ambiguity.28 ) The arity of an

operation is the number of operands upon which it acts, and we say that f F is an n-ary operation on A if f maps

An into A. An operation f F is called a nullary operation (or constant) if its arity is zero. Unary, binary, and

ternary operations have arity 1, 2, and 3, respectively. An algebra A is called unary if all of its operations are unary.

An algebra A is finite if |A| is finite and trivial if |A| = 1. Given two algebras A and B, we say that B is a reduct of

A if both algebras have the same universe and A can be obtained from B by simply adding more operations.

Examples

groupoid A = hA, i

An algebra with a single binary operation is called a groupoid. This operation is usually denoted by + or , and

we write a + b or a b (or just ab) for the image of ha, bi under this operation, and call it the sum or product of

a and b, respectively.

semigroup A = hA, i

A groupoid for which the binary operation is associative is called a semigroup. That is, a semigroup is a groupoid

with binary operation satisfying (a b) c = a (b c), for all a, b, c A.

monoid A = hA, , ei

A monoid is a semigroup along with a multiplicative identity e. That is, hA, i is a semigroup and e is a constant

(nullary operation) satisfying e a = a e = a, for all a A.

group A = hA, ,1 , ei

A group is a monoid along with a unary operation 1 called multiplicative inverse. That is, the reduct hA, , ei is

a monoid and 1 satisfies a a1 = a1 a = e, for all a A. An Abelian group is a group with a commutative

binary operation, which we usually denote by + instead of . In this case, we write 0 instead of e to denote

the additive identity, and instead of 1 to denote the additive inverse. Thus, an Abelian group is a group

A = hA, +, , 0i such that a + b = b + a for all a, b A.

ring A = hA, +, , , 0i

A ring is an algebra A = hA, +, , , 0i such that

R1. hA, +, , 0i is an Abelian group,

R2. hA, i is a semigroup, and

R3. for all a, b, c A, a (b + c) = a b + a c and (a + b) c = a c + b c.

A ring with unity (or unital ring) is an algebra A = hA, +, , , 0, 1i, where the reduct hA, +, , , 0i is a ring,

and where 1 is a multiplicative identity; i.e. a 1 = 1 a = a, for all a A.

27 N.B. In this first paragraph, not all of the definitions are entirely precise. Rather, my goal here is to state them in a way that seems intuitive and

heuristically useful.

28 This convention creates an ambiguity when discussing, for example, homomorphisms from one algebra, A, to another, B; in such cases we

will adhere to the more precise notation f A and f B , for operations on A and B, respectively.

47

A.2

field If A = hA, +, , , 0, 1i is a ring with unity, an element r A is called a unit if it has a multiplicative inverse.

That is, r A is a unit provided there exists r1 A with r r1 = r1 r = 1. A division ring is a ring in

which every non-zero element is a unit, and a field is a division ring in which multiplication is commutative.

module Let R = hR, +, , , 0, 1i be a ring with unit. An R-module (sometimes called a left unitary R-module) is

an algebra M = hM, +, , 0, fr irR with an Abelian group reduct hM, +, , 0i, and with unary operations

(fr )rR which satisfy the following four conditions for all r, s R and x, y M :

M1. fr (x + y) = fr (x) + fr (y)

M2. fr+s (x) = fr (x) + fs (x)

M3. fr (fs (x)) = frs (x)

M4. f1 (x) = x.

If the ring R happens to be a field, an R-module is typically called a vector space over R.

Note that condition M1 says that each fr is an endomorphism of the Abelian group hM, +, , 0i. Conditions

M2M4 say: (1) the collection of endomorphisms (fr )rR is itself a ring with unit, where the function composition described in (M3) is the binary multiplication operation, and (2) the map r 7 fr is a ring epimorphism

from R onto (fr )rR .

Part of the importance of modules lies in the fact that every ring is, up to isomorphism, a ring of endomorphisms

of some Abelian group. This fact is analogous to the more familiar theorem of Cayley stating that every group

is isomorphic to a group of permutations of some set.

bilinear algebra Let F = hF, +, , , 0, 1i be a field. An algebra A = hA, +, , , 0, fr irF is a bilinear algebra over F

provided hA, +, , 0, fr irF is a vector space over F and for all a, b, c A and all r F ,

(a + b) c = (a c) + (b c)

c (a + b) = (c a) + (c b)

a fr (b) = fr (a b) = fr (a) b

If, in addition, (a b) c = a (b c) for all a, b, c A, then A is called an associative algebra over F. Thus an

associative algebra over a field has both a vector space reduct and a ring reduct. An example of an associative

algebra is the space of linear transformations (endomorphisms) of any vector space into itself.

A.2

diagonal relation on A is the set A = {ha, ai : a A} and the all relation is the set A = A2 . (We write and

when the underlying set is apparent.)

equivalence A binary relation on a set A is an equivalence relation on A if, for any a, b, c A, it satisfies:

E1. ha, ai ,

E2. ha, bi implies hb, ai , and

E3. ha, bi and hb, ci imply ha, ci .

We denote the set of all equivalence relations on A by Eq(A).

If Eq(A) is an equivalence relation on A and hx, yi , we say that x and y are equivalent modulo . The

set of all y A that are equivalent to x modulo is denoted by x/ = {y A : hx, yi } and we call x/

48

A.2

the equivalence class (or coset) of x modulo . The set {x/ : x A} of all equivalence classes of S

A modulo

is denote by A/. Clearly equivalence classes form a partion of A, which simply means that A = xA x/

and x/ y/ = if x/ 6= y/.

To be continued...

49

A.3

A.3

We begin by collecting some facts that are very useful for solving elementary problems in group theory. (Notation:

H 6 G means H is a subgroup of G.)

1. Aut(G) denotes the group of automorphisms of the group G. The set of inner automorphisms, denoted Inn(G),

is the (normal) subgroup of Aut(G) defined as follows: Inn(G) iff (g G) (x G) ((x) = gxg 1 ).

2. Let H 6 G and let A Aut(G) be a non-empty set of automorphisms of G. We say that H is an A-invariant

subgroup of G if h H for all h H and A. For instance, if A = 1 then, trivially, every subgroup of G

is A-invariant. In two important special cases we use special terms. If H is Aut(G)-invariant, H is said to be

characteristic in G. If H is Inn(G)-invariant, H is said to be normal in G.

The concept of normal subgroup dominates the whole of group theory, and a special notation is used. We write

H P G to mean H is a normal subgroup of G, and H R G to mean H is not a normal subgroup of G.

3. The normalizer of a subset S G is the set

NG (S) = {g G : g 1 Sg = S}.

In case S = {s} is a singleton, we write NG ({s}) = NG (s). Also, we occasionally denote NG (S) by N (S)

when the context makes clear which overgroup is intended. It is easy to verify that the normalizer is a subgroup

of G. In fact, when S is a subgroup of G, NG (S) is the largest subgroup of G in which S is normal. Thus,

S P NG (S) 6 G, and S P G iff NG (S) = G.

4. The centralizer of a subset S G is the set

CG (S) = {g G : g 1 sg = s for all s S}.

Here too, we write CG ({s}) = CG (s) when S = {s} is a singleton, in which case we also have CG (s) =

NG (s). Thus, it is clear from the definition that

\

\

CG (S) =

CG (s) =

NG (s).

sS

sS

Next note that, since S P NG (S), the group NG (S) acts on S by conjugation. The map : NG (S) Aut(S),

defined by (g)(s) = gsg 1 (s S; g NG (S)) is a group homomorphism with kernel

ker = {g NG (S) : g 1 sg = s for all s S}.

But notice that if g G satisfies g 1 sg = s for all s S, then certainly g NG (S). Therefore,

ker = {g NG (S) : g 1 sg = s for all s S} = {g G : g 1 sg = s for all s S} = CG (S).

Since kernels of homomorphisms are normal subgroups, we have prove CG (S) P NG (S).

5. A group G is called simple provided G has exactly two normal subgroups, namely G and (e) (the identity in G).

Clearly if G is simple, then any homomorphism on G is a monomorphism (since the kernel of a homomorphism

is a normal subgroup). A group G is called almost simple if G has a normal subgroup S P G which is

nonabelian, simple, and has trivial centralizer CG (S) = (e).

50

A.3

Next we review a number of very useful results, as presented in John Dixons wonderful little book [1].29

1.T.1. If H 6 K 6 G and if [G : H] is finite, then [G : K] is finite and [G : H] = [G : K][K : H].

1.T.2. If A, B 6 G and [G : B] is finite, then A B is a subgroup of finite index in A. In fact, [A : A B] 6 [G : B],

with equality iff G = AB.

In particular, if [G : A] is also finite, then [G : A B] 6 [G : A][G : B] with equality iff G = AB.

1.T.3. If S is a subset of a group G, then the number of conjugates, x1 Sx (x G), of S in G is equal to [G : NG (S)]

In the case that S consists of a single element s, then NG (S) = CG (s), and s has [G : C(s; G)] conjugates in

G.

29 As Dixon notes, the proofs of 1.T.13 can be found in Hall (Sec. 1.56, 2.13); Kurosh (Ch. 3); Rotman (Ch. 2); Schenkman (Sec. 1.13); and

Scott (Sec. 1.67, 2.23, 3.13).

51

A.4

A.4

Direct Products

Direct Products

infinite) family of groups

{Gi | i I}, define

Q

Q

S a binary operation on the Cartesian

product (of sets)

Gi as follows: If f, g

Gi (that is, f, g : I

Gi and f (i), g(i) Gi for each i),

iI

iI

SiI

then f g : I

Gi is the function given by i 7 f (i)g(i). Since each Gi is a group, f (i)g(i) Gi for every

iI

Q

Q

i, whence f g

Gi . It is easy to verify that

Gi together with this binary operation is a group, called the

iI

iI

direct product (or complete direct sum) of the family of groups {Gi | i I}.

Qw

D.2. The (external) weak direct product of a family of groups {Gi | i I}, denoted

Gi , is the set of all

iI

Q

f

Gi such that f (i) = ei , the identity in Gi , for all but finitely many i I. If all Gi are (additive) abelian,

iI

Qw

P

then

Gi is usually called the (external) direct sum and is denoted iI Gi .

iI

If I is finite, the weak direct product coincides with the direct product.

Qw

Q

D.3. Theorem. If {Gi | i I} is a family of groups, then

Gi is a normal subgroup of

Gi and, for each

iI

iI

k I,

(i) the map k :

iI

Qw

iI

Gi .

iI

0 Gk k

Qw

Gi

P

iI

Gi k Gk 0

iI

D.4. Theorem. Let {Ni | i I} be a family of normal subgroups of a group G such that

S

(i) G = h i Ni i.

S

(ii) For each k I, Nk h i6=k Ni i = (e).

Qw

Then G = iI Ni .

D.5. The following special case arises frequently: if Ni P G for each 1 6 i 6 r, then hN1 N2 Nr i =

N1 N2 Nr = {n1 n2 nr | ni Ni }. In additive notation N1 N2 Nr is written N1 + N2 + + Nr .

D.6. Corollary. If Ni P G for each 1 6 i 6 r, if G = N1 N2 Nr , and if Nk (N1 Nk1 Nk+1 Nr ) = (e)

for each 1 6 k 6 r, then G

= N1 N2 Nr .

52

A.5

A.5

multiplicative A subset A of a ring (or groupoid) is called multiplicative iff it is closed under multiplication; i.e. x, y A

implies xy A.

prime ideal An ideal P in a ring R is prime iff P 6= R and, for any ideals A, B of R,

AB P

A P or B P.

(7)

Theorem A.1 If R is a commutative ring, then a proper ideal P ( R is prime if and only if, for all elements a, b R,

ab P

a P or b P.

(8)

If R is a general (non-commutative) ring, then condition (8) implies P is prime but not conversely.

Proof: See Hungerford [2], Theorem III.2.15.

Consider the forward implication of Theorem A.1 i.e. P prime implies condition (8). To see that this does not hold in

general for non-commutative rings, consider this simple counter-example: Let M2 (Z2 ) be the ring of 2 2 matrices

over Z2 = Z/2Z

(or over

any division ring, for that matter). Then the ideal P = (0), that is, the ideal generated by

0 0

the zero matrix

, is the only ideal of M2 (Z2 ) (this easily follows from Proposition A.1 below.) As the only

0 0

1 0

0 0

ideal, P trivially satisfies condition (7), so P is prime. However, if a =

and b =

, then ab P , but

0 0

0 1

a

/ P and b

/ P.

Corollary A.1 If P is a prime ideal of a commutative ring R, then

a1 a2 an P

(9)

Corollary A.2 In a commutative ring R, an ideal P ( R is prime if and only if the set R \ P is multiplicative.

Theorem A.2 If S is a multiplicative subset of a ring R which is disjoint from an ideal I of R, then there exists an

ideal P which is maximal in the set of all ideals R disjoint from S and containing I. Furthermore, any such ideal P is

prime.

Note: this theorem is frequently used in the case I = (0). (See, e.g., the April 2008 exam 2.10, Problem 2, part d.) To

prove the theorem, let I be the set of all ideals of R which are disjoint from the multiplicative subsetSS. Of course, I

is not empty since I I . If {I : } is a chain of ideas in I , it is not hard to show that J = {I : } is

an ideal, and that J must be disjoint from S. Therefore J I and Zorns lemma implies that I contains a maximal

ideal. The proof is completed by the following result, which is a useful general principal, so we state it separately as

Lemma A.1 Suppose R is a commutative ring, S R is a multiplicative subset, and P is an ideal of R which is

maximal with respect to the property P S = . Then P is a prime ideal.

Proof: Suppose a, b R \ P . We show that ab

/ P , which will prove that P is prime. Since P is maximal among all ideals with

the property P S = , we have

(P + Ra) S 6= 6= (P + Rb).

Therefore, p + ra = s for some p P , r R, and s S, and p0 + r0 b = s0 for some p0 P , r0 R, and s0 S. Now compute

ss0 = (p + ra)(p0 + r0 b) = pp0 + pr0 b + rap0 + rr0 ab.

The first three terms on the right are in P since P is an ideal, while the left-hand-side ss0 S, as S is multiplicative. Therefore,

rr0 ab cannot be in P , so ab

/ P.

u

t

53

A.6

A.6

We assume throughout this section that R is a commutative ring with identity e. First recall some basic definitions.

unit An element of R that has an inverse is called a unit. That is r R is a unit iff there is an a R with

ar = ra = e.

irreducible

prime A nonzero, nonunit element r in a commutative ring R is called

(i) irreducible provided that r = ab implies a or b is a unit

(ii) prime provided that r|ab implies r|a or r|b.

A.7

Rings of Polynomials

We review some basic facts about a the polynomial rings R[x] and R[x1 , . . . , xn ]. Most of the material in this section

has been shamelessly copied from Hungerford ([2], section III.6) sometimes word-for-word since, in my opinion,

Hungerfords presentation cannot be improved upon.

Let R be a ring. The degree of a nonzero monomial axk11 xk22 xknn R[xP

1 , . . . , xn ] is the nonnegative integer

m

k1 + k2 + + kn . If f is a nonzero polynomial in R[x1 , . . . , xn ], then f = i=0 ai xk1i1 xknin , and the (total)

degree of the polynomial f is the maximum of the degrees of the monomials ai xk1i1 xknin such that ai 6= 0

(i = 1, 2, . . . , m). The total degree of f is denoted deg f . Clearly a nonzero polynomial f has degree zero iff f is a

constant polynomial and f = a0 = a0 x01 x0n . Recall that, for each 1 6 k 6 n, R[x1 , . . . , xk1 , xk+1 , . . . , xn ] is a

subring of R[x1 , . . . , xn ]. The degree of f in xk is the degree of f considered as a polynomial in one indeterminate

xk over the ring R[x1 , . . . , xk1 , xk+1 , . . . , xn ].

Theorem A.3

(iii) If R has no zero divisors, deg(f g) = deg f + deg g.

(iv) If n = 1 and the leading coefficient of f or g is not a zero divisor in R (in particular, if it is a unit), then

deg(f g) = deg f + deg g.

This theorem is also true if deg f is taken to mean degree of f in xk .

It is easy to verify that R[x] is commutative (resp. an integral domain) whenever the same is true of R.

If F is a field, then F [x] is a Euclidean domain, hence a PID and a UFD, and the set of units of F [x] is precisely

the set of nonzero constant polynomials, which can be identified with the set F = F \ {0}. ([2] Theorem 6.14)

If D is a UFD, we have the following important facts about the units and irreducible elements of D[x] ([2], p. 162):

(i) The units in D[x] are precisely the constant polynomials that are units in D.

(ii) If c is an irreducible element of D, then the constant polynomial c is irreducible in D[x] [use Thm A.3 and (i)].

(iii) Every first degree polynomial whose leading coefficient is a unit in D is irreducible in D[x]. In particular, every

first degree polynomial over a field is irreducible.

(iv) Suppose D is a subring of an integral domain E and f D[x] E[x]. Then f may be irreducible in E[x] but

not in D[x] and vice versa, as is seen in the following examples.

54

A.8

Nakayamas Lemma

Examples. 2x + 2 is irreducible in Q[x] by (iii) above. However, 2x + 2 = 2(x + 1) and neither 2 nor x + 1 is a unit

in Z[x] by (i), whence 2x + 2 is reducible in Z[x]. On the other hand x2 + 1 is irreducible in R[x] but factors in C[x]

as (x + i)(x i). By (i), neither x + i nor x i is a unit in C[x], so x2 + 1 is reducible in C[x].

If D is a UFD, then so is D[x1 , . . . , xn ]. ([2] Theorem 6.14) Since a field F is trivially a UFD, F [x1 , . . . , xn ] is a

UFD.

A.8

Nakayamas Lemma

Theorem A.4 (Nakayama) If J is an ideal in a commutative ring R with identity, 1R , then the following conditions

are equivalent.

(i) J is contained in every maximal ideal of R.

(ii) 1R j is a unit for every j J.

(iii) If A is a finitely generated R-module such that JA = A, then A = 0.

(iv) If B is a submodule of a finitely generated R-module A such that JA + B = A, then B = A.

Remark. As we will see in the next section, the lemma is true even when R is noncommutative, provided that (i) is

replaced with the condition that J is contained in the Jacobson radical of R.

Proof: ((i) (ii)) Suppose (i) holds and suppose 1R j is not a unit. Then (1R j) is a proper ideal, so (1R j) M for some

maximal ideal M ( R. Thus, 1R j M and J M , and we have j M so 1R j + j = 1R M . Of course, this implies

the contradiction M = R. Therefore, 1R j must be a unit. [(ii) (iii)] Suppose (ii) holds and let A be a finitely generated

R-module with JA = A. There is a minimal generating set for A, say, {a1 , . . . , an }. If A 6= 0, then a1 is not zero. Recall,

JA = {

m

X

ji xi | ji J, xi A, m N},

i=1

where each xi A is of the form xi = r1i a1 + + rni an , and upon rearranging terms, we see that ji xi = eachj

A.9

Here is a basic fact that is sometimes useful (e.g., in the counter-example after Theorem A.1 above). It is elementary

and probably appears as an exercise in some of the standard references, though I have not seen it elsewhere.30

Proposition A.1 Let R be a commutative ring with 1R 6= 0. Then the ideals of Mn (R) are precisely the subsets

Mn (J) Mn (R), where J is an ideal of R.

Proof: We prove it for the case n = 2. The proof in the general case should be almost identical. Suppose J is an ideal and

A1 , A2 M2 (J). Then A1 A2 has all elements in J, since J is, in particular, a subgroup.

Therefore M2 (J) is a subgroup of

P

hM2 (R); +, 0i. If M = (mij ) M2 (R) and A = (aij ) M2 (J), then M A = ( 2k=1 mik akj ). Clearly, all the elements of

M A are in J, since J is an ideal and aij J. Similarly, all the elements of AM are in J. This proves that M2 (J) is an ideal of

M2 (R) whenever J is an ideal of R.

Now, let I M2 (R) be an ideal of M2 (R), and let J be the set of all a R such that a is an element of some A I .

Clearly 0 J, since A I implies 0 = A A I . Let a, b J. Suppose a is the ij th entry of A

I andb is the

a 0

th

th

kl entry of B I . Let Mij be a matrix with 1 in the ij position and 0 elsewhere. Then M1i AMj1 =

I

0 0

b 0

ab 0

and M1k BMl1 =

I . Therefore,

I , so a b J, whence, J is a subgroup. Fix r R. Then

0 0

0

0

r 0

a 0

ra 0

=

I , so ra J, and J is an ideal.

u

t

0 0

0 0

0 0

30 I

have since found a nice, short proof of this result in Lams book [5].

55

A.9

Proposition A.2 Let R and R0 rings. Then the ideals of R R0 have the form I J, where I is an ideal of R and J

is an ideal of R0 .

Proof: Let A R R0 be an ideal. I will show (i) A = A1 A2 , for some A1 R and A2 R0 , and (ii) A1 and A2 are ideals

of R and R0 , respectively.

(i) Define

A1 = {a R : (a, a0 ) A for some a0 R0 } and

That is, A1 (resp. A2 ) is the set of all first (resp. second) coordinates of elements in A. I claim that A = A1 A2 .31 Fix a A1

and b0 A2 . We show (a, b0 ) A. Since a A1 , there is some a0 A2 such that (a, a0 ) A. Similarly, (b, b0 ) A, for some

b A1 . Since A is an ideal, (1, 0)(a, a0 ) = (a, 0) A, and (0, 1)(b, b0 ) = (0, b0 ) A. Therefore, (a, 0)+(0, b0 ) = (a, b0 ) A,

as claimed. This proves A1 A2 A. The reverse inclusion is obvious.

(ii) Fix a, b A1 . Then, there exist a0 , b0 A2 such that (a, a0 ) A and (b, b0 ) A. Now, since A is, in particular, a

subgroup of the additive group of R R0 , we have (a, a0 ) (b, b0 ) = (a b, a0 b0 ) A. Therefore, a b A1 , so A1 is a

subgroup of hR, +, 0i. Fix r R. Then (ra, a0 ) = (ra, 1a0 ) = (r, 1) (a, a0 ) A, since A is an ideal of R R0 . Therefore,

ra A1 , which proves that A1 is an ideal of R. The same argument, mutatis mutandis, proves that A2 is an ideal of R0 . This

completes the proof of (ii) and establishes the proposition.

u

t

Example:32 The ideals of Z/12Z M2 (R) are all sets of the form I J, where I {(0), (1), (2), (3), (4), (6)} and

J {M2 (0), M2 (R)}.

The following is a nice proof of a standard problem that I learned from the book by Lam [5].

Proposition A.3 Let R be a ring with identity 1. If a and b are nonzero elements in R, then 1 ab is invertible if and

only if 1 ba is invertible.

Proof: It is clear by symmetry that we need only prove one direction. Suppose 1 ab is invertible. The ideal R(1 ba) contains

Ra(1 ba) = R(1 ab)a = Ra and, therefore, contains 1 ba + ba = 1. Thus, R(1 ba) = R, which implies r(1 ba) = 1

for some r R.

A related linear algebra problem is to show that if A and B are square matrices, then AB and BA have the same

eigenvalues. This can be solved exactly as above, with one modification: replace 1 with I, where I is the identity

matrix of the same dimensions as A and B.

31 Although this may seem trivial, and to some extent it is trivial, there is something to verify here, since we could have (a, a0 ) A, (b, b0 ) A,

so that (a, b0 ) A1 A2 , and yet (a, b0 )

/ A. That is, in general, A need not be equal to the product of all first and second coordinates of

elements of A. (Consider, for example, the diagonal {(0, 0), (1, 1), (2, 2)}, which cannot be written as A1 A2 .)

32 This example appears in the first problem of the ring theory section of the November 2008 comprehensive exams.

56

REFERENCES

REFERENCES

References

[1] John Dixon. Problems in Group Theory. Dover, New York, 1974.

[2] Thomas W. Hungerford. Algebra. Springer-Verlag, New York, 1974.

[3] Nathan Jacobson. Basic Algebra I. W. H. Freeman and Co., New York, 1985.

[4] Friedrich Kasch and Adolf Mader. Rings, Modules, and the Total. Birkhauser, Basel, 2004.

[5] T. Y. Lam. A First Course in Noncommutative Rings. Springer-Verlag, New York, second edition, 2001.

[6] Harvey E. Rose. A Course on Finite Groups. Springer-Verlag, London, 2009.

57