1

Prove that if $R$ is a UFD then $R[x]$ is also a UFD. I look at some proofs online but not able to understand much. Proof goes like this:

Let $R$ be a UFD and let $F$ denotes the field of fraction of $R$. The key to showing that $R[x]$ is a unique factorization domain is to compare factorizations in $R[x]$ with factorizations in the Euclidean domain $F[x]$. Call an element of $R[x]$ primitive if its coefficients are relatively prime. Any element $g(x) ∈ R[x]$ can be written as $$g(x) = dg_1(x),$$where $d ∈ R$ and $g(x)$ is primitive. Moreover, this decomposition is unique up to units of $R$. After this I am not able to understand and I am not able to understand the bold written text.

Reference : http://homepage.math.uiowa.edu/~goodman/22m121.dir/2005/section6.6.pdf

user26857
  • 52,094
  • 2
    An algebra proof needs to be formal, intuitive or not. I think the standard proof cannot be improved (see the answer here, or any textbook on abstract algebra). It becomes intuitive by exercising this over and over again. – Dietrich Burde Feb 17 '17 at 16:18
  • I look in the book Abstract Algebra by Dummit and foote, but not able to understand much. –  Feb 17 '17 at 16:41

1 Answers1

7

If $K$ is the field of fractions of $R$, then $K[x]$ is a UFD because it is Euclidean hence a PID.

So, every polynomial in $R[x]$ has a unique factorization in $K[x]$.

The crucial point is that this factorization is actually in $R[x]$.

The key result in this path is Gauss's lemma.

lhf
  • 216,483
  • If $K$ is the field of fractions of R, then $K[x]$ is a UFD ? –  Feb 17 '17 at 16:50
  • @Shivd, yes, see https://en.wikipedia.org/wiki/Polynomial_ring#Factorization_in_K.5BX.5D. – lhf Feb 17 '17 at 17:24