Euclidean domain: Difference between revisions

From Commalg
No edit summary
Line 27: Line 27:
===Standard examples===
===Standard examples===


* The [[ring of integers]] <math>\mathbb{Z}</math> is a Euclidean domain with Euclidean norm defined by the absolute value. {{proofat|[[Ring of integers is Euclidean with norm equal to absolute value]]}}
* The [[ring of rational integers]] <math>\mathbb{Z}</math> is a Euclidean domain with Euclidean norm defined by the absolute value. {{proofat|[[Ring of integers is Euclidean with norm equal to absolute value]]}}
* The [[polynomial ring over a field]] <math>k[x]</math> is a Euclidean domain with Euclidean norm defined by the degree of a polynomial. This is, in fact a ''uniquely'' Euclidean norm. and hence the polynomial ring over a field is a uniquely Euclidean domain. {{proofat|[[Polynomial ring over a field is uniquely Euclidean with norm equal to degree]]}}
* The [[polynomial ring over a field]] <math>k[x]</math> is a Euclidean domain with Euclidean norm defined by the degree of a polynomial. This is, in fact a ''uniquely'' Euclidean norm. and hence the polynomial ring over a field is a uniquely Euclidean domain. {{proofat|[[Polynomial ring over a field is uniquely Euclidean with norm equal to degree]]}}



Revision as of 01:09, 24 January 2009

This article defines a property of integral domains, viz., a property that, given any integral domain, is either true or false for that.
View other properties of integral domains | View all properties of commutative unital rings
VIEW RELATED: Commutative unital ring property implications | Commutative unital ring property non-implications |Commutative unital ring metaproperty satisfactions | Commutative unital ring metaproperty dissatisfactions | Commutative unital ring property satisfactions | Commutative unital ring property dissatisfactions

Definition

Symbol-free definition

An integral domain is said to be Euclidean if it admits a Euclidean norm.

Definition with symbols

An integral domain is termed a Euclidean domain if there exists a function from the set of nonzero elements of to the set of nonnegative integers satisfying the following properties:

  • if and only if is a unit
  • Given nonzero and in , there exist and such that and either or .

We call the dividend, the divisor, the quotient and the remainder.

Such a function is called a Euclidean norm on .

Caveats

  • The definition of Euclidean norm does not require the ring to be an integral domain. A commutative unital ring that admits a Euclidean norm is termed a Euclidean ring.
  • The definition of Euclidean domain does not require that and be uniquely determined from and . If and are uniquely determined from and , the integral domain is termed a uniquely Euclidean domain.

Examples

Standard examples

Other examples

Pathological examples

On a field, any norm function is Euclidean. This is because we can always choose a quotient so that the remainder is zero.

Relation with other properties

Stronger properties

Weaker properties

Properties of Euclidean norms

Euclidean norms can in general be very weirdly behaved, but some Euclidean norms are good. For a complete list of properties of Euclidean norms (i.e., properties against which a given Euclidean norm can be tested), refer:

Category:Properties of Euclidean norms

Here are some important properties that most typical Euclidean norms satisfy:

Metaproperties

Polynomial-closedness

This property of commutative unital rings is not closed under passing to the polynomial ring

The polynomial ring over a Euclidean domain need not be a Euclidean domain. One example is the polynomial ring with integer coefficients, which is not a Euclidean domain; another example is the polynomial ring in two variables over a field (which can be viewed as the polynomial ring in one variable, over the polynomial ring over a field).