- is a common divisor of and ; that is, and ;
- if is any common divisor of and , then ;
- is monic.
Note that gcd (denoted by ) of and , if it exists, is unique. If we had which is another gcd, then since it also divides both polynomials we know that .
Similarly, if one regards merely as a common divisor. By Exercise 4, for some unit ; that is, for some nonzero constant (prove why). Since and are both monic, however, and .
Let be an ideal in , if then , which shows that it is a principal ideal. Now suppose that , and let of smallest degree, we'll show that .
We can see that because for any element in an ideal, all of it's multiples are a part of it. Looking at , then given some then by the division algorithm we have such that where either or but then . Now if then we've found a polynomial with a smaller degree than in (namely ), so therefore we must have that which means that .