Skip to content

Cyclotomic Fields

One of the most important classes of number fields arises from the solutions of the equation

Roots of Unity

One of the most important classes of number fields arises from the solutions of the equation

xn=1. x^n=1.

The solutions are called the nn-th roots of unity.

In the complex numbers, these roots are

1,ζn,ζn2,,ζnn1, 1,\zeta_n,\zeta_n^2,\ldots,\zeta_n^{n-1},

where

ζn=e2πi/n. \zeta_n=e^{2\pi i/n}.

Geometrically, these numbers lie equally spaced around the unit circle in the complex plane.

For example, the fourth roots of unity are

1,i,1,i. 1,\quad i,\quad -1,\quad -i.

The sixth roots of unity form a regular hexagon.

Roots of unity connect algebra, geometry, trigonometry, and number theory. The fields generated by them are called cyclotomic fields.

Cyclotomic Polynomials

The polynomial

xn1 x^n-1

has all nn-th roots of unity as roots. However, many of these roots also satisfy equations of smaller degree. The primitive roots play the essential role.

Definition. An nn-th root of unity ζ\zeta is called primitive if

ζn=1 \zeta^n=1

but

ζk1for 1k<n. \zeta^k\neq1 \qquad \text{for } 1\le k<n.

Equivalently, ζ\zeta generates all nn-th roots of unity through its powers.

The primitive nn-th roots are precisely

ζna \zeta_n^a

with

gcd(a,n)=1. \gcd(a,n)=1.

The polynomial whose roots are the primitive nn-th roots of unity is called the nn-th cyclotomic polynomial.

Definition.

Φn(x)=1angcd(a,n)=1(xζna). \Phi_n(x) = \prod_{\substack{1\le a\le n \\ \gcd(a,n)=1}} (x-\zeta_n^a).

The degree of Φn(x)\Phi_n(x) equals Euler’s totient function:

degΦn(x)=φ(n). \deg \Phi_n(x)=\varphi(n).

For example,

Φ1(x)=x1, \Phi_1(x)=x-1, Φ2(x)=x+1, \Phi_2(x)=x+1, Φ3(x)=x2+x+1, \Phi_3(x)=x^2+x+1,

and

Φ4(x)=x2+1. \Phi_4(x)=x^2+1.

The factorization

xn1=dnΦd(x) x^n-1 = \prod_{d\mid n}\Phi_d(x)

is fundamental in algebra and number theory.

Definition of Cyclotomic Fields

The field generated by a primitive nn-th root of unity is called a cyclotomic field.

Definition.

Q(ζn) \mathbb{Q}(\zeta_n)

is the nn-th cyclotomic field.

Since all primitive nn-th roots are powers of one another, adjoining a single primitive root automatically adjoins all of them.

For example,

Q(ζ3)=Q(1+32). \mathbb{Q}(\zeta_3) = \mathbb{Q}\left( \frac{-1+\sqrt{-3}}{2} \right).

Because

ζ32+ζ3+1=0, \zeta_3^2+\zeta_3+1=0,

the field has degree

[Q(ζ3):Q]=2. [\mathbb{Q}(\zeta_3):\mathbb{Q}]=2.

Similarly,

Q(ζ4)=Q(i). \mathbb{Q}(\zeta_4)=\mathbb{Q}(i).

Cyclotomic fields are finite extensions of Q\mathbb{Q}, hence number fields.

Irreducibility of Cyclotomic Polynomials

Cyclotomic polynomials are irreducible over Q\mathbb{Q}.

Theorem. For every positive integer nn,

Φn(x) \Phi_n(x)

is irreducible in Q[x]\mathbb{Q}[x].

Consequently, the minimal polynomial of ζn\zeta_n over Q\mathbb{Q} is exactly Φn(x)\Phi_n(x). Therefore,

[Q(ζn):Q]=φ(n). [\mathbb{Q}(\zeta_n):\mathbb{Q}] = \varphi(n).

This result gives an explicit infinite family of algebraic extensions with computable degree.

For example,

Φ5(x)=x4+x3+x2+x+1, \Phi_5(x) = x^4+x^3+x^2+x+1,

so

[Q(ζ5):Q]=4. [\mathbb{Q}(\zeta_5):\mathbb{Q}]=4.

Galois Groups of Cyclotomic Fields

Cyclotomic fields are Galois extensions of Q\mathbb{Q}.

Every automorphism is determined by where it sends ζn\zeta_n. Since automorphisms preserve algebraic relations, ζn\zeta_n must map to another primitive nn-th root:

σ(ζn)=ζna,gcd(a,n)=1. \sigma(\zeta_n)=\zeta_n^a, \qquad \gcd(a,n)=1.

Thus the Galois group is naturally identified with the multiplicative group of units modulo nn:

Gal(Q(ζn)/Q)(Z/nZ)×. \mathrm{Gal}(\mathbb{Q}(\zeta_n)/\mathbb{Q}) \cong (\mathbb{Z}/n\mathbb{Z})^\times.

The group operation corresponds to exponent multiplication modulo nn.

For example,

(Z/5Z)×={1,2,3,4}, (\mathbb{Z}/5\mathbb{Z})^\times = \{1,2,3,4\},

which is cyclic of order 44. Therefore

Gal(Q(ζ5)/Q)C4. \mathrm{Gal}(\mathbb{Q}(\zeta_5)/\mathbb{Q}) \cong C_4.

Cyclotomic fields thus provide explicit examples where Galois groups can be described concretely.

Cyclotomic Extensions and Abelian Groups

Since

(Z/nZ)× (\mathbb{Z}/n\mathbb{Z})^\times

is always abelian, cyclotomic extensions are abelian Galois extensions.

This fact lies at the heart of class field theory.

Kronecker and Weber proved a remarkable theorem:

Kronecker-Weber Theorem. Every finite abelian extension of Q\mathbb{Q} is contained in a cyclotomic field.

Thus cyclotomic fields encode all abelian extensions of the rational numbers.

This theorem reveals that roots of unity govern much of algebraic number theory.

Gaussian Integers and Cyclotomic Fields

The simplest nontrivial cyclotomic field is

Q(i)=Q(ζ4). \mathbb{Q}(i)=\mathbb{Q}(\zeta_4).

Its ring of integers is

Z[i]={a+bi:a,bZ}, \mathbb{Z}[i] = \{a+bi : a,b\in\mathbb{Z}\},

called the Gaussian integers.

Similarly,

Q(ζ3)=Q(3) \mathbb{Q}(\zeta_3) = \mathbb{Q}(\sqrt{-3})

has ring of integers

Z[ζ3]. \mathbb{Z}[\zeta_3].

These rings possess rich arithmetic structures involving primes, units, and factorization.

For example, primes congruent to 1(mod4)1\pmod4 factor in Z[i]\mathbb{Z}[i], while primes congruent to 3(mod4)3\pmod4 remain prime.

Thus congruence conditions on ordinary integers become geometric statements inside cyclotomic fields.

Cyclotomic Fields and Fermat’s Last Theorem

Cyclotomic fields played a major historical role in attempts to prove Fermat’s Last Theorem.

Kummer studied the arithmetic of

Q(ζp) \mathbb{Q}(\zeta_p)

for prime pp. He discovered that ordinary unique factorization can fail in these fields. To repair this failure, he introduced ideal numbers, which later evolved into Dedekind ideals.

Kummer proved Fermat’s Last Theorem for a large class of primes called regular primes by studying the arithmetic of cyclotomic fields.

Thus cyclotomic fields directly motivated the development of algebraic number theory.

Cyclotomic Fields in Modern Mathematics

Cyclotomic fields appear throughout modern mathematics.

They arise in:

  • reciprocity laws;
  • class field theory;
  • modular forms;
  • Galois representations;
  • algebraic topology;
  • Fourier analysis;
  • cryptography.

The discrete Fourier transform is fundamentally built from roots of unity. Finite field analogues of cyclotomic constructions appear in coding theory and cryptographic algorithms.

In modern arithmetic geometry, cyclotomic characters describe how Galois groups act on roots of unity, linking field extensions with deep arithmetic invariants.

Thus cyclotomic fields form one of the central bridges between algebra, arithmetic, and symmetry.