Is a polynomial ring over a UFD in countably many variables a UFD?

Solution 1:

Key Idea $ $ Each successive polynomial ring extension $\,D\subset D[x]\,$ is factorization inert, i.e. the ring extension introduces no new factorizations, i.e. if $\, 0\ne d\ \in D\,$ factors in $\,D[x]\,$ as $\,d = ab\,$ for $\, a,b\in D[x]\,$ then $\,a,b\in D.\,$ From this one easily deduces that the requisite factorization properties extend to the ascending union $\,R[x_1,x_2,\cdots\,].$ The same ideas works for arbitrary inert extensions.

Remark $\ $ Paul Cohn introduced the idea of inert extensions when studying Bezout rings. Cohn proved that every gcd domain can be inertly embedded in a Bezout domain, and every UFD can be inertly embedded in a PID. There are a few variations on the notion of inertness that prove useful when studying the relationship between factorizations in base and extension rings, e.g. a weaker form where $\, d = ab\,\Rightarrow\, au, b/u\in D,\,$ for some unit $\,u\,$ in the extension ring.

Solution 2:

We may think of the polynomial ring $R[x_1,x_2,\ldots]$ as a limit of polynomial rings in finitely many variables. There are natural injections $R[x_1,x_2,\ldots,x_n]\hookrightarrow R[x_1,x_2,\ldots]$ and you can show that with these identifications, if $p\in R[x_1,x_2,\ldots,x_n]$, then so is any divisor of $p$. Thus every element of this ring uniquely factors as a product of irreducibles (in the usual sense).

Solution 3:

Hint: first show that for any $n\in\mathbb N$ and any $f\in R[x_1,x_2,\cdots,x_n]\subset R[x_1,x_2,\cdots]$, $f$ is irreducible in $R[x_1,x_2,\cdots]$ iff it's so in $R[x_1,x_2,\cdots,x_n]$; then notice any element of $R[x_1,x_2,\cdots]$ lies in $R[x_1,x_2,\cdots,x_n]$ for some $n$.