In mathematics, a principal ideal domain, or PID, is an integral domain in which every ideal is principal, i.e., can be generated by a single element. More generally, a principal ideal ring is a nonzero commutative ring whose ideals are principal, although some authors (e.g., Bourbaki) refer to PIDs as principal rings. The distinction is that a principal ideal ring may have zero divisors whereas a principal ideal domain cannot.

Principal ideal domains are thus mathematical objects that behave somewhat like the integers, with respect to divisibility: any element of a PID has a unique decomposition into prime elements (so an analogue of the fundamental theorem of arithmetic holds); any two elements of a PID have a greatest common divisor (although it may not be possible to find it using the Euclidean algorithm). If x and y are elements of a PID without common divisors, then every element of the PID can be written in the form ax + by.

Principal ideal domains are Noetherian, they are integrally closed, they are unique factorization domains and Dedekind domains. All Euclidean domains and all fields are principal ideal domains.

Principal ideal domains appear in the following chain of class inclusions:

rngsringscommutative ringsintegral domainsintegrally closed domainsGCD domainsunique factorization domainsprincipal ideal domainsEuclidean domainsfieldsalgebraically closed fields


Examples include:


Examples of integral domains that are not PIDs:


Main article: Structure theorem for finitely generated modules over a principal ideal domain

The key result is the structure theorem: If R is a principal ideal domain, and M is a finitely generated R-module, then is a direct sum of cyclic modules, i.e., modules with one generator. The cyclic modules are isomorphic to for some [4] (notice that may be equal to , in which case is ).

If M is a free module over a principal ideal domain R, then every submodule of M is again free.[5] This does not hold for modules over arbitrary rings, as the example of modules over shows.


In a principal ideal domain, any two elements a,b have a greatest common divisor, which may be obtained as a generator of the ideal (a, b).

All Euclidean domains are principal ideal domains, but the converse is not true. An example of a principal ideal domain that is not a Euclidean domain is the ring ,[6][7] this was proved by Theodore Motzkin and was the first case known.[8] In this domain no q and r exist, with 0 ≤ |r| < 4, so that , despite and having a greatest common divisor of 2.

Every principal ideal domain is a unique factorization domain (UFD).[9][10][11][12] The converse does not hold since for any UFD K, the ring K[X, Y] of polynomials in 2 variables is a UFD but is not a PID. (To prove this look at the ideal generated by It is not the whole ring since it contains no polynomials of degree 0, but it cannot be generated by any one single element.)

  1. Every principal ideal domain is Noetherian.
  2. In all unital rings, maximal ideals are prime. In principal ideal domains a near converse holds: every nonzero prime ideal is maximal.
  3. All principal ideal domains are integrally closed.

The previous three statements give the definition of a Dedekind domain, and hence every principal ideal domain is a Dedekind domain.

Let A be an integral domain. Then the following are equivalent.

  1. A is a PID.
  2. Every prime ideal of A is principal.[13]
  3. A is a Dedekind domain that is a UFD.
  4. Every finitely generated ideal of A is principal (i.e., A is a Bézout domain) and A satisfies the ascending chain condition on principal ideals.
  5. A admits a Dedekind–Hasse norm.[14]

Any Euclidean norm is a Dedekind-Hasse norm; thus, (5) shows that a Euclidean domain is a PID. (4) compares to:

An integral domain is a Bézout domain if and only if any two elements in it have a gcd that is a linear combination of the two. A Bézout domain is thus a GCD domain, and (4) gives yet another proof that a PID is a UFD.

See also


  1. ^ See Fraleigh & Katz (1967), p. 73, Corollary of Theorem 1.7, and notes at p. 369, after the corollary of Theorem 7.2
  2. ^ See Fraleigh & Katz (1967), p. 385, Theorem 7.8 and p. 377, Theorem 7.4.
  3. ^ Milne, James. "Algebraic Number Theory" (PDF). p. 5.
  4. ^ See also Ribenboim (2001), p. 113, proof of lemma 2.
  5. ^ Lecture 1. Submodules of Free Modules over a PID Retrieved 31 March 2023
  6. ^ Wilson, Jack C. "A Principal Ring that is Not a Euclidean Ring." Math. Mag 46 (Jan 1973) 34-38 [1]
  7. ^ George Bergman, A principal ideal domain that is not Euclidean - developed as a series of exercises PostScript file
  8. ^ Motzkin, Th (December 1949). "The Euclidean algorithm". Bulletin of the American Mathematical Society. 55 (12): 1142–1146. ISSN 0002-9904.
  9. ^ Proof: every prime ideal is generated by one element, which is necessarily prime. Now refer to the fact that an integral domain is a UFD if and only if its prime ideals contain prime elements.
  10. ^ Jacobson (2009), p. 148, Theorem 2.23.
  11. ^ Fraleigh & Katz (1967), p. 368, Theorem 7.2
  12. ^ Hazewinkel, Gubareni & Kirichenko (2004), p.166, Theorem 7.2.1.
  13. ^ "T. Y. Lam and Manuel L. Reyes, A Prime Ideal Principle in Commutative Algebra" (PDF). Archived from the original (PDF) on 26 July 2010. Retrieved 31 March 2023.
  14. ^ Hazewinkel, Gubareni & Kirichenko (2004), p.170, Proposition 7.3.3.