Well-ordering principle

In mathematics, the well-ordering principle, also called the well-ordering property or least natural number principle, states that every non-empty subset of the nonnegative integers contains a least element, also called a smallest element. In other words, if is a nonempty subset of the nonnegative integers, then there exists an element of which is less than, or equal to, any other element of . Formally, . Most sources state this as an axiom or theorem about the natural numbers, but the phrase "natural number" was avoided here because of ambiguity over the inclusion of zero. The statement is true about the set of natural numbers regardless whether it is defined as (nonnegative integers) or as (positive integers), since one of Peano's axioms for , the induction axiom (or principle of mathematical induction), is logically equivalent to the well-ordering principle. Since and the subset relation is transitive, the statement about is implied by the statement about .

Experience with numbers favors this principle. For instance, the set T = {5, 8, 3, 11} has 3 as its least element, and 2 is the least element in the set of even positive numbers. It is a deceptively obvious principle because in many cases it is not clear what the least number actually is.

— Lars Tuset, Abstract Algebra via Numbers

The standard order on is well-ordered by the well-ordering principle, since it begins with a least element, regardless whether it is 1 or 0. By contrast, the standard order on (or on ) is not well-ordered by this principle, since there is no smallest negative number. According to Deaconu and Pfaff, the phrase "well-ordering principle" is used by some (unnamed) authors as a name for Zermelo's "well-ordering theorem" in set theory, according to which every set can be well-ordered. This theorem, which is not the subject of this article, implies that "in principle there is some other order on which is well-ordered, though there does not appear to be a concrete description of such an order."