{
  "id": "unique-factorization-domain",
  "title": "Unique Factorization Domain",
  "lang": "en",
  "source_lang": "en",
  "summary": "A unique factorization domain is an integral domain in which every nonzero nonunit factors into irreducibles uniquely up to order and multiplication by units.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "UFD",
    "factorial domain",
    "factorial ring"
  ],
  "generated_at": "2026-11-06",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/unique-factorization-domain/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/unique-factorization-domain/",
      "json": "https://aiwiki.page/zh/unique-factorization-domain.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A unique factorization domain (UFD) is an integral domain in which every nonzero element that is not invertible can be written as a product of irreducible elements, uniquely apart from the order of the factors and multiplication by invertible elements. The concept generalizes the fundamental theorem of arithmetic from the integers to more general rings. It is central to abstract algebra, number theory, and the study of polynomial rings."
    },
    {
      "heading": "Definition",
      "text": "Let \\(R\\) be a commutative ring with identity \\(1\\ne 0\\) and no zero divisors. Several notions are needed to state unique factorization precisely:\n\n- A unit is an element \\(u\\in R\\) with a multiplicative inverse in \\(R\\).\n- Two elements \\(a,b\\in R\\) are associates if \\(a=ub\\) for some unit \\(u\\).\n- An irreducible element is a nonzero nonunit \\(p\\) such that \\(p=ab\\) implies that at least one of \\(a,b\\) is a unit.\n\nThe domain \\(R\\) is a UFD if it satisfies two conditions.\n\nExistence of factorization. Every nonzero nonunit \\(a\\in R\\) has a factorization\n\n\\[a=u p_1p_2\\cdots p_n,\\]\n\nwhere \\(u\\) is a unit and each \\(p_i\\) is irreducible.\n\nUniqueness of factorization. If\n\n\\[a=u p_1\\cdots p_n=v q_1\\cdots q_m\\]\n\nare two such factorizations, then \\(n=m\\), and the factors can be reordered so that each \\(p_i\\) is associate to \\(q_i\\).\n\nThe qualification about units is essential. In \\(\\mathbb Z\\), for example, the units are \\(1\\) and \\(-1\\), so \\(6=2\\cdot3=(-2)(-3)\\) does not constitute a failure of uniqueness.\n\nEvery field is a UFD under the standard definition: all its nonzero elements are units, so there are no nonzero nonunits requiring factorization. A unit can be regarded as a unit times an empty product of irreducibles. Zero is excluded from the factorization requirement."
    },
    {
      "heading": "Irreducible and prime elements",
      "text": "A prime element of an integral domain is a nonzero nonunit \\(p\\) such that\n\n\\[p\\mid ab\\quad\\Longrightarrow\\quad p\\mid a\\ \\text{or}\\ p\\mid b.\\]\n\nThis generalizes the divisibility property of a prime number. Every prime element in an integral domain is irreducible, but an irreducible element need not be prime.\n\nThe distinction gives a fundamental characterization:\n\nAn integral domain is a UFD if and only if every nonzero nonunit factors into irreducibles and every irreducible element is prime.\n\nFor the forward direction, suppose an irreducible \\(p\\) divides \\(ab\\). Comparing irreducible factorizations in an equation \\(ab=pc\\) shows that \\(p\\) must be associate to a factor of \\(a\\) or of \\(b\\). Hence it divides one of them.\n\nConversely, suppose factorizations exist and irreducibles are prime. Given\n\n\\[p_1\\cdots p_n=u q_1\\cdots q_m,\\]\n\nthe primality of \\(p_1\\) implies that it divides some \\(q_j\\). Since \\(q_j\\) is irreducible, the two are associates. Cancelling corresponding factors and repeating proves uniqueness.\n\nThe existence condition cannot simply be omitted: a domain may have no irreducible elements at all while still containing nonzero nonunits."
    },
    {
      "heading": "Basic examples",
      "text": "Integers and Gaussian integers\n\nThe ring \\(\\mathbb Z\\) is the standard example. Its irreducibles are the positive and negative rational primes, and its units are \\(\\pm1\\).\n\nThe Gaussian integers\n\n\\[\\mathbb Z[i]=\\{a+bi:a,b\\in\\mathbb Z\\}\\]\n\nalso form a UFD. They admit a Euclidean division procedure using the norm\n\n\\[N(a+bi)=a^2+b^2.\\]\n\nFactorization depends on the ring in which it is performed. For example, \\(5\\) is prime in \\(\\mathbb Z\\), but in \\(\\mathbb Z[i]\\),\n\n\\[5=(2+i)(2-i).\\]\n\nThis does not violate unique factorization: it shows that an element irreducible in a smaller ring may become reducible in a larger one.\n\nPolynomial rings\n\nIf \\(k\\) is a field, the ring \\(k[x]\\) of polynomials in one variable is a UFD. Polynomial division makes it a Euclidean domain.\n\nMore generally, if \\(R\\) is a UFD, then\n\n\\[R[x_1,\\ldots,x_n]\\]\n\nis a UFD for every finite number of indeterminates. Thus\n\n\\[\\mathbb Z[x],\\qquad \\mathbb Q[x,y],\\qquad \\mathbb C[x_1,\\ldots,x_n]\\]\n\nare all UFDs.\n\nThe irreducible factors need not be linear. Over \\(\\mathbb R\\), \\(x^2+1\\) is irreducible, whereas over \\(\\mathbb C\\),\n\n\\[x^2+1=(x-i)(x+i).\\]"
    },
    {
      "heading": "Relationship with Euclidean and principal ideal domains",
      "text": "The standard implications are\n\n\\[\\text{Euclidean domain} \\ \\Longrightarrow\\ \\text{principal ideal domain} \\ \\Longrightarrow\\ \\text{unique factorization domain}.\\]\n\nA Euclidean domain supports division with remainder controlled by a suitable size function. The Euclidean algorithm then shows that each ideal is generated by a single element.\n\nA principal ideal domain (PID) is an integral domain in which every ideal is principal. In a PID:\n\n- The ascending chain condition on ideals ensures that every nonzero nonunit factors into irreducibles.\n- If \\(p\\) is irreducible, the ideal \\((p)\\) is maximal and hence prime, so \\(p\\) is a prime element.\n\nTogether these establish unique factorization.\n\nThe converse implications do not hold in general. In particular, being a UFD does not mean that every ideal is principal. For a field \\(k\\), the ring \\(k[x,y]\\) is a UFD, but its ideal \\((x,y)\\) is not principal. Any generator would have to divide both \\(x\\) and \\(y\\), and hence would have to be a unit; however, \\((x,y)\\) is a proper ideal.\n\nThus unique factorization is a condition about the multiplicative structure of elements, not a requirement that all ideals have single generators."
    },
    {
      "heading": "Gauss's lemma and polynomial factorization",
      "text": "The passage from \\(R\\) to \\(R[x]\\) rests on Gauss's lemma.\n\nFor a nonzero polynomial over a UFD, its content is a greatest common divisor of its coefficients, defined up to multiplication by a unit. A polynomial is primitive if its content is a unit.\n\nGauss's lemma states that the product of two primitive polynomials is primitive. Consequently, for nonzero \\(f,g\\in R[x]\\),\n\n\\[\\operatorname{cont}(fg) \\sim \\operatorname{cont}(f)\\operatorname{cont}(g),\\]\n\nwhere \\(\\sim\\) means “is associate to.”\n\nLet \\(K\\) be the field of fractions of \\(R\\). For a primitive polynomial \\(f\\in R[x]\\) of positive degree,\n\n\\[f\\text{ is irreducible in }R[x] \\quad\\Longleftrightarrow\\quad f\\text{ is irreducible in }K[x].\\]\n\nThis bridges factorization over a ring and factorization over its fraction field. Since \\(K[x]\\) is a UFD, separating polynomial content from primitive factors establishes that \\(R[x]\\) is a UFD.\n\nFor example, a primitive polynomial in \\(\\mathbb Z[x]\\) is reducible over \\(\\mathbb Q\\) precisely when it is reducible over \\(\\mathbb Z\\). This makes it possible to transfer many polynomial factorization questions from rational coefficients to integer coefficients."
    },
    {
      "heading": "Greatest common divisors and divisibility",
      "text": "In a UFD, every pair of nonzero elements has a greatest common divisor and a least common multiple, each unique up to associates.\n\nChoose representatives \\(p\\) for the associate classes of irreducibles. If\n\n\\[a=u\\prod_p p^{\\alpha_p}, \\qquad b=v\\prod_p p^{\\beta_p},\\]\n\nwhere only finitely many exponents are nonzero, then\n\n\\[\\gcd(a,b)\\sim\\prod_p p^{\\min(\\alpha_p,\\beta_p)}\\]\n\nand\n\n\\[\\operatorname{lcm}(a,b)\\sim\\prod_p p^{\\max(\\alpha_p,\\beta_p)}.\\]\n\nIn particular,\n\n\\[\\gcd(a,b)\\operatorname{lcm}(a,b)\\sim ab.\\]\n\nDivisibility is determined by comparing exponents:\n\n\\[a\\mid b \\quad\\Longleftrightarrow\\quad \\alpha_p\\le\\beta_p \\quad\\text{for every }p.\\]\n\nNevertheless, a greatest common divisor need not be a linear combination of the original elements. In \\(k[x,y]\\), the elements \\(x\\) and \\(y\\) have greatest common divisor \\(1\\), but there are no polynomials \\(A,B\\) such that\n\n\\[Ax+By=1,\\]\n\nas evaluation at \\(x=y=0\\) shows. The familiar Bézout identity from the integers therefore does not hold in every UFD."
    },
    {
      "heading": "Failure of unique factorization",
      "text": "A classical counterexample is\n\n\\[R=\\mathbb Z[\\sqrt{-5}].\\]\n\nIn this domain,\n\n\\[6=2\\cdot3=(1+\\sqrt{-5})(1-\\sqrt{-5}).\\]\n\nThe norm\n\n\\[N(a+b\\sqrt{-5})=a^2+5b^2\\]\n\nis multiplicative. There are no elements of norm \\(2\\) or \\(3\\). This implies that \\(2\\), \\(3\\), and \\(1\\pm\\sqrt{-5}\\) are irreducible: a factorization of any of them into two nonunits would force factors of those impossible norms.\n\nThe only units are \\(\\pm1\\). The displayed factorizations therefore cannot be obtained from one another by reordering and multiplying factors by units.\n\nThis example also separates irreducibility from primality. Although \\(2\\) is irreducible, it divides\n\n\\[(1+\\sqrt{-5})(1-\\sqrt{-5})=6\\]\n\nwithout dividing either factor."
    },
    {
      "heading": "Further structural properties",
      "text": "Localization\n\nA localization of a UFD is again a UFD, provided the multiplicative set being inverted does not contain zero. Inverting elements makes some formerly irreducible elements into units; the remaining irreducible factors still give unique factorization.\n\nExamples include\n\n\\[\\mathbb Z[1/6]\\]\n\nand the Laurent polynomial ring\n\n\\[k[x,x^{-1}].\\]\n\nIn the first, \\(2\\) and \\(3\\) become units. In the second, \\(x\\) becomes a unit.\n\nBy contrast, an arbitrary subring or quotient of a UFD need not be a UFD. For example, the non-UFD \\(\\mathbb Z[\\sqrt{-5}]\\) is both a subring of the field \\(\\mathbb C\\) and a quotient of the UFD \\(\\mathbb Z[t]\\).\n\nIntegral closure\n\nEvery UFD is an integrally closed domain: an element of its fraction field satisfying a monic polynomial with coefficients in the domain already belongs to the domain.\n\nTo see this, write such an element as \\(a/b\\), where \\(a\\) and \\(b\\) have no common irreducible factor. A monic equation of degree \\(n\\), after multiplication by \\(b^n\\), implies that \\(b\\mid a^n\\). Unique factorization forces \\(b\\) to be a unit.\n\nThe converse is false: integral closure alone does not ensure unique factorization.\n\nNoetherianity and ideal factorization\n\nEvery Noetherian integral domain has factorization into irreducibles, but those factorizations need not be unique. Conversely, a UFD need not be Noetherian. The polynomial ring\n\n\\[k[x_1,x_2,x_3,\\ldots]\\]\n\nin countably infinitely many indeterminates is a UFD, but it is not Noetherian, as shown by the strictly increasing chain\n\n\\[(x_1)\\subsetneq(x_1,x_2)\\subsetneq(x_1,x_2,x_3)\\subsetneq\\cdots.\\]\n\nIn a Dedekind domain, every nonzero proper ideal factors uniquely into prime ideals even when elements do not factor uniquely. Such a domain is a UFD exactly when it is a PID, equivalently when its ideal class group is trivial. Ideal factorization thus provides a replacement for element factorization in important rings arising in algebraic number theory."
    },
    {
      "heading": "Historical and mathematical significance",
      "text": "Unique factorization in the integers provided the model for the general theory. Carl Friedrich Gauss developed polynomial factorization methods and the arithmetic of Gaussian integers, both central examples of unique factorization beyond \\(\\mathbb Z\\).\n\nThe study of Diophantine equations led to factorizations in larger rings of algebraic numbers, where uniqueness can fail. These failures helped motivate ideal-theoretic approaches to algebraic number theory.\n\nIn algebraic geometry, polynomial UFDs make irreducible factors central to the description of hypersurfaces. Unique factorization is also an important structural property of coordinate rings, but it does not by itself supply an efficient factorization algorithm. Existence and uniqueness of factors are algebraic statements; the computational cost of finding those factors is a separate question."
    }
  ],
  "links": [
    "integral-domain",
    "fundamental-theorem-of-arithmetic",
    "integer",
    "abstract-algebra",
    "number-theory",
    "ring-mathematics",
    "field-mathematics",
    "prime-number",
    "polynomial",
    "euclidean-algorithm",
    "principal-ideal-domain",
    "ideal-ring-theory",
    "greatest-common-divisor",
    "carl-friedrich-gauss",
    "diophantine-equation",
    "algebraic-geometry"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}