MIDTERM 2 AN JIANG Problem 1.

Proof.

(Section 6.3.14)

For the group Gp , we have np 1 mod p and np | 3, thus np = 1. Then < a > is the only Sylow p-subgroup of Gp . Note every nonidentity element of Gp has order 3 or p. If | ab |= p then < ab >=< a >, ab < a >,i.e., ab = an+1 for some n Z+ ,i.e., b = an < a >, thus bp = 1 and then 3 | p, a contradiction. So | ab |= 3. Similarly, if | ab2 |= p then < ab2 >=< a > and ab2 < a >,i.e.,ab2 = am+1 for some m Z+ ,i.e., 2 b = am < a >, thus b2p = 1 and then 3 | 2p, so 3 | p, a contradiction. So | ab2 |= 3. Thus G is a subring of F (Gp ), so the surjective homomorphism from F (Gp ) to Gp is also surjective when restricted on G,i.e.,Gp is a homomorphic image of G. If G is a nite group, and suppose that | G |= n Z+ , we can always nd a prime p which is congruent to 1 mod 3 and n < 3p. This contradicts with the fact that Gp is a homomorphic image of G, thus| Gp | should be less or equal to | G | .

Problem 2.
Proof.

(Section 7.1.30)

(a)We compute (a1 , a2 , a3 , ...) = (0, a1 , a2 , a3 , ...) = (a1 , a2 , a3 , ...), (a1 , a2 , a3 , ...) = (a2 , a3 , ...) = (0, a2 , a3 , ...). So = Id( R) and = Id. (b)Let c (a1 , a2 , a3 , ...) = (c, a1 , a2 , a3 , ...) with any constant c, then c s are innitely many right inverses for . (c)Let (a1 , a2 , a3 , ...) = (a1 , 0, 0, ...). (a1 , a1 , a1 , ...), (a2 , a2 , a2 , ...) Z Z Z , 1 2 3 1 2 3 [(a1 , a1 , a1 , ...) + (a2 , a2 , a2 , ...)] = (a1 + a2 , a1 + a2 , a1 + a2 , ...) = a1 + a2 = (a1 , a1 , a1 , ...) + 1 2 3 1 2 3 1 1 2 2 3 3 1 1 1 2 3 (a2 , a2 , a2 , ...). Thus R. 1 2 3 Check (a1 , a2 , a3 , ...) = (a1 , 0, 0, ...) = (0, 0, 0, ...), (a1 , a2 , a3 , ...) = (a2 , a3 , ...) = (a2 , 0, 0, ...). So = 0 but = 0. (d)Assume that there is a nonzero element R such that = 0. Then (a1 , a2 , a3 , ...) = (a2 , a3 , ...) = (0, 0, 0, ...), (a2 , a2 , a2 , ...) Z Z Z . So = 0, a contradiction. Hence there is no nonzero element 1 2 3 R such that = 0.

Problem 3.
Proof.

Sec.7.3.21

Let IM be an ideal of Mn (R). Let J = {entries of matrices in IM }. If a, b J , then there are two matrices Aa , Ab IM , s.t.,a = apq of Aa and b = brs of Ab with Aa = (aij ) and Ab = (bij ). Then apq brs = c11 in E1p Aa Eq1 E1r Aa Es1 = (cij ) IM . So apq brs J i.e.,a b J . r R, rapq = dpq in Er Aa = (dpq ) IM where Er = (aij ) with aii = r for all i {1, ..., n} and aij = 0 for all i = j . Similarly ar = apq r = epq in Aa Er = (epq ) IM . So ra, ar J . In all, J is an ideal in R, i.e., every ideal of Mn (R) is equal to Mn (J) for some ideal J of R.

Problem 4.
Proof.

(Sec.7.3.34)

(a)I + J = {a + b | a I, b J}. a I , a = a + 0 I + J , thus I I + J . Similarly J I + J . So I + J is a nonempty set containing both I and J .

1

MIDTERM 2 AN JIANG

We prove that I + J is an ideal: a + b, i + j I + J , where a, i I and b, j J , (a + b) (i + j) = (a i) + (b j) I + J . On the other hand, r(a + b) = ra + rb I + J , and (a + b)r = ar + br I + J . Hence I + J is an ideal . Consider any H containing both I and J , a + b I + J , a I H, b J H . So a + b H , i.e., I + J H . I + J is the smallest ideal of R containing both I and J . (b)IJ = {all f inite sums elements of the f orm ij with i I and j J}, so IJ is a nonempty set(IJ (0)) Let N1 i1 jn and N2 i2 jn be two elements of IJ . WLOG, suppose that N1 N2 , then n=1 n n=1 n N1 N1 N2 N2 N1 2 1 1 1 1 2 n=1 in jn = n=N2 +1 in jn IJ . On the other hand, r n=1 (in in )jn + n=1 in jn = n=1 in jn N1 1 n=1 (rin )jn IJ , and N1 N1 ( n=1 i1 jn )r = n=1 i1 (jn r) IJ . So IJ is an ideal. n n It is easy to see N1 i1 jn I and N2 i2 jn J since ideals are closed under addition and n=1 n n=1 n multiplication by all the elements of R. Thus IJ I J . (c)Let R = Z, I = 6Z, J = 10Z,then IJ = 60 = 30Z =I J . (d)By part (2), we know that IJ I J . On the other hand, since I + J = R, there are a I , b J s.t., a + b = 1. x I J , x I and x J . x = x(a + b) = xa + xb IJ . I.e.,I J IJ . Thus I J = IJ .

Problem 5.
Proof.

(Section 7.3.35)

I(J + K) = {all f inite sums of elements of the f orm i(j + k) = ij + ik, i I, j J, k K}. IJ + IK = {a + b | a IJ, b IK}
N N n=1 in jn

I(J + K), suppose =

N n=1

+ in kn =
n=1

(in jn ) + (in kn ). Since

N n=1

(in jn ) IJ ,

(in kn ) IK , then IJ + IK .
N2 N1 1 n=1 in jn

IJ + IK , suppose =

+
n=1

i2 kn = n

max{N1 ,N2 } 1 (in jn n=1

+ i2 kn ) with i1 , i2 I, jn n n n

J kn K , where we let i1 = jn = 0 when N1 < n max{N1 , N2 } and i2 = kn = 0 when N2 < n n n max{N1 , N2 }. Thus I(J + K). In all, I(J + K) = IJ + IK . Similarly, for (I + J)K = {all f inite sums of elements of the f orm (i + j)k = ik + jk, i I, j J, k K}, and IK + JK = {a + b | a IK, b JK}, we have (I + J)K = IK + JK using the same

method. (b)Assume that J I . I (J + K), I and J + K = {j + k | j J, k K}. Let = j + k, j J I, k K . Since j + k = I then k I K , thus j + k J + (I K). On the other hand, J + (I K) = {j + h | j J I, h I and h K}. Let = j + h, j J I, h I and h K , then I and J + K , i.e., I (J + K). In all I (J + K) = J + (I K).

Problem 6.
Proof.

(Section 7.4.36)

Let S be the set of prime ideals in R. Then S is nonempty and is partially ordered by inverse inclusion ''. If C is a chain in S , dene J to be the intersection of all ideals in C :J = AS We show that J is a prime ideal: By our HW sec.7.3.18(b), we know J is an ideal. Since for any A S , then A = R and J = R. Because A is a prime ideal, at least one of a and b is an element of A. Thus at least one of a and b is an element of J . Hence J is a prime ideal. This proves that each chain has an

MIDTERM 2 AN JIANG

upper bound in S . By Zorn's Lemma S has a maximal element with respect to inverse inclusion, which is therefore a minimal element with respect to inclusion.

Problem 7.
Proof.

(Section 8.2.7)

(a)(bi )iI Zp , we have ij (bi mod pi ) = bi mod p, so we can let each bi {0, 1, ..., p 1}. It is easy to see that the map from (bi )iI to b0 + b1 p + b2 p2 + b3 p3 + ... is an isomophism. So every element of Zp can be written uniquely as an innite formal sum mentioned above. We describe the operation for this formal sum:
(a0 + a1 p + a2 p2 + a3 p3 + ...) + (b0 + b1 p + b2 p2 + b3 p3 + ...) = (a0 + b0 ) + (a1 + b1 )p + (a2 + b2 )p2 + ... (a0 + a1 p + a2 p2 + a3 p3 + ...)(b0 + b1 p + b2 p2 + b3 p3 + ...) = (a0 b0 ) + (a1 b1 )p + (a2 b2 )p2 + ... (b)If(a0 + a1 p + a2 p2 + a3 p3 + ...)(b0 + b1 p + b2 p2 + b3 p3 + ...) = (a0 b0 ) + (a1 b1 )p + (a2 b2 )p2 + ... = 0, then ai bi = 0 for all i I . Since Z is an integral domain, either ai or bi is zero. Thus Zp is an integral domain. a Z, we write it into p-decimal, that is a = a0 + a1 p + a2 p2 + a3 p3 + ..., which gives a bijection between Z and Zp .Thus Zp contains a copy of Z .

(c)

Problem 8.
Proof.

(Section 8.2.7)

completes our induction. r (c)Let D = R 0, then F = d | r R, d D. By the denition of Bezout Domain, (r, d) = (z) for some z R. By part (a), let r = az, d = bz and z = rx + dy for some x, y R. Then z = rx + dy = r azx + bzy , which implies 1 = ax + by , i.e.,(1) = (a, b). On the other hand, rb = abz = ad, so d = a . b

(a)"" If R is a Bezout Domain, then a, b R, (a, b) = (d) for some d R, which implies that a (d) and b (d) i.e., d | a and d | b, on the other hand, d (a, b) i.e., d = ax + by for some x, y R. If there is a d such that d | a, d | b then d | d = ax + by . Thus d is a g.c.d. of a and b, and d = ax + by for some x, y R. "" If a, b R, a, b have a g.c.d. d R and d = ax + by for some x, y R, then (d) (a, b). On the other hand, a (d), b (d) implies that (a, b) (d). Hence (a, b) = (d), i.e.,R is a Bezout Domain. (b)Let R be a Bezout Domain. We are going to prove that nite set A R(suppose A has n elements), (A) = (d) for some d R. We prove it by induction on n: If n = 1, we are done. If n = 2, this is the denition of Bezout Domain. Assume that the claim is true when n < k with k be an integer not less than 3, then for any a1 , a2 , ...ak R, we rst claim that (a1 , ..., ak1 , ak ) = (a1 , ..., ak2 , d), where (ak1 , ak ) = (d). By part (a), d | ak1 , d | ak which implies (a1 , ..., ak1 , ak ) (a1 , ..., ak2 , d) and d = ak1 x+ak y for some x, y R which implies (a1 , ..., ak1 , ak ) (a1 , ..., ak2 , d). This completes our subclaim. By our hypothesis, there is an element z R such that (a1 , ..., ak2 , d) = (z), this

Problem 9.
Proof.

(Section 8.3.11)

""This is given by Theorem 14. ""Let a be a nonzero element of the ideal I with a minimal number of irreducible factors. We prove that I = (a). If there is an element b I that is not in(a) then we are going to prove that the g.c.d. d of a and b has less irreducible factors than a. Suppose a = upe1 pe2 ...pen and b = vpf1 pf2 ...pfn are prime factorizations for a and b, where u and v n n 1 2 1 2 are units, the primes p1 , p2 , ..., pn are distinct and the exponents ei , fi 0. Since b (a), we claim that there is some i such that ei > fi , otherwise, if ei / fi for all i min(e1 ,f1 ) min(ei ,fi ) min(en ,fn ) min(e1 ,f1 ) min(en ,fn ) ...pfi ...pn {1, ..., n} then a | b. Then d = p1 ...pi ...pn = p1 has i less irreducible factors than a, a contradiction. Thus I = (a), R is a PID.