The Kronecker–Weber theorem says that every finite abelian extension of the rational numbers is contained in a field obtained by adjoining roots of unity. The statement is surprisingly strong. We begin with an arbitrary polynomial, whose roots may have no obvious connection with roots of unity. We assume only that its Galois group is abelian. Somehow, by adjoining sufficiently many roots of unity, we should recover every root of the original polynomial. We want to understand why this should be true by working with an actual element of the extension. Rather than begin with ramification groups, we will start with its conjugates, write a Fourier expansion, and try to replace the terms in that expansion by expressions involving roots of unity.
For cubic extensions, this works remarkably well. We can construct a Fourier expression, calculate its cube, and remove the unwanted prime factors by dividing by suitable Gauss sums. Eventually, the only cube equations left involve ninth roots of unity. This gives a direct proof for every cyclic cubic extension. For higher degrees, the same cancellation of ordinary ramified primes still works. The remaining calculation is more difficult because powers of a prime may occur as the extension degree. We will return to that difficulty only after understanding exactly what the Fourier calculations accomplish.
Cubic Case
Suppose is a cyclic cubic extension. Choose an element
that generates the field. Write its three conjugates as
, ordered so that the Galois symmetry
sends
to
, then to
, and finally back to
. Our goal is to find an expression for
in terms of roots of unity. Let
be a primitive cube root of unity, so
. The natural thing to try is to combine the three conjugates with the coefficients
. Define
The first expression is rational because it is unchanged by every Galois symmetry. The other two are more interesting. When we cyclically permute the roots, we find
and
. Instead of permuting three different terms, the Galois symmetry now simply multiplies an expression by a fixed cube root of unity. This is the whole reason for using the Fourier coefficients. We have not lost the original number. Adding the three expressions gives
Because a cyclic cubic extension of is totally real, complex conjugation fixes the
and exchanges
with
. Consequently
. Our problem is therefore to find an expression for
. Once we know
, we recover the original element by adding its complex conjugate and the rational number
.
Now the first simplification appears. Since , we have
. The field
has degree three, while
has degree two, so the two fields have no nontrivial intersection. Therefore
This is already a remarkable reduction. We began with an arbitrary cubic polynomial, but the entire extension is now described by a cube root of an element of the simple quadratic field . There is another relation worth recording. Since
, the product
belongs to
. But complex conjugation also fixes it. Hence
, and therefore
The norm of from
to
must be a rational cube. This will severely restrict the prime factors of
.
The ring of integers of is
. Every element is
, and its norm is
. This ring has unique factorization, much like the ordinary integers. One can see why from its triangular lattice: given any complex number
, choose integers nearest to
. The difference has norm at most
. Applying this approximation to a quotient of two elements gives division with a remainder of smaller norm, and Euclid’s algorithm follows. We can therefore factor
into prime elements of
, allowing negative powers if
is not integral.
A prime factor appearing to a power divisible by three is harmless. If divides
, we can replace
by
. This changes the cube from
to
, without changing the field obtained by adjoining
over
. Thus only prime exponents modulo three matter. Suppose an ordinary rational prime
occurs in the factorization. There are two possibilities.
If , then
remains prime in
. Its norm is
. If it appears in
to exponent
, it appears in
to exponent
. But we proved that
is a rational cube. Hence
, so
. We can remove this factor by dividing
by a power of
. The other case is more interesting. If
, then
splits:
Suppose and
occur in
to exponents
. Since
is a cube, their exponents satisfy
. After removing ordinary cubes, the only possible nontrivial patterns are therefore
These are exactly the factors we need to remove. Multiplication by a number of cannot remove them, because that only changes exponents by multiples of three. We need an algebraic expression whose cube contains
. Where can we find one? We will construct it explicitly from Gauss sums,
th roots of unity. Take
. Choose a multiplicative character
of order three modulo
. Its values are
. Let
be a primitive
th root of unity, and form the weighted sum
This is another Fourier expression, but now it is built entirely from roots of unity. If we replace by
, and change the summation variable from
to
, we find that
is multiplied by
. So it behaves exactly like the Fourier expression
from our unknown cubic field: under the relevant symmetry, both are multiplied by cube roots of unity. Now calculate its cube. Put
.
Multiplying and writing
in the double sum gives
. Similarly, grouping the terms of
according to
gives
, where
Consequently,
The advantage is that is a sum of cube roots of unity, so it belongs to
. We can determine its prime factorization directly. The Gauss-sum identities give
. Thus
is a prime element of norm
, associated to either
or
. To identify the correct factor, choose the cubic character by
. Then reduce the Jacobi sum modulo
. Writing
, we obtain
. When the binomial is expanded, every power sum has exponent between
and
, strictly between zero and
. Each power sum vanishes modulo
. Hence
. Finally, the congruence modulo three fixes the unit. Because
, we have
. Since
, this gives
. Choosing the associate
, we obtain
. Our calculation has therefore produced exactly what we wanted:
This is the central identity of the cubic proof. It constructs from roots of unity a Fourier expression with precisely the prime exponents we were unable to remove by multiplying by an element of .
Return to the Fourier expression of our unknown cubic field. Suppose the factors above
occur in
with exponents
modulo three. Divide by the Gauss sum:
Since , the new cube
has exponents divisible by three at both primes above
. We can remove those remaining multiples of three by multiplying
by an appropriate element of
. If the original exponents are
, divide by
instead. Its cube has exponent pattern
, which is congruent to
modulo three. Thus either possible pattern can be removed.
Why is this really removing ramification, rather than merely changing an equation? Consider a prime above
. After dividing by the Gauss sum and removing cubes of local prime elements, the remaining equation near
has the form
, where
is a local unit. Since
, the derivative of
is
, which does not vanish at a nonzero root modulo
. The reduced polynomial has no repeated roots. Its factors lift to the local integer ring without requiring a ramified extension. So the new cubic equation is unramified at
.
This is the concrete prime-removal calculation: divide a resolvent expression by a Gauss sum, and the troublesome prime exponents disappear from the cube equation.
There is one small issue. The new expression need not belong to the original cubic field, because
belongs to a cyclotomic field. But that is not a problem. We are allowed to enlarge the field temporarily, since our goal is to show that the original number can be expressed using roots of unity. After removing the prime, we repeat the operation for every remaining rational prime different from three. Let’s construct an example where we can see the entire cancellation and the new polynomial.
For , choose the cubic character with
. The Jacobi sum calculation gives
. Therefore the corresponding Gauss sum satisfies
For , choose the cubic character with
. A direct evaluation of
gives two terms equal to
, six equal to
, and three equal to
. Thus its Jacobi sum is
, and
Now multiply the two Fourier sums:
Its complex conjugate is , and their product is
.
Consider the real algebraic number
Because each Gauss sum transforms by a cubic character, has three conjugates
. The corresponding conjugates of
are therefore
,
, and
. This produces a cyclic cubic field. We can find its polynomial without guessing. Expand
:
We know . We also have
, and hence
. Therefore
This is a concrete cubic polynomial obtained by multiplying Fourier sums from seventh and thirteenth roots of unity. It is irreducible over ; for example, modulo five it becomes
, which has no root. Now suppose we want to remove the prime seven. Instead of manipulating the cubic polynomial directly, return to the Fourier expression
and divide by the known seventh-root Gauss sum:
The unwanted factor has disappeared exactly. The new real number is
Using and
, we obtain
We have gone from a cubic equation involving seventh and thirteenth roots of unity to one involving only thirteenth roots of unity. And we can reconstruct the original number. We know , so
The field generated by is contained in the field generated by
and
. Thus removing seven did not destroy the original information. We moved it into a known cyclotomic factor. This is the calculation to keep in mind throughout the general proof. We are not trying to transform a complicated polynomial into a cyclotomic polynomial by factoring it directly. We are finding an expression for one root, separating its Fourier components, and replacing those components by known cyclotomic expressions.
Now return to an arbitrary cyclic cubic field, with Fourier expression . For each prime
whose factors occur in
with nonzero exponents modulo three, divide by
or
, whichever matches those exponents. At primes
, the exponents were already divisible by three. After doing this for finitely many primes, we have replaced
by another expression
whose cube has no prime exponents outside three, except multiples of three. Remove those remaining cubes using elements of
. The new equation must therefore have the form
after multiplying by an element of
, where
is a unit of
. Why is this so restrictive? Because the units of
are only
, and
has, up to a unit, just one prime factor in this ring:
. We still have the important relation that the norm of the cube’s right-hand side is a rational cube. This relation survives all our divisions, because
is rational and
. But
. Therefore the norm of
contains
. Since the norm is a rational cube,
must be divisible by three. We can absorb that factor into
as well. We are left with
Every unit is, modulo cubes of units, one of . Indeed, the cubes of the six units are just
. After one last multiplication by a unit, our equation is simply
These equations are completely solved by ninth roots of unity. If , we can take
. If
, we can take
, up to multiplication by a cube root of unity. And if
, then
already belongs to
.
So the unknown Fourier expression can be reconstructed from ninth roots of unity and the Gauss sums we used to remove its other prime factors. More precisely, there are finitely many primes
, exponents
, an integer
, and a nonzero number
such that
There may be no need for the ninth-root factor, in which case . This is the explicit expression we were looking for. Substitute it back into the Fourier inversion formula:
Every is a finite sum of
th roots of unity, with coefficients among
. The number
belongs to
, and
is rational. Thus the formula expresses
as an element of a cyclotomic field. We have proved Kronecker–Weber for every cyclic cubic extension by explicitly reconstructing its Fourier expression from Gauss sums and ninth roots of unity. No general class field theory was needed. The essential calculations were unique factorization in
, the Jacobi-sum identity, and the fact that the norm of the original cube is itself a cube. This is the most concrete form of the proof.
Prime Order
We have finished the cubic case. We began with a Fourier expression , found that its cube belonged to
, and examined its prime factors. At a prime
, the only nontrivial patterns were
and
. The Gauss sum gave exactly the pattern
, and its square gave
modulo three. So we could remove either pattern. We want to repeat this for a cyclic extension of degree
, where
is an odd prime. Afterwards, we will see what changes for degree
. Let
be cyclic of degree
, with Galois group generated by
. Choose an element
generating the field, and write its conjugates as
. Let
be a primitive
th root of unity. As in the cubic case, define
,
so that . Let’s concentrate on
. Since
, its
th power is fixed by
. Also,
and
have coprime degrees
and
. Thus, exactly as before,
We also get a constraint analogous to the relation in the cubic case. Multiply all the conjugates of
obtained by replacing
with
, for
. Their product is fixed by
, because the multipliers multiply to
. It is also fixed by every symmetry of
, since these merely permute the factors. Therefore the product is rational, and its
th power is the norm of
. Hence
is a rational
th power.
Now suppose ramifies in
.Choose a prime factor above it in the integer ring of
, and choose an algebraic integer
that has exactly one factor of this prime locally. Take a Galois symmetry
that does not change the residues modulo this prime. Then
is a local unit. Reducing it modulo the prime gives a nonzero element of a finite field. Moreover, the multipliers for two such symmetries multiply. Thus we have another multiplicative character, coming directly from how the roots move near
. Now look at a symmetry whose multiplier is one modulo the prime. Its movement begins at the next order:
. The first nonzero coefficients at this order add when symmetries are composed. The possible coefficients form an additive group of characteristic
. But our Galois group has order a power of
, and
. So this additive part must be trivial. In ordinary language, every symmetry responsible for ramification at
is already visible through the first multiplicative coefficient. There is no hidden higher-order movement. Furthermore, because the whole Galois group is abelian, applying the residue-field Frobenius does not alter the multiplier. Thus the multiplier lies in
, rather than a larger residue field. If the ramification group has order
, this proves
That is just what we need. The group
is cyclic of order
, so it contains a character of order
.
Consequently in the prime order case, splits into
distinct prime ideals in
. Let us call them
. We now want to know the exponents with which these primes occur in
. The norm relation says that the sum of their exponents is divisible by
. But that is not enough. For example, when
, there are many possible vectors whose entries add to a multiple of five. We need a stronger restriction. That restriction comes from the equation
. It turns out that the exponent vector is not arbitrary at all: modulo
, it must be one of the patterns obtained from a single Gauss sum.
Since , choose a character
of order
modulo
. Form
We know that replacing by
multiplies
by
. Thus its
th power is fixed by every symmetry acting on
, and so
. We can calculate the prime factors of
almost as directly as in the cubic case. Label the primes
so that, modulo
, the character satisfies
. Write
and expand
. Then
. Modulo
, the coefficient of
becomes
. All these coefficients vanish until
. At that value, the highest power of
is
, whose sum over the nonzero residues is
. Since
has leading coefficient
, the coefficient is nonzero. The earlier coefficients are divisible by
locally, so they cannot change the first nonzero power of
. Since
is, up to a unit,
, this gives the exponent of each prime in
:
So the Gauss sum gives the pattern , with the primes labelled as above. Its square gives twice that pattern modulo
, its cube gives three times the pattern, and so on. But how do we know that the unknown
has one of precisely these patterns?
Temporarily adjoin the degree- subfield of
to
. At
, the ramification group of the combined extension is still cyclic of order
. We can choose its generator
to act as
on
, and choose
so that it acts on the Gauss sum by
. Our unknown resolvent satisfies the identical equation
. Take a prime element
in the local combined field. Because the ramification is tame,
reduces to an element
of order
. Write
and
, with
local units. The symmetry
does not change the residues of these units. Therefore reducing the two transformation equations gives
and
. Hence
. Taking
th powers and returning to the field
, we obtain the desired constraint:
The equality is understood with the primes labelled consistently by the chosen character. Thus the unknown resolvent can only have the same exponent pattern as the Gauss sum, modulo . Dividing
by
removes it. For a Fourier component
, whose multiplier is
, the same argument gives
, and we divide by
. There are no other possible patterns because there are only
possible multipliers
. Each multiplier forces one of the
exponent patterns.
Take and
. Since
, we have characters of order five modulo eleven. In
, the prime eleven splits into four primes
. Our Gauss sum satisfies
. Its prime exponents are
. For example, at
, the character reduces to
. In the expansion using
, the first nonzero coefficient occurs at
, because
first contains
when
. Since eleven corresponds to ten powers of
, the exponent in
is
. Repeating this at the other three primes gives exponents
.
Now take the powers of this pattern modulo five:
| Fourier character | Prime exponents modulo 5 | Divide by |
|---|---|---|
These are all five possible patterns for a Fourier component in a cyclic degree-five extension ramified at eleven. We have not assumed this from the norm constraint. We derived it from the transformation law of the resolvent.
Prime Power Case
We have seen how to remove a prime from a cyclic extension of degree . The Fourier expression satisfies an equation
, and the prime factors of
can be matched with those of a Gauss sum. We want to do the same thing when the extension has degree
. The only new difficulty is that a prime may affect just part of the Galois group. Suppose
is cyclic of degree nine, with Galois group generated by
. Choose
and write its conjugates as
. Let
. We take the usual Fourier expressions
Now suppose seven ramifies, but its ramification group has order only three. Since the full Galois group has order nine, this subgroup is generated by . Let
. Applying
to a Fourier expression shifts the conjugates by three places. Since seven is different from three, we can let this ramification symmetry fix
. The Fourier calculation then gives
. Look at what this means. The nine Fourier expressions fall into three groups. The expressions
are unchanged by
. The expressions
are multiplied by
. Finally,
are multiplied by
. Therefore, although the extension has degree nine, we have only three possible types of movement at seven. What equations do these expressions satisfy? Since
, taking cubes removes the movement:
Here means the elements of
unchanged by
. It is a cubic field, and seven is unramified in it. The field
is also unramified at seven. Thus the coefficients
belong to a field with no ramification at seven. We can now examine the prime factors of these cube equations, just as we did in the original cubic proof. In the cubic case we calculated a Gauss sum from seventh roots of unity satisfying
, where
and
. We will use exactly the same Gauss sum here.
Temporarily combine with the cyclic cubic subfield of
. The ramification group in the combined field still has order three. We can choose the cubic character defining
so that our generator
acts by
. The expressions
have this same movement. Therefore their cubes must have the same prime-exponent pattern as
, modulo three. Similarly,
have the movement of
, so their cubes have the pattern of
.
Thus all nine Fourier expressions are covered by just three patterns:
| Fourier expressions | Exponents at | Correction |
|---|---|---|
So we divide each Fourier expression by the indicated Gauss sum. The first group needs no correction. For the second group, put , and for the third group put
. In every case,
. Moreover, the cube equation for each
has prime exponents divisible by three at all primes above seven. We have removed seven from the unknown coefficients. The Fourier expansion still reconstructs
, but now every occurrence of the movement at seven is carried by the explicit Gauss sum
. This is the entire idea. We did not need nine different Gauss sums. We needed only three corrections because the ramification group at seven had order three. Now do the same calculation for degree
Suppose is cyclic of degree
, with generator
. Choose
and form the Fourier expressions
, so
. Let
be a ramified prime, and suppose its ramification group has order
. This group is generated by
. Put
, a primitive
th root of unity. Exactly as in the degree-nine example, applying
shifts the Fourier sum by
places. Therefore
. Taking the
th power removes this movement:
This is the correct analogue of the cubic equation. Although may have degree much larger than
, its
th power belongs to a field unramified at
. We now want to remove the factors above
from these equations. Since
, choose a character
of order
modulo
, and form the Gauss sum
. We choose the character so that the same ramification symmetry satisfies
. Now recall the prime-factor calculation for Gauss sums. The prime
splits into
primes in
. If we label these primes
consistently with the character, then
So the Gauss sum supplies one definite vector of prime exponents. Its th power supplies
times that vector, modulo
. Why must the unknown equation
have that same pattern? Choose a prime element
in the combined local field. The ramification symmetry changes it by
, where
has order
. Write
and
, with
local units. Because
leaves the residues of units unchanged, reducing the equations
and
gives
and
in the residue field. Hence
. Since
has order
, we obtain
.
The equations and
belong to fields unramified at
. Passing from the larger local field to these unramified fields converts
into the corresponding prime exponents of
. Thus, at every prime above
,
This is exactly the constraint we need. The prime exponents of the unknown resolvent equation are forced by its Fourier character. They cannot have arbitrary patterns. There are only possibilities, corresponding to
, and the powers
match every one of them. Therefore, if
is the remainder of
modulo
, we put
. The corrected expression satisfies
, and its
th power has exponents divisible by
at every prime above
. We have rewritten our original element as
Every Gauss sum is an explicit expression in roots of unity. The new coefficients no longer move under the ramification at
. To describe where these coefficients live, let
be the cyclic subfield of
of degree
, and form
. In this combined field, the ramification group at
still has order
. Let
be the elements of
unchanged by this group. Then
has no ramification at
, and the corrected coefficients
belong to
. Also,
, since the common ramification group maps isomorphically onto the Galois group of
.
Thus we have removed one ramified prime while keeping an explicit expression for our original element. We can repeat the calculation for each remaining prime different from . Eventually, only the prime
remains to be handled. The remaining case, where the prime equals
, needs a separate argument.
Wild Ramification
The previous argument depended on the fact that the ramification group at was detected by a character of
. But at the prime
, a group of order
can move an algebraic number by extremely small amounts without changing its first multiplier. For example, in
, take
. The symmetry
changes
by
. This is divisible by three powers of
, not just one.
The first-order character cannot see this movement. It only becomes visible after examining higher powers of the local prime element. For cubic fields, we avoided this difficulty by unique factorization in . After cancelling the other factors, the remaining equation reduced to a cube root of
. For arbitrary
, such a simple reduction is not available. The larger cyclotomic ring need not even have unique factorization of elements. Instead, we study how closely the conjugate roots of an unknown polynomial can approach one another near
.
Suppose is odd, and we have a cyclic extension of degree
in which only
ramifies. First,
must be totally ramified. Otherwise there would be a nontrivial intermediate field in which no finite rational prime ramifies. This is impossible: the lattice discriminant bound from the geometry of numbers shows that every number field other than
has discriminant of absolute value greater than one, hence at least one ramified finite prime.
Choose a local prime element in our extension. Its minimal polynomial over
is Eisenstein:
All coefficients except the leading one are divisible by , while the constant term is not divisible by
. Normalize the valuation by
. Since the extension is totally ramified of degree
, we have
. Now write the polynomial using all its conjugate roots:
Differentiate and substitute . Every term vanishes except the one obtained by differentiating the factor
. Thus
This is the important expression. Its valuation measures the total number of factors of occurring in the differences between all the conjugate roots. Because the Galois group has prime order
, all nonidentity symmetries remain together until the first level at which the group becomes trivial. Suppose each difference
is divisible by exactly
powers of
. The product formula gives
.
But we can also differentiate the polynomial in the usual way. The leading term of the derivative is , which has valuation
. Every other nonzero term has valuation congruent to a different number modulo
, because it is of the form
, with
. The smallest-valuation terms therefore cannot cancel one another. We conclude that
Since is odd, this forces
. On the other hand, the first-order multiplicative character is trivial for a group of order
, so every nonidentity symmetry moves
by at least
. Therefore
. Hence
.
We have proved a concrete restriction: in a cyclic degree- extension ramified only at the odd prime
, every nonidentity symmetry moves a local prime element by exactly two powers of that element. The total exponent of the derivative is therefore
. We obtained this without identifying the unknown polynomial. We used only its degree, its Eisenstein coefficients, and the differences of its conjugate roots.
Suppose now that is any abelian extension of
-power degree, with
odd and no other finite prime ramified. We first show that its Galois group must be cyclic. At the prime above
, look at the groups of symmetries whose differences
are divisible by increasingly high powers of
. The first two groups are the whole Galois group. Every time the group becomes smaller, the quotient embeds into the additive group of
, so a nontrivial step removes exactly a factor of
. Let
be the group remaining after the first strict drop. Then
has index
. Suppose another subgroup
also had index
. The two fixed fields
and
would both be degree-
extensions ramified only at
. By the polynomial calculation above, the exponent measuring the differences of conjugate roots in each of them is
. Now compare the extension
with
. At the initial levels, the relevant groups have the same size. At the first drop,
contains the entire remaining group, whereas
does not. At every later level, the intersection with
is at least as large as the intersection with
. Therefore the total exponent obtained from the product of root differences is strictly larger for
than for
. But computing those exponents through the two towers
and
gives the same answer. Indeed, the different of a tower satisfies
in the totally ramified situation. Both intermediate fields have degree
and the same different exponent
. This contradicts the strict inequality. Hence
is the only subgroup of index
. A finite abelian
-group with only one index-
subgroup is cyclic. If it had two independent cyclic factors, reducing either factor modulo
would give two different homomorphisms onto a group of order
, and hence two different index-
subgroups. So
must be cyclic.
Now suppose our remaining field has degree
. Inside
, there is a cyclic subfield
of degree
, because the full Galois group is cyclic of order
. Form
. This extension is abelian of
-power degree, and only
ramifies. We just proved that its Galois group must be cyclic. But this cyclic group embeds into the product of the two cyclic groups
and
, each of order
. No element of this product has order larger than
. Therefore a cyclic subgroup of the product has order at most
. Since
contains both
and
, each of degree
, this forces
. Thus
The last unknown extension has been identified by the restrictions on how its conjugate roots can move near .
Prime Two: The prime two needs a separate calculation because the degree-two version of the derivative inequality does not restrict the movement as strongly. The first observation is very elementary. A quadratic field , with
squarefree, has discriminant
when
, and
otherwise. If only two ramifies, the only possibilities are
. Thus the three quadratic fields are
, all contained in
. In particular, there is only one real quadratic field ramified only at two, namely
.
Now let be a real cyclic extension of degree
, ramified only at two. Let
be the real subfield of
. It is also cyclic of degree
. Form
. The field
is real and abelian, and only two ramifies in it. Hence it can have only one quadratic subfield, namely
. But if a finite abelian group of power-of-two order is not cyclic, it has at least three subgroups of index two, and the corresponding fixed fields give at least three quadratic subfields.
Therefore is cyclic. Its Galois group embeds into
, so its degree cannot exceed
. Since it contains
and
, both of that degree, they coincide. Thus every real cyclic
-power extension ramified only at two is contained in a power-of-two cyclotomic field.
For a nonreal cyclic extension of degree at least four, its unique quadratic subfield is real. Indeed, complex conjugation is the unique element of order two in its cyclic Galois group, and it fixes that quadratic subfield. Therefore
. Form
. Its Galois group is
. Complex conjugation is the element whose first component is the unique involution in
and whose second component is the nonidentity element of
. Quotienting by that diagonal involution gives a cyclic group of order
.
Therefore the real subfield is a real cyclic extension of degree
, ramified only at two. The real case shows that
is cyclotomic. Since
, the original field
is cyclotomic as well. The prime-two case is complete.
Final Proof
We can now finish the proof. Suppose has an arbitrary finite abelian Galois group. Such a group is a product of cyclic groups of prime-power order. For each cyclic factor, take the field fixed by all the other factors. The original field is the compositum of these smaller cyclic fields. For each cyclic prime-power extension, our Fourier and prime-removal argument eliminates all ramification away from its degree prime, at the cost of adjoining suitable roots of unity. The final calculation at that prime shows that the remaining extension also lies in a cyclotomic field. Thus every cyclic factor belongs to a cyclotomic field. Finally, adjoining roots of unity of orders
and
is the same as adjoining roots of unity of order
. Hence the compositum of finitely many cyclotomic fields is cyclotomic. We conclude that every finite abelian extension
is contained in
. for some for some
This is the Kronecker–Weber theorem.
It is worth returning once more to the beginning, because the proof has a simpler interpretation than its later steps might suggest. We started with an element and wrote its conjugates in Fourier coordinates. In the cubic case, the important coordinate was
, satisfying
. Its cube belonged to
and could be factored. The exponents of prime factors in
showed where the cube-root equation could ramify. At a prime different from three, any exponents not divisible by three could be matched by a Gauss sum built from roots of unity. Dividing by that Gauss sum removed the local obstruction. At the prime three, the argument was different. After the other prime factors were removed, the norm relation forced the remaining cube equation to involve only units. Those units led directly to ninth roots of unity.
In higher degrees, the same distinction remains. At a prime different from the degree prime
, the movement of conjugate roots is controlled by one multiplicative residue character. A Gauss sum supplies a matching character, so the movement can be cancelled. At the prime
, the conjugates may remain extremely close even after their first-order movement has disappeared. The derivative
measures how much the conjugates collide. Its divisibility cannot be arbitrary, because the coefficients of
are rational integers. This restriction eventually forces the remaining extension to agree with a prime-power cyclotomic extension. In other words, the proof is built around one repeated operation: replace an unknown expression by a better one whose conjugates have less troublesome behavior, while retaining enough information to recover the original expression.
The cubic proof used two fortunate arithmetic facts. First, has unique factorization, so we could track the prime exponents in
very explicitly. Second, after removing all ordinary prime factors, there was essentially nothing left except units and the prime above three. The higher-degree proof uses a related property of
: there is no nontrivial number field unramified at every finite prime. Once all ramification has been removed, no further extension can remain hidden.
For an arbitrary number field, neither simplification is guaranteed. Prime ideals may fail to be generated by single elements, and there may be nontrivial everywhere-unramified abelian extensions. Moreover, residue fields can have elements rather than just
, so the required local characters need not come from ordinary
th roots of unity. The basic Fourier construction still works: abelian symmetries can still be separated into one-dimensional characters. What changes is the arithmetic needed to realize and cancel those characters. Class field theory replaces the simple factorization of rational numbers by ideal classes, congruence classes, and local norm conditions. But the question remains the same as at the beginning: given an algebraic number and its conjugates, which combinations of their symmetries can be reproduced by explicit arithmetic constructions, and what global restrictions prevent any additional combinations from occurring? Kronecker–Weber answers that question completely for the rational numbers.