Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 3

Algebraic Number Theory

Romyar Sharifi

Chapter 3 Applications

Book contents

Chapter 3
Applications

3.1. Cyclotomic fields

Let n be a positive integer.

Notation 3.1.1.

Let n be a positive integer and K a field. The group μn(K) will denote the group of nth roots of unity in K.

Remark 3.1.2.

Let n be a positive integer and K a field of characteristic not divisible by n. The group μn to denote the group of nth roots of unity in an algebraic closure of K, fixed beforehand. This group always has order n.

Example 3.1.3.

Let and p be prime numbers.

a.

The group μ(𝔽p¯) of th roots of unity in an algebraic closure of 𝔽p has order for p and is trivial if = p.

b.

The group μ(𝔽p) is μ for dividing p1 and 1 for all other .

Notation 3.1.4.

Let K be a field and L be an extension of K. If S is a set of elements of L, then the field K(S) is the subfield of L given by adjoining to K all elements of S.

Definition 3.1.5.

The field (μn) is the nth cyclotomic field.

Remark 3.1.6.

More generally, if F is a field of characteristic not dividing n, we let F (μn) denote the field obtained from F by adjoining all nth roots of unity in an algebraic closure of F.

Remark 3.1.7.

The field (μn) is Galois over , as it is the splitting field of xn1. All nth roots of unity are powers of any primitive nth root of unity ζn, so (μn) = (ζn).

Definition 3.1.8.

The nth cyclotomic polynomial Φn [x] is the polynomial which has as its roots the primitive nth roots of unity.

Note that xn1 = dnΦd. We recall the definition of the Möbius function.

Definition 3.1.9.

The Möbius function μ : 1 is defined as follows. Let n = p1r1pkrk for distinct primes pi and positive integers ri for 1 i k for some k 0. Then

μ(n) = { (1)kifri = 1forall1 i k, 0 otherwise.

We omit the proof of the following, which uses the Möbius inversion formula.

Lemma 3.1.10.

For all n 1, we have

Φn =dn(xd1)μ(nd).

Examples 3.1.11.

a.

Φ1 = x1, Φ2 = x+1, Φ3 = x2 +x+1, Φ4 = x2 +1, Φ5 = x4 +x3 +x2 +x+1, Φ6 = x2 x+1.

b.

Φ15 = x8 x7 +x5 x4 +x3 x+1.

c.

Φpr = xpr1(p1) ++xpr1 +1 for every prime p and r 1.

For n 1, we will use ζn to denote a primitive nth root of unity in an algebraic closure of .

Lemma 3.1.12.

Let n 1 and let i,j be relatively prime to n. Then

1ζni 1ζnj 𝒪(μn)×.
Proof.

Let k with 𝑗𝑘 1modn. Then

1ζni 1ζnj = 1ζn𝑖𝑗𝑘 1ζnj = 1+ζnj++ζ nj(𝑖𝑘1)

is an algebraic integer since ζn is. The same being true after reversing i and j, we have the result.

We let [μn] denote the ring generated over by the nth roots of unity.

Lemma 3.1.13.

Let p be a prime number and r 1. Then the absolute value of the discriminant of [μpr] is a power of p, and (p) is the only prime of that ramifies in (μpr). It is totally ramified and lies below (1ζpr). Moreover, [(μpr) : ] = pr1(p1).

Proof.

Note that [(μpr) : ] degΦpr = pr1(p1). We have

i=1 pi pr1(1ζ pri) = Φ pr(1) = p,

which forces 1ζpri to be divisible by a prime 𝔭 over p for some i with p i. By Lemma 3.1.12, this implies that each 1ζprj with p j is divisible by 𝔭. Therefore, 𝔭pr1(p1) divides (p), which forces [(μpr) : ] = pr1(p1) and

p𝒪(μpr) = 𝔭pr1(p1) = (1ζ pr)pr1(p1).

Finally, note that

disc(𝒪(μpr))disc([μpr]),

which is a product of terms of the form ζpriζprj for ij both not divisible by p, which from what we have seen is only divisible by the prime 𝔭 = (1ζpr). In other words, no prime other than p can ramify.

Proposition 3.1.14.

The nth cyclotomic polynomial is irreducible for all n 1. In other words, [(μn) : ] = φ(n), where φ is Euler’s phi-function. Moreover, the prime ideals of that ramify in 𝒪(μn) are the odd primes dividing n and, if n is a multiple of 4, the prime 2.

Proof.

If we write n = p1r1pkrk for distinct primes pi and ri 1, then

degΦn =dnμ (n d )d =i=1kp iri1(p i1) = φ(n).

Hence, the second statement implies the first. In n is even and not divisible by 4, then (μn) = (μn2) and φ(n) = φ(n2), so we may assume that either n is odd or divisible by 4.

The result holds for k = 1 by Lemma 3.1.13. Write n = mpr for some m,r 1 and prime p not dividing m. As p does not not ramify in (μm) by induction on k but is totally ramified in (μpr) by Lemma 3.1.13, the fields (μm) and (μpr) are linearly disjoint. So by induction, the primes which divide n are exactly those which ramify in (μn) = (μm)(μpr), and we have

[(μn) : ] = [(μm) : ][(μpr) : ] = φ(m)φ(pr) = φ(n).

For an arbitrary field of good characteristic, let us make the following definition.

Definition 3.1.15.

Let F be a field of characteristic not dividing n 1. Define a homomorphism

χn: Gal(F (μn)F ) (𝑛ℤ)×

on σ Gal(F (μn)F ) as follows. If iσ is the unique integer with 1 i n such that σ(ζ) = ζiσ for all nth roots of unity ζ in F, then χn(σ) = iσmodn. Then χn is called the nth cyclotomic character for F.

Notation 3.1.16.

If a 𝑛ℤ, then ζa for ζ an nth root of unity denotes ζb for any b with image a modulo n.

Remark 3.1.17.

The homomorphism χn is always injective, as any element such that χn(σ) = 1 for all σ Gal(F (μn)F ) fixes μn and hence F (μn).

We have the following corollary of Proposition 3.1.14, since χn for F = is an injective homomorphism between groups of equal order.

Corollary 3.1.18.

The nth cyclotomic character χn: Gal((μn)) (𝑛ℤ)× is an isomorphism.

Remark 3.1.19.

In particular, (μpr) for an odd prime p and r 1 has cyclic Galois group.

Proposition 3.1.20.

The ring [μn] is the ring of integers of (μn).

Proof.

We first consider n = pr for a prime p and r 1. In this case, we know that the absolute value of disc([μpr]) is a power of p, say pm. In particular, 𝔣[μpr] divides (pm). Let λr = 1ζpr, which generates the unique prime over (p) in (μpr). Since (p) is totally ramified in (μpr), we have that

𝒪(μpr)(λr)≅ℤ𝑝ℤ.

In particular,

𝒪(μpr) = +λr𝒪(μpr) = [μpr]+λr𝒪(μpr). (3.1.1)

Replacing 𝒪(μpr) on the right-hand side of (3.1.1) using the formula for 𝒪(μpr) given by (3.1.1) itself, we have

𝒪(μpr) = [μpr]+λr([μpr]+λr𝒪(μpr)) = [μpr]+λr2𝒪 (μpr).

Repeatedly replacing 𝒪(μpr) on the right, we eventually obtain

𝒪(μpr) = [μpr]+pm𝒪 (μpr),= [μpr]

the latter step by definition of the conductor.

For the general case, we write n = p1r1pkrk for distinct primes pi and ri 1. Then (μn) is the compositum of the (μpiri) and the discriminants of the fields (μpiri) are relatively prime, we have by Proposition 1.4.28 that the elements

ζp1r1i1ζ pkrkik

with 0 it ptrt1(pt1)1 for each 1 t k form an integral basis of 𝒪(μn). Since these elements are all contained in the order [μn] in (μn), we have the result.

The factorization in (μn) of the ideals generated by prime numbers is rather easy to describe.

Proposition 3.1.21.

Let p be a prime, and let r 0 be such that pr exactly divides n. Let m = n pr, and let f be the order of p in (𝑚ℤ)×. Then

𝑝ℤ[μn] = (𝔭1𝔭g)φ(pr),

where φ is the Euler phi-function, g = f1φ(m) and the 𝔭i are distinct primes of [μn] of residue degree f.

Proof.

First, we note that p is totally ramified in (μpr) of degree φ(pr) and unramified in (μm). It follows from Remark 2.5.7 that the ramification index of p in (μn) is then φ(pr), and the residue degree of p in (μn) is the residue degree of p in (μm).

So, let 𝔮 be a prime ideal over p in [μm]. Its residue field is

F = [μm]𝔮 = 𝔽p(μm).

As F× is cyclic of order |F|1, we have F = 𝔽pf for the smallest f 1 such that m(pf1), which is to say that the order of p in (𝑚ℤ)×. Finally, g is constrained to be f1φ(m) by the degree formula.

We have the following corollary.

Corollary 3.1.22.

An odd prime p splits completely in (μn) if and only if p 1modn. The prime 2 does not split completely in a nontrivial cyclotomic extension of .

Proof.

By Proposition 3.1.21, to say that a prime p splits completely is exactly to say that φ(pr) = 1 and the order of p in ((npr))× is 1. If p is odd, then this means r = 0 and p 1modn. If p = 2, this forces n = 1 or n = 2, which is to say that (μn) = .

3.2. Quadratic reciprocity

In this section, we briefly explore the relationship between cyclotomic and quadratic fields.

Definition 3.2.1.

For an odd prime p, we set p = (1)(p1)2p.

The reason for this definition is the following.

Lemma 3.2.2.

Let p be an odd prime. The field (p) is the unique quadratic field contained in (μp).

Proof.

Recall that Gal((μp)) is cyclic of order p1, so it has a unique quotient of order 2. As p is totally ramified in (μp), it is ramified in K, so K = (p), where p = ±p. Moreover, no other prime is ramified in (μp). If p 3mod4, then K has ring of integers [p], and we have

[p](2)𝔽2[x](x2 p)𝔽2[x](x+1)2,

which means that 2 ramifies in K. Since p 1mod4, we must have p = p.

We prove the following consequence of results of Proposition 3.1.21.

Proposition 3.2.3.

Let p and q be odd prime numbers. Then q splits in (p) if and only if q splits into an even number of primes in (μp).

Proof.

The prime q splits into an even number of primes in (μp) if and only if the decomposition group Gq of any prime over q has even index in Gal((μp)). Since the latter Galois group is cyclic with unique subgroup of index 2 having fixed field (p) by Lemma 3.2.2, this occurs if and only if Gq fixes (p), which is to say, if and only if q splits in (p).

Definition 3.2.4.

Let a be an integer and q be an odd prime number with q a. The Legendre symbol (aq) is defined to be

(a q ) = { 1 if a is a square mod q, 1 otherwise.

In other words, (aq) is the unique unit in such that

aq1 2 (a q )modq.

Gauss’ law of quadratic reciprocity is the following.

Theorem 3.2.5 (Quadratic reciprocity).

If p and q are distinct odd prime numbers, then

(p q ) (q p ) = (1)p1 2 q1 2 .
Proof.

Note that

pq1 2 (1)p1 2 q1 2 modq.

if and only if

(p)q1 2 1modq,

which is to say if and only if (p q ) = 1. This says exactly that there exists a such that

a2 pmodq.

But then x2 p factors modulo q, so (q) splits in [p]. Now, Proposition 3.2.3 tells us that this happens if and only if (q) splits in [μp] into an even number of primes. By Proposition 3.1.21, the prime (q) splits into (p1)f primes in (μp), where f is the order of q modulo p. So, it splits into an even number if and only if f divides (p1)2, which is to say that

qp1 2 1modp,

In other words, (p q) = (1)p1 2 q1 2 if and only if (q p) = 1, as desired.

Remark 3.2.6.

To complete the law of quadratic reciprocity, we note that the definitions imply that

( 1 p ) = (1)p1 2 ,

and we note without proof that

( 2 p ) = (1)p21 8

3.3. Fermat’s last theorem

Recall that Fermat’s last theorem (or FLT) asserts the nonexistence of integer solutions to xn+yn = zn with 𝑥𝑦𝑧0 for all n 3. Fermat proved this conjecture for n = 4, and given this it clearly suffices to show the nonexistence for odd prime exponents. While FLT was proven by Wiles in 1995 using methods far beyond the scope of these notes, we are able to prove here the following so-called “first case” of Fermat’s last theorem for odd prime exponents of a special form.

Fix an odd prime p and a primitive pth root of unity ζp in (μp). We require a couple of lemmas.

Lemma 3.3.1.

Let x,y be relatively prime, and suppose that p x+y. Then the elements x+ζpiy of [μp] for 0 i p1 are pairwise relatively prime.

Proof.

If 𝔮 is a prime ideal of [μp] dividing both x+ζpiy and x+ζpjy for 0 i < j < p, then 𝔮 divides both (ζpjζpi)y and (ζpjζpi)x. If 𝔮 does not lie over p, then it must divide both x and y, which is impossible. Thus, 𝔮 lies over p, so it equals (1ζp). On the other hand, x+ζpiy x+ymod(1ζp), which implies that x+y 0modp, since x+y is an integer. Thus, no such 𝔮 can exist.

Terminology 3.3.2.

For any n 3, we refer to the unique element of Gal((μn)) with image 1 under the nth cyclotomic character as complex conjugation, and we write α¯ to denote the image of α (μn) under this element.

Lemma 3.3.3.

Let 𝜖 [μp]×. Then there exists j such that 𝜖ζpj is fixed by complex conjugation.

Proof.

Note that σ(𝜖¯𝜖1) has absolute value 1 for every σ Gal((μp)), so it is a root of unity by Corollary 4.4.2 below, hence a 2pth root of unity. If the lemma did not hold, then each

𝜖¯ζpj 𝜖ζpj = ζp2j𝜖¯ 𝜖

would have to be nontrivial for every j, which means that 𝜖¯𝜖1 would not be a pth root of unity. Thus, we would have 𝜖¯𝜖1 = ζpi for some i . We may write 𝜖 cmod(1ζp) for some c , and so 𝜖¯ cmod(1ζp) as well. On the other hand,

𝜖¯ = ζpi𝜖 𝜖 cmod(1ζ p),

so (1ζp) in fact divides 𝜖, which is a contradiction as 𝜖 is a unit.

Lemma 3.3.4.

The images of any p1 of the pth roots of unity in [μp](p) are 𝔽p-linearly independent.

Proof.

We have

[μp](p)≅ℤ[x](Φp,p)𝔽p[x](Φp)𝔽p[x](x1)p1,

and the images of any p1 among 1,x,,xp1 are 𝔽p-linearly independent in the last term.

We now prove the result.

Theorem 3.3.5 (Kummer).

Let p be an odd prime such that Cl(μp) contains no elements of order p. Then there do not exist integers x,y,z with p 𝑥𝑦𝑧 such that xp+yp = zp.

Proof.

Suppose that xp+yp = zp for some integers x,y,z with p 𝑥𝑦𝑧 and (x,y) = (1). For p = 3, we note that the set of nonzero cubes modulo 9 is {±1}, and no sum of two elements of this set equals a third element modulo 9. Thus, we may assume that p 5 from now on.

Note that if x y zmodp, then 2xp xpmodp, so p divides 3xp. As p 𝑥𝑦𝑧, this cannot happen. Therefore, if pxy, then p x+z. Switching the roles of y and z by writing xp+(z)p = (y)p if needed, we may therefore assume that p xy.

In [μp], the quantity xp+yp factors, and we have

i=0p1(x+ζ piy) = zp.

Note that z x+ymodp, so p does not divide x+y. By Lemma 3.3.1, we have that the ideals (x+ζpiy) are coprime, so in order that their product be a pth power of an ideal, each must itself be a pth power. Write

(x+ζpy) = 𝔞p

for some ideal 𝔞 of [μp]. Since we have assumed that Cl(μp) has no elements of order p, the ideal 𝔞 is principal, so let α [μp] be a generator of 𝔞. We then have

x+ζpy = 𝜖αp

for some 𝜖 [μp]×.

Now, note that we may write α = c+d(1ζ) for some c and d [μp], and

αp cp+dp(1ζ)p cmod(p).

By Lemma 3.3.3, we that there exists j such that 𝜖 = ζpj𝜖 is fixed by complex conjugation. We thus have

x+ζpy ζpj𝜖cmod(p),

so

x+ζp1y ζ pj𝜖cmod(p).

We therefore have

ζp2j(x+ζ py) x+ζp1ymod(p).

If ζp2j, ζp2j+1, 1 and ζp1 are distinct pth roots of unity, then since p1 4, they are linearly independent modulo p. This would force both x and y to be divisible by p, a contradiction.

It follows that 1 = ζp2j, ζp2j+1 or ζp2j+2. In the first of these cases, we have

x+ζpy x+ζp1ymod(p),

so p divides y, a contradiction. In the second case, we have

ζp1x+y x+ζ p1y𝑚𝑜𝑑(p),

so p divides xy, again a contradiction. In the final case, we have

ζp2x+ζ p1y x+ζ p1y𝑚𝑜𝑑(p),

so p divides x, a contradiction, finishing the proof.

Remark 3.3.6.

The “first case” of FLT refers to the nonexistence of solutions to xp+yp = zp with p 𝑥𝑦𝑧. The “second case” refers to the nonexistence of solutions with p𝑥𝑦𝑧 and 𝑥𝑦𝑧0.

Find in the notes