Polynomial ring/Field/Euclidean division/2/Introduction/Section


Let be a field. We say that a polynomial divides a polynomial , if there exists a polynomial such that

If can be divided by , we also say that is a multiple of . In it is not possible to divide any element by any element . This is different from a field, but similar no the integers . However, there is an important substitute, the Euclidean division.


Let be a field and let be the polynomial ring over . Let be polynomials with . Then there exist unique polynomials such that

We prove the statement about the existence by induction over the degree of . If the degree of is larger than the degree of , then and is a solution.

Suppose that . By the remark just made also holds, so is a constant polynomial, and therefore (since and is a field) and is a solution.

So suppose now that and that the statement for smaller degrees is already proven. We write and with . Then setting we have the relation

The degree of this polynomial is smaller than and we can apply the induction hypothesis to it. That means there exist and such that

From this we get altogether

so that and is a solution.

To prove uniqueness, let , both fulfilling the stated conditions. Then . Since the degree of the difference is smaller than , this implies and so .


The polynomial divides if and only if the remainder in the Euclidean division is . The proof of this theorem is constructive, that is, it describes a method how to perform the Euclidean division effectively. For this, it is necessary to be able to perform the operations in the base field. We give two examples, one over the rational numbers and one over the complex numbers.


We want to apply the Euclidean division (over )

So we want to divide a polynomial of degree by a polynomial of degree , hence the quotient and also the remainder have (at most) degree . For the first step, we ask with which term we have to multiply to achieve that the product and have the same leading term. This is . The product is

The difference between and this product is

We continue the division by with this polynomial, which we call . In order to get coincidence with the leading coefficient we have to multiply with . This yields

The difference between this and is therefore

This is the remainder and altogether we get


We perform the Euclidean division

The inverse of is , and therefore we have

Hence, starts with , and we have

We have to subtract this term from and we obtain

We apply the same procedure to this polynomial (which we call ). We compute

Therefore, the constant term of equals , and we obtain

We subtract this from and get

This term is the remainder , the Euclidean division altogether is