Definition:Ordering/Definition 2
Definition
Let $S$ be a set.
Let $\RR$ be a relation $\RR$ on $S$.
$\RR$ is an ordering on $S$ if and only if $\RR$ satisfies the ordering axioms:
| \((1)\) | $:$ | \(\ds \RR \circ \RR \) | |||||||
| \((2)\) | $:$ | \(\ds \RR \cap \RR^{-1} = \Delta_S \) |
where:
- $\circ$ denotes relation composition
- $\RR^{-1}$ denotes the inverse of $\RR$
- $\Delta_S$ denotes the diagonal relation on $S$.
Notation
Symbols used to denote a general ordering relation are usually variants on $\preceq$, $\le$ and so on.
On $\mathsf{Pr} \infty \mathsf{fWiki}$, to denote a general ordering relation it is recommended to use $\preceq$ and its variants:
- $\preccurlyeq$
- $\curlyeqprec$
To denote the conventional ordering relation in the context of numbers, the symbol $\le$ is to be used, or its variants:
- $\leqslant$
- $\leqq$
- $\eqslantless$
The symbol $\subseteq$ is universally reserved for the subset relation.
| \(\ds a\) | \(\preceq\) | \(\ds b\) | can be read as: | \(\quad\) $a$ precedes, or is the same as, $b$ | ||||||||||
| \(\ds a\) | \(\preceq\) | \(\ds b\) | can be read as: | \(\quad\) $b$ succeeds, or is the same as, $a$ |
If, for two elements $a, b \in S$, it is not the case that $a \preceq b$, then the symbols $a \npreceq b$ and $b \nsucceq a$ can be used.
When the symbols $\le$ and its variants are used, it is common to interpret them as follows:
| \(\ds a\) | \(\le\) | \(\ds b\) | can be read as: | \(\quad\) $a$ is less than, or is the same as, $b$ | ||||||||||
| \(\ds a\) | \(\le\) | \(\ds b\) | can be read as: | \(\quad\) $b$ is greater than, or is the same as, $a$ |
Partial vs. Total Ordering
It is not demanded of an ordering $\preceq$, defined in its most general form on a set $S$, that every pair of elements of $S$ is related by $\preceq$.
They may be, or they may not be, depending on the specific nature of both $S$ and $\preceq$.
If it is the case that $\preceq$ is a connected relation, that is, that every pair of distinct elements is related by $\preceq$, then $\preceq$ is called a total ordering.
If it is not the case that $\preceq$ is connected, then $\preceq$ is called a partial ordering.
Beware that some sources use the word partial for an ordering which may or may not be connected, while others insist on reserving the word partial for one which is specifically not connected.
It is wise to be certain of what is meant.
As a consequence, on $\mathsf{Pr} \infty \mathsf{fWiki}$ we resolve any ambiguity by reserving the terms for the objects in question as follows:
- Partial ordering: an ordering which is specifically not total
- Total ordering: an ordering which is specifically not partial.
Also defined as
1955: John L. Kelley: General Topology defines an ordering as a transitive relation.
He also allows the synonyms partial ordering (which this is), and quasi-ordering (which is generally used as a synonym for preordering).
This approach glosses over the antisymmetric nature of an ordering, and in fact what is ended up with appears to be what on $\mathsf{Pr} \infty \mathsf{fWiki}$ is defined as a strict ordering.
This approach is not used on $\mathsf{Pr} \infty \mathsf{fWiki}$.
Also known as
An ordering is also referred to as an order relation or an order, although the latter term is also used for several other concepts so bears the risk of ambiguity.
Some sources use the word partial for an ordering which may or may not be connected, while others insist on reserving the word partial for an ordering which is specifically not connected.
It is wise to be certain of what is meant.
An ordering as defined here is sometimes referred to as a weak ordering if it is necessary to place emphasis on the fact that it is not a strict ordering.
Also see
- Results about orderings can be found here.
Sources
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text {III}$: The Natural Numbers: $\S 14$: Orderings: Exercise $14.27 \ \text {(a)}$