Principal ideal domain

Last updated

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.

Contents

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:

rngs rings commutative rings integral domains integrally closed domains GCD domains unique factorization domains principal ideal domains Euclidean domains fields algebraically closed fields

Examples

Examples include:

Non-examples

Examples of integral domains that are not PIDs:

Modules

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.

Properties

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

Notes

  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 math.sc.edu Retrieved 31 March 2023
  6. Wilson, Jack C. "A Principal Ring that is Not a Euclidean Ring." Math. Mag 46 (Jan 1973) 34-38
  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.

Related Research Articles

In mathematics, Bézout's identity, named after Étienne Bézout who proved it for polynomials, is the following theorem:

In mathematics, more specifically in ring theory, a Euclidean domain is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of integers. This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements. In particular, the greatest common divisor of any two elements exists and can be written as a linear combination of them. Also every ideal in a Euclidean domain is principal, which implies a suitable generalization of the fundamental theorem of arithmetic: every Euclidean domain is a unique factorization 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 divisibility. In an integral domain, every nonzero element a has the cancellation property, that is, if a ≠ 0, an equality ab = ac implies b = c.

<span class="mw-page-title-main">Prime ideal</span> Ideal in a ring which has properties similar to prime elements

In algebra, a prime ideal is a subset of a ring that shares many important properties of a prime number in the ring of integers. The prime ideals for the integers are the sets that contain all the multiples of a given prime number, together with the zero ideal.

In mathematics, a unique factorization domain (UFD) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is an integral domain in which every non-zero non-unit element can be written as a product of irreducible elements, uniquely up to order and units.

In mathematics, a commutative ring is a 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 properties that are not specific to commutative rings. This distinction results from the high number of fundamental properties of commutative rings that do not extend to noncommutative rings.

<span class="mw-page-title-main">Factorization</span> (Mathematical) decomposition into a product

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4.

In mathematics, specifically ring theory, a principal ideal is an ideal in a ring that is generated by a single element of through multiplication by every element of The term also has another, similar meaning in order theory, where it refers to an (order) ideal in a poset generated by a single element which is to say the set of all elements less than or equal to in

In abstract algebra, a Dedekind domain or Dedekind ring, named after Richard Dedekind, is an integral domain in which every nonzero proper ideal factors into a product of prime ideals. It can be shown that such a factorization is then necessarily unique up to the order of the factors. There are at least three other characterizations of Dedekind domains that are sometimes taken as the definition: see below.

In number theory, the ideal class group of an algebraic number field K is the quotient group JK /PK where JK is the group of fractional ideals of the ring of integers of K, and PK is its subgroup of principal ideals. The class group is a measure of the extent to which unique factorization fails in the ring of integers of K. The order of the group, which is finite, is called the class number of K.

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

In mathematics, the ring of integers of an algebraic number field is the ring of all algebraic integers contained in . An algebraic integer is a root of a monic polynomial with integer coefficients: . This ring is often denoted by or . Since any integer belongs to and is an integral element of , the ring is always a subring of .

In mathematics, in particular commutative algebra, the concept of fractional ideal is introduced in the context of integral domains and is particularly fruitful in the study of Dedekind domains. In some sense, fractional ideals of an integral domain are like ideals where denominators are allowed. In contexts where fractional ideals and ordinary ring ideals are both under discussion, the latter are sometimes termed integral ideals for clarity.

In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a statement about polynomials over the integers, or, more generally, over a unique factorization domain. Gauss's lemma underlies all the theory of factorization and greatest common divisors of such polynomials.

In mathematics, a GCD 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 by two given elements. Equivalently, any two elements of R have a least common multiple (LCM).

In mathematics, a Bézout domain is a form of a Prüfer domain. It is an integral domain in which the sum of two principal ideals is again a principal ideal. This means that for every pair of elements a Bézout identity holds, and that every finitely generated ideal is principal. Any principal ideal domain (PID) is a Bézout domain, but a Bézout domain need not be a Noetherian ring, so it could have non-finitely generated ideals ; if so, it is not a unique factorization domain (UFD), but still is a GCD domain. The theory of Bézout domains retains many of the properties of PIDs, without requiring the Noetherian property. Bézout domains are named after the French mathematician Étienne Bézout.

In mathematics, a Prüfer domain is a type of commutative ring that generalizes Dedekind domains in a non-Noetherian context. These rings possess the nice ideal and module theoretic properties of Dedekind domains, but usually only for finitely generated modules. Prüfer domains are named after the German mathematician Heinz Prüfer.

In commutative algebra, an integrally closed domainA is an integral domain whose integral closure in its field of fractions is A itself. Spelled out, this means that if x is an element of the field of fractions of A that is a root of a monic polynomial with coefficients in A, then x is itself an element of A. Many well-studied domains are integrally closed, as shown by the following chain of class inclusions:

In number theory, quadratic integers are a generalization of the usual integers to quadratic fields. Quadratic integers are algebraic integers of degree two, that is, solutions of equations of the form

References