The Stacks project

Lemma 10.120.3. Let $R$ be a domain. Consider the following conditions:

  1. The ring $R$ satisfies the ascending chain condition for principal ideals.

  2. Every nonzero, nonunit element $a \in R$ has a factorization $a = b_1 \ldots b_ k$ with each $b_ i$ an irreducible element of $R$.

Then (1) implies (2).

Proof. Let $x$ be a nonzero element, not a unit, which does not have a factorization into irreducibles. Set $x_1 = x$. We can write $x = yz$ where neither $y$ nor $z$ is irreducible or a unit. Then either $y$ does not have a factorization into irreducibles, in which case we set $x_2 = y$, or $z$ does not have a factorization into irreducibles, in which case we set $x_2 = z$. Continuing in this fashion we find a sequence

\[ x_1 | x_2 | x_3 | \ldots \]

of elements of $R$ with $x_ n/x_{n + 1}$ not a unit. This gives a strictly increasing sequence of principal ideals $(x_1) \subset (x_2) \subset (x_3) \subset \ldots $ thereby finishing the proof. $\square$

Comments (2)

Comment #4339 by David Speyer on

I don't know if you have a standard convention about marking uses of Choice. If so, it might be worth pointing out that this argument requires Choice; see https://mathscinet.ams.org/mathscinet-getitem?mr=422022 . I ran across this page while trying to find out if Choice was needed for this Lemma, so maybe this comment will help the next person.

Comment #4489 by on

Thanks David! To everybody: you should always assume everything in the Stacks project uses choice because this is one of the starting axioms of the set theory we use.

There are also:

  • 10 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 034R. Beware of the difference between the letter 'O' and the digit '0'.



View Lemma 10.120.3 as pdf