Order (relation)

In mathematics, an order relation is a relation on a set which generalises the notion of comparison between numbers and magnitudes, or inclusion between sets or algebraic structures.

Throughout the discussion of various forms of order, it is necessary to distinguish between a strict or strong form and a weak form of an order: the difference being that the weak form includes the possibility that the objects being compared are equal. We shall usually denote a general order by the traditional symbols < or > for the strict form and ≤ or ≥ for the weak form, but notations such as ${\subset },{\supset }$,${\subseteq },{\supseteq }$; ${\prec },{\succ }$,${\preceq },{\succeq }$; ${\sqsubset },{\sqsupset }$,${\sqsubseteq },{\sqsupseteq }$ are also common. We also use the traditional notational convention that $x<y\Leftrightarrow y>x$.

Partial order

The most general form of order is the (strict) partial order, a relation < on a set satisfying:

• Irreflexive: $x\not <x;\,$
• Antisymmetric: $x<y\Rightarrow y\not <x;\,$
• Transitive: $x<y,y<z\Rightarrow x<z.\,$

The weak form ≤ of an order satisfies the variant conditions:

• Reflexive: $x\leq x;\,$
• Antisymmetric: $x\leq y,y\leq x\Rightarrow x=y;\,$
• Transitive: $x\leq y,y\leq z\Rightarrow x\leq z.\,$

Total order

A total or linear order is one which has the trichotomy property: for any x, y exactly one of the three statements $x<y$, $x=y$, $x>y$ holds.

Associated concepts

If a ≤ b in an ordered set (X,<) then the interval

$[a,b]=\{x\in X:a\leq x\leq b\}.\,$

We say that b covers a if the interval $[a,b]=\{a,b\}$: that is, there is no x strictly between a and b.

Let S be a subset of a ordered set (X,<). An upper bound for S is an element u of X such that $u\geq s$ for all elements $s\in S$. A lower bound for S is an element l of X such that $\ell \geq s$ for all elements $s\in S$. In general a set need not have either an upper or a lower bound.

A maximum for S is an upper bound which is in S; a minimum for S is a lower bound which is in S.