In mathematics, a well-order (or well-ordering or well-order relation) on a set is a total ordering on with the property that every non-empty subset of has a least element in this ordering. The set together with the ordering is then called a well-ordered set. In some academic articles and textbooks these terms are instead written as wellorder, wellordered, and wellordering or well order, well ordered, and well ordering.
Every non-empty well-ordered set has a least element. Every element of a well-ordered set, except a possible greatest element, has a unique successor (next element), namely the least element of the subset of all elements greater than . There may be elements, besides the least element, that have no predecessor (see below for an example). A well-ordered set contains for every subset with an upper bound a least upper bound, namely the least element of the subset of all upper bounds of in .
If ≤ is a non-strict well ordering, then < is a strict well ordering. A relation is a strict well ordering if and only if it is a well-founded strict total order. The distinction between strict and non-strict well orders is often ignored since they are easily interconvertible.
Every well-ordered set is uniquely order isomorphic to a unique ordinal number, called the order type of the well-ordered set. The well-ordering theorem, which is equivalent to the axiom of choice, states that every set can be well ordered. If a set is well ordered (or even if it merely admits a well-founded relation), the proof technique of transfinite induction can be used to prove that a given statement is true for all elements of the set.
The observation that the natural numbers are well ordered by the usual less-than relation is commonly called the well-ordering principle (for natural numbers).
See main article: Ordinal number.
Every well-ordered set is uniquely order isomorphic to a unique ordinal number, called the order type of the well-ordered set. The position of each element within the ordered set is also given by an ordinal number. In the case of a finite set, the basic operation of counting, to find the ordinal number of a particular object, or to find the object with a particular ordinal number, corresponds to assigning ordinal numbers one by one to the objects. The size (number of elements, cardinal number) of a finite set is equal to the order type.[1] Counting in the everyday sense typically starts from one, so it assigns to each object the size of the initial segment with that object as last element. Note that these numbers are one more than the formal ordinal numbers according to the isomorphic order, because these are equal to the number of earlier objects (which corresponds to counting from zero). Thus for finite, the expression "-th element" of a well-ordered set requires context to know whether this counts from zero or one. In a notation "-th element" where can also be an infinite ordinal, it will typically count from zero.
For an infinite set the order type determines the cardinality, but not conversely: well-ordered sets of a particular cardinality can have many different order types (see, below, for an example). For a countably infinite set, the set of possible order types is uncountable.
The standard ordering ≤ of the natural numbers is a well ordering and has the additional property that every non-zero natural number has a unique predecessor.
Another well ordering of the natural numbers is given by defining that all even numbers are less than all odd numbers, and the usual ordering applies within the evens and the odds:
\begin{matrix} 0&2&4&6&8&...&1&3&5&7&9&... \end{matrix}
This is a well-ordered set of order type . Every element has a successor (there is no largest element). Two elements lack a predecessor: 0 and 1.
Unlike the standard ordering ≤ of the natural numbers, the standard ordering ≤ of the integers is not a well ordering, since, for example, the set of negative integers does not contain a least element.
The following binary relation is an example of well ordering of the integers: if and only if one of the following conditions holds:
This relation can be visualized as follows:
\begin{matrix} 0&1&2&3&4&...&-1&-2&-3&... \end{matrix}
Another relation for well ordering the integers is the following definition:
|x|<|y| or |x|=|y|andx\leqy.
\begin{matrix} 0&-1&1&-2&2&-3&3&-4&4&... \end{matrix}
This has the order type .
The standard ordering ≤ of any real interval is not a well ordering, since, for example, the open interval does not contain a least element. From the ZFC axioms of set theory (including the axiom of choice) one can show that there is a well order of the reals. Also Wacław Sierpiński proved that ZF + GCH (the generalized continuum hypothesis) imply the axiom of choice and hence a well order of the reals. Nonetheless, it is possible to show that the ZFC+GCH axioms alone are not sufficient to prove the existence of a definable (by a formula) well order of the reals.[2] However it is consistent with ZFC that a definable well ordering of the reals exists—for example, it is consistent with ZFC that V=L, and it follows from ZFC+V=L that a particular formula well orders the reals, or indeed any set.
An uncountable subset of the real numbers with the standard ordering ≤ cannot be a well order: Suppose is a subset of well ordered by . For each in, let be the successor of in ordering on (unless is the last element of). Let
A=\{(x,s(x))|x\inX\}
\{1/n|n=1,2,3,...\}
Examples of well orders:
\{-2-n|0\leqn<\omega\}
\{-2-n-2-m-n|0\leqm,n<\omega\}
\{-2-n|0\leqn<\omega\}\cup\{1\}
If a set is totally ordered, then the following are equivalent to each other:
Every well-ordered set can be made into a topological space by endowing it with the order topology.
With respect to this topology there can be two kinds of elements:
For subsets we can distinguish:
A subset is cofinal in the whole set if and only if it is unbounded in the whole set or it has a maximum that is also maximum of the whole set.
A well-ordered set as topological space is a first-countable space if and only if it has order type less than or equal to ω1 (omega-one), that is, if and only if the set is countable or has the smallest uncountable order type.