Jump to content

Polynomial ring/Field/Zeroes/Introduction/Section

From Wikiversity

A zero of a polynomial is an element such that . A polynomial does not necessarily have zeroes, and this depends also on the base field. The polynomial has no real zero, but it has the complex zeroes and . As an element in , the polynomial can not be written as a product of simpler polynomials. However, in , it has the factor decomposition


Let be a field, let be the polynomial ring over and . Then the evaluation mapping

is -linear. Moreover, we have

see exercise.


Let be a field and let be the polynomial ring over . Let be a polynomial and . Then is a zero

of if and only if is a multiple of the linear polynomial .

If is a multiple of , then we can write

with another polynomial . Inserting yields

In general, there exists, due to fact, a representation

where either or the degree of is , so in both cases is a constant. Inserting yields

So if holds, then the remainder must be , and this means .



Let be a field and let be the polynomial ring over . Let be a polynomial () of degree

. Then has at most zeroes.

We prove the statement by induction over . For the statement holds. So suppose that and that the statement is already proven for smaller degrees. Let be a zero of (if does not have a zero at all, we are done anyway). Hence, by fact and the degree of is , so we can apply to the induction hypothesis. The polynomial has at most zeroes. For we have . This can be zero, due to fact  (5), only if one factor is , so the zeroes of are or a zero of . Hence, there are at most zeroes of .