Recall that every element
has an order that
divides
; thus every element is a root of
. Put
another way, the elements of
are the
st roots of
unity, and these are all the nonzero elements of the field.
Given a field, we divide it into conjugacy classes, taking the minimal
polynomial from each. Then based on our observation, we must have
as a product of the minimal polynomials of the nonzero
elements.
We can now pursue a more general problem, roots of
for other
values of
. These
roots of unity must exist in some field. We
find the field, then find the minimal polynomials of the conjugacy
classes in the field.
Suppose we have an element
of order
in some field
. Then
is a root of
in that field, and so
are the elements
. We can find
such a
if we form the field correctly.
Before doing so, it is interesting to pause a moment and suggest an application of this. Consider the DFT:
Recall that if
, then there are
elements of order
in
.
If
is the order of
modulo
, then
is the smallest
extension field of
in which
th roots of unity exist.
If we list the exponents of the primitive roots of unity, we get what
are called the cylotomic cosets. For example, for the last
example we have the following:
| Conjugacy class | Cyclotomic cosets | |
|
|
{0 } | |
|
|
|
{ 1,7,4,13} |
|
|
|
{2,14,8,11} |
|
|
|
{3,6,12,9} |
|
|
|
{5} |
|
|
|
{10} |
The cyclotomic cosets modulo
with respect to
contain the
exponents of the
distinct powers of a primitive
th root of
unity with respect to
, each coset corresponding to a conjugacy
class. These cosets provide a shorthand representation for the
conjugacy class.