Let be a field.
Definition 1. Define the n-th cyclotomic extension of by
, where
. We call
a primitive n-th root of unity if
for any
.
Problem 1. Show that contains a primitive
-th root of unity if and only if
. In this case, there are
primitive n-th roots of unity, where
denotes the Euler totient function.
(Click for Solution)
Solution. If , then
contains
as a subfield, so that
contains the usual primitive
-th root of unity
. Otherwise, suppose
for some prime
.
If , then
for some integer
. Then for any
,
so that , and
is not a primitive
-th root of unity.
Suppose . By Euler’s totient theorem,
Therefore, , so that there exists an integer
such that
Recall that is cyclic, so that there exists
such that
. In particular,
In particular, is a primitive
-th root of unity.
Problem 2. Let be a primitive
-th root of unity. Show that
is Galois, and
is isomorphic to some subgroup of
.
(Click for Solution)
Solution. Let be a primitive
-th root of unity and write
. Then
is the splitting field of the separable polynomial
, and thus
is Galois. For any
,
is uniquely determined by
for
. Define the desired monomorphism by
.
Definition 2. Let denote the primitive n-th roots of unity. Define the n-th cyclotomic polynomial
by
We remark that .
Problem 3. Show that is irreducible in
. Furthermore,
.
(Click for Solution)
Solution. Firstly, . Fix a root
of
. Then for any prime
,
. For any
, write
In particular,
Therefore, there are at least roots of
, so that
. Therefore,
is irreducible, and
. Using Problem 2, the monomorphism
defined by
has kernel
, so that
.
Problem 4. Let be an algebraically closed field with
. Suppose
is a positive integer with
. Show that
contains exactly the primitive
-th roots of unity in
.
(Click for Solution)
Solution. Let denote the subset of the primitive
-th roots of unity in
. We aim to show that
. Fix
for any
. Then
implies that
, so that
. Setting
,
. Furthermore,
Therefore, .
Problem 5. Prove Dirichlet’s theorem: for every positive integer , there exists infinitely many prime numbers
such that
.
(Click for Solution)
Solution. Fix . Since
as
, there exists
such that the integer
. Hence, there exists a prime
so that . In particular,
so that
is cyclic with order
. Therefore,
, so that
. Define the infinite set
as desired.
—Joel Kindiak, 4 May 26, 1226H
Leave a comment