Euclidean domain
In abstract algebra, a Euclidean domain is a type of ring in which the Euclidean algorithm can be used.
More precisely, a Euclidean domain is an integral domain D for which can be defined a function g mapping nonzero elements of D to non-negative integers and possessing the following properties:
- For all nonzero a and b in D, g(ab) ≥ g(a).
- 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 g(r) < g(b).
The function g is variously called a gauge, valuation or norm.
Note that some authors define the function in an inequivalent way which nonetheless still gives the same class of rings.
Examples of Euclidean domains include:
- Z, the ring of integers. Define g(n) = |n|, the absolute value of n.
- Z[i], the ring of Gaussian integers. Define g(z) = |z|2.
- K[X], the ring of polynomials over a field K. For each nonzero polynomial P, define g(P) to be the degree of P.
- Any field. Define g(x) = 1 for all nonzero x.
Every Euclidean domain is a principal ideal domain.
In fact, if I is a nonzero ideal of a Euclidean domain D and a nonzero a in I is chosen to minimize g(a), then I = aD.
The name comes from the fact that the extended Euclidean algorithm can be carried out in any Euclidean domain.