In this section, we generalize the construction of §2.1.1.
proof:
We have already seen that
is a commutative ring with unity.
We need only show that each non-zero element in
has an inverse modulo
,
provided
is irreducible.
Let
be non-zero.
Since
is irreducible, we have
(otherwise, it would be a
non-trivial factor of
).
By Lemma 2.5.5,
has
an inverse modulo
.
(b)
is a primitive polynomial
over
.
In fact, if
by Example 2.5.4.
As long as you remember that in
, we have
(since everything
is modulo
), addition and multiplication
in
is easy:
This defines addition
This looks just like complex multiplication,
where
has been replaced by
.
In other words, there is a direct correspondence between
the addition and multiplication formulas for
and for
.
More abstractly said, if we define
by
then
for all
In fact, if
as in the above example.
Addition and multiplication
in
is easy:
With these binary operations,
This looks just like complex multiplication,
where
has been replaced by
.
In other words, there is a direct correspondence between
the addition and multiplication formulas for
and
.
In this example,
is a primitive element in
but
is not (so
is not a primitive
polynomial over
). Also,
is a primitive element but
is not.
Motivated by the facts in the above examples, we make the following definition.
for all
for all