# Order-Extension Principle/Proof 1

## Theorem

Let $S$ be a set.

Let $\preceq$ be an ordering on $S$.

Then there exists a total ordering $\le$ on $S$ such that:

$\forall a, b \in S: \left({a \preceq b \implies a \le b}\right)$

## Proof

Let $\preceq$ be an ordering on the set $S$.

If $\preceq$ is a total ordering, the result is complete.

Suppose, then, that $\preceq$ is not a total ordering.

Let $T$ be the set of orderings on $S$ that extend $\preceq$, ordered by inclusion.

Let $C$ be a chain in $T$.

By Union of Nest of Orderings is Ordering, $\bigcup C$ is an ordering.

Thus every chain in $T$ has an upper bound in $T$.

By Zorn's Lemma, $T$ has a maximal element, $\le$.

$\le$ is seen to be a total ordering, as follows:

Suppose that $a, b \in S$, $a \not \le b$, and $b \not \le a$.

Let $\le'$ be the relation defined as:

$\le' \mathrel {:=} \le \cup \set {\tuple {a, b} }$

Let $\le'^-$ be the transitive closure of $\le'$.

Then by Ordering can be Expanded to compare Additional Pair, $\le'^-$ is an ordering.

But $\le'^- \mathrel {\supsetneq} \le$, contradicting the maximality of $\le$.

Thus, $\le$ is a total ordering.

$\blacksquare$

#### Axiom of Choice

This proof depends on the Axiom of Choice, by way of Zorn's Lemma.

Because of some of its bewilderingly paradoxical implications, the Axiom of Choice is considered in some mathematical circles to be controversial.

Most mathematicians are convinced of its truth and insist that it should nowadays be generally accepted.

However, others consider its implications so counter-intuitive and nonsensical that they adopt the philosophical position that it cannot be true.