A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
A principal ideal domain (PID) is an integral domain in which every ideal is principal, generated by a single element. PIDs include the integers Z and polynomial rings F[x] over a field F.
Recall from your study of integral domains that an integral domain is a commutative ring with no zero-divisors — a setting where the cancellation law holds and division behaves somewhat like it does in the integers. A principal ideal domain adds one more structural constraint: every ideal in the ring is principal, meaning it can be generated by a single element. An ideal I is principal if there exists some a in the ring such that I = (a) = {ra : r ∈ R}, the set of all multiples of a.
The integers ℤ are the prototype. Every ideal of ℤ looks like nℤ = {…, -2n, -n, 0, n, 2n, …} for some non-negative integer n. If you take any collection of integers closed under addition and under multiplication by arbitrary integers, you'll find it consists exactly of all multiples of the smallest positive element it contains. This is not a coincidence — it follows from the division algorithm, which allows you to reduce any element modulo the smallest one. The polynomial ring F[x] over a field F is a PID for the same reason: the division algorithm for polynomials ensures every ideal is generated by the polynomial of smallest degree within it.
The payoff of being a PID is a rich theory of divisibility. In any PID, irreducible elements (those that cannot be factored non-trivially) coincide with prime elements (those whose divisibility implies divisibility of one of the factors). This equivalence fails in more general integral domains and is precisely what allows unique factorization. The greatest common divisor of two elements always exists in a PID and can be expressed as a linear combination — the analog of Bézout's identity from elementary number theory. In ℤ, gcd(6, 10) = 2, and indeed 2 = 6(-1) + 10(1). The ideal (6, 10) in ℤ, generated by 6 and 10 together, equals (2) — a principal ideal, as expected.
The hierarchy matters for what comes next. Every Euclidean domain (a ring with a division algorithm) is a PID, and every PID is a unique factorization domain (UFD). So PIDs sit exactly in the middle of this chain: general enough to include rings without a Euclidean algorithm, but structured enough to guarantee unique factorization into irreducibles. Understanding PIDs is the key step in seeing why ℤ[x] — which is a UFD but not a PID, since the ideal (2, x) requires two generators — falls outside this class, and why the structure of polynomial rings over fields is so much better behaved than over more general coefficient rings.