Euclidean rings of -integers in complex quadratic fields
Abstract
We give an elementary approach to studying whether rings of -integers in complex quadratic fields are Euclidean with respect to the -norm.
1 Introduction
In a first course on elementary number theory, one establishes the Fundamental Theorem of Arithmetic, which says that every positive integer factors uniquely as product of primes. In the standard proof, one needs to know that for any prime , if divides , then divides or divides . This seemingly obvious fact about primes is usually derived from the Euclidean algorithm. The following crucial property of allows one to show that the Euclidean algorithm terminates in a finite number of steps: For all , , there exists such that and . Equivalently, this “Euclidean property” reads: For all there exists such that .
Algebraic number fields are one of the main objects of study in algebraic number theory. The simplest number fields other than the rational numbers are the complex quadratic fields which take the form
where is squarefree. We view as a subset of the complex numbers . Let denote the norm function (which multiplies an element by its conjugate)
One has for all , as is verified by direct computation. Let denote the ring of integers in , which consists of those elements that satisfy a monic polynomial with integer coefficients. One can show with
The ring in is the analogue of in , but properties enjoyed by (such as unique factorization) do not always hold in .
We now give the classical generalization of the Euclidean algorithm. We call norm-Euclidean if for every there exists such that ; this is equivalent to the condition that is a Euclidean ring with respect to the function . It is known that is norm-Euclidean exactly when . This goes back to Dedekind’s supplement to Dirichlet’s book [4].
Let be a finite (possibly empty) set of primes, and let be the set of all finite products of elements in (where by convention). In this paper, we are interested in the so-called ring of -integers
This is an example of the ring-of-fractions construction one might encounter in a first course on ring theory.
We define the -norm of an element , denoted by , by deleting the primes in from the prime factorization of the numerator and denominator of the rational number . For example, when , , one has and hence . It follows from the multiplicative property of that the function is also multiplicative.
We call -norm-Euclidean if for every there exists such that ; this is equivalent to the statement that is a Euclidean ring with respect to the function . One would like to know: When is -norm-Euclidean? Even in our setting, where is a complex quadratic field, this question is, in general, unsolved. To give a simple example, if and , then ; in this case is -norm-Euclidean, although is not norm-Euclidean.
In this paper we give an elementary approach that allows us to prove a few results about -norm-Euclidean fields in the complex quadratic setting. Our first result furnishes a number of examples.
Theorem 1.
The complex quadratic field is -norm-Euclidean for the following choices of and :
Values of | |
---|---|
1,2,3,7,11 | |
1,2, 3, 5, 6, 7, 11, 15, 19, 23 | |
1,2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 23, 31, 35, 39, 43, 47, 51, | |
55, 59, 67, 71 | |
1,2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, | |
33, 34, 35, 39, 43, 47, 51, 55, 59, 67, 71, 79, 83, 87, 91, 95, 103, | |
107, 111, 115, 119, 123, 127, 131, 139, 143 |
Note the previous theorem is not claiming these lists are complete or even finite, although both are true when . As discussed, when , this result is classical. When these examples appear in [8, 14]. However, we have not seen any examples with explicitly given in the literature.
A natural question arises: Does there always exists a set so that is -norm-Euclidean? The answer to this question is yes, and we give a quantified version of this claim. Before stating this result, we require an additional piece of terminology and notation. We write to denote the absolute value of the discriminant of . By definition, the discriminant is where denotes the complex conjugate of ; therefore the discriminant equals where
Given we write to denote the ceiling of ; i.e., is the smallest integer greater than .
Theorem 2.
Let be an complex quadratic field of discriminant . If contains all primes less than , then is -norm-Euclidean.
In a first course in algebraic number theory, one shows that the class group is generated by the set of all prime ideals whose norm is less than the Minkowski bound; it turns out that Theorem 2 implies this result in our setting. However our proof of Theorem 2 does not use the Minkowski bound, the class group, or even the notion of an ideal! For those familiar with the rudiments of algebraic number theory, further discussion is given in an appendix (see §6). We should note that Theorem 2 appears in [11] but that our proof is different.
To give another example, consider and , where
Theorem 2 implies that is -norm-Euclidean; however, is not norm-Euclidean (even though is a PID and hence a UFD).
On the other hand, one might consider a fixed set and ask which complex quadratic fields are -norm-Euclidean. When contains several elements, this seems to be a difficult problem, so we restrict ourselves to the case where contains a single prime . Even in this simplest case, we will further restrict which pairs we consider in order to obtain a complete classification. In what follows denotes the usual Legendre symbol; namely if has a solution with , if divides , and otherwise.
Theorem 3.
Let with squarefree and .
-
1.
Suppose and . Then is -norm-Euclidean only if .
-
2.
Suppose and . Then is -norm-Euclidean if and only if .
-
3.
Suppose and . Then is -norm-Euclidean if and only if one of the following holds:
We note that the previous theorem follows from Theorem 0.19 of [14]; however, our approach requires very little background knowledge and our proof is relatively short. In comparing Theorem 1 with Theorem 3, the reader may have noticed the addition of to the list when . It turns out the technique used to prove Theorem 1 does not quite apply in the case of , but we find a way to treat this case and four other “exceptional cases” in Section 5.
We view the following question as a natural one. In light of Theorem 3 one can restrict attention to those pairs such that .
Problem.
Are there infinitely many for which there exists such that is -norm-Euclidean when ?
Associated to any number field is a finite abelian group, called the class group of . Roughly speaking, this group governs the complexity of factorizations of elements of into irreducible elements, and this group is trivial if and only if unique factorization holds. It turns out that if is -norm-Euclidean with , then the class group of is cyclic. According to the Cohen–Lenstra heuristics (see [3]), the latter event should happen quite often (roughly 97.75% of the time) for fields of prime discriminant, but we currently cannot even prove that it happens infinitely often. (See §6 for additional discussion.) If one were to resolve the problem above in the affirmative, then one would prove that class group of is cyclic infinitely often, resolving a major open problem. (Of course, this likely means that producing such a proof may be difficult.) On the other hand, if the resolution of this problem is in the negative, then proving such a result would be interesting in its own right. We note that Stark has already suggested looking at Euclidean rings of -integers in connection with class number problems (see [13]).
Finally, since we are posing problems anyway, here is another:
Problem.
Are there infinitely many for which is -norm-Euclidean when ?
2 Main idea
In this section, we develop the main idea of this paper, which provides sufficient conditions for to be -norm-Euclidean. We will see that Theorems 1 and 2 will then immediately follow. We will give a small amount of additional background material along the way as necessary. Let denote a complex quadratic field and adopt all the notation given in §1. In particular, we write with squarefree and discriminant .
The norm function also maps . In the case this is evident from our definition; in the case where , observe that
where . It follows from this that for all . The following lemma gives an inequality that involves elements of that are not integral.
Lemma 1.
Suppose
with , not divisible by any prime in , , . Then
Proof.
Observe
and which implies
∎
We define the fundamental domain for as
This will assist us in visualizing the norm-Euclidean property graphically. When , takes the shape of a rectangle, and when , takes the shape of a parallelogram. Notice that any can be written as where and . Indeed, translations of give a tessellation of . Hence, when studying the norm-Euclidean property, we can focus our attention on the points in . Indeed, observe that is norm-Euclidean if and only if for all there exists such that . In particular, where denotes the complex modulus.
Definition.
For let denote the minimal over all representations with , .
Lemma 2.
We have is -norm-Euclidean if for all there exists such that .
Proof.
Let be arbitrary. We must show that there exists such that . Without loss of generality, we may assume that where is not divisible by any primes in , by multiplying by an element of if necessary; indeed, if , then and . Moreover, we may assume by subtracting an appropriate element of . Noting that , Lemma 1 gives the result. ∎
Example.
Consider the case of whose fundamental domain is depicted in Figure 1. As one can see, we cannot cover by circles of radius centered at the points of . However, in light of Lemma 2, if we choose , we can additionally consider circles of radius centered at points in of the form . In this case, we can cover as depicted in Figure 1. This allows us to conclude that is -norm-Euclidean with .


We now generalize the idea presented in the previous example. Consider the collection of all -integers in the fundamental domain (i.e., elements of ). This collection is precisely the set of all for and . In light of Lemmas 1 and 2, we know that the condition is sufficient for to be -Euclidean. Moreover, we will only need to consider the where . To to each “row of circles” , we can associate a horizontal strip
Note that the are maximal with the property that . The give rise to intervals via the projection map . We define
Notice that , which allowed us to rewrite the intervals in terms of rather than . The following lemma gives sufficient conditions for to be -norm-Euclidean.
Lemma 3.
Notation as above. If , then is -norm-Euclidean.
Proof.
Suppose . Taking of both sides allows use to observe that
In light of the preceding discussion, we conclude that is -norm-Euclidean. ∎
Example.
Consider the field and choose . We write down the intervals with and , and check that these cover the unit interval. Thus is -norm-Euclidean. Figure 2 gives the intervals and the corresponding covering of . We have sorted the intervals to make it easier to “see” them in the covering.

We rephrase Lemma 3 in a slightly different form, that will be convenient in the sequel. In what follows, we write to denote the fractional part of a real number .
Corollary 1.
Suppose that for every rational there exists such that
Then is -norm-Euclidean.
Remark.
Let be the smallest prime such that . Since for all , the condition in Corollary 1 can only be satisfied when .
As illustrated in the previous example, our results thus far lead to the following simple procedure:
-
1.
Let be the smallest prime not in and set .
-
2.
Enumerate the intervals for with .
-
3.
If , then is -norm-Euclidean.
Notice that this procedure will never prove that is not -norm-Euclidean. However, as was stated in Theorem 1 it allows us to show a number of complex quadratic fields are, in fact, -norm-Euclidean.
3 Proof of Theorems 1 and 2
Proof of Theorem 1.
The procedure described in the previous section leads to the proof of Theorem 1. Implementing this procedure on a computer gives the result immediately, but this could be done by hand as the number of intervals necessary is not large. Below we give the value of necessary and the number of intervals produced.
∎
Proof of Theorem 2.
The proof is a simple application of Corollary 1. Let . Set . Suppose that contains all primes so that contains all positive integers . We will follow the proof of Dirichlet’s approximation theorem to show that there exists a such that or . Subdivide the unit interval as
where is the number of sub-intervals. Each of the numbers must land in one of the subintervals. By the Pigeonhole Principle, there must exist an satisfying such that differ by less than . Upon setting we obtain the desired result. ∎
4 Proof of Theorem 3
Since Theorem 3 gives a classification of sorts, the proof will require some effort. The first part concerns the case where with odd, and the second part concerns the case where . In each part we must treat the cases of and separately. As first pass, the reader may wish to skip one or more of these subproofs.
Proof of Theorem 3 ( is odd).
Let be squarefree and with odd and . Set . Let be arbitrary and write where , , with and not both divisible by . Then we have
where we have rewritten and with maximal. Note that and both of , cannot be divisible by .
First consider the case where . We have
(1) |
Suppose . We claim that is not divisible by . Indeed if, divides , then we must have , lest both and are divisible by ; in this case, one can solve to show that is a square mod , a contradiction. Therefore when . We turn to the case where . This is the same except that is possibly divisible by one copy of . If is not divisible by , the result follows as before, so we may assume divides . In this case, must be divisible by as well, which implies that and hence when . Consequently, is not -norm-Euclidean when and .
Next we turn to the case . We have
If , then is not divisible by , and it follows that then when . If then is divisible by at most one copy of . As before, we may assume divides . In this case, we find that is divisible by and thus . This gives when except when equals one of the pairs . We deal with the remaining cases in Section 5. ∎
Proof of Theorem 3 ().
Let be squarefree and . Set . Let be arbitrary and write where , . We aim to show that . Observe that
We rewrite and where and is maximal; note that and that and cannot both be even.
First consider the case where . We have
(2) |
We claim that is divisible by at most one power of ; indeed, the assumption together with leads to , a contradiction. Whence
(3) |
which implies when . Since was arbitrary, this proves that is not -norm-Euclidean when and .
This leaves open the cases of . However, if is even then the assumption that divides leads to divides and therefore when . We will return to the particular cases of later.
Next, consider the case where . We assume, in addition, that so that is an odd integer. We have
(4) |
We claim that is not divisible by ; indeed, if this were the case, then which leads to , a contradiction. Therefore
(5) |
Hence when .
Now we return to the case of . We choose . In a similar manner as before, we write
where , , not both even, and is divisible by at most one power of . Notice that but that could equal . If does not divide , then . Hence we may assume divides . In this case, it follows that and are both odd, and since is a multiple of , we have .
It turns out the case of will require a little more care. We return to this case in the next section. ∎
5 Exceptional cases
Here we deal with the cases where is one of the following pairs:
It turns out that our criterion from §2 just barely fails for the cases and . In particular, the countable union of intervals fail to cover by just finitely many points. The case of is a little more difficult to deal with.
Proposition 1.
is -norm-Euclidean.
Proof.
For the first part of the proof, we will show that
(6) |
To establish this, we show that the condition in Corollary 1 holds for all except when . First, observe that implies the fractional part belongs to for all , and hence the condition clearly fails for these two values of . Note that .
Let be arbitrary. If there exists such that , then we are done, since . By way of contradiction, suppose that for all . We have or . For sake of concreteness, suppose , but the case of is treated in a similar manner. Since , we have but by hypothesis it must be that . Similarly, . We inductively define a sequence of intervals in this manner, all of length , having the property that . Therefore , and since this intersection contains at most one element, we get a contradiction, except for one possible value of . Similarly, if , we can inductively define and obtain a contradiction, except for one possible value of . Hence we have proven that the condition in Corollary 1 holds with at most two possible exceptions. But since we already know and are exceptions, this proves (6).
It suffices to show that given with odd, there exists such that . (If is of the form , then multiply by and translate back into using an element of .) Notice that since . First set . We find
Therefore when . If , then we find when . If , then when . This completes the proof. ∎
Proposition 2.
is -norm-Euclidean and -norm-Euclidean.
Proof.
Suppose with or . We proceed in a similar manner as in Proposition 1. First we claim that . For sake of concreteness, we prove this when . Let be arbitrary. Suppose for all . (If this condition does not hold, then we are done since .) This means that , , , and so on. Inductively, we find
Therefore . This proves the claim when . When , the proof is similar. Noting that , we can assume that for all . This leads to and the result follows as before.
Let with . We may assume . If , then when . Similarly, if , then when . This leaves only the points and . When , we compute so that in either case. Consider . We have so that in the case . For the case , we compute so that . This completes the proof. ∎
It appears that the strategy employed for the previous two propositions does not work when . Indeed, although it turns out that is -norm-Euclidean in the remaining exceptional cases, Lemma 1 may not be sufficient to prove this. We require a new idea. The following lemma essentially says that in some cases, we can increase the radii of our circles.
Lemma 4.
Proof.
Proposition 3.
is -norm-Euclidean and -norm-Euclidean.
Proof.
Set . We first consider . Making use of Lemmas 2 and 4 we obtain a list of circles of various radii that suffice to cover . See Table 1 for the centers of the chosen circles (as elements ) and the radius afforded by our lemmas.
, , , | |
, , , | |
, , , , , |
In principle, one could verify by hand that the provided circles cover . We believe the picture in Figure 3 that displays the covering is fairly convincing. If one is not convinced by the picture, one could partition the fundamental domain into parallelograms of equal area in the obvious way, and use a computer to check that each parallelogram lies entirely inside one of the given circles. When , the argument is similar. We give a list of circles (see Table 2) that carry out the covering (also depicted in Figure 3).
, , , | |
, , , , , , , | |
, , , , , , , |


∎
6 Appendix
We finish with some discussion that requires a modicum of algebraic number theory. Let be a number field with ring of integers , and let denote the absolute value of the norm map. In the quadratic setting, it is known that there are only finitely many norm-Euclidean fields. As we have seen, when is complex quadratic, this result is classical. When is real quadratic, the classification was completed by Chatland and Davenport in 1950 (see [2]). It turns out that with squarefree is norm-Euclidean if and only if . Barnes and Swinnerton-Dyer corrected an error from earlier work (see [1]); for a time, it was thought that the field was norm-Euclidean. See [5] for a self-contained exposition of this result. See [9, 10] for an introduction to the topic of Euclidean number fields, or [7] for a survey of the field.
Recall that every number field has embeddings . We have where is the number of real embeddings and is the number of conjugate pairs of complex embeddings. We say that unit group has rank , and write , if modulo its torsion subgroup is isomorphic to . Dirichlet’s Unit Theorem states that . Davenport generalized the result of [2] to show that there are only finitely many norm-Euclidean fields with . Note that iff . Very little is known about norm-Euclidean fields when .
We will now move to the -integral setting, but first we introduce a little more terminology and notation. (One possible reference for this material is [6].) Recall that associated to every prime ideal is a valuation , where is the power of in the (unique) factorization of the fractional ideal into prime ideals of . We refer to equivalence classes of embeddings up to complex conjugation as infinite primes. The set of all infinite primes is denoted by ; notice that and hence . By a prime of we will mean either a finite prime (which is a prime ideal ) or an infinite prime (which is an embedding ). We can associate to every prime of (finite or infinite) an absolute value . If the prime is finite (associated to an ideal ) then . If the prime is infinite (associated to an embedding ) then or , depending upon whether is real or complex. This normalization is chosen so that .
We give the usual definition of the ring of -integers. Let be a finite set of primes of containing . We define the -integers of as
It should be noted that passing from to has the effect of inverting all the prime ideals in . The -norm of a number is defined as .
A theorem of O’Meara (see [12]) says that that for any number field there exists a finite set of primes such that is -norm-Euclidean. It would be desirable to have a quantitative form of this theorem that holds for any number field. In principle, the techniques developed by Lenstra in [8] would allow one to prove a quantitative version of this theorem (see the last paragraph of Section 1 of [8]). However, to our knowledge this has not been carried out anywhere in the literature. On the other hand, O’Meara’s Theorem is also proved in [11]; in principle this approach could be made quantitative as well, but the author only explicitly states such a result in the complex quadratic case.
The determination of all -norm-Euclidean number fields (and function fields) with was completed by van der Linden (see [14]). (The case of is an exercise.) The analogue of Dirichlet’s Unit Theorem in the -integral setting says that and consequently, is precisely the situation where has rank one. As indicated before, not much is known when .
We now explain how the setting in which we have been working throughout the paper fits into this picture. Let be a finite set of rational primes as in §1. Let denote the set all prime ideals of lying above primes in together with the set of all infinite primes . In this setting one could write instead of the more cumbersome but accurate , and instead of . It turns out that is then the same ring we introduced in §1, and is the same function. We leave these claims as exercises to the reader. It can now be seen that our proof of Theorem 2 is an elementary proof of a quantitative version of O’Meara’s Theorem in the complex quadratic case.
Let be a complex quadratic field with notation as in §1. Let be a rational prime. Recall that one calls split, inert, or ramified in depending upon whether the factorization of into prime ideals looks like , , , respectively. When is odd this can be detected by observing whether the Legendre symbol is equal to , or ; when , this can de detected by whether belongs to , , or . As in Theorem 3, consider . Then when is inert or ramified, and if splits. In other words, the conditions in Theorem 3 were secretly insisting that . It follows that our Theorem 3 is subsumed by van der Linden’s classification. We still believe it is worthwhile to put down as our proof is elementary in nature. On the other hand, Theorem 1 contains a number of examples in which .
We now give the connection with the class group of , denoted by . We write to denote the multiplicative group of nonzero fractional ideals and denote the subgroup of principal fractional ideals, so that . It is clear that is trivial if and only if is a PID; in this setting, this is equivalent to being a UFD. Suppose be a set of primes in containing . We can analogously define the -class group . (We note that , like , is a Dedekind domain.) It turns out that is isomorphic to modulo the subgroup generated by the finite primes in . In particular, if is -norm-Euclidean, then is trivial, and hence the primes (or even just the non-principal primes) in generate . This explains the comment immediately following Theorem 2; indeed, in the complex quadratic setting, the Minkowski constant is .
Finally, consider the situation of Theorem 3 and the remark that follows. Let be a complex quadratic field and . If is inert, then and hence being -norm-Euclidean implies is trivial. A famous thoerem of Baker–Heegner–Stark states that this only happens for . If is ramified then and is isomorphic to where is trivial in ; consequently, being -norm-Euclidean implies that has order or . Similarly, complex quadratic fields with class number have been classified, so the list of possibilities is finite. (Keep in mind that the solutions to these class number problems are deep results and that our proof of Theorem 3 did not make use of these results in any way.) On the other hand, if is split then , and since , are inverses in , it follows again that ; consequently, being -norm-Euclidean implies the class group is cyclic generated by . This event should happen infinitely often, but currently this is unproven. This explains the discussion following Theorem 3.
Acknowledgment
This research was completed as part of the Research Experience for Undergraduates and Teachers program at California State University, Chico funded by the National Science Foundation (DMS-1559788).
References
- [1] E. S. Barnes and H. P. F. Swinnerton-Dyer. The inhomogeneous minima of binary quadratic forms. I. Acta Math., 87:259–323, 1952.
- [2] H. Chatland and H. Davenport. Euclid’s algorithm in real quadratic fields. Canad. J. Math., 2:289–296, 1950.
- [3] H. Cohen and H. W. Lenstra, Jr. Heuristics on class groups. In Number theory (New York, 1982), volume 1052 of Lecture Notes in Math., pages 26–36. Springer, Berlin, 1984.
- [4] P. G. Lejeune Dirichlet. Vorlesungen über Zahlentheorie. Herausgegeben und mit Zusätzen versehen von R. Dedekind. Vierte, umgearbeitete und vermehrte Auflage. Chelsea Publishing Co., New York, 1968.
- [5] R. B. Eggleton, C. B. Lacampagne, and J. L. Selfridge. Euclidean quadratic fields. Amer. Math. Monthly, 99(9):829–837, 1992.
- [6] Serge Lang. Algebraic Number Theory. Applied Mathematical Sciences. Springer, 1994.
- [7] Franz Lemmermeyer. The Euclidean algorithm in algebraic number fields. Exposition. Math., 13(5):385–416, 1995.
- [8] H. W. Lenstra, Jr. Euclidean number fields of large degree. Invent. Math., 38(3):237–254, 1976/77.
- [9] Hendrik W. Lenstra, Jr. Euclidean number fields. I. Math. Intelligencer, 2(1):6–15, 1979/80.
- [10] Hendrik W. Lenstra, Jr. Euclidean number fields. II, III. Math. Intelligencer, 2(2):73–77, 99–103, 1979/80. Translated from the Dutch by A. J. Van der Poorten.
- [11] Raj Markanda. Euclidean rings of algebraic numbers and functions. J. Algebra, 37(3):425–446, 1975.
- [12] O. T. O’Meara. On the finite generation of linear groups over Hasse domains. J. Reine Angew. Math., 217:79–108, 1965.
- [13] H. M. Stark. The Gauss class-number problems. In Analytic number theory, volume 7 of Clay Math. Proc., pages 247–256. Amer. Math. Soc., Providence, RI, 2007.
- [14] F. J. van der Linden. Euclidean rings with two infinite primes, volume 15 of CWI Tract. Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Amsterdam, 1985.