The cubic Kronecker-Weber Theorem May 5, 2008
Posted by davidspeyer in Galois theory, Number theory.trackback
This is the second in a sequence of posts where I look at extensions of the rational numbers in a very hands on, low tech, way. This time, we’re going to start checking the Kronecker-Weber theorem. The Kronecker-Weber Theorem states:
The Kronecker-Weber Theorem: If is an abelian Galois extension of
, then
is contained in
for some integer
.
So, when I said before that the only abelian extensions I was familiar with were the quadratic and the cyclotomic extensions, I had basically already listed them all! In the last post, I already listed all of the extensions of
; they were indexed by order three subgroups of
. Today, we’ll try to fit these inside cyclotomic fields.
By the way, I just discovered the very nice article Kronecker-Weber via Stickelberger by Franz Lemmermeyer; if you are enjoying this series of posts, you might want to work your way through that.
First of all, let’s talk about cyclotomic fields. Set . From now on, we’ll write
in place of
. The Galois group of
is
, with the generator
. (It is obvious that every Galois automorphism is of this form. It requires an argument to see that these are all automorphisms; if you want to try it, I suggest first doing the case
, then
and then deducing the case of general
from the cases you’ve already done.) So, the cubic subfields of
are in bijection with index three subgroups of
. If we put all of the cyclotomic fields together, we get that the
extensions of
which lie in cyclotomic fields are in bijection with the index three subgroups of
. Since these are the same objects that index the entire set of
extensions of
, you should believe that all the
extensions of
lie in cyclotomic fields.
Of course, that is no proof at all, because we’ve just shown that two sets are both countable. For those who know a little algebraic number theory, here is how to make that argument rigorous: Recall that the extensions of
are of the form
. Here
is an element of
whose norm,
, is a square free product of primes that are
modulo
. So the (integral) primes which ramify in
are the primes which divide
, and possibly also
. Looking at the details of our classification, we see that, if
,
, …,
is a list of primes that are
modulo
, then there are precisely
abelian cubic extensions of
whose ramification is contained in the set
. We can exhibit
such extensions as subfields of
, so we see that every abelian cubic extension of
lies in a cyclotomic field.
But the aim of this sequence of posts is to get explicit, and this argument isn’t. We show that finite counts match, but we don’t indicate how to fit a particular extension into a cyclotomic field. What we’d really like to do is, given an index
subgroup of
, output an explicit formula for
as an element of
. That is basically what we are going to do, but the details are different. What we are actually going to do is start with a character
and give a formula for
as an element of
. We then just symmetrize the formula to project down to
. (This symmetrization makes
and
yield the same element of
.) We then use our classification of
extensions to know that we have built all of them.
This seems like the point to make an admission. I thought I had a really slick way to do this step, but it is broken and, I think, unfixable. So I am going to use the standard argument, which goes through Gauss sums. Although it is sad to see my pretty argument go away, the Gauss sum method is probably better motivated and certainly more important. But, as a result, I’m going to have to pause our story soon and do a post about Gauss sums.
In the mean time, let me tell you where we are going, with a formula that you can check out for yourself. Let be an integer which is a product of primes which are
modulo
. Let
be an index
subgroup of
. So the fixed field of
in
is a
extension of
. We’d like to find an element of this fixed field. The most obvious option is
— and this will work. Being a little more flexible, we could choose some function
from
to
and use
. What is the best choice of
? It turns out the best option is not to build an element of
, but to build an element of
. We take
to be a character
, mapping
to
with kernel
. So we construct the element
in . It is fixed by
, the preimage of
in
. Now, the first fun fact to check is that
is in
. And then comes the really fun fact:
, where
is the element of
associated to
.
It’ll probably be about a week and a half for me to get the proof up; feel free to race me!
Comments»
No comments yet — be the first.