Skip to main content
Mathematics LibreTexts

3.3: Nonunique Factorization

  • Page ID
    82469
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    Learning Objectives

    In this section, we'll seek to answer the questions:

    • How can unique factorization fail, and why does it matter?
    • What is an example of a nonatomic domain?
    • What is an example of an element that does not factor uniquely into a product of irreducibles?

    Despite the evidence to the contrary, not every ring has the unique factorization property. That is, there are commutative rings with identity which are not UFDs. In fact, the failure of certain rings in algebraic number theory to have the unique factorization property played a role in several failed attempts to prove Fermat's Last Theorem, which says that there are no nontrivial integer solutions \((x,y,z)\) to the equation \(x^n + y^n = z^n\) if \(n \ge 3\text{.}\) Pierre de Fermat famously claimed that he had a “marvelous proof” of this fact, but the margin of the book in which he was writing was “too narrow to contain it.” Fermat's supposed proof was never found, and many now doubt that he had one. The search for a valid proof would not be complete until the work of Andrew Wiles and Richard Taylor in the mid-1990s.

    In 1847, Gabriel Lamé claimed he had completely solved the problem. His solution relied on the factorization of \(x^p + y^p\text{,}\) where \(p\) is an odd prime, as

    \begin{equation*} x^p + y^p = (x+y)(x+\zeta y) \cdots (x+\zeta^{p-1}y)\text{,} \end{equation*}

    where \(\zeta = e^{2\pi i/p}\) is a primitive \(p\)-th root of unity in \(\mathbb{C}\text{.}\) However, the ring \(\mathbb{Z}[\zeta] = \{a_0 + a_1 \zeta + a_2 \zeta^2 + \cdots + a_{p-1} \zeta^{p-1} : a_i\in\mathbb{Z}\}\) is not a unique factorization domain.

    There are two ways that unique factorization in an integral domain can fail: there can be a failure of a nonzero nonunit to factor into irreducibles, or there can be nonassociate factorizations of the same element. We investigate each in turn.

    Exploration 3.3.1 : A Non-atomic Domain

    We say an integral domain \(R\) is atomic if every nonzero nonunit can be written as a finite product of irreducibles in \(R\text{.}\)

    Let

    \begin{align*} R & = \mathbb{Z} + x\mathbb{Q}[x]\\ & = \{a + b_1 x + b_2 x^2 + \cdots + b_n x^n : a\in \mathbb{Z}, b_1,\ldots, b_n \in \mathbb{Q}, n\ge 0 \}, \end{align*}

    the set of polynomials with integer constant terms and rational coefficients.

    1. Convince yourself that \(R\) is an integral domain. You do not need to prove it in detail, but you should at least argue that \(R\) is closed under the usual polynomial addition and multiplication, and that \(R\) is a domain.
    2. Describe the irreducibles in \(R\text{.}\)
    3. Use the notion of degree to argue that any factorization of \(x\) in \(R\) has the form
      \begin{equation*} x = m\left(\frac{x}{m}\right). \end{equation*}
  • Explain why the factorization in the previous part cannot lead to a factorization of \(x\) into irreducibles in \(R\text{.}\)

    We now explore the atomic domain \(R = \mathbb{Z}[\sqrt{-7}] = \{ a+b\sqrt{-7} : a,b\in\mathbb{Z}\}\text{.}\) As we will see, even when a nonzero nonunit can be written as a product of irreducibles, it may be the case that this factorization is not unique.

    Activity 3.3.1

    Verify that \(8 = (1+\sqrt{-7})(1-\sqrt{-7})\text{.}\)

    Next, we develop a multiplicative function \(\delta\) which enables us to explore the multiplicative properties of \(\mathbb{Z}[\sqrt{-7}]\text{.}\)

    Theorem 3.3.1

    Define \(\delta : R \to \mathbb{N}_0\) by \(\delta(a+b\sqrt{-7}) = a^2 + 7 b^2\text{.}\) Then for all \(x,y\in R\text{,}\) \(\delta(xy) = \delta(x)\delta(y)\text{.}\)

    Theorem 3.3.2

    An element \(u\in R\) is a unit if and only if \(\delta(u) = 1\text{.}\)


    This page titled 3.3: Nonunique Factorization is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Michael Janssen & Melissa Lindsey via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.