Professional Documents
Culture Documents
Homework 12 Solutions
Chapter 11 Section 11.1 Question: 16. Let a and b be relatively prime integers. Prove that there are integers m, n such that a m + b n 1 (modulo ab). Answer: Since a, b are relatively prime we have that ab a b with : ab a b such that (c) = (c mod a, c mod b) are is an isomorphism. (You should check that indeed is an isomorphism). Since
a
b j b 0 (mod a) and b j (1 b j ) 0 (mod a) . Since a and b are relatively prime, then b j has an inverse and (1 b j ) 0(mod a ) , i.e. there exist an integer n such that b n = 1(mod a ) . Similarly, there exist an integer m such that a m 1(mod b) . But (a m + b n ) = (a m ) + (b n ) = (b n mod a, b n mod b) = (0, 1) + (1, 0) = (1, 1). Since is an isomorphism, this means that a m + b n = 1(mod ab) .
Section 11.2 Question: 1. Prove the following. a.) The polynomial ring
Answer: a.) If [ x, y ] was a Euclidean domain then [ x, y ] would be a principal ideal domain. But if [ x, y ] is a PID then the maximal ideals are the principal ideals generated by irreducible elements. The polynomial x is irreducible, so (x) would be a maximal ideal. On the other hand, the ideal (x, y) is an ideal which is not all of [ x, y ] , since polynomials p ( x, y ) such that p(0, 0) 0 ( x, y ) . But clearly x ( x, y ) , thus, ( x) < ( x, y ) , contradicting the fact that (x) was maximal. Question: b) The ring
Page 2
Answer: b.) A similar argument with (2, x) [ x] and (2) and (x) (2, x) yields that not a PID. Question: 2. Prove that the following rings are Euclidean domains. f 2 . [ w], w = e 2 i / 3 b) a)
[ x] is
Answer: An integral domain , with a size function : {0} {0, 1, 2,} such that if a, b and a 0 then there exists elements q, r such that b = aq + r and either r ( ) = 0 or (r ) < (a) , is a Euclidean domain.
a) Let w = e 2 i / 3 =
1 3 +i 2 2 1 3 w2 = e 4 i / 3 = i = (1 + w) 2 2 w3 = 1 [ w] is an integral domain.
Thus, [ w] = {a + bw / a, b } . It is easy to check that Define a size function : [ w] {0, 1, 2,} by (a + bw) = a 2 + b 2 ab .
We must show that for any x, y [ w], y 0 q, r [ w] such that x = yq + r with (r ) < ( y ) or (r ) = 0. First it is easy to show that we can always write x has a multiple of y, i.e.: x = zy where z = z0 + z1w and z0 , z1 . 1 1 Write z0 = k + z0 where | z0 | and z1 = + z1 where | z1 | and k , . Let 2 2 q = k + w and r = x qy . Then clearly x = qy + r with q [ w] and r = x (k + w) y [ w] . Thus, it remains to show that (r ) < ( y ) which can be done by straightforward computation.
b)
2 = {a + b 2 / a, b } . It is easy to check that R is an integral domain. Again, given 2 elements k = a + b 2 , y = c + d 2 we can write Let R =
= y e0 + f 0 2 + y (r1 + r2 2 .
r
Page 3
Define :
2 {0, 1, 2,} by
(a + b 2) = a 2 + 2b 2
It is a tedious but straightforward calculation to verify that (r ) = 0 or (r ) < ( y ) where r = y (r1 + r2 2). Hence, 2 is a Euclidean domain.
Question: 3. Give an example showing that division with remainder need not be unique in a Euclidean domain. Answer: Let [i ] be the Euclidean domain with : [i ] {0, 1, 2,} given by (a + bi ) = a 2 + b 2
We can see that (2 + 3i ) = (2 + i ) (2 + i ) + (1 i ) and (2 + 3i ) = (2 + i ) (1 + i ) + 1 and |1| = 1 < 2 + 32 and 12 + 12 = 2 < 13 . Hence factorization need not be unique in an Euclidean domain.
2 2
Question: 6. Prove Proposition (2.8), that a domain R, which has existence of factorizations is a unique factorization domain if and only if every irreducible element is prime. Answer: Assume every irreducible element of R is prime. Let a = p1 pm = q1 qn be two factorizations of a. Since p1 is prime and p1 | q1 qn , then p1 divides some qi . Reorder the qi s so that qi = q1 . Since q1 is irreducible and p1 is not a unit, then p1 is an associate of q1 . So we have that p1 and q1 are associates. Proceed in the same manner for a = p2 pm = q2 qn to obtain that n = m and with a suitable ordering pi and qi are associates for i = 1, , n .
Suppose now that we have unique factorization domain. Let p be an irreducible that divides ab, that is q R such that pq = ab . If either a or b is a unit, then p divides the other one. Otherwise let a = a1 am and b = b1 bn be their factorizations and let q = q1 qk . Then ab = a1 amb1 bn = pq1 qk are 2 factorizations of ab. Hence p is an associate of one of the elements of {a1 , am , b1 , bn } . Thus p / a or p / b .
Page 4
[i ] .
(32 < 112 + 7 2 ) 12 + 12 < 32 12 < 12 + 12 0(0) = 0 [i ] . Note that 1, i are also gcd of 11 + 7i and 18 i.