# Indeed essentially all the ideas and results from

This preview shows pages 49–51. Sign up to view the full content.

as well. Indeed, essentially all the ideas and results from Chapters 1 and 2 carry over almost immediately from Z to D . Recall that for a, b D , we write b | a if a = bc for some c D ; note that deg( a ) = deg( b ) + deg( c ). Also, recall that because of the cancellation law for an integral domain, if b | a and b 6 = 0, then the choice of c above is unique, and may be denoted a/b . The units D * of D are precisely the units K * of K ; i.e., the non-zero constants. We call two polynomials a, b D associates if a = bu for u K * . Clearly, any non-zero polynomial a is associate to a unique monic polynomial, called the monic associate of a . Note that a polynomial a is a unit if and only if it is associate to 1. Let us call a polynomial normalized if it is either zero or monic. We call a polynomial p irreducible if it is non-constant and all divisors of p are associate to 1 or p . Conversely, we call a polynomial n reducible if it is non-constant and is not irreducible. Equivalently, non-constant n is reducible if and only if there exist polynomials a, b D of degree strictly less that n such that n = ab . Clearly, if a and b are associate polynomials, then a is irreducible if and only if b is irreducible. The irreducible polynomials play a role similar to that of the prime numbers. Just as it is convenient to work with only positive prime numbers, it is also convenient to restrict attention to monic irreducible polynomials. Corresponding to Theorem 1.2, every non-zero polynomial can be expressed as a unit times a product of monic irreducibles in an essentially unique way: Theorem 6.1 Every non-zero polynomial n can be expressed as n = u · Y p p ν p ( n ) , where u is a unit, and the product is over all monic irreducible polynomials, with all but a finite number of the exponents zero. Moreover, the exponents and the unit are uniquely determined by n . To prove this theorem, we may assume that n is monic, since the non-monic case trivially reduces to the monic case. 44

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
The proof of the existence part of Theorem 6.1 is just as for Theorem 1.2. If n is 1 or a monic irreducible, we are done. Otherwise, there exist a, b D of degree strictly less than n such that n = ab , and again, we may assume that a and b are monic. We then apply an inductive argument with a and b . The proof of the uniqueness part of Theorem 6.1 is almost identical to that of Theorem 1.2. Analogous to Theorem 1.4, we have: Theorem 6.2 For any ideal I D , there exists a unique normalized polynomial d such that I = dD . Proof. We first prove the existence part of the theorem. If I = { 0 } , then d = 0 does the job, so let us assume that I 6 = { 0 } . Let d be a monic polynomial of minimal degree in I . We want to show that I = dD . We first show that I dD . To this end, let c be any element in I . It suffices to show that d | c . Using the Division with Remainder Property, write c = qd + r , where deg( r ) < deg( d ). Then by the closure properties of ideals, one sees that r = c - qd is also an element of I , and by the minimality of the choice of d , we must have r = 0. Thus, d | c .
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern