Generated by GPT-5-mini| Principal ideal domain | |
|---|---|
| Name | Principal ideal domain |
| Type | Commutative ring |
| Field | Algebra |
Principal ideal domain is a type of commutative ring with unity in which every ideal is generated by a single element. It occupies a central place in algebraic number theory, algebraic geometry, and commutative algebra because it provides a tractable setting for unique factorization, module classification, and explicit computation. Principal ideal domains connect to classical results studied by figures such as Évariste Galois, Richard Dedekind, David Hilbert, Emmy Noether, and Kronecker.
A principal ideal domain (PID) is an integral domain that is also a principal ideal ring: every ideal I satisfies I = (a) for some a in the ring. The definition refines concepts introduced in work by Dedekind on ideals and by Noether on rings with finiteness conditions; it is a special case of a principal ideal ring considered in studies by Hilbert and Kronecker and sits inside the lattice of properties linking Euclid's algorithm, unique factorization domains, and Bezout domains.
Standard examples include the ring of integers Z, which was central to the investigations of Carl Friedrich Gauss, and polynomial rings k[x] over a field k, related to work by Évariste Galois and studied in the context of Carl Jacobi's algebraic questions. Rings of integers in some algebraic number fields, such as the Gaussian integers Z[i] studied by Adrien-Marie Legendre and Gauss, are PIDs; Dedekind's theory contrasts these with non-PID rings like the ring of integers of Q(√-5), a classical counterexample considered by Lejeune Dirichlet and discussed in Dedekind's correspondence. Non-examples include coordinate rings of many affine varieties studied in Alexander Grothendieck's work and certain valuation rings appearing in research by Krull. The Euclidean domains examined by Euclid and later formalized by Gauss and Lame are PIDs, but not every unique factorization domain encountered in Hilbert's problems is a PID.
In a PID every nonzero prime ideal is maximal, a fact used in proofs by Dedekind and Noether. Principal ideal domains are Noetherian and integrally closed in their field of fractions, properties connected to the writings of Zariski and Samuel on commutative algebra. A PID is a unique factorization domain (UFD); this link was explored in the literature of Gauss and formalized in modern treatments by Kaplansky and Atiyah. Conversely, a UFD need not be a PID, a distinction highlighted in examples analyzed by Nagata and in counterexamples developed in the work of Krull.
Every ideal in a PID is generated by a single element, which yields a clear structure theorem for ideals analogous to structure theorems for modules used by Jordan and Kronecker. Factorization of elements into irreducibles is unique up to associates and ordering, a principle rooted in the investigations of Gauss and extended by Dedekind in his theory of ideals and factorization in number fields. The Chinese Remainder Theorem, employed in studies by Gauss and Euler, has a particularly explicit form for PIDs, permitting simultaneous congruences and decomposition of quotient rings; related decompositions appear in the work of Sylow and Cauchy on group structure where modular arithmetic plays a role.
Over a PID, finitely generated modules admit a complete classification: every finitely generated module decomposes into a direct sum of cyclic modules, a theorem developed in treatments by Frobenius and Smith and widely used in linear algebra over principal domains. This classification underlies the rational canonical form and Jordan normal form links to research by Jordan and Cayley. Homological dimensions simplify: PIDs have global dimension at most one, an observation connected to homological algebra foundations by Cartan and Eilenberg and to projects in Serre's work on homological criteria for regularity. Torsion submodules and primary decomposition over a PID mirror studies in Noether's theory of modules.
PIDs serve as a testing ground for broader theories in algebraic number theory as in Dedekind's study of ideal factorization, in algebraic topology where homology groups over Z or polynomial rings are computed in the style of Eilenberg and Mac Lane, and in algebraic geometry where local rings resembling PIDs simplify singularity analysis as in early work of Zariski. Computational algebraic systems exploit PID structure for algorithmic factorization and solving linear diophantine equations, continuing traditions initiated by Gauss and extended in computational approaches by researchers at institutions such as Institute for Advanced Study and in projects inspired by Hilbert's problems. The role of PIDs in classifying modules and enabling explicit calculation makes them foundational for modern developments pursued by mathematicians including Serre, Atiyah, and Mac Lane.