well-order
Sign in to saveAlso known as well-ordering, well-order relation, wellorder, wellordering, well-ordered, well order, well ordering, well ordered
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 (or woset). In some academic articles and textbooks these terms are instead written as wellorder, wellordered, and wellordering or well order, well ordered, and well ordering.
Wikidata facts
Show 3 more facts
- has characteristic
- well-founded relation
- different from
- well-ordered set
- facet of
- well-ordered set
Sources (2)
via Wikidata · CC0
~7 min read
Encyclopedic overview
9 sectionsContents
- Ordinal numbers
- Examples and counterexamples
- Natural numbers
- Integers
- Reals
- Equivalent formulations
- Order topology
- See also
- References
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 (or woset). 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 .
Excerpted from Wikipedia’s “well-order” article, available under the CC BY-SA 4.0 licence.