All totally real abelian number fields of class number one are Euclidean

summary

The gist

ALL TOTALLY REAL ABELIAN NUMBER FIELDS OF CLASS NUMBER ONE ARE EUCLIDEAN is a short note that shows, more generally…

In short

The paper proves that for any totally real abelian number field K with degree at least two, its ring of integers is Euclidean if and only if its class number hK is one. This result verifies a long-standing prediction by Weinberger regarding exceptional extensions and establishes a definitive criterion for determining when the ring of integers is Euclidean based solely on the class number.

Key concepts

Euclidean Ring
A ring of integers OK is Euclidean if there exists a function (a norm) that allows any element to be divided by another with a remainder smaller than the divisor's norm. This property is crucial for performing division algorithms, similar to standard arithmetic in integers.
Class Number (hK)
The class number measures how far the ring of integers OK is from being a Unique Factorization Domain (UFD). If hK equals one, every non-zero element can be uniquely factored into prime ideals, which is a strong condition related to Euclidean properties.
Prime Ideal Counting Function ($\Pi_K(x)$)
This function counts the number of non-zero prime ideals in K whose norm (the size of the ideal) falls within a specific range, such as between x and 2x. The paper establishes a lower bound for this count, showing how many such ideals must exist.
Hecke L-function Zeros
Scholium (I) provides information about the zeros of certain Hecke L-functions associated with cyclotomic fields. It asserts that these functions have no zeros in a specific region, which is used to control the distribution of prime ideals in K.

Terminology used across episodes

This episode discusses

The paper

All totally real abelian number fields of class number one are Euclidean · Read on arXiv

Austrian Science Fund · EU NextGeneration project · Croatian Science Foundation

It is a famous result of Narkiewicz that there are at most two real quadratic and at most one totally real cubic Galois extensions K/ Q, whose ring of integers O K is a unique factorization domain (UFD), but not Euclidean. As predicted by another famous result due to Weinberger, these exceptions should in fact not exist, as their existence would contradict a generalized version of the Riemann hypothesis. Building on recent spectacular progress on the Quasi-Riemann hypothesis for Hecke characters, in this short note we close the above final gap provided by Narkiewicz's result, and show, more generally, that the ring of integers O K of any totally real abelian number field K is a UFD, if and only if it is Euclidean. By referring to an additional announced uniform zero-free half-plane for general Dedekind zeta functions, we also establish the corresponding result for certain explicit new families of non-Galois cubic, quartic and quintic fields of unit rank one or two.

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "All totally real abelian number fields of class number one are Euclidean".

Emmy: Here's the gist of the paper. ALL TOTALLY REAL ABELIAN NUMBER FIELDS OF CLASS NUMBER ONE ARE EUCLIDEAN is a short note that shows, more generally, that the ring of integers OK of any totally real abelian number field K is a UFD, if and only if it is Euclidean The main theorem proves this equivalence for all totally real abelian number fields with degree at least two The paper establishes a lower bound on the number of prime ideals in certain residue classes, leading to the conclusion that OK is Euclidean if and only if hK = 1 The main theorem states that for a totally real abelian number field K/Q with n ≥ 2, there are constants cK, xK > 0 such that ΠK(x) ≥ cK · x log(x)2 for all x > xK In particular, for all totally real abelian number fields K OK is Euclidean ⇐⇒ hK = 1 Verification of Previous Results The authors verify Weinberger’s prediction regarding exceptional extensions by showing that the ring of integers OK is a UFD if and only if it is Euclidean for all totally real abelian number fields K This result builds upon Narkiewicz's earlier work concerning quadratic and cubic extensions The theorem overlaps with results from

Har-Mur04: and

Mur-Pet13: regarding non-existence of hypothetical exceptional extensions Key Ingredients and Tools The proof relies on two results from

OAI26: , Thm.

Ada: 1.2 and Prop.

Emmy: 2.1, which establish Scholium (I) and Scholium (II) Scholium (I) asserts that for every cyclotomic field F containing the group of 12th roots of unity µ12 and every Hecke character χ: A∗F/F∗ → C∗ of F of finite order, the associated Hecke L-function L(s, χ) has no zeros in the open region Re(s) > 1 − δ0 with a uniform width δ0 = 10−6 Scholium (II) provides a lower bound for certain prime ideals, stating that there are constants am, xm > 0 such that for all x ≥ xm (2.1) Pm(x) ≥ am x log(x)2 Derivation of the Lower Bound The lower bound is derived by combining Scholium (I), (II), and Proposition 1.6, which provides a refined version of another result in

OAI26: By combining these, the authors obtain the desired lower bound of growth for the “prime ideal counting function” ΠK(x) This is shown in two steps, found in Sect.

Ada: 2 and Sect.

Title and authors: Ada: So we're looking at this paper called "All totally real abelian number fields of class number one are Euclidean". It’s tackling that old debate about whether a ring of integers has unique factorization or if it has to satisfy the division algorithm.

Emmy: Exactly, Ada. The core idea is showing that if the ring of integers for any totally real abelian number field has class number one, then it must also be Euclidean. It connects this algebraic property of unique factorization directly to a geometric property called having a division algorithm on that ring of integers OK.

Kolya: That sounds like they are trying to settle what Narkiewicz started about quadratic and cubic extensions having class number one but not necessarily being Euclidean. What's the main point they’re pushing here?

Ada: The main point is showing this equivalence holds for all totally real abelian number fields with degree two or more. They establish a lower bound on a counting function, called the prime ideal counting function PiK of x, which shows that if the ring isn't Euclidean, this count has to grow at least as fast as x times the square of the logarithm of x.

Emmy: That growth rate is what they are aiming for. They prove there are constants cK and xK such that for all values of x greater than that threshold, PiK of x is greater than or equal to cK times x times the log of x squared.

Kolya: So, if we're thinking about where this means for the math community, it’s like they are providing a hard floor on how sparse prime ideals can be in these rings. It suggests you can't have too many "weird" prime ideal structures without violating this growth rate.

Ada: Right. And the big implication is linking this directly to the class number being one because they show that for every totally real abelian field K, if it has class number one, then it must be Euclidean and vice versa. That’s a very strong statement about the relationship between these two properties of OK >

Title and authors: Emmy: It means that the algebraic condition of having unique factorization is equivalent to the geometric condition of having a division algorithm defined by some norm function on the ring of integers OK. It ties together number theory and geometry in a very neat way.

Kolya: I wonder if this result helps with the earlier work on exceptional extensions, like those quadratic or cubic fields Narkiewicz looked at? Does this theorem confirm that those exceptions, which were thought to be rare or impossible, can't exist under these general conditions?

Ada: It does. The paper says their proof overlaps with earlier work by Har Murty and Murty Petersen on non-existence of hypothetical exceptional extensions in certain cases. They essentially use this new lower bound on PiK of x to show that the exceptions they were looking for, like those quadratic or cubic fields with class number one but not being Euclidean, simply cannot exist.

Emmy: So they're using analytic counting tools to rule out specific algebraic structures that were previously thought possible. It’s a powerful way to solidify what we already knew about these special extensions >

Kolya: What about the methodology? How are they actually getting that lower bound on the prime ideal count? It sounds like it requires combining some very deep analytic results.

Ada: Well, they rely on two main ingredients from a source called OAI26. First, Scholium one, which deals with zero-free regions for Hecke L-functions associated with cyclotomic fields containing the 12th roots of unity and finite order Hecke characters. This establishes a uniform width delta zero equal to one thousandth of one hundred—or zero point one—for the region where there are no zeros <ref:2610.24900#pg3>.

Emmy: And second, Scholium two, which gives them a lower bound for certain prime ideals themselves. This essentially tells them that for large enough numbers x, there will always be at least a certain number of rational primes whose prime divisors fall within specific ranges defined by some exponential functions of the logarithm of x >

Kolya: So they combine those analytic constraints with Proposition one point six from OAI26 to get the growth rate for PiK of x. What does that combination actually tell us about the density?

Title and authors: Ada: It tells us that when you subtract those error terms—the A(x) and B(x) terms which handle prime ideals with non-surjective reduction—you end up with a growth of at least n times am times x times the square of the logarithm of x. That is, n a m x log of x squared >

Emmy: That term n a m x log of x squared is what they are aiming for. It means that as you look at larger and larger numbers, the number of relevant prime ideals doesn't just stay small; it grows predictably with that specific power law in the logarithm >

Kolya: And then they show that when x gets big enough, those error terms A(x) and B(x) are smaller than this main term. They are "little o" of x times the square of the logarithm of x. That means their contribution doesn't change the overall growth rate in a significant way for large enough numbers >

Ada: Exactly. So, they choose a threshold x K big enough so that all those estimates hold simultaneously, which establishes the lower bound for PiK of x as n a m times x log of x squared minus something smaller than that >

Emmy: It's like they are showing that the "noise" or the exceptions don't swamp the main signal when you look at huge numbers. The structure dominates, and it grows according to this logarithmic law >

Kolya: For someone who just listens to this show, what does this mean practically? Does it change how we think about these number fields in general?

Ada: It provides a very concrete tool for testing the Euclidean property. Instead of just hoping that a field with class number one might be Euclidean, they can use this lower bound on prime ideal counts to rigorously prove it. If you find a field where the count is less than this lower bound for some range of x, then you know immediately it fails the condition >

Emmy: It gives us a way to quantify "how far" a ring of integers is from being Euclidean by looking at how many prime ideals are behaving in a certain way. It turns an abstract property into a counting problem >

The paper's summary: Ada: So, to recap, this paper is essentially proving that if you have a totally real abelian number field where every ideal factorizes uniquely, then that ring must also have a division algorithm defined by some norm function. It’s linking the algebraic idea of unique factorization directly to the geometric idea of having a division algorithm on the ring of integers.

Emmy: It’s like showing two different ways to describe the same underlying structure in number fields are actually equivalent.

Ada: And for all totally real abelian fields with degree two or higher, this equivalence holds true, provided you stick to class number one. The big takeaway is that you don't need to check a whole list of specific exceptions like quadratic or cubic fields to know if the ring is Euclidean if the class number condition is met >

Emmy: That’s significant because it validates Weinberger’s prediction that those potential exceptions, which were thought to exist under certain conditions, actually cannot happen for these broader types of fields. It turns a conjecture about rare cases into a general rule for all totally real abelian fields with degree two or more >

Ada: Exactly. And they do this by using very sophisticated analytic counting tools—specifically zero-free regions for Hecke L-functions and bounds on prime ideal distributions—to establish a growth rate for prime ideals that is strong enough to rule out non-Euclidean rings when the class number isn't one >

Emmy: The method relies on showing that the number of "bad" prime ideals, those that don't behave nicely with respect to surjectivity in the reduction map, actually grows slower than what you need to worry about when you look at very large numbers. It means the structure of these rings dominates the count >

Ada: And this leads to a concrete statement: if you look at the number of prime ideals whose norm falls in a certain range, that count will grow at least as fast as x times the square of the logarithm of x, provided you're past some initial threshold. That’s what they call PiK of x being greater than or equal to a constant times x log of x squared >

Emmy: So it gives us a way to test for Euclidean rings using just counting functions and analytic bounds rather than having to perform the full division algorithm check on every single element. It provides a quantitative check that’s independent of the field's specific algebraic details beyond its degree and abelian structure >

Ada: Right. And this whole setup allows them to verify results from other papers, like those by Har Murty and Murty, which looked at non-existence in some specific cases before they could prove this general statement for all totally real abelian fields with degree two or more >

Emmy: It solidifies the structure of these rings. If you have class number one, you’re guaranteed a division algorithm; if the ring isn't Euclidean, the class number must be something other than one. It’s a clean boundary line there >

Ada: And they even get a corollary about prime ideals splitting completely in extensions H l over K, giving us bounds on those specific types of primes as well. It shows this technique is versatile enough for analyzing how primes move between different field structures >

Emmy: So, to summarize, the paper takes the algebraic property of unique factorization and proves it's equivalent to the geometric property of being Euclidean for all totally real abelian fields with degree two or more, using a strong analytic lower bound on prime ideal counting >

Ada: It’s a very solid piece of work confirming long-standing predictions about these fields.

Emmy: Right.

The paper's improvements: Ada: So, to recap, the authors are pushing the boundaries of this work by suggesting they can refine the constants in that lower bound we talked about earlier, moving from just an existence proof to a more explicit calculation for those constants cK and xK. It's like going from saying there's a floor on how sparse the prime ideals can be to giving you an exact number for that floor >

Emmy: That refinement is important because it moves us closer to being able to use this tool in practical applications. Right now, we know the bound exists, but knowing what those constants actually are helps us figure out how large x needs to be before the estimate kicks in. It makes the "x greater than xK" part much more useful for someone trying to apply this concept >

Ada: Exactly. And they also address the limitations of their current proof structure by showing how they can incorporate those error terms, A(x) and B(x), more tightly into the main estimate. They're essentially showing that those "small" parts of the count are even smaller than we first thought when we set up the main inequality >

Emmy: That’s like tightening the screws on an engine. It means they aren't just proving a general principle; they are making sure every single component of the argument is as efficient as possible in terms of scaling, which is crucial for any kind of number theory work that needs to be reliable at scale >

Ada: And one key improvement is showing how the counting function behaves when you look at primes that split completely in some specific field extension H l over K, which we mentioned briefly earlier. They’re adding a corollary that gives us a concrete bound for those prime ideals S l of x >

Emmy: That bridges the gap between the main theorem about the field itself and how primes behave when you extend the field. It shows that this method isn't just for looking at one field in isolation, but it can be used to probe relationships between different extensions in a controlled way >

Ada: So, they’re turning a general existence result into something more computationally and theoretically tractable by giving us tighter numerical bounds on the constants and showing how the error terms vanish faster. This makes the tool much more robust for applying it to specific families of fields >

Emmy: It really builds on that foundation we laid, connecting analytic tools like zero-free regions directly to precise counting estimates for algebraic structures. It’s a testament to how these ideas from different areas of mathematics can combine when applied together in this way >

Ada: And honestly, the implication is that we have a much clearer picture of the landscape for totally real abelian fields with class number one. We know they are Euclidean, and now we have better tools to understand why and how large the field needs to be for that property to hold true in a quantitative sense >

Emmy: It gives us more confidence in applying these ideas to other areas where we might be studying constraints on algebraic objects, whether it's geometry or dynamics. We’ve shown this machinery works for these specific fields, and now we can think about what else it might unlock >

Conclusion: Ada: So, to wrap up, this paper proves that for any totally real abelian number field with degree two or higher, the ring of integers is Euclidean if and only if its class number is one. It’s a very clean equivalence that holds universally for this class of fields >

Emmy: That’s the big picture here—it confirms Weinberger's prediction about those potential exceptions being impossible under these conditions. It settles a long-standing question about the relationship between unique factorization and the division algorithm on these specific number fields.

Kolya: From a probabilistic viewpoint, what this means is that we can use analytic bounds to control the distribution of prime ideals in a very precise way, which suggests that for any field with class number one, you’re not going to run into any weird structural roadblocks regarding unique factorization >

Ada: Exactly. And the methodology used—combining zero-free regions from Hecke L-functions with sharp bounds on prime ideal counts—shows that the structure of these rings is very tightly constrained by their arithmetic properties. It's a very powerful connection between analysis and algebra >

Emmy: The implication is that we have a more rigorous way to analyze these rings, moving beyond just checking if they might be Euclidean based on their class number. We now have a quantitative test for that property across the entire family of totally real abelian fields with degree two or higher >

Kolya: I just wonder about the constants, though; are those cK and xK really small enough to matter when we try to apply this to fields with larger degrees, say degree five or six?

Ada: That’s a good question. The paper focuses on the general case with degree two or higher, and they do build on earlier work that touches on those higher degrees as well. They aim for those constants to be uniform enough across all such fields which is what makes it so powerful >

Emmy: So we have this solid foundation now for understanding these rings. It sets a new standard for how we approach the problem of unique factorization in number fields.

Ada: And moving forward, this result opens up new avenues where we can use these counting functions to probe other types of algebraic structures, like those involving prime ideals splitting in extensions, which we touched on earlier >

Kolya: I’m looking forward to seeing how this analytic counting approach plays into the study of chaotic systems or other probabilistic models that have similar scaling behaviors. That seems like a natural next step for this kind of research >

Emmy: Right. We've done the heavy lifting here proving the equivalence for these abelian fields, and now we can look at what else this mathematical framework allows us to measure and control in our next set of papers >

More episodes

← Home