{
  "id": "principal-ideal-domain",
  "title": "Principal ideal domain",
  "lang": "en",
  "source_lang": "en",
  "summary": "A principal ideal domain is an integral domain in which every ideal is generated by a single element, generalizing key divisibility properties of the integers.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "PID",
    "principal ideal integral domain"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/principal-ideal-domain/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/principal-ideal-domain/",
      "json": "https://aiwiki.page/zh/principal-ideal-domain.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A principal ideal domain (PID) is a commutative integral domain in which every ideal is generated by one element. The integers \\(\\mathbb Z\\) and the ring \\(F[x]\\) of polynomials in one variable over a field \\(F\\) are fundamental examples. Principal ideal domains occupy an important place in abstract algebra because they support greatest common divisors, unique factorization, and a classification of finitely generated modules that extends both the classification of finitely generated abelian groups and canonical forms for linear operators."
    },
    {
      "heading": "Definition and conventions",
      "text": "An integral domain is a commutative ring \\(R\\) with a multiplicative identity \\(1\\ne 0\\) and no zero divisors. An ideal \\(I\\subseteq R\\) is principal if there is an element \\(a\\in R\\) such that\n\n\\[I=(a)=aR=\\{ar:r\\in R\\}.\\]\n\nThe ring \\(R\\) is a principal ideal domain if every ideal has this form. The definition includes the zero ideal \\((0)\\) and the whole ring \\(R=(1)\\).\n\nA generator need not be unique. For nonzero \\(a,b\\in R\\),\n\n\\[(a)=(b) \\quad\\Longleftrightarrow\\quad a=ub\\]\n\nfor some unit \\(u\\), meaning an element with a multiplicative inverse in \\(R\\). Such elements \\(a\\) and \\(b\\) are called associates. The same equivalence holds when both elements are zero.\n\nA principal ideal ring also has every ideal generated by one element, but need not be an integral domain. For example, \\(\\mathbb Z/6\\mathbb Z\\) is a principal ideal ring but not a PID, because its nonzero residue classes \\(2\\) and \\(3\\) multiply to zero."
    },
    {
      "heading": "Examples and nonexamples",
      "text": "Integers\n\nEvery ideal of \\(\\mathbb Z\\) is \\(n\\mathbb Z\\) for a unique nonnegative integer \\(n\\). For a nonzero ideal \\(I\\), choose its least positive element \\(n\\). Division with remainder shows that every element of \\(I\\) is divisible by \\(n\\), so \\(I=(n)\\).\n\nThis is the basic model for the connection between ideals and divisibility.\n\nPolynomial rings over fields\n\nIf \\(F\\) is a field, then \\(F[x]\\) is a PID. Given a nonzero ideal \\(I\\), choose a nonzero polynomial \\(f\\in I\\) of least degree. For any \\(g\\in I\\), polynomial division gives\n\n\\[g=qf+r,\\]\n\nwhere \\(r=0\\) or \\(\\deg r<\\deg f\\). Since \\(r=g-qf\\) belongs to \\(I\\), minimality forces \\(r=0\\). Hence \\(I=(f)\\).\n\nThe assumption that the coefficients form a field is essential. For example, \\(\\mathbb Z[x]\\) is not a PID: its ideal \\((2,x)\\) is not principal.\n\nFields and Gaussian integers\n\nEvery field is a PID, since its only ideals are \\((0)\\) and the whole field.\n\nThe Gaussian integers\n\n\\[\\mathbb Z[i]=\\{a+bi:a,b\\in\\mathbb Z\\}\\]\n\nalso form a PID. Their norm \\(N(a+bi)=a^2+b^2\\) permits a division-with-remainder argument.\n\nA multivariable nonexample\n\nThe polynomial ring \\(F[x,y]\\) is not a PID. Consider the ideal\n\n\\[I=(x,y).\\]\n\nIf \\(I=(f)\\), then \\(f\\) divides both \\(x\\) and \\(y\\). Their only common divisors are units, so \\(f\\) would be a unit and \\(I\\) would be the whole ring. But every element of \\((x,y)\\) vanishes at \\(x=y=0\\), whereas \\(1\\) does not.\n\nThus adjoining a second polynomial variable can destroy the principal ideal property even when the coefficient ring is a field."
    },
    {
      "heading": "Divisibility and greatest common divisors",
      "text": "Principal ideals translate divisibility into ideal inclusion:\n\n\\[a\\mid b \\quad\\Longleftrightarrow\\quad (b)\\subseteq(a).\\]\n\nThe direction of containment is reversed: a divisor generates an ideal containing the ideal generated by its multiple.\n\nFor \\(a,b\\in R\\), their generated ideal is\n\n\\[(a,b)=\\{ax+by:x,y\\in R\\}.\\]\n\nIn a PID this ideal equals \\((d)\\) for some \\(d\\). Consequently,\n\n\\[d=ax+by\\]\n\nfor suitable \\(x,y\\in R\\), and \\(d\\) divides both \\(a\\) and \\(b\\). Any common divisor of \\(a\\) and \\(b\\) divides every such linear combination, including \\(d\\). Thus \\(d\\) is a greatest common divisor, determined up to multiplication by a unit.\n\nThe identity \\(d=ax+by\\) is a Bézout identity. In particular,\n\n\\[(a,b)=R \\quad\\Longleftrightarrow\\quad ax+by=1\\]\n\nfor some \\(x,y\\in R\\).\n\nLeast common multiples have a complementary ideal interpretation. For nonzero \\(a,b\\), the intersection \\((a)\\cap(b)\\) is generated by a least common multiple. If \\(d\\) is a greatest common divisor and \\(m\\) a least common multiple, then \\(dm\\) and \\(ab\\) are associates.\n\nThese facts extend familiar integer arithmetic, including the Chinese remainder theorem. If \\((a)+(b)=R\\), then\n\n\\[R/(ab)\\cong R/(a)\\times R/(b).\\]"
    },
    {
      "heading": "Unique factorization and prime ideals",
      "text": "Every PID is a unique factorization domain: every nonzero nonunit factors into irreducible elements, and the factorization is unique up to ordering and multiplication of factors by units.\n\nTwo properties underlie this result:\n\n- Every ascending chain of ideals eventually stabilizes, ensuring that factorization into irreducibles terminates.\n- Every irreducible element is prime.\n\nFor the second property, let \\(p\\) be irreducible and suppose \\(p\\mid ab\\) but \\(p\\nmid a\\). A greatest common divisor of \\(p\\) and \\(a\\) must be a unit, so there are \\(x,y\\in R\\) with\n\n\\[xp+ya=1.\\]\n\nMultiplying by \\(b\\) shows that \\(p\\mid b\\). This is the prime-divisor property responsible for uniqueness, generalizing the fundamental theorem of arithmetic.\n\nAn ideal \\(P\\ne R\\) is a prime ideal if \\(ab\\in P\\) implies \\(a\\in P\\) or \\(b\\in P\\). In a PID, every nonzero prime ideal is generated by a prime element and is maximal. Equivalently, if \\(p\\) is irreducible, then \\(R/(p)\\) is a field.\n\nThe zero ideal is prime because \\(R\\) is a domain, but it is maximal only when \\(R\\) itself is a field. Thus a PID that is not a field has Krull dimension one."
    },
    {
      "heading": "Relationship to other classes of domains",
      "text": "Several important classes satisfy the implications\n\n\\[\\text{Euclidean domain} \\Longrightarrow \\text{principal ideal domain} \\Longrightarrow \\text{unique factorization domain}.\\]\n\nEuclidean domains\n\nA Euclidean domain has a size function that supports division with remainder. Choosing a nonzero ideal element of least size proves that every ideal is principal, just as for integers and univariate polynomials.\n\nThe converse does not hold: a PID need not admit a Euclidean function. A classical example is\n\n\\[\\mathbb Z\\!\\left[\\frac{1+\\sqrt{-19}}{2}\\right],\\]\n\nwhich is a PID but is not Euclidean.\n\nThis distinction separates an ideal-theoretic existence property from a stronger division property. The PID condition alone does not supply a particular Euclidean algorithm for computing generators.\n\nUnique factorization domains\n\nUnique factorization does not imply that every ideal is principal. The ring \\(F[x,y]\\), for example, is a unique factorization domain but has the nonprincipal ideal \\((x,y)\\). Unique factorization concerns multiplicative decompositions of elements; being a PID also restricts the additive structure of ideals.\n\nNoetherian and Bézout domains\n\nA Noetherian ring is a ring in which every ideal is finitely generated, equivalently one satisfying the ascending chain condition on ideals. Every PID is Noetherian because one generator suffices for each ideal.\n\nA Bézout domain is an integral domain in which every finitely generated ideal is principal. A domain is a PID precisely when it is both Noetherian and a Bézout domain. The distinction matters because a general Bézout domain may have ideals that are not finitely generated."
    },
    {
      "heading": "Modules over a PID",
      "text": "Principal ideal domains are especially important because of the structure of their modules. Modules generalize vector spaces by allowing scalars from a ring rather than requiring a field.\n\nSubmodules of free modules\n\nOver a PID, every submodule of a free module is free. In particular, if\n\n\\[N\\subseteq R^n,\\]\n\nthen \\(N\\) has a basis of at most \\(n\\) elements.\n\nThis is not a general property of integral domains. For instance, the ideal \\((x,y)\\subseteq F[x,y]\\), regarded as a module over \\(F[x,y]\\), is a submodule of a free module of rank one but is not itself free.\n\nClassification of finitely generated modules\n\nEvery finitely generated module \\(M\\) over a PID \\(R\\) has an isomorphism of the form\n\n\\[M\\cong R^r\\oplus R/(d_1)\\oplus\\cdots\\oplus R/(d_t),\\]\n\nwhere each \\(d_i\\) is a nonzero nonunit and\n\n\\[d_1\\mid d_2\\mid\\cdots\\mid d_t.\\]\n\nHere \\(\\oplus\\) denotes a direct sum. The integer \\(r\\) and the ideals \\((d_i)\\) are uniquely determined by \\(M\\). The elements \\(d_i\\), called invariant factors, are therefore unique up to multiplication by units.\n\nThe summand \\(R^r\\) is the free part. The remaining summands form the torsion submodule, whose elements are annihilated by some nonzero scalar. In particular, every finitely generated torsion-free module over a PID is free. Finite generation is essential: \\(\\mathbb Q\\), as a module over \\(\\mathbb Z\\), is torsion-free but not free.\n\nFactoring the invariant factors into powers of prime elements gives an alternative decomposition into modules \\(R/(p^e)\\), called the elementary divisor decomposition."
    },
    {
      "heading": "Applications to groups and linear algebra",
      "text": "Finitely generated abelian groups\n\nAn abelian group is naturally a module over \\(\\mathbb Z\\), with integer scalar multiplication defined by repeated addition and additive inverses. Since \\(\\mathbb Z\\) is a PID, the module structure theorem gives\n\n\\[G\\cong \\mathbb Z^r\\oplus \\mathbb Z/n_1\\mathbb Z\\oplus\\cdots\\oplus \\mathbb Z/n_t\\mathbb Z,\\]\n\nwhere \\(n_i>1\\) and \\(n_1\\mid\\cdots\\mid n_t\\). This is the classification of finitely generated abelian groups.\n\nLinear operators\n\nIf \\(V\\) is a finite-dimensional vector space over \\(F\\) and \\(T:V\\to V\\) is a linear map, then \\(V\\) becomes an \\(F[x]\\)-module by defining\n\n\\[f(x)\\cdot v=f(T)v.\\]\n\nBecause \\(F[x]\\) is a PID, the module classification yields the rational canonical form of \\(T\\). When the relevant polynomials split into linear factors over \\(F\\), the elementary divisor decomposition yields Jordan canonical form.\n\nMatrix reduction\n\nA matrix \\(A\\) over a PID admits a Smith normal form:\n\n\\[UAV=\\operatorname{diag}(d_1,\\ldots,d_s,0,\\ldots,0),\\]\n\nwhere \\(U,V\\) are invertible matrices over the ring and\n\n\\[d_1\\mid d_2\\mid\\cdots\\mid d_s.\\]\n\nThis form describes finitely presented modules through generators and relations. Over \\(\\mathbb Z\\), it is used to compute finitely generated abelian groups and integral homology groups. Over a general PID, existence of the form is an algebraic theorem; effective computation additionally requires suitable procedures for arithmetic and finding ideal generators."
    }
  ],
  "links": [
    "integral-domain",
    "ideal-ring-theory",
    "integer",
    "polynomial",
    "field-mathematics",
    "abstract-algebra",
    "ring-mathematics",
    "greatest-common-divisor",
    "chinese-remainder-theorem",
    "unique-factorization-domain",
    "fundamental-theorem-of-arithmetic",
    "euclidean-algorithm",
    "module-mathematics",
    "isomorphism",
    "direct-sum",
    "abelian-group",
    "vector-space",
    "linear-map",
    "matrix",
    "smith-normal-form"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}