Euclidean domain

From Wikipedia, the free encyclopedia

In abstract algebra, a Euclidean domain (also called a Euclidean ring) is a type of ring in which the Euclidean algorithm applies.

A Euclidean domain is a specific type of integral domain, and can be characterized by the following (not necessarily exhaustive) chain of class inclusions:

• integral domains ⊃ unique factorization domains ⊃ principal ideal domains ⊃ Euclidean domains ⊃ fields

Contents 1 Definition 2 Examples 3 Properties 4 See also 5 References

[edit] Definition

Formally, a Euclidean domain is an integral domain D on which one can define a function v mapping nonzero elements of D to non-negative integers that satisfies the following division-with-remainder property:

• If a and b are in D and b is nonzero, then there are q and r in D such that a = bq + r and either r = 0 or v(r) < v(b).

The function v is called a valuation or norm or gauge and the key point here is that the remainder r has v-size smaller than the v-size of the divisor b. The operation mapping (a, b) to (q, r) is called the Euclidean division, whereas q is called the Euclidean quotient.

Nearly all algebra textbooks which discuss Euclidean domains include the following extra property in the definition:

• for all nonzero a and b in D, v(a) ≤ v(ab).

This property does not have to be assumed since it is not needed to prove the most basic facts about Euclidean domains (see below). However, this inequality can always be arranged to occur by changing the choice of v, as follows: if (D,v) is a Euclidean domain as given above then the function w defined on nonzero elements of D by w(a) = least value of v(ax) as x runs over nonzero elements of D also makes D a Euclidean domain according to the above definition and it satisfies w(a) ≤ w(ab) for all nonzero a and b in D.

To check that w is a norm, suppose that b does not divide a and, amongst all expressions of the form a = bq + r, choose one for which v(r) is minimal. If w(r) ≥ w(b), then v(r) ≥v(bc) for some c. We can write a = bcQ + R with v(R) < v(bc) ≤ v(r), which contradicts the minimality of v(r).

[edit] Examples

Examples of Euclidean domains include:

• Z, the ring of integers. Define v(n) = |n|, the absolute value of n.
• Z[i], the ring of Gaussian integers. Define v(a+bi) = a²+b², the norm of the Gaussian integer a+bi.
• Z[ω] (where ω is a cube root of 1), the ring of Eisenstein integers. Define v(a+bω) = a²-ab+b², the norm of the Eisenstein integer a+bω.
• K[X], the ring of polynomials over a field K. For each nonzero polynomial f, define v(f) to be the degree of f.
• K[[X]], the ring of formal power series over the field K. For each nonzero power series f, define v(f) as the degree of the smallest power of X occurring in f.
• Any discrete valuation ring. Define v(x) to be the highest power of the maximal ideal M containing x (equivalently, to the power of the generator of the maximal ideal that x is associated to). The case K[[X]] is a special case of the above.
• Any field. Define v(x) = 1 for all nonzero x.

The examples of polynomial and power series rings in one variable are the reason that the function v in the definition of a Euclidean domain is not assumed to be defined at 0.

[edit] Properties

The following properties of Euclidean domains do not require the inequality v(a) ≤ v(ab):

• The extended Euclidean algorithm is applicable (which is the source of the name Euclidean domain).

• Every Euclidean domain is a principal ideal domain. In fact, if I is a nonzero ideal of a Euclidean domain D and a is chosen to minimize v(a) over all nonzero elements of I, then I = aD.

• The principal ideals of elements with minimal Euclidean valuation are the entire ring, i.e. they are units. (If the inequality v(a) ≤ v(ab) is assumed, all the units have this minimal valuation.)

• Every nonzero nonunit is a product of irreducibles. This follows from the corresponding result for any principal ideal domain (or Noetherian domain), though assuming the inequality v(a) ≤ v(ab) would enable a direct inductive argument.

Conversely, not every PID is Euclidean, though exceptions are not easy to find. For example, for d = -19, -43, -67, -163, the ring of integers of Q() is a PID which is not Euclidean, but the cases d = -1, -2, -3, -7, -11 are Euclidean.^[1]

However, many finite extensions of Q with trivial class group do have Euclidean integral rings. Assuming the extended Riemann hypothesis, if K is a finite extension of Q and the ring of integers of K is a PID with an infinite number of units, then the ring of integers is Euclidean.^[2] In particular this applies to the case of totally real quadratic number fields with trivial class group. In addition (and without assuming ERH), if the field K has trivial class group and unit rank strictly greater than three, then the ring of integers is Euclidean.^[3] An immediate corollary of this is that if the class group is trivial and the extension has degree greater than 8 then the ring of integers is necessarily Euclidean.

[edit] See also

• Ordinal number - these allow a kind of Euclidean division: for all α and β, if β > 0, then there are unique γ and δ such that α = β · γ + δ and δ < β; however, the ordinals are not a Euclidean domain, since they are not even a ring (addition of ordinals, for example, is not commutative).

[edit] References

1. ^ Motzkin, Theodore (1949), “The Euclidean algorithm”, Bulletin of the American Mathematical Society 55 (12): 1142-1146, <http://projecteuclid.org/handle/euclid.bams/1183514381> 
2. ^ Weinberger, Peter J. (1973), “On Euclidean rings of algebraic integers”, Proceedings of Symposia in Pure Mathematics (AMS) 24: 321-332 
3. ^ Harper, Malcolm & Murty, M. Ram (2004), “Euclidean rings of algebraic integers”, Canadian Journal of Mathematics 56 (1): 71-76, <http://www.mast.queensu.ca/~murty/harper-murty.pdf>