Canonical: https://knowlpedia.com/shared-foundations/total-order/

# Total order

A partial order in which any two elements are comparable.

A **total order** on a [set](https://knowlpedia.com/shared-foundations/set/) \(X\) is a [partial order](https://knowlpedia.com/shared-foundations/partial-order/) \(\le\) on \(X\) such that for all \(a,b\in X\), either \(a\le b\) or \(b\le a\).

## Remarks

Total orders are also called linear orders. A [well-ordered set](https://knowlpedia.com/shared-foundations/well-ordered-set/) is a totally ordered set with the additional property that every nonempty subset has a least element.

## Examples

- The usual order \(\le\) on \(\mathbb{Z}\) (the [integers](https://knowlpedia.com/shared-foundations/integers/)) is a total order.
- (Lexicographic order) If \(X\) and \(Y\) are totally ordered, define an order on \(X\times Y\) by \((x,y)\le_{\mathrm{lex}}(x',y')\) if either \(x<x'\), or \(x=x'\) and \(y\le y'\) (where \(x<x'\) means \(x\le x'\) and \(x\ne x'\)). This gives a total order on the [Cartesian product](https://knowlpedia.com/shared-foundations/cartesian-product/) \(X\times Y\).
