Euclidean domain: Difference between revisions
No edit summary |
|||
(12 intermediate revisions by the same user not shown) | |||
Line 2: | Line 2: | ||
==Definition== | ==Definition== | ||
===Symbol-free definition=== | |||
An [[integral domain]] is said to be '''Euclidean''' if it admits a [[defining ingredient::Euclidean norm]]. | |||
===Definition with symbols=== | ===Definition with symbols=== | ||
Line 7: | Line 11: | ||
An [[integral domain]] <math>R</math> is termed a '''Euclidean domain''' if there exists a function <math>N</math> from the set of nonzero elements of <math>R</math> to the set of nonnegative integers satisfying the following properties: | An [[integral domain]] <math>R</math> is termed a '''Euclidean domain''' if there exists a function <math>N</math> from the set of nonzero elements of <math>R</math> to the set of nonnegative integers satisfying the following properties: | ||
* <math> | * <math>N(x) = 0</math> if and only if <math>x</math> is a unit | ||
* Given nonzero <math>a</math> and <math>b</math> in <math>R</math>, there exist <math>q</math> and <math>r</math> such that <math>a = qb + r</math> and either <math>r = 0</math> or <math>N(r) < N(b)</math>. | * Given nonzero <math>a</math> and <math>b</math> in <math>R</math>, there exist <math>q</math> and <math>r</math> such that <math>a = qb + r</math> and either <math>r = 0</math> or <math>N(r) < N(b)</math>. | ||
We call <math>a</math> the ''dividend'', <math>b</math> the ''divisor'', <math>q</math> the ''quotient'' and <math>r</math> the ''remainder''. | We call <math>a</math> the ''dividend'', <math>b</math> the ''divisor'', <math>q</math> the ''quotient'' and <math>r</math> the ''remainder''. | ||
The definition of Euclidean domain does not require that <math>q</math> and <math>r</math> be uniquely determined from <math>a</math> and <math>b</math>. If <math>q</math> and <math>r</math> | Such a function <math>N</math> is called a [[Euclidean norm]] on <math>R</math>. | ||
===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 <math>q</math> and <math>r</math> be uniquely determined from <math>a</math> and <math>b</math>. If <math>q</math> and <math>r</math> are uniquely determined from <math>a</math> and <math>b</math>, the integral domain is termed a [[uniquely Euclidean domain]]. | |||
==Examples== | |||
===Standard examples=== | |||
* 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]]}} | |||
===Other examples=== | |||
* The [[ring of Gaussian integers]] <math>\mathbb{Z}[i]</math> is a Euclidean domain with Euclidean norm equal to the norm in the sense of a quadratic integer ring. {{proofat|[[Ring of Gaussian integers is norm-Euclidean]]}} | |||
* A quadratic integer ring, or more generally, a [[ring of integers in a number field]], is termed [[norm-Euclidean ring of integers in a number field]] if it is Euclidean with respect to the algebraic norm. Since there is a correspondence between number fields and their rings of integers, we often abuse language and say that the number field itself is norm-Euclidean. | |||
* Any [[discrete valuation ring]] is a Euclidean domain where the norm of an element is given by the largest power of the irreducible that divides it. For instance, the [[formal power series ring over a field]] is a Euclidean domain, where the norm of a formal power series is the smallest <math>n</math> for which the coefficient of <math>x^n</math> that is nonzero. | |||
===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== | ==Relation with other properties== | ||
Line 18: | Line 44: | ||
===Stronger properties=== | ===Stronger properties=== | ||
{| class="sortable" border="1" | |||
! Property !! Meaning !! Proof of implication !! Proof of strictness (reverse implication failure) !! Intermediate notions | |||
|- | |||
| [[Weaker than::uniquely Euclidean domain]] || there is a [[Euclidean norm]] for which Euclidean division is unique. || || || {{intermediate notions short|Euclidean domain|uniquely Euclidean domain}} | |||
|- | |||
| [[Weaker than::Polynomial ring over a field]] || it can be written as the [[polynomial ring]] <math>K[x]</math> for a [[field]] <math>K</math>. || || || {{intermediate notions short|Euclidean domain|polynomial ring over a field}} | |||
|} | |||
===Weaker properties=== | ===Weaker properties=== | ||
{| class="sortable" border="1" | |||
! Property !! Meaning !! Proof of implication !! Proof of strictness (reverse implication failure) !! Intermediate notions | |||
|- | |||
| [[Stronger than::multi-stage Euclidean domain]] || || || || {{intermediate notions short|multi-stage Euclidean domain|Euclidean domain}} | |||
|- | |||
| [[Stronger than::principal ideal domain]] || [[integral domain]] that is a [[principal ideal ring]] || [[Euclidean implies PID]] || [[PID not implies Euclidean]] || {{intermediate notions short|principal ideal domain|Euclidean domain}} | |||
|- | |||
| [[Stronger than::Bezout domain]] || [[integral domain]] in which every [[finitely generated ideal]] is [[principal ideal|principal]] || || || {{intermediate notions short|Bezout domain|Euclidean domain}} | |||
|- | |||
| [[Stronger than::unique factorization domain]] || || || || {{intermediate notions short|unique factorization domain|Euclidean domain}} | |||
|- | |||
| [[Stronger than::Dedekind domain]] || Noetherian, normal, one-dimensional domain || || || {{intermediate notions short|Dedekind domain|Euclidean domain}} | |||
|- | |||
| [[Stronger than::Noetherian domain]] || [[integral domain]] and every ideal is finitely generated || || || {{intermediate notions short|Noetherian domain|Euclidean domain}} | |||
|- | |||
| [[Stronger than::Noetherian ring]] || every ideal is finitely generated || || || {{intermediate notions short|Noetherian ring|Euclidean domain}} | |||
|} | |||
===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: | |||
* [[Multiplicatively monotone Euclidean norm]] | |||
==Metaproperties== | |||
{{not poly-closed curing property}} | |||
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). | |||
Latest revision as of 16:11, 12 November 2023
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
- The ring of rational integers is a Euclidean domain with Euclidean norm defined by the absolute value. For full proof, refer: Ring of integers is Euclidean with norm equal to absolute value
- The polynomial ring over a field 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. For full proof, refer: Polynomial ring over a field is uniquely Euclidean with norm equal to degree
Other examples
- The ring of Gaussian integers is a Euclidean domain with Euclidean norm equal to the norm in the sense of a quadratic integer ring. For full proof, refer: Ring of Gaussian integers is norm-Euclidean
- A quadratic integer ring, or more generally, a ring of integers in a number field, is termed norm-Euclidean ring of integers in a number field if it is Euclidean with respect to the algebraic norm. Since there is a correspondence between number fields and their rings of integers, we often abuse language and say that the number field itself is norm-Euclidean.
- Any discrete valuation ring is a Euclidean domain where the norm of an element is given by the largest power of the irreducible that divides it. For instance, the formal power series ring over a field is a Euclidean domain, where the norm of a formal power series is the smallest for which the coefficient of that is nonzero.
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
Property | Meaning | Proof of implication | Proof of strictness (reverse implication failure) | Intermediate notions |
---|---|---|---|---|
uniquely Euclidean domain | there is a Euclidean norm for which Euclidean division is unique. | click here | ||
Polynomial ring over a field | it can be written as the polynomial ring for a field . | click here |
Weaker properties
Property | Meaning | Proof of implication | Proof of strictness (reverse implication failure) | Intermediate notions |
---|---|---|---|---|
multi-stage Euclidean domain | click here | |||
principal ideal domain | integral domain that is a principal ideal ring | Euclidean implies PID | PID not implies Euclidean | click here |
Bezout domain | integral domain in which every finitely generated ideal is principal | click here | ||
unique factorization domain | click here | |||
Dedekind domain | Noetherian, normal, one-dimensional domain | click here | ||
Noetherian domain | integral domain and every ideal is finitely generated | click here | ||
Noetherian ring | every ideal is finitely generated | click here |
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).