In this section, we shall ask and answer the polynomial analog of the question mentioned in the previous section. We state a prove a polynomial analog of Lemma 1.4.2.
The proof below is worthwhile trying to understand well since it contains a basic idea which occurs in other parts of mathematics.
proof:
If
is not empty then it must contain
0. If it contains some non-zero element then
it must contain a polynomial of degree
. By the well-ordering
principle,
contains an element of
least degree
.
Claim:
.
If
then the division algorithm says
that there is a polynomial
such that
. Since
is closed under addition
and subtraction,
belongs to
.
But
is a non-zero element of
of
lowest degree, so
must be zero.
This implies
.
Since
was choosen arbitrarily, this imples
. The reverse inclusion
follows from the assumption
that
is closed under addition and subtraction.
This proves the claim and the lemma.
In other words, any non-empty subset
of polynomials
having coefficients in a field
which is closed under addition and polynomial
multiplication must be the set of multiples of
a fixed polynomial
. Using mathematical induction,
it is possible to show that an ideal of
is principal. This implies
is a
principal ideal domain.
We will study later the ``ring of polynomials modulo
'',