Principal Ideal Domain
   HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a principal ideal domain, or PID, is an
integral domain In mathematics, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibilit ...
(that is, a non-zero
commutative ring In mathematics, a commutative ring is a Ring (mathematics), ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring prope ...
without nonzero
zero divisor In abstract algebra, an element of a ring is called a left zero divisor if there exists a nonzero in such that , or equivalently if the map from to that sends to is not injective. Similarly, an element of a ring is called a right ze ...
s) in which every ideal is principal (that is, is formed by the multiples of a single element). Some authors such as Bourbaki refer to PIDs as principal rings. Principal ideal domains are mathematical objects that behave like the
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
s, with respect to
divisibility In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a ''Multiple (mathematics), multiple'' of m. An integer n is divis ...
: any element of a PID has a unique factorization into
prime element In mathematics, specifically in abstract algebra, a prime element of a commutative ring is an object satisfying certain properties similar to the prime numbers in the integers and to irreducible polynomials. Care should be taken to distinguish ...
s (so an analogue of the fundamental theorem of arithmetic holds); any two elements of a PID have a
greatest common divisor In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers , , the greatest co ...
(although it may not be possible to find it using the
Euclidean algorithm In mathematics, the Euclidean algorithm,Some widely used textbooks, such as I. N. Herstein's ''Topics in Algebra'' and Serge Lang's ''Algebra'', use the term "Euclidean algorithm" to refer to Euclidean division or Euclid's algorithm, is a ...
). If and are elements of a PID without common divisors, then every element of the PID can be written in the form , etc. Principal ideal domains are
Noetherian In mathematics, the adjective Noetherian is used to describe objects that satisfy an ascending or descending chain condition on certain kinds of subobjects, meaning that certain ascending or descending sequences of subobjects must have finite leng ...
, they are integrally closed, they are
unique factorization domain In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is ...
s and Dedekind domains. All Euclidean domains and all fields are principal ideal domains. Principal ideal domains appear in the following chain of class inclusions:


Examples

Examples include: * K: any field, * \mathbb: the ring of
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
s, * K /math>: rings of polynomials in one variable with coefficients in a field. (The converse is also true, i.e. if A /math> is a PID then A is a field.) Furthermore, a ring of formal power series in one variable over a field is a PID since every ideal is of the form (x^k), * \mathbb /math>: the ring of Gaussian integers, * \mathbb omega/math> (where \omega is a primitive cube root of 1): the Eisenstein integers, * Any discrete valuation ring, for instance the ring of -adic integers \mathbb_p.


Non-examples

Examples of integral domains that are not PIDs: * \mathbb sqrt/math> is an example of a ring that is not a
unique factorization domain In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is ...
, since 4 = 2\cdot 2 = (1+\sqrt)(1-\sqrt). Hence it is not a principal ideal domain because principal ideal domains are unique factorization domains. Also, \langle 2, 1+\sqrt \rangle is an ideal that cannot be generated by a single element. * \mathbb /math>: the ring of all polynomials with integer coefficients. It is not principal because \langle 2, x \rangle is an ideal that cannot be generated by a single polynomial. * K , y, \ldots the ring of polynomials in at least two variables over a ring is not principal, since the ideal \langle x, y \rangle is not principal. * Most rings of algebraic integers are not principal ideal domains. This is one of the main motivations behind Dedekind's definition of Dedekind domains, which allows replacing unique factorization of elements with unique factorization of ideals. In particular, many \mathbb zeta_p for the primitive p-th root of unity \zeta_p, are not principal ideal domains. The class number of a ring of algebraic integers gives a measure of "how far away" the ring is from being a principal ideal domain.


Modules

The key result is the structure theorem: If ''R'' is a principal ideal domain, and ''M'' is a finitely generated ''R''-module, then M is a direct sum of cyclic modules, i.e., modules with one generator. The cyclic modules are isomorphic to R/xR for some x\in R (notice that x may be equal to 0, in which case R/xR is R). If ''M'' is a
free module In mathematics, a free module is a module that has a ''basis'', that is, a generating set that is linearly independent. Every vector space is a free module, but, if the ring of the coefficients is not a division ring (not a field in the commu ...
over a principal ideal domain ''R'', then every submodule of ''M'' is again free. This does not hold for modules over arbitrary rings, as the example (2,X) \subseteq \mathbb /math> of modules over \mathbb /math> shows.


Properties

In a principal ideal domain, any two elements have a
greatest common divisor In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers , , the greatest co ...
, which may be obtained as a generator of the ideal . 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 \mathbb\left frac 2\right/math>, this was proved by Theodore Motzkin and was the first case known. In this domain no and exist, with , so that (1+\sqrt)=(4)q+r, despite 1+\sqrt and 4 having a greatest common divisor of . Every principal ideal domain is a
unique factorization domain In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is ...
(UFD). The converse does not hold since for any UFD , the ring of polynomials in 2 variables is a UFD but is not a PID. (To prove this look at the ideal generated by \left\langle X,Y \right\rangle. It is not the whole ring since it contains no polynomials of degree 0, but it cannot be generated by any one single element.) #Every principal ideal domain is
Noetherian In mathematics, the adjective Noetherian is used to describe objects that satisfy an ascending or descending chain condition on certain kinds of subobjects, meaning that certain ascending or descending sequences of subobjects must have finite leng ...
. #In all unital rings,
maximal ideal In mathematics, more specifically in ring theory, a maximal ideal is an ideal that is maximal (with respect to set inclusion) amongst all ''proper'' ideals. In other words, ''I'' is a maximal ideal of a ring ''R'' if there are no other ideals ...
s are prime. In principal ideal domains a near converse holds: every nonzero prime ideal is maximal. #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, the following are equivalent. # ''A'' is a PID. # Every prime ideal of ''A'' is principal. # ''A'' is a Dedekind domain that is a UFD. # 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. # ''A'' admits a Dedekind–Hasse norm.Hazewinkel, Gubareni & Kirichenko (2004)
p.170
Proposition 7.3.3.
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 UFD if and only if it is a
GCD domain In mathematics, a GCD domain (sometimes called just domain) is an integral domain ''R'' with the property that any two elements have a greatest common divisor (GCD); i.e., there is a unique minimal principal ideal containing the ideal generated ...
(i.e., a domain where every two elements have a greatest common divisor) satisfying the ascending chain condition on principal ideals. 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

*
Bézout's identity In mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout who proved it for polynomials, is the following theorem: Here the greatest common divisor of and is taken to be . The integers and are called Bà ...


Notes


References

* Michiel Hazewinkel, Nadiya Gubareni, V. V. Kirichenko. ''Algebras, rings and modules''.
Kluwer Academic Publishers Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in ...
, 2004. * John B. Fraleigh, Victor J. Katz. ''A first course in abstract algebra''. Addison-Wesley Publishing Company. 5 ed., 1967. * Nathan Jacobson. Basic Algebra I. Dover, 2009. * Paulo Ribenboim. ''Classical theory of algebraic numbers''. Springer, 2001.


External links


Principal ring
on MathWorld {{DEFAULTSORT:Principal Ideal Domain Commutative algebra Ring theory