The Stacks project

Lemma 10.120.8. A UFD satisfies the ascending chain condition for principal ideals.

Proof. Consider an ascending chain $(a_1) \subset (a_2) \subset (a_3) \subset \ldots $ of principal ideals in $R$. Write $a_1 = p_1^{e_1} \ldots p_ r^{e_ r}$ with $p_ i$ prime. Then we see that $a_ n$ is an associate of $p_1^{c_1} \ldots p_ r^{c_ r}$ for some $0 \leq c_ i \leq e_ i$. Since there are only finitely many possibilities we 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 0BUD. Beware of the difference between the letter 'O' and the digit '0'.