11.07.2015 Views

Abstract Algebra Theory and Applications - Computer Science ...

Abstract Algebra Theory and Applications - Computer Science ...

Abstract Algebra Theory and Applications - Computer Science ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

284 CHAPTER 16 INTEGRAL DOMAINSConsequently, either a <strong>and</strong> p are associates or a is a unit. Therefore, p isirreducible.Conversely, let p be irreducible. If 〈a〉 is an ideal in D such that 〈p〉 ⊂〈a〉 ⊂ D, then a | p. Since p is irreducible, either a must be a unit or a<strong>and</strong> p are associates. Therefore, either D = 〈a〉 or 〈p〉 = 〈a〉. Thus, 〈p〉 is amaximal ideal.□Corollary 16.9 Let D be a PID. If p is irreducible, then p is prime.Proof. Let p be irreducible <strong>and</strong> suppose that p | ab. Then 〈ab〉 ⊂ 〈p〉. ByCorollary 14.17, since 〈p〉 is a maximal ideal, 〈p〉 must also be a prime ideal.Thus, either a ∈ 〈p〉 or b ∈ 〈p〉. Hence, either p | a or p | b.□Lemma 16.10 Let D be a PID. Let I 1 , I 2 , . . . be a set of ideals such thatI 1 ⊂ I 2 ⊂ · · · . Then there exists an integer N such that I n = I N for alln ≥ N.Proof. We claim that I = ⋃ ∞i=1is an ideal of D. Certainly I is not empty,since I 1 ⊂ I <strong>and</strong> 0 ∈ I. If a, b ∈ I, then a ∈ I i <strong>and</strong> b ∈ I j for some i <strong>and</strong> jin N. Without loss of generality we can assume that i ≤ j. Hence, a <strong>and</strong> bare both in I j <strong>and</strong> so a − b is also in I j . Now let r ∈ D <strong>and</strong> a ∈ I. Again,we note that a ∈ I i for some positive integer i. Since I i is an ideal, ra ∈ I i<strong>and</strong> hence must be in I. Therefore, we have shown that I is an ideal in D.Since D is a principal ideal domain, there exists an element a ∈ D thatgenerates I. Since a is in I N for some N ∈ N, we know that I N = I = 〈a〉.Consequently, I n = I N for n ≥ N.□Any commutative ring satisfying the condition in Lemma 16.10 is saidto satisfy the ascending chain condition, or ACC. Such rings are calledNoetherian rings, after Emmy Noether.Theorem 16.11 Every PID is a UFD.Proof. Existence of a factorization. Let D be a PID <strong>and</strong> a be a nonzeroelement in D that is not a unit. If a is irreducible, then we are done. If not,then there exists a factorization a = a 1 b 1 , where neither a 1 nor b 1 is a unit.Hence, 〈a〉 ⊂ 〈a 1 〉. By Lemma 16.7, we know that 〈a〉 ̸= 〈a 1 〉; otherwise, a<strong>and</strong> a 1 would be associates <strong>and</strong> b 1 would be a unit, which would contradictour assumption. Now suppose that a 1 = a 2 b 2 , where neither a 2 nor b 2 is aunit. By the same argument as before, 〈a 1 〉 ⊂ 〈a 2 〉. We can continue withthis construction to obtain an ascending chain of ideals〈a〉 ⊂ 〈a 1 〉 ⊂ 〈a 2 〉 ⊂ · · · .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!