Unique Factorization: Proving for Polynomials in x

[stoolie77]

Hello everybody. I had been reading up on Unique Factorization again and I came across an interesting question.

Can someone prove unique factorization for the set of polynomials in $x$, with integer coefficients?

From what I understand, the analogous Euclidean algorithm works for such polynomials using "degree" instead of "norm".

If someone could answer this, that would be great as it might clear up some of my other thoughts I have with Unique Factorization.

Gracias - Omar

 

[Brimley]

Can anyone post a solution to this? I would like to see this as well. --Brim

 

[ramsey2879]

Hello everybody. I had been reading up on Unique Factorization again and I came across an interesting question.

Can someone prove unique factorization for the set of polynomials in $x$, with integer coefficients?

From what I understand, the analogous Euclidean algorithm works for such polynomials using "degree" instead of "norm".

If someone could answer this, that would be great as it might clear up some of my other thoughts I have with Unique Factorization.

Gracias - Omar

see the book by Ireland and Rosen "A Classical Introduction to Modern Number Theory" 2nd edition pp 6-8

 

[Brimley]

I don't know exactly where to find page 7 and 8, but here is page 6. I still don't know how to relate it directly in terms that aren't advanced as this.

 

[mathwonk]

the fact that Z[X] is a ufd is due to gauss. this proof should appear in every abstract algebra book, e.g. in most of the free ones on my web page.

it is NOT a euclidean domain however. the crucial concept is tod efine the "content" o=f a polynomial as the gcd of the coefficients, then prove the content of a product is the product of the contents. then one can reduce the proof to the case of Q[X].

 

[Brimley]

the fact that Z[X] is a ufd is due to gauss. this proof should appear in every abstract algebra book, e.g. in most of the free ones on my web page.

it is NOT a euclidean domain however. the crucial concept is tod efine the "content" o=f a polynomial as the gcd of the coefficients, then prove the content of a product is the product of the contents. then one can reduce the proof to the case of Q[X].

Hello Roy, I reviewed your webpage although I didn't find any free sources that gave a lot of insight on this, and I didn't entirely make sense of your response. I know that you were using Z[x] as a UFD, however I'm trying to prove unique factorization for the set of polynomials in $x$ with integer coefficients. You talk about defining the "content" of a polynomial as the GCD of its coefficients, then proving the content of a product is the product of its contents. I'm totally lost with what you're saying.

 

[mathwonk]

Z[x] is my notation for the ring of polynomials in one variable x with integer coefficients. The proof this is a ufd is what I thought you wanted. this is due to gauss, and is reduced down to the case of assuming that Q[x] is a ufd, where Q is the rational numbers.

let me give you specific refernces to my web page.

math 844.1, section 4, page 18. that Z[x] is a ufd is specifically proved in detail.

math 80006b,pages 19-24, more terse than above.

the last two sections on my math 4000 notes also discuss the ideas. In particular they discuss the fact that Q[x] is a principal ideal domain, hence also a unique factorization domain, using the concept of degree as euclidean norm. Moreover they prove that any element of Z[x] that factors in Q[x] already factors in Z[x], the main step to proving that Z[x] is a ufd, "Gauss lemma."so indeed this topic is discussed in most of the notes there.

 

[mathwonk]

If you use the idea you mentioned, you can prove that Q[x] is a ufd. Then the attached notes (extracted from my web page) allow you to deduce it for Z[x], as gauss did.