The Stacks project

Lemma 10.120.10. A polynomial ring over a UFD is a UFD. In particular, if $k$ is a field, then $k[x_1, \ldots , x_ n]$ is a UFD.

Proof. Let $R$ be a UFD. Then $R$ satisfies the ascending chain condition for principal ideals (Lemma 10.120.8), hence $R[x]$ satisfies the ascending chain condition for principal ideals (Lemma 10.120.9), and hence every element of $R[x]$ has a factorization into irreducibles (Lemma 10.120.3). Let $S \subset R$ be the multiplicative subset generated by prime elements. Since every nonunit of $R$ is a product of prime elements we see that $K = S^{-1}R$ is the fraction field of $R$. Observe that every prime element of $R$ maps to a prime element of $R[x]$ and that $S^{-1}(R[x]) = S^{-1}R[x] = K[x]$ is a UFD (and even a PID). Thus we may apply Lemma 10.120.7 to conclude. $\square$


Comments (0)

There are also:

  • 9 comment(s) on Section 10.120: Factorization

Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 0BC1. Beware of the difference between the letter 'O' and the digit '0'.