Euclidean domain

From formulasearchengine
Jump to navigation Jump to search

In mathematics, more specifically in abstract algebra and ring theory, a Euclidean domain (also called a Euclidean ring) is a ring that can be endowed with a Euclidean function (explained below) which allows a suitable generalization of the Euclidean division of the 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 (Bézout's identity). 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.

It is important to compare the class of Euclidean domains with the larger class of principal ideal domains (PIDs). An arbitrary PID has much the same "structural properties" of a Euclidean domain (or, indeed, even of the ring of integers), but when an explicit algorithm for Euclidean division is known, one may use Euclidean algorithm and extended Euclidean algorithm to compute greatest common divisors and Bézout's identity. In particular, the existence of efficient algorithms for Euclidean division of integers and of polynomials in one variable over a field is of basic importance in computer algebra.

So, given an integral domain R, it is often very useful to know that R has a Euclidean function: in particular, this implies that R is a PID. However, if there is no "obvious" Euclidean function, then determining whether R is a PID is generally a much easier problem than determining whether it is a Euclidean domain.

Euclidean domains appear in the following chain of class inclusions:

Commutative ringsintegral domainsintegrally closed domainsunique factorization domainsprincipal ideal domainsEuclidean domainsfields


Let R be an integral domain. A Euclidean function on R is a function from to the non-negative integers satisfying the following fundamental division-with-remainder property:

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

A Euclidean domain is an integral domain which can be endowed with at least one Euclidean function. It is important to note that a particular Euclidean function f is not part of the structure of a Euclidean domain: in general, a Euclidean domain will admit many different Euclidean functions.

Most algebra texts require a Euclidean function to have the following additional property:

  • (EF2) For all nonzero a and b in R, f(a) ≤ f(ab).

However, one can show that (EF2) is superfluous in the following sense: any domain R which can be endowed with a function g satisfying (EF1) can also be endowed with a function f satisfying (EF1) and (EF2): indeed, for one can define f(a) as follows[1]

In words, one may define f(a) to be the minimum value attained by g on the set of all non-zero elements of the principal ideal generated by a.

A multiplicative Euclidean function is one such that f(ab)=f(a)f(b) and f(a) is never zero. It follows that f(1)=1 and in fact f(a)=1 if and only if a is a unit.

Notes on the definition

Many authors use other terms such as "degree function", "valuation function", "gauge function" or "norm function", in place of "Euclidean function".{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} Some authors also require the domain of the Euclidean function to be the entire ring R;[2] however this does not essentially affect the definition, since (EF1) does not involve the value of f(0). The definition is sometimes generalized by allowing the Euclidean function to take its values in any well-ordered set; this weakening does not affect the most important implications of the Euclidean property.

The property (EF1) can be restated as follows: for any principal ideal I of R with nonzero generator b, all nonzero classes of the quotient ring R/I have a representative r with f(r) < f(b). Since the possible values of f are well-ordered, this property can be established by proving f(r) < f(b) for any r (not in I) with minimal value of f(r) in its class. Note that for a Euclidean function that is so established there need not exist an effective method to determine q and r in (EF1).


Examples of Euclidean domains include:

Example of domains that are not Euclidean domains include

{{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}


Let R be a domain and f a Euclidean function on R. Then:

  • R is a principal ideal domain (PID). In fact, if I is a nonzero ideal of R then any element a of I\{0} with minimal value (on that set) of f(a) is a generator of I.[5] As a consequence R is also a unique factorization domain and a Noetherian ring. With respect to general principal ideal domains, the existence of factorizations (i.e., that R is an atomic domain) is particularly easy to prove in Euclidean domains: choosing a Euclidean function f satisfying (EF2), x cannot have any decomposition into more than f(x) nonunit factors, so starting with x and repeatedly decomposing reducible factors is bound to produce a factorization into irreducible elements.
  • Any element of R at which f takes its globally minimal value is invertible in R. If an f satisfying (EF2) is chosen, then the converse also holds, and f takes its minimal value exactly at the invertible elements of R.
  • If the Euclidean property is algorithmic, i.e., if there is a division algorithm that for given a and nonzero b produces a quotient q and remainder r with a = bq + r and either r = 0 or f(r) < f(b), then an extended Euclidean algorithm can be defined in terms of this division operation.[6]

Not every PID is Euclidean. For example, for d = −19, −43, −67, −163, the ring of integers of is a PID which is not Euclidean, but the cases d = −1, −2, −3, −7, −11 are Euclidean.[7]

However, in many finite extensions of Q with trivial class group, the ring of integers is Euclidean (not necessarily with respect to the absolute value of the field norm; see below). 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.[8] 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 is a Galois extension of Q, has trivial class group and unit rank strictly greater than three, then the ring of integers is Euclidean.[9] An immediate corollary of this is that if the number field is Galois over Q, its class group is trivial and the extension has degree greater than 8 then the ring of integers is necessarily Euclidean.

Norm-Euclidean fields

Algebraic number fields K come with a canonical norm function on them: the absolute value of the field norm N that takes an algebraic element α to the product of all the conjugates of α. This norm maps the ring of integers of a number field K, say OK, to the nonnegative rational integers, so it is a candidate to be a Euclidean norm on this ring. If this norm satisfies the axioms of a Euclidean function then the number field K is called norm-Euclidean or simply Euclidean.[10][11] Strictly speaking it is the ring of integers that is Euclidean since fields are trivially Euclidean domains, but the terminology is standard.

If a field is not norm-Euclidean then that does not mean the ring of integers is not Euclidean, just that the field norm does not satisfy the axioms of a Euclidean function. In fact, the rings of integers of number fields may be divided in several classes:

The norm-Euclidean quadratic fields have been fully classified, they are where d takes the values

−11, −7, −3, −2, −1, 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, 73 (sequence A048981 in OEIS).[13]

Every Euclidean imaginary quadratic field is norm-Euclidean and is one of the five first fields in the preceding list.

See also


  1. {{#invoke:citation/CS1|citation |CitationClass=citation }}
  2. E.g., Dummit and Foote, Abstract Algbra, 3rd edition, p. 270
  3. Fraleigh & Katz (1967), p. 377, Example 1
  4. Fraleigh & Katz (1967), p. 377, Example 2
  5. Fraleigh & Katz (1967), p. 377, Theorem 7.4
  6. Fraleigh & Katz (1967), p. 380, Theorem 7.7
  7. {{#invoke:citation/CS1|citation |CitationClass=citation }}
  8. {{#invoke:citation/CS1|citation |CitationClass=citation }}
  9. {{#invoke:citation/CS1|citation |CitationClass=citation }}
  10. {{#invoke:citation/CS1|citation |CitationClass=book }}
  11. {{#invoke:citation/CS1|citation |CitationClass=book }}
  12. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  13. {{#invoke:citation/CS1|citation |CitationClass=book }}


  • John B. Fraleigh, Victor J. Katz. A first course in abstract algebra. Addison-Wesley Publishing Company. 5 ed., 1967. ISBN 0-201-53467-3
  • Pierre Samuel, "About Euclidean rings", Journal of Algebra 19 (1971) 282-301.