Well Ordering Principle

The Well Ordering Principle states that every nonempty set of positive integers contains a smallest member. The proof of this is simply common sense, but we can construct a formal proof by contradiction. Assume there is no smallest element. Then for each element in the set, there exists a smaller element, so if we take this smaller element, there must a different smaller element, and so on. Since the set is finite, we cannot continue like this infinitely many times, contradiction.

This article is a stub. Help us out by expanding it.