Canonical: https://knowlpedia.com/shared-foundations/well-ordered-set/

# Well-ordered set

A totally ordered set in which every nonempty subset has a least element.

A **well-ordered set** is a [set](https://knowlpedia.com/shared-foundations/set/) \(X\) equipped with a [total order](https://knowlpedia.com/shared-foundations/total-order/) \(\le\) such that every nonempty subset \(A\subseteq X\) has a least element; that is, there exists \(m\in A\) with \(m\le a\) for all \(a\in A\).

## Remarks

Well-orderings are central in statements like the [well-ordering theorem](https://knowlpedia.com/shared-foundations/well-ordering-theorem/), which asserts that every set can be well-ordered. The [well-ordering principle](https://knowlpedia.com/shared-foundations/well-ordering-principle/) is the special case asserting that \(\mathbb{N}\) is well-ordered by its usual order.

## Examples

- With the usual \(\le\), the [natural numbers](https://knowlpedia.com/shared-foundations/natural-numbers/) form a well-ordered set.
- Any finite set becomes well-ordered after choosing a total order; for instance, \(\{a_1,\dots,a_n\}\) is well-ordered by declaring \(a_1<a_2<\cdots<a_n\).
