Euclidean domain: Difference between revisions

Jump to navigation Jump to search
imported>1234qwer1234qwer4
 
imported>Kanguole
m Examples: italics
 
Line 32: Line 32:
=== Notes on the definition ===
=== Notes on the definition ===


Many authors use other terms in place of "Euclidean function", such as "degree function", "valuation function", "gauge function" or "norm function".<ref name="DummitAlgebra">{{Cite book|title=Abstract Algebra|last1=Dummit|first1=David S.|last2=Foote|first2=Richard M.|publisher=Wiley|year=2004|isbn=9780471433347 |page=270}}</ref> Some authors also require the [[domain of a function|domain]] of the Euclidean function to be the entire ring {{mvar|R}};<ref name="DummitAlgebra"/> however, this does not essentially affect the definition, since (EF1) does not involve the value of {{math|''f''&thinsp;(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.
Many authors use other terms in place of "Euclidean function", such as "degree function", "valuation function", "gauge function" or "norm function".<ref name="DummitAlgebra">{{Cite book|title=Abstract Algebra|last1=Dummit|first1=David S.|last2=Foote|first2=Richard M.|publisher=Wiley|year=2004|isbn=978-0-471-43334-7 |page=270}}</ref> Some authors also require the [[domain of a function|domain]] of the Euclidean function to be the entire ring {{mvar|R}};<ref name="DummitAlgebra"/> however, this does not essentially affect the definition, since (EF1) does not involve the value of {{math|''f''&thinsp;(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 {{mvar|I}} of {{mvar|R}} with nonzero generator {{mvar|b}}, all nonzero classes of the [[quotient ring]] {{math|''R''/''I''}} have a representative {{mvar|r}} with {{math|''f''&thinsp;(''r'') < ''f''&thinsp;(''b'')}}. Since the possible values of {{mvar|f}} are well-ordered, this property can be established by showing that {{math|''f''&thinsp;(''r'') < ''f''&thinsp;(''b'')}} for any {{math|''r'' ∉ ''I''}} with minimal value of {{math|''f''&thinsp;(''r'')}} in its class. Note that, for a Euclidean function that is so established, there need not exist an effective method to determine {{mvar|q}} and {{mvar|r}} in (EF1).
The property (EF1) can be restated as follows: for any principal ideal {{mvar|I}} of {{mvar|R}} with nonzero generator {{mvar|b}}, all nonzero classes of the [[quotient ring]] {{math|''R''/''I''}} have a representative {{mvar|r}} with {{math|''f''&thinsp;(''r'') < ''f''&thinsp;(''b'')}}. Since the possible values of {{mvar|f}} are well-ordered, this property can be established by showing that {{math|''f''&thinsp;(''r'') < ''f''&thinsp;(''b'')}} for any {{math|''r'' ∉ ''I''}} with minimal value of {{math|''f''&thinsp;(''r'')}} in its class. Note that, for a Euclidean function that is so established, there need not exist an effective method to determine {{mvar|q}} and {{mvar|r}} in (EF1).
Line 42: Line 42:
*{{math|'''Z'''}}, the ring of integers. Define {{math|''f''&thinsp;(''n'') {{=}} {{!}}''n''{{!}}}}, the [[absolute value]] of {{mvar|n}}.<ref>{{harvnb|Fraleigh|Katz|1967|p=377, Example 1}}</ref>
*{{math|'''Z'''}}, the ring of integers. Define {{math|''f''&thinsp;(''n'') {{=}} {{!}}''n''{{!}}}}, the [[absolute value]] of {{mvar|n}}.<ref>{{harvnb|Fraleigh|Katz|1967|p=377, Example 1}}</ref>
*{{math|'''Z'''[{{hairsp|''i''}}]}}, the ring of [[Gaussian integer]]s. Define {{math|''f''&thinsp;(''a'' + ''bi'') {{=}} ''a''{{sup|2}} + ''b''{{sup|2}}}}, the [[field norm|norm]] of the Gaussian integer {{math|''a'' + ''bi''}}.
*{{math|'''Z'''[{{hairsp|''i''}}]}}, the ring of [[Gaussian integer]]s. Define {{math|''f''&thinsp;(''a'' + ''bi'') {{=}} ''a''{{sup|2}} + ''b''{{sup|2}}}}, the [[field norm|norm]] of the Gaussian integer {{math|''a'' + ''bi''}}.
* {{math|'''Z'''[''ω'']}} (where {{math|''ω''}} is a [[Root of unity#General definition|primitive]] (non-[[real number|real]]) [[cube root of unity]]), the ring of [[Eisenstein integer]]s. Define {{math|''f''&thinsp;(''a'' + ''bω'') {{=}} ''a''{{sup|2}} − ''ab'' + ''b''{{sup|2}}}}, the norm of the Eisenstein integer {{math|''a'' + ''bω''}}.
* {{math|'''Z'''[''ω'']}} (where {{tmath|1=\omega=\tfrac{-1\pm \sqrt{-3} }{2} }} is a [[primitive root of unity|primitive cube root of unity]]), the ring of [[Eisenstein integer]]s. Define {{math|''f''&thinsp;(''a'' + ''bω'') {{=}} ''a''{{sup|2}} − ''ab'' + ''b''{{sup|2}}}}, the norm of the Eisenstein integer {{math|''a'' + ''bω''}}.
* {{math|'''Z'''[''φ'']}}, the ring of [[golden integer]]s, where {{mvar|''φ''}} is the [[golden ratio]]. Define {{math|''f''&thinsp;(''a'' + ''bφ'') {{=}} ''a''{{sup|2}} + ''ab'' − ''b''{{sup|2}}}}, the norm of {{math|''a'' + ''bφ''}}.
* {{math|'''Z'''[''φ'']}}, the ring of [[golden integer]]s, where {{tmath|1=\varphi=\tfrac{1+\sqrt 5}{2} }} is the [[golden ratio]]. Define {{math|''f''&thinsp;(''a'' + ''bφ'') {{=}} {{!}}''a''{{sup|2}} + ''ab'' − ''b''{{sup|2}}{{!}}}}, the absolute value of the [[field norm]] of {{math|''a'' + ''bφ''}}.  
*{{math|''K''[''X'']}}, the [[polynomial ring|ring of polynomials]] over a [[field (mathematics)|field]] {{mvar|K}}. For each nonzero polynomial {{mvar|P}}, define {{math|''f''&thinsp;(''P'')}} to be the [[degree of a polynomial|degree]] of {{mvar|P}}.<ref>{{harvnb|Fraleigh|Katz|1967|p=377, Example 2}}</ref>
*{{math|''K''[''X'']}}, the [[polynomial ring|ring of polynomials]] over a [[field (mathematics)|field]] {{mvar|K}}. For each nonzero polynomial {{mvar|P}}, define {{math|''f''&thinsp;(''P'')}} to be the [[degree of a polynomial|degree]] of {{mvar|P}}.<ref>{{harvnb|Fraleigh|Katz|1967|p=377, Example 2}}</ref>
*{{math|''K''{{brackets|''X''}}}}, the ring of [[formal power series]] over the field {{mvar|K}}. For each nonzero [[power series]] {{mvar|P}}, define {{math|''f''&thinsp;(''P'')}} as the [[order (power series)|order]] of {{mvar|P}}, that is the degree of the smallest power of {{mvar|X}} occurring in {{mvar|P}}. In particular, for two nonzero power series {{mvar|P}} and {{mvar|Q}}, {{math|''f''&thinsp;(''P'') ≤ ''f''&thinsp;(''Q'')}} if and only if {{mvar|P}} [[Formal power series#Dividing series|divides]] {{mvar|Q}}.
*{{math|''K''{{brackets|''X''}}}}, the ring of [[formal power series]] over the field {{mvar|K}}. For each nonzero [[power series]] {{mvar|P}}, define {{math|''f''&thinsp;(''P'')}} as the [[order (power series)|order]] of {{mvar|P}}, that is the degree of the smallest power of {{mvar|X}} occurring in {{mvar|P}}. In particular, for two nonzero power series {{mvar|P}} and {{mvar|Q}}, {{math|''f''&thinsp;(''P'') ≤ ''f''&thinsp;(''Q'')}} if and only if {{mvar|P}} [[Formal power series#Division|divides]] {{mvar|Q}}.
*Any [[discrete valuation ring]]. Define {{math|''f''&thinsp;(''x'')}} to be the highest power of the [[maximal ideal]] {{mvar|M}} containing {{mvar|x}}. Equivalently, let {{mvar|g}} be a generator of {{mvar|M}}, and {{mvar|v}} be the unique integer such that {{mvar|g{{hairsp}}{{sup|v}}}} is an [[associated elements|associate]] of {{mvar|x}}, then define {{math|''f''&thinsp;(''x'') {{=}} ''v''}}. The previous example {{math|''K''{{brackets|''X''}}}} is a special case of this.
*Any [[discrete valuation ring]]. Define {{math|''f''&thinsp;(''x'')}} to be the highest power of the [[maximal ideal]] {{mvar|M}} containing {{mvar|x}}. Equivalently, let {{mvar|g}} be a generator of {{mvar|M}}, and {{mvar|v}} be the unique integer such that {{mvar|g{{hairsp}}{{sup|v}}}} is an [[associated elements|associate]] of {{mvar|x}}, then define {{math|''f''&thinsp;(''x'') {{=}} ''v''}}. The previous example {{math|''K''{{brackets|''X''}}}} is a special case of this.
*A [[Dedekind domain]] with finitely many [[zero ideal|nonzero]] [[prime ideal]]s {{math|''P''{{sub|1}}, ..., ''P{{sub|n}}''}}.  Define <math>f(x) = \sum_{i=1}^n v_i(x)</math>, where {{mvar|v{{sub|i}}}} is the [[discrete valuation]] corresponding to the ideal {{mvar|P{{sub|i}}}}.<ref>{{Cite journal|last=Samuel|first=Pierre|date=1 October 1971|title=About Euclidean rings|journal=Journal of Algebra|volume=19|issue=2|pages=282–301 (p. 285)|doi=10.1016/0021-8693(71)90110-4|issn=0021-8693|doi-access=free}}</ref>
*A [[Dedekind domain]] with finitely many [[zero ideal|nonzero]] [[prime ideal]]s {{math|''P''{{sub|1}}, ..., ''P{{sub|n}}''}}.  Define <math>f(x) = \sum_{i=1}^n v_i(x)</math>, where {{mvar|v{{sub|i}}}} is the [[discrete valuation]] corresponding to the ideal {{mvar|P{{sub|i}}}}.<ref>{{Cite journal|last=Samuel|first=Pierre|date=1 October 1971|title=About Euclidean rings|journal=Journal of Algebra|volume=19|issue=2|pages=282–301 (p. 285)|doi=10.1016/0021-8693(71)90110-4|issn=0021-8693|doi-access=free}}</ref>
Line 51: Line 51:
Examples of domains that are ''not'' Euclidean domains include:
Examples of domains that are ''not'' Euclidean domains include:
* Every domain that is not a [[principal ideal domain]], such as the ring of polynomials in at least two indeterminates over a field, or the ring of univariate polynomials with integer [[coefficient]]s, or the number ring {{math|'''Z'''[{{hairsp|{{sqrt|&minus;5}}}}]}}.
* Every domain that is not a [[principal ideal domain]], such as the ring of polynomials in at least two indeterminates over a field, or the ring of univariate polynomials with integer [[coefficient]]s, or the number ring {{math|'''Z'''[{{hairsp|{{sqrt|&minus;5}}}}]}}.
* The [[ring of integers]] of {{math|'''Q'''({{hairsp|{{sqrt|−19}}}})}}, consisting of the numbers {{math|{{sfrac|''a'' + ''b''{{sqrt|&minus;19}}|2}}}} where {{mvar|a}} and {{mvar|b}} are integers and both even or both odd. It is a principal ideal domain that is not Euclidean. This was proved by [[Theodore Motzkin]] and was the first case known.<ref>{{Cite journal |last=Motzkin |first=Th |date=December 1949 |title=The Euclidean algorithm |url=https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society/volume-55/issue-12/The-Euclidean-algorithm/bams/1183514381.full |journal=Bulletin of the American Mathematical Society |volume=55 |issue=12 |pages=1142–1146 |doi=10.1090/S0002-9904-1949-09344-8 |issn=0002-9904|doi-access=free }}</ref>
* The [[ring of integers]] of {{math|'''Q'''({{hairsp|{{sqrt|−19}}}})}}, consisting of the numbers {{math|{{sfrac|''a'' + ''b''{{sqrt|&minus;19}}|2}}}} where {{mvar|a}} and {{mvar|b}} are integers and both even or both odd, is a principal ideal domain that is not Euclidean. This was proved by [[Theodore Motzkin]] and was the first case known<ref>{{Cite journal |last=Motzkin |first=Th |date=December 1949 |title=The Euclidean algorithm |url=https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society/volume-55/issue-12/The-Euclidean-algorithm/bams/1183514381.full |journal=Bulletin of the American Mathematical Society |volume=55 |issue=12 |pages=1142–1146 |doi=10.1090/S0002-9904-1949-09344-8 |issn=0002-9904|doi-access=free }}</ref> and subsequently proved for {{math|'''Q'''({{hairsp|{{sqrt|''D''}}}})}} for {{mvar|D}} = −19, −43, −67, −163.
* The ring {{math|1=''A'' = '''R'''[''X'', ''Y'']/(''X''<sup>&thinsp;2</sup> + ''Y''<sup>&thinsp;2</sup> + 1)}} is also a principal ideal domain<ref>
* The ring {{math|1=''A'' = '''R'''[''X'', ''Y'']/(''X''<sup>&thinsp;2</sup> + ''Y''<sup>&thinsp;2</sup> + 1)}} is also a principal ideal domain<ref>
{{cite book|first=Pierre|last=Samuel|url=http://www.math.tifr.res.in/~publ/ln/tifr30.pdf|title=Lectures on Unique Factorization Domains|date=1964|publisher=Tata Institute of Fundamental Research|isbn= |pages=27–28|author-link=}}
{{cite book|first=Pierre|last=Samuel|url=http://www.math.tifr.res.in/~publ/ln/tifr30.pdf|title=Lectures on Unique Factorization Domains|date=1964|publisher=Tata Institute of Fundamental Research|isbn= |pages=27–28}}
</ref> that is not Euclidean. To see that it is not a Euclidean domain, it suffices to show that for every non-zero prime <math>p\in A</math>, the map <math>A^\times\to(A/p)^\times</math> induced by the quotient map <math>A\to A/p</math> is not [[surjective]].<ref>
</ref> that is not Euclidean. To see that it is not a Euclidean domain, it suffices to show that for every non-zero prime <math>p\in A</math>, the map <math>A^\times\to(A/p)^\times</math> induced by the quotient map <math>A\to A/p</math> is not [[surjective]].<ref>
{{cite web
{{cite web
Line 63: Line 63:
  |website=
  |website=
  |publisher=
  |publisher=
|access-date=
  |quote=}}
  |quote=}}
</ref>
</ref>
Line 73: Line 72:
* 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 (logic)|converse]] also holds, and ''f'' takes its minimal value exactly at the invertible elements of ''R''.
* 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 (logic)|converse]] also holds, and ''f'' takes its minimal value exactly at the invertible elements of ''R''.
*If Euclidean division is algorithmic, that is, if there is an [[algorithm]] for computing the quotient and the remainder, then an [[extended Euclidean algorithm]] can be defined exactly as in the case of integers.<ref>{{harvnb|Fraleigh|Katz|1967|p=380, Theorem 7.7}}</ref>
*If Euclidean division is algorithmic, that is, if there is an [[algorithm]] for computing the quotient and the remainder, then an [[extended Euclidean algorithm]] can be defined exactly as in the case of integers.<ref>{{harvnb|Fraleigh|Katz|1967|p=380, Theorem 7.7}}</ref>
*If a Euclidean domain is not a field then it has a non-unit element ''a'' with the following property: any element ''x'' not divisible by ''a'' can be written as ''x'' = ''ay'' + ''u'' for some unit ''u'' and some element ''y''. This follows by taking ''a'' to be a non-unit with ''f''(''a'') as small as possible. This strange property can be used to show that some principal ideal domains are not Euclidean domains, as not all PIDs have this property.  For example, for ''d'' = −19, −43, −67, −163, the [[ring of integers]] of <math>\mathbf{Q}(\sqrt{d}\,)</math> is a PID which is {{em|not}} Euclidean (because it doesn't have this property), but the cases ''d'' = −1, −2, −3, −7, −11 {{em|are}} Euclidean.<ref>{{Citation
*If a Euclidean domain is not a field then it has a non-unit element ''a'' called a ''universal side divisor''<ref name="Motzkin">{{Citation
   | last = Motzkin | first = Theodore | author-link = Theodore Motzkin
   | last = Motzkin | first = Theodore | author-link = Theodore Motzkin
   | title = The Euclidean algorithm
   | title = The Euclidean algorithm
Line 80: Line 79:
   | url = http://projecteuclid.org/handle/euclid.bams/1183514381
   | url = http://projecteuclid.org/handle/euclid.bams/1183514381
   | doi = 10.1090/S0002-9904-1949-09344-8 | zbl=0035.30302
   | doi = 10.1090/S0002-9904-1949-09344-8 | zbl=0035.30302
| doi-access = free}}</ref>
| doi-access = free}}</ref><ref>{{cite book |last1=Alaca |first1=Şaban |last2=Williams |first2=Kenneth |title=Introductory Algebraic Number Theory |date=2003 |publisher=Cambridge University Press |location=Cambridge |isbn=978-0-521-83250-2 |page=44}}</ref><ref>{{cite book |last1=Rotman |first1=Joseph |title=Advanced Modern Algebra |date=2002 |publisher=Prentice Hall |isbn=0-13-087868-5 |page=154 |edition=1}}</ref><ref>{{cite book |last1=Dummit |first1=David |last2=Foote |first2=Richard |title=Abstract Algebra |date=2003 |publisher=Wiley |isbn=978-0-471-43334-7 |page=277 |edition=3}}</ref> with the following property: any element ''x'' not divisible by ''a'' can be written as ''x'' = ''ay'' + ''u'' for some unit ''u'' and some element ''y''. This follows by taking ''a'' to be a non-unit with ''f''(''a'') as small as possible. This strange property can be used to show that some principal ideal domains are not Euclidean domains, as not all PIDs have this property.  For example, for ''d'' = −19, −43, −67, −163, the [[ring of integers]] of <math>\mathbf{Q}(\sqrt{d}\,)</math> is a PID which is {{em|not}} Euclidean (because it doesn't have this property), but the cases ''d'' = −1, −2, −3, −7, −11 {{em|are}} Euclidean.<ref name="Motzkin"/>


However, in many [[finite extension]]s of '''Q''' with [[trivial group|trivial]] [[Ideal class group|class group]], the ring of integers is Euclidean (not necessarily with respect to the absolute value of the field norm; see below).
However, in many [[finite extension]]s of '''Q''' with [[trivial group|trivial]] [[Ideal class group|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 [[field extension|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.<ref>{{Citation
Assuming the [[extended Riemann hypothesis]], if ''K'' is a finite [[field extension|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.<ref>{{cite conference
   | last = Weinberger | first = Peter J. | author-link = Peter J. Weinberger
   | last = Weinberger | first = Peter J. | author-link = Peter J. Weinberger
|editor-first=Harold G. |editor-last=Diamond
   | title = On Euclidean rings of algebraic integers
   | title = On Euclidean rings of algebraic integers
   | journal = Proceedings of Symposia in Pure Mathematics
   | book-title=Analytic Number Theory
   | publisher = AMS
|series=Proceedings of Symposia in Pure Mathematics Vol. 24
   | volume = 24 | pages = 321–332 | year = 1973
   | publisher = American Mathematical Society
| doi = 10.1090/pspum/024/0337902 | isbn = 9780821814246 }}</ref>
   |location=Providence, Rhode Island
| pages = 321–332 | year = 1973
| doi = 10.1090/pspum/024/0337902 | isbn = 0-8218-1424-9}}</ref>
In particular this applies to the case of [[totally real field|totally real]] [[quadratic field|quadratic number fields]] with trivial class group.
In particular this applies to the case of [[totally real field|totally real]] [[quadratic field|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 [[Dirichlet's unit theorem|unit rank]] strictly greater than three, then the ring of integers is Euclidean.<ref>{{Citation
In addition (and without assuming ERH), if the field ''K'' is a [[Galois extension]] of '''Q''', has trivial class group and [[Dirichlet's unit theorem|unit rank]] strictly greater than three, then the ring of integers is Euclidean.<ref>{{Citation
Line 107: Line 109:
== Norm-Euclidean fields ==
== Norm-Euclidean fields ==


[[Algebraic number field]]s ''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 [[Conjugate element (field theory)|conjugates]] of ''α''.  This norm maps the [[ring of integers]] of a number field ''K'', say ''O''<sub>''K''</sub>, to the nonnegative [[Integer|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''.<ref name="RibAlgNum">{{cite book | title=Algebraic Numbers | publisher=Wiley-Interscience | author=Ribenboim, Paulo | year=1972 | isbn=978-0-471-71804-8}}</ref><ref name="HardyWright">{{cite book |first1=G.H. |last1=Hardy |first2=E.M. |last2=Wright |first3=Joseph |last3=Silverman |first4=Andrew |last4=Wiles |title=An Introduction to the Theory of Numbers |url=https://books.google.com/books?id=P6uTBqOa3T4C&pg=PP1 |date=2008 |publisher=Oxford University Press |edition=6th |isbn=978-0-19-921986-5 }}</ref>  Strictly speaking it is the ring of integers that is Euclidean since fields are trivially Euclidean domains, but the terminology is standard.
[[Algebraic number field]]s ''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 [[Conjugate element (field theory)|conjugates]] of ''α''.  This norm maps the [[ring of integers]] of a number field ''K'', say ''O''<sub>''K''</sub>, to the nonnegative [[Integer|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''.<ref name="RibAlgNum">{{cite book | title=Algebraic Numbers | publisher=Wiley-Interscience | author=Ribenboim, Paulo | year=1972 | isbn=978-0-471-71804-8}}</ref><ref name="HardyWright">{{cite book |first1=G.H. |last1=Hardy |author-link=G. H. Hardy |first2=E.M. |last2=Wright |author-link2=E. M. Wright |first3=Joseph |last3=Silverman |author-link3=Joseph H. Silverman |first4=Andrew |last4=Wiles |author-link4=Andrew Wiles |title=An Introduction to the Theory of Numbers |url=https://books.google.com/books?id=P6uTBqOa3T4C&pg=PP1 |date=2008 |publisher=Oxford University Press |edition=6th |isbn=978-0-19-921986-5 }}</ref>  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:
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:
Line 116: Line 118:


The norm-Euclidean [[quadratic field]]s have been fully classified; they are <math>\mathbf{Q}(\sqrt{d}\,)</math> where <math>d</math> takes the values
The norm-Euclidean [[quadratic field]]s have been fully classified; they are <math>\mathbf{Q}(\sqrt{d}\,)</math> where <math>d</math> takes the values
:−11, −7, −3, −2, −1, 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, 73 {{OEIS|id=A048981}}.<ref>{{cite book | last = LeVeque | first = William J. | author-link = William J. LeVeque | title = Topics in Number Theory|volume=I and II | publisher = Dover | year = 2002 | orig-year = 1956 | isbn = 978-0-486-42539-9 | zbl = 1009.11001 | pages = [https://archive.org/details/topicsinnumberth0000leve/page/ II:57,81] | url = https://archive.org/details/topicsinnumberth0000leve/page/ }}</ref>
:−11, −7, −3, −2, −1, 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, 73 {{OEIS|id=A048981}}.<ref>{{cite book | last = LeVeque | first = William J. | author-link = William J. LeVeque | title = Topics in Number Theory|volume=I and II | publisher = Dover | year = 2002 | orig-date = 1956 | isbn = 978-0-486-42539-9 | zbl = 1009.11001 | pages = [https://archive.org/details/topicsinnumberth0000leve/page/ II:57,81] | url = https://archive.org/details/topicsinnumberth0000leve/page/ }}</ref>


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