Set Theory: Ordered Sets and Ordinal Numbers

Definitions of partial ordering, partially ordered (reflexive, transitive, antisymmetric), maximal, minimal.

A bijective function $f$ is order-preserving if $a \leq b \Rightarrow f (a) \leq f (b)$ . An order-preserving function $f$ is an isomorphism if $f (a) \leq f (b) \Leftrightarrow a \leq b$ . Two partially ordered sets are isomorphic if there exists an isomorphism between them.

Noncomparable if neither $a \leq b$ nor $b \leq a$ . A set is ordered if it contains no noncomparable elements. Two isomorphic sets have the same (order) type. Order of $N$ (in the normal manner) is $ω$ . The power $ℵ_{0}$ corresponds to the order type $ω$ .

Definition 1 An ordered set $M$ is well-ordered if every nonempty subset $A$ of $M$ has a smallest (or “first”) element, i.e., an element $μ$ such that $μ \leq a$ for every $a \in A$ .

Definition 2 The order type of a well-ordered set is an ordinal number or simply an ordinal. If the set is infinite, the ordinal is transfinite.

Theorem 1

The ordered sum of a finite number of well-ordered sets $M_{1}, M_{2}, \dots, M_{n}$ is itself a well-ordered set.

Proof

Let $M$ be an arbitrary subset of the ordered sum $M_{1} + M_{2} + \dots + M_{n}$ , and let $M_{k}$ be the first set containing elements of $M$ . Then $M \cap M_{k}$ is a subset of the well-ordered set $M_{k}$ , and therefore has a smallest element $μ$ . Clearly $μ$ is also the smallest element of $M$ .

Need to check whether this holds for the sum of countably many well-ordered sets, and why?

Corollary

The ordered sum of a finite number of ordinal numbers is itself an ordinal number.

Theorem 2

The ordered product of two well-ordered sets $M_{1}$ and $M_{2}$ is well-ordered.

Proof

Let $M$ be an arbitrary subset of $M_{1} \cdot M_{2}$ , with $(a, b)$ such that $a \in M_{1}$ , $b \in M_{2}$ . The set of all second elements $b$ in $M$ is a subset of $M_{2}$ , and therefore has a least element $b_{1}$ since $M_{2}$ is well-ordered. Then look at all $(a, b_{1})$ . Again, the set of all first elements $a$ is a subset of $M_{1}$ , hence has a smallest element $a_{1}$ since $M_{1}$ is well-ordered. $(a_{1}, b_{1})$ is clearly the smallest element of $M$ .

Corollary 1

The ordered product of a finite number of well-ordered sets is itself a well-ordered set.

Corollary 2

The ordered product of a finite number of ordinal numbers is itself an ordinal number.

Every element of a well-ordered set $M$ determines an (initial) section $P$ , the set of all $x \in M$ such that $x < a$ , and a remainder $Q$ , the set of all $x \in M$ such that $x \geq a$ . Given two well-ordered sets $M$ and $N$ of order type $α$ and $β$ respectively, then:

$α = β$ if $M$ and $N$ are isomorphic.
$α < β$ if $M$ is isomorphic to some section of $N$ .
$α > β$ if $N$ is isomorphic to some section of $M$ .

Lemma

Let $f$ be an isomorphism of a well-ordered set $A$ onto some subset $B \subseteq A$ . Then $f (a) \geq a$ for all $a \in A$ .

Proof

If there exists $a \in A$ such that $f (a) < a$ , then there is a least such element $a_{0}$ since $A$ is well-ordered. Let $b_{0} = f (a_{0})$ , then $b_{0} < a_{0}$ , and $f (b_{0}) < f (a_{0}) = b_{0}$ since $f$ is an isomorphism. But then $a_{0}$ is not the smallest element such that $f (a) < a$ . Contradiction.

Theorem 3

Two given ordinal numbers $α$ and $β$ satisfy one and only one of the relations $α < β$ , $α = β$ , $α > β$ .

Proof

Let $W (α)$ be the set of all ordinals $< α$ . Any two numbers $γ$ and $γ^{'}$ in $W (α)$ are comparable and the corresponding ordering of $W (α)$ makes it a well-ordered set of type $α$ . If a set $A$ is of type $α$ , then by definition, the ordinals less than $α$ are the types of well-ordered sets isomorphic to sections of $A$ . Hence, the ordinals are in one-to-one correspondence with the elements of $A$ .

Let $α$ , $β$ be two ordinals, then $W (α)$ , $W (β)$ are well-ordered sets of type $α$ , $β$ respectively. Let $C = A \cap B$ . Then $C$ is well-ordered, of type $γ$ , say. We now show $γ \leq α$ . If $C = A$ , then obviously $γ = α$ . Otherwise, if $C \neq A$ , then $C$ is a section of $A$ and hence $γ < α$ .

[Let $ξ \in C$ , $η \in A - C$ . Then $ξ$ , $η$ are comparable, i.e., either $ξ < η$ or $ξ > η$ . But $η < ξ < α$ is impossible, since then $η \in C$ . Therefore $ξ < η$ and hence $C$ is a section of $A$ , which implies $γ < α$ . Moreover, $γ$ is the first element of $A - C$ .]

Thus $γ \leq α$ . Similarly $γ \leq β$ . The case $γ < α$ , $γ < β$ is impossible, since then $γ \in A - C$ , $γ \in B - C$ . But then $γ \notin C$ on the one hand and $γ \in A \cap B = C$ on the other hand.

It follows that there are only three possibilities:

$γ = α, γ = β, α = β$ $γ = α, γ < β, α < β$ $γ < α, γ = β, α > β$

i.e., $α$ and $β$ are comparable.

Theorem 4

Let $A$ and $B$ be well-ordered sets. Then either $A$ is equivalent to $B$ or one of the sets is of greater power than the other, i.e., the powers of $A$ and $B$ are comparable.

Proof

A definite power corresponds to each ordinal. As ordinals are comparable, so are the corresponding powers.

Well-ordering theorem

Every set can be well-ordered.

Axiom of choice

Given any set $M$ , there is a “choice function” $f$ such that $f (A)$ is an element of $A$ for every nonempty subset $A \subseteq M$ .

Definition 3 Let $M$ be a partially ordered set, and let $A$ be any subset of $M$ such that $a$ and $b$ are comparable for every $a$ , $b \in A$ . Then $A$ is a chain (in $M$ ). A chain $C$ is maximal if there is no other chain $C^{'}$ in $M$ containing $C$ as a proper subset.

Definiton 4 An element $a$ of a partially ordered set $M$ is an upper bound of a subset $M^{'} \subseteq M$ if $a^{'} \leq a$ for every $a^{'} \in M^{'}$ .

The below two assertions are equivalent to the axiom of choice.

Hausdorff’s maximal principle

Every chain in a partially ordered set $M$ is contained in a maximal chain in $M$ .

Zorn’s Lemma

If every chain in a partially ordered set $M$ has an upper bound, then $M$ contains a maximal element.

Theorem 5 (Mathematical induction)

Given a proposition $P (n)$ formulated fo every positive integer $n$ , suppose that

$P (1)$ is true.
The validity of $P (k)$ for all $k \leq n$ implies the validity of $P (n + 1)$ .

Then $P (n)$ is true for all $n = 1, 2, \dots$

Proof

Suppose $P (n)$ fails to be true for all $n = 1, 2, \dots$ Let $n_{1}$ be the smallest integer for which $P (n)$ is false ( $n_{1}$ exists due to the well-ordering of the positive integers). Clearly $n_{1} > 1$ , so $n_{1} - 1$ is a positive integer. Therefore $P (n)$ is valid for all $k \leq n_{1} - 1$ , but not for $n_{1}$ . Contradiction.

Theorem 5’ (Transfinite induction)

Given a well-ordered set $A$ , let $P (a)$ be a proposition formulated for every element $a \in A$ . Suppose that

$P (a)$ is true for the smallest element of $A$ .
The validity of $P (a)$ for all $a < a^{*}$ implies the validity of $P (a^{*})$ .

Then $P (a)$ is true for all $a \in A$ .

Proof

Suppose $P (a)$ fails to be true for all $a \in A$ . Then $P (a)$ is false for all $a$ in some nonempty subset $A^{*} \subseteq A$ . By well-ordering, $A^{*}$ has a smallest element $a^{*}$ . Therefore $P (a)$ is valid for all $a < a^{*}$ but not for $a^{*}$ . Contradiction.

Problems

Exhibit both a partial ordering and a simple ordering of the set of all complex numbers.

Partial ordering: only order reals. Simple: order reals, then complex.
What is the minimal element of the set of all subsets of a given set $X$ , partially ordered by set inclusion? What is the maximal element?

$\emptyset$ and $X$ .
A partially ordered set $M$ is a directed set if, given any two element $a$ , $b \in M$ , there is an element $c \in M$ such that $a \leq c$ , $b \leq c$ . Are the partially ordered sets in Examples 1-4, Section 3.1 all directed sets?

No, yes, yes, yes.
The greatest lower bound of two elements $a$ and $b$ of a partially ordered set $M$ is $c \in M$ such that $c \leq a$ , $c \leq b$ and there is no element $d \in M$ such that $c < d \leq a$ , $d \leq b$ . Define least upper bound similarly. A lattice is a partially ordered set with both a greatest lower bound and a least upper bound. Prove that the set of all subsets of a given set $X$ , partially ordered by set inclusion, is a lattice. What is the set-theoretic meaning of the greatest lower bound and least upper bound of two elements of this set?

Same as 2.
Prove that an order-preserving mapping of one ordered set onto another is automatically an isomorphism.

All order-mapping preserving mappings are bijective. Hence an inverse exists. Need to show how the inverse also preserves order. Hence isomorphism.
Prove that ordered sums and products of ordered sets are associative.

Just step through to show that they are the same.
Construct well-ordered sets with ordinals $ω + n$ , … Show that the sets are all countable.

$N + {a_{1}, \dots, a_{n}}$ , … Line each one up on a row, and zigzag up and down.
Construct well-ordered sets with ordinals $ω \cdot n$ , … Show that the sets are all countable.

$N \cdot {a_{1}, \dots, a_{n}}$ , … Similar proof to countability of the rationals.
Show that $ω + ω = ω \cdot 2$ .

Let $f$ send $a \in N_{1} + N_{2}$ to $(a, 1)$ if $a \in N_{1}$ and to $(a, 2)$ if $a \in N_{2}$ . Evidently bijective, and order-preserving, hence isomorphic, and hence they have equivalent ordinals too.
Prove that the set $W (α)$ of all ordinals less than a given ordinal $α$ is well-ordered.

Each ordinal less than $α$ corresponds to a section of $A$ . There is a least section of $A$ , the empty set, as all other sections of $A$ are greater than or equal to it. Hence the corresponding ordinal to the empty set is the least element of $W (α)$ and we also know that ordinals are comparable. Therefore $W (α)$ is well-ordered.
Prove that any nonempty set of ordinals is well-ordered.

$A$ subset. Nonempty and ordinals are comparable so exists $μ \in A$ such that $μ \leq a$ for all $a \in A$ . Therefore well-ordered.
Prove that the set $M$ of all ordinals corresponding to a countable set is itself countable.

Line them up. Then use Cantor diagonal argument.
Let $ℵ_{1}$ be the power of the set $M$ in the preceding problem. Prove that there is no power $m$ such that $ℵ_{0} < m < ℵ_{1}$ .

Impossible as there is no set which is strictly bigger than countable and yet strictly smaller than uncountable.

Open ends

Why do Theorems 1 and 2 hold for just finitely many? Do they also hold for countably many? If not, why not?
What well-ordered set has ordinal $ω^{ω}$ ?

I found this link https://en.wikipedia.org/wiki/Ordinal_analysis#Theories_with_proof-theoretic_ordinal_%CF%89%CF%89 but it still leaves me none the wiser. This link https://math.stackexchange.com/questions/1412153/let-omega-be-the-ordinal-of-the-well-ordered-set-mathbbn-what-does-mean is a tiny bit clearer.
For Problem 5, how is it shown that the inverse preserves order?
Is the proof for Problem 13 correct?

I would greatly appreciate any help.

Set Theory: Ordered Sets and Ordinal Numbers

Problems

Open ends

Christian Christiansen