Hausdorff Maximality Principle

In mathematics, the Hausdorff maximal principle is an alternate and earlier formulation of Zorn's lemma proved by Felix Hausdorff in 1914 (Moore 1982:168). It states that in any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset, where "maximal" is with respect to set inclusion.

In a partially ordered set, a totally ordered subset is also called a chain. Thus, the maximal principle says every chain in the set extends to a maximal chain.

The Hausdorff maximal principle is one of many statements equivalent to the axiom of choice over ZF (Zermelo–Fraenkel set theory without the axiom of choice). The principle is also called the Hausdorff maximality theorem or the Kuratowski lemma (Kelley 1955:33).

Statement

The Hausdorff maximal principle states that, in any partially ordered set $P$, every chain $C_0$ (i.e., a totally ordered subset) is contained in a maximal chain $C$ (i.e., a chain that is not contained in a strictly larger chain in $P$). In general, there may be several maximal chains containing a given chain.

An equivalent form of the Hausdorff maximal principle is that in every partially ordered set, there exists a maximal chain. (Note if the set is empty, the empty subset is a maximal chain.)

This form follows from the original form since the empty set is a chain. Conversely, to deduce the original form from this form, consider the set $P'$ of all chains in $P$ containing a given chain $C_0$ in $P$. Then $P'$ is partially ordered by set inclusion. Thus, by the maximal principle in the above form, $P'$ contains a maximal chain $C'$. Let $C$ be the union of $C'$, which is a chain in $P$ since a union of a totally ordered set of chains is a chain. Since $C$ contains $C_0$, it is an element of $P'$. Also, since any chain containing $C$ is contained in $C$ as $C$ is a union, $C$ is in fact a maximal element of $P'$; i.e., a maximal chain in $P$.

The proof that the Hausdorff maximal principle is equivalent to Zorn's lemma is somehow similar to this proof. Indeed, first assume Zorn's lemma. Since a union of a totally ordered set of chains is a chain, the hypothesis of Zorn's lemma (every chain has an upper bound) is satisfied for $P'$ and thus $P'$ contains a maximal element or a maximal chain in $P$.

Conversely, if the maximal principle holds, then $P$ contains a maximal chain $C$. By the hypothesis of Zorn's lemma, $C$ has an upper bound $x$ in $P$. If $y \ge x$, then $\widetilde = C \cup \$ is a chain containing $C$ and so by maximality, $\widetilde = C$; i.e., $y \in C$ and so $y = x$. $\square$

Examples

If ''A'' is any collection of sets, the relation "is a proper subset of" is a strict partial order on ''A''. Suppose that ''A'' is the collection of all circular regions (interiors of circles) in the plane. One maximal totally ordered sub-collection of ''A'' consists of all circular regions with centers at the origin. Another maximal totally ordered sub-collection consists of all circular regions bounded by circles tangent from the right to the y-axis at the origin.

If (x₀, y₀) and (x₁, y₁) are two points of the plane $\mathbb^$, define (x₀, y₀) < (x₁, y₁) if y₀ = y₁ and x₀ < x₁. This is a partial ordering of $\mathbb^$ under which two points are comparable only if they lie on the same horizontal line. The maximal totally ordered sets are horizontal lines in $\mathbb^$.

Application

By the Hausdorff maximal principle, we can show every Hilbert space $H$ contains a maximal orthonormal subset $A$ as follows. (This fact can be stated as saying that $H \simeq \ell^2(A)$ as Hilbert spaces.)

Let $P$ be the set of all orthonormal subsets of the given Hilbert space $H$, which is partially ordered by set inclusion. It is nonempty as it contains the empty set and thus by the maximal principle, it contains a maximal chain $Q$. Let $A$ be the union of $Q$. We shall show it is a maximal orthonormal subset. First, if $S, T$ are in $Q$, then either $S \subset T$ or $T \subset S$. That is, any given two distinct elements in $A$ are contained in some $S$ in $Q$ and so they are orthogonal to each other (and of course, $A$ is a subset of the unit sphere in $H$). Second, if $B \supsetneq A$ for some $B$ in $P$, then $B$ cannot be in $Q$ and so $Q \cup \$ is a chain strictly larger than $Q$, a contradiction. $\square$

For the purpose of comparison, here is a proof of the same fact by Zorn's lemma. As above, let $P$ be the set of all orthonormal subsets of $H$. If $Q$ is a chain in $P$, then the union of $Q$ is also orthonormal by the same argument as above and so is an upper bound of $Q$. Thus, by Zorn's lemma, $P$ contains a maximal element $A$. (So, the difference is that the maximal principle gives a maximal chain while Zorn's lemma gives a maximal element directly.)

Proof 1

The idea of the proof is essentially due to Zermelo and is to prove the following weak form of Zorn's lemma, from the axiom of choice.

:Let $F$ be a nonempty set of subsets of some fixed set, ordered by set inclusion, such that (1) the union of each totally ordered subset of $F$ is in $F$ and (2) each subset of a set in $F$ is in $F$. Then $F$ has a maximal element.

(Zorn's lemma itself also follows from this weak form.) The maximal principle follows from the above since the set of all chains in $P$ satisfies the above conditions.

By the axiom of choice, we have a function $f : \mathfrak(P) - \ \to P$ such that $f(S) \in S$ for the power set $\mathfrak(P)$ of $P$.

For each $C \in F$, let $C^*$ be the set of all $x \in P - C$ such that $C \cup \$ is in $F$. If $C^* = \emptyset$, then let $\widetilde = C$. Otherwise, let
:$\widetilde = C \cup \.$
Note $C$ is a maximal element if and only if $\widetilde = C$. Thus, we are done if we can find a $C$ such that $\widetilde = C$.

Fix a $C_0$ in $F$. We call a subset $T \subset F$ a ''tower (over $C_0$)'' if

# $C_0$ is in $T$.
# The union of each totally ordered subset $T' \subset T$ is in $T$, where "totally ordered" is with respect to set inclusion.
# For each $C$ in $T$, $\widetilde$ is in $T$.

There exists at least one tower; indeed, the set of all sets in $F$ containing $C_0$ is a tower. Let $T_0$ be the intersection of all towers, which is again a tower.

Now, we shall show $T_0$ is totally ordered. We say a set $C$ is ''comparable in $T_0$'' if for each $A$ in $T_0$, either $A \subset C$ or $C \subset A$. Let $\Gamma$ be the set of all sets in $T_0$ that are comparable in $T_0$. We claim $\Gamma$ is a tower. The conditions 1. and 2. are straightforward to check. For 3., let $C$ in $\Gamma$ be given and then let $U$ be the set of all $A$ in $T_0$ such that either $A \subset C$ or $\widetilde \subset A$.

We claim $U$ is a tower. The conditions 1. and 2. are again straightforward to check. For 3., let $A$ be in $U$. If $A \subset C$, then since $C$ is comparable in $T_0$, either $\widetilde \subset C$ or $C \subset \widetilde$. In the first case, $\widetilde$ is in $U$. In the second case, we have $A \subset C \subset \widetilde$, which implies either $A = C$ or $C = \widetilde$. (This is the moment we needed to collapse a set to an element by the axiom of choice to define $\widetilde$.) Either way, we have $\widetilde$ is in $U$. Similarly, if $C \subset A$, we see $\widetilde$ is in $U$. Hence, $U$ is a tower. Now, since $U \subset T_0$ and $T_0$ is the intersection of all towers, $U = T_0$, which implies $\widetilde$ is comparable in $T_0$; i.e., is in $\Gamma$. This completes the proof of the claim that $\Gamma$ is a tower.

Finally, since $\Gamma$ is a tower contained in $T_0$, we have $T_0 = \Gamma$, which means $T_0$ is totally ordered.

Let $C$ be the union of $T_0$. By 2., $C$ is in $T_0$ and then by 3., $\widetilde C$ is in $T_0$. Since $C$ is the union of $T_0$, $\widetilde C \subset C$ and thus $\widetilde C = C$. $\square$

Proof 2

The Bourbaki–Witt theorem, together with the Axiom of choice, can be used to prove the Hausdorff maximal principle. Indeed, let $P$ be a nonempty poset and $X\mathrel=\$ be the set of all totally ordered subsets of $P$. Notice that $X\neq \emptyset$, since $P\neq \emptyset$ and $\\in X$, for any $x\in P$. Also, equipped with the inclusion $\subseteq$, $X$ is a poset. We claim that every chain $\mathcal\subseteq X$ has a supremum. In order to check this out, let $S$ be the union $\bigcup_C$. Clearly, $C\subseteq S$, for all $C\in \mathcal$. Also, if $U$ is any upper bound of $\mathcal$, then $S\subseteq U$, since by definition $C\subseteq U$ for all $C\in \mathcal$.

Now, consider the map $f\colon X\to X$ given by

$f(C)\mathrel=\beginC, &\text\ C\ \text\\ C\cup \, &\text\ C\ \text\end$

where $g$ is a choice function on $\$ whose existence is ensured by the Axiom of choice, and the fact that $P\setminus C\neq \emptyset$ is an immediate consequence of the non-maximality of $C$. Thus, $C\subseteq f(C)$, for each $C\in X$. In view of the Bourbaki-Witt theorem, there exists an element $C_0\in \mathcal$ such that $f(C_0)=C_0$, and therefore $C_0$ is a maximal chain of $P$.

In the case $P=\emptyset$, the empty set is trivially a maximal chain of $P$, as already mentioned above. $\square$

Notes

References

* . Reprinted by Springer-Verlag, New York, 1974. (Springer-Verlag edition).
* John Kelley (1955), ''General topology'', Von Nostrand.
* Gregory Moore (1982), ''Zermelo's axiom of choice'', Springer.
* James Munkres (2000), ''Topology'', Pearson.
* Appendix of
{{Order theory

Axiom of choice
Mathematical principles
Order theory