Total order (linear order)

A partial order in which every pair of elements is comparable.
Total order (linear order)

A total order (or linear order) on a set XX is a partial order \le on XX such that for all x,yXx,y\in X,

xy or yx.x\le y\ \text{or}\ y\le x.

This property is called comparability (or trichotomy when strengthened appropriately).

Total orders allow one to speak of intervals, monotonicity, and order convergence, which are central in one-variable real analysis.

Examples:

  • The usual order \le on R\mathbb{R} is a total order.
  • Lexicographic order on R2\mathbb{R}^2: define (a,b)lex(c,d)(a,b)\le_{\mathrm{lex}}(c,d) iff either a<ca<c, or a=ca=c and bdb\le d; this is a total order.
  • \subseteq on P({1,2})\mathcal{P}(\{1,2\}) is not a total order since {1}\{1\} and {2}\{2\} are incomparable.