Think of an ideal as certain types of set of integers which is closed under addition and multiplication. The concept of an ideal will pay big dividends for us in the next chapter.

Note you can multiply any element of by any integer and the product will still be in . You can add two elements (but they *both* must belong to ) and the sum will still be in .

Thanks to the following result, the answer to the first question asked above is ``yes''.

- is empty,
- ,
- there is an integer such that , i.e., is the set of all multiples of some integer (which is constructed in the proof below).

The proof below is worthwhile trying to understand well since it contains a basic idea which occurs in other parts of mathematics (in fact, we shall see the idea again in the next chapter).

**proof**: If is not empty then it must contain 0. Suppose that is non-zero. Let be non-zero. Since , and either or , must contain a positive element. By the well-ordering principle, contains a least element .

Claim: .

If then the division algorithm (theorem 1.2.7) says that there is an such that with . Since is closed under addition and subtraction, belongs to . But is the smallest non-zero element of , 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.

David Joyner 2007-09-03