Properties of Cyclotomic Polynomials

Algebra Field Theory Galois Theory
Article Directory

Background in Basic Field Theory

Let K be a field (in this post we mostly assume that KQ) and n an integer >1 which is not divisible by the characteristic of K. Then the polynomial

Xn1

is separable because its derivative is nXn10. Hence in the algebraic closure K, the polynomial has n distinct roots, which forms a group U, and is cyclic. In fact, as an exercise, one can show that, for a field k, any subgroup U of the multiplicative group k is a cyclic group.

The generator ζn of U is called the primitive n-th root of unity. Let K=Q and L be the smallest extension that contains all elements of U, then we have L=Q(ζn). As a matter of fact, L/K is a Galois extension (to be shown later), and the cyclotomic polynomial Φn(X) is the irreducible polynomial of ζn over Q. We first need to find the degree [L:K].

Proposition 1. Notation being above, L/K is Galois, the Galois group Gal(L/K)(Z/nZ) (the group of units in Z/nZ) and [L:K]=φ(n).

Let’s first elaborate the fact that |(Z/nZ)|=φ(n). Let [0],[1],,[n1] be representatives of Z/nZ. An element [x] in Z/nZ is a unit if and only if there exists [y] such that [xy]=[1], which is to say, xy1modn. Notice that xy1modn if and only if xy+mn=1 for some y,nZ, if and only if gcd(x,n)=1. Therefore |(Z/nZ)|=φ(n) is proved.

The proof can be produced by two lemmas, the first of which is independent to the characteristic of the field.

Lemma 1. Let k be a field and n be not divisible by the characteristic p. Let ζ=ζn be a primitive n-th root of unity in k, then (Z/nZ)Gal(k(ζ)/k) and therefore [k(ζ):k]φ(n). Besides, k(ζ)/k is a normal abelian extension.

Proof. Let σ be an embedding of k(ζ) in k over k, then

(σζ)n=σ(ζn)=σ(1)=1

so that σζ is also an n-th root of unity also. Hence σζ=ζi for some i=i(σ), uniquely determined modulo n. It follows that σ maps k(ζ) into itself. This is to say, k(ζ) is normal over k. Let τ be another automorphism of k(ζ) over k then

στζ=ζi(σ)i(τ).

It follows that i(σ) and i(τ) are prime to n (otherwise, σζ would have a period smaller than n, implying that the period of ζ is smaller than n, which is absurd). Therefore for each σGal(k(ζ)/k), i(σ) can be embedded into (Z/nZ), thus proving our theorem.

It is easy to find an example with strict inclusion. One only needs to look at k=R or C.

Lemma 2. Let ζ=ζn be a primitive n-th root of polynomial over Q, then for any pn, ζp is also a primitive n-th root of unity.

Proof. Let f(X) be the irreducible polynomial of ζ over Q, then f(X)|(Xn1) by definition. As a result we can write Xn1=f(X)h(X) where h(X) has leading coefficient 1. By Gauss’s lemma, both f and h have integral coefficients.

Suppose ζp is not a root of f. Since (ζp)n1=(ζn)p1=0, it follows that ζp is a root of h, and ζ is a root of h(Xp). As a result, f(X) divides h(Xp) and we write

h(Xp)=f(X)g(X).

Again by Gauss’s lemma, g(X) has integral coefficients.

Next we reduce these equations in Fp=Z/pZ. We firstly have

f(X)g(X)=h(Xp).

By Fermat’s little theorem ap=a for all aFq, we also have

h(Xp)=h(X)p.

Therefore

f(X)g(X)=h(X)p,

which implies that f(X)|h(X)p. Hence f and h must have a common factor. As a result, Xn1=f(X)h(X) has multiple roots in Fp, which is impossible because of our choice of p.

Now we are ready for Proposition 1.

Proof of Proposition 1. Since Q is a perfect field, Q(ζ)/Q is automatically separable. This extension is Galois because of lemma 1. By lemma 1, it suffices to show that [Q(ζ):Q]φ(n).

Recall in elementary group theory, if G is a finite cyclic group of order m and x is a generator of G, then the set of generators consists elements of the form xν where νm. In this occasion, if ζ generates U, then ζp also generates U because pn. It follows that every primitive n-th root of unity can be obtained by raising ζ to a succession of prime numbers that do not divide n (as a result we obtain exactly φ(n) such primitive roots). By lemma 2, all these numbers are roots of f in the proof of lemma 2. Therefore degf=[L:K]φ(n). Hence the proposition is proved.

We will show that f in the proof lemma 2 is actually the cyclotomic polynomial Φn(x) you are looking for. The following procedure works for all fields where the characteristic does not divide n, but we assume characteristic to be 0 for simplicity.

We have

Xn1=ζ(Xζ),

where the product is taken over all n-th roots of unity. Collecting all roots with the same period d (i.e., those ζ such that ζd=1), we put

Φd(X)=periodζ=d(Xζ).

Then

Xn1=d|nΦd(X).

It follows that Φ1(X)=X1 and

Φn(X)=Xn1dnd<nΦd(X).

This presentation makes our computation much easier. But to understand Φn, we still should keep in mind that the n-th cyclotomic polynomial is defined to be

Φn(X)=periodζ=n(Xζ),

whose roots are all primitive n-th roots of unity. As stated in the proof of proposition 1, there are φ(n) primitive n-th roots of unity, and therefore degΦn(X)=φ(n). Besides, f|Φn. Since both have the same degree, these two polynomials equal. It also follows that d|nφ(n)=n.

Proposition 2. The cyclotomic polynomial is irreducible and is the irreducible polynomial of ζ over Q, where ζ is a primitive n-th root of unity.

We end this section by a problem in number fields, making use of what we have studied above.

Problem 0. A number field F only contains finitely many roots of unity.

Solution. Let ζF be a root of unity with period n. Then Φn(ζ)=0 and therefore [Q(ζ):Q] has degree φ(n). Since Q(ζ) is also a subfield of F, we also have φ(n)[F:Q]. Since {n:φ(n)[F:Q]} is certainly a finite set, the number of roots of unity lie in F is finite.

Technical Computations

We will do some dirty computation in this section.

Problem 1. If p is prime, then Φp(X)=Xp1+Xp2++1, and for an integer ν1, Φpν(X)=Φp(Xpν1).

Solution. The only integer d that divides p is 1 and we can only have

Φp(X)=Xp1Φ1(X)=Xp1++1.

For the second statement, we use induction on ν. When ν=1 we have nothing to prove. Suppose now

Φpν(X)=Φp(Xpν1)=Xpν1Xpν11=Xpν1r=0ν1Φpr(X)

is proved, then Xpν1=r=0νΦpr(X) and therefore

Φpν+1(X)=Xpν+11r=0νΦpr(X)=Xpν+11Xpν1=Φp(Xpν).

Problem 2. Let p be a prime number. If pn, then

Φpn(X)=Φn(Xp)Φn(X).

Solution. Assume pn first. It holds clearly for n=1. Suppose now the statement holds for all integers <n that are prime to p. We see

Φn(Xp)Φn(X)=Xpn1d|nd<nΦd(Xp)d|nd<nΦd(X)Xn1=Xpn1(Xn1)d|nd<nΦdp(X)=Xpn1d|nΦd(X)d|nd<nΦdp(X)=Φnp(X).

Problem 3. If n is an odd number >1, then Φ2n(X)=Φn(X).

Solution. By problem 2, Φ2n(X)=Φn(X2)/Φn(X). To show the identity it suffices to show that

Φn(X)Φn(X)=Φn(X2).

For n=3 we see

Φ3(X)Φ3(X)=(X2+X+1)(X2X+1)=(X2+1)2X2=X4+X2+1=Φ3(X2).

Now suppose it holds for all odd numbers 3d<n, then

Φn(X)Φn(X)=(Xn1)(Xn1)(X1)(X1)3d<nd|nΦd(X)Φd(X)=(X2n1)(X21)3d<nd|nΦd(X2)=Φn(X2).

The following problem would not be very easy without the Möbius inversion formula so we will use it anyway. Problems above can also be deduced from this formula. Let f:Z0Z0 be a function and F(n)=d|nf(d), then the Möbius inversion formula states that

f(n)=d|nF(n/d)μ(d)

with

μ(n)={0if n is divisible by p2 for some prime p,(1)rif n is a product of r distinct primes,1if n=1.

Putting f(d)=Φd(X), we see

Φn(X)=d|n(Xn/d1)μ(d).

Now we proceed.

Problem 4. If p|n, then Φpn(X)=Φn(Xp).

Solution. By the Möbius inversion formula, we see

Φpn(X)=d|pn(Xpn/d1)μ(d)=(d|n(Xpn/d1)μ(d))(d|npdn(Xpn/d1)μ(d))=Φn(Xp)

because all d that divides np but not n must be divisible by p2. Problem 2 can also follow from here.

Problem 5. Let n=p1r1psrs, then

Φn(X)=Φp1ps(Xp1r11psrs1).

Solution. This problem can be solved by induction on the number of primes. For s=1 it is problem 1. Suppose it has been proved for s1 primes, then for

ns1=p1r1ps1rs1

and a prime ps, we have

Φns1ps(X)=Φns1(Xps)Φns1(X)

On the other hand,

Φns1(Xps)Φns1(X)=Φp1ps1(Xp1r11ps1rs11ps)Φp1ps1(Xp1r11ps1rs11)=Φp1ps1ps(Xp1r11ps1rs11ps11)

if we put Y=Xp1r11ps1rs11. When it comes to higher degree of ps, it’s merely problem 2. Therefore we have shown what we want.

Computing the Norm

Let ζ be a primitive n-th root of unity, put K=Q(ζ) and G the Galois group.. We will compute the norm of 1ζ with respect to the extension K/Q. Since this extension is separable, we have

NQK(1ζ)=σGσ(1ζ)=σG(1σζ)

Since G acts on the set of primitive roots transitively, {σζ}σG is exactly the set of primitive roots of unity, which are roots of Φn(X). It follows that

NQK(1ζ)=Φn(1).

If n=pr, then NQK(1ζ)=Φp(1pr1)=Φp(1)=p. On the other hand, if

n=p1r1psrs,

then

Φn(1)=Φp1ps(1)=1.

Comments