Every non-empty set S of non-negative integers contains a least element; that is, there is some integer a in S such that for all b’s belonging to S.

Because this principle plays a role in many proofs related to foundations of mathematics, let us use it to show that the set of positive integers has what is known as the Archimedean property.

Archimedean property:

If a and b are any positive integers, then there exists a positive integer n such that .

Proof:

By contradiction:

Assume that the statement of the theorem is not true so that for some a and b, we have for every positive integer n. Then, the set consists entirely of positive integers. By the Well-Ordering Principle, S will possess a least element, say, . Notice that also lies in S; because S contains all integers of this form. Further, we also have contrary to the choice of as the smallest integer in S. This contradiction arose out of original assumption that the Archimedean property did not hold; hence, the proof. QED.

First Principle of Finite Induction:

Let S be a set of positive integers with the following properties:

a) the integer 1 belongs to S.

b) Whenever the integer k is in S, the next integer is also in S.

Then, S is the set of all positive integers.

Second Principle of Finite Induction:

Let S be a set of positive integers with the following properties:

a) the integer 1 belongs to S.

b) If k is a positive integer such that belong to S, then must also be in S.

Then, S is the set of all positive integers.

So, in lighter vein, we assume a set of positive integers is given just as Kronecker had observed: “God created the natural numbers, all the rest is man-made.”