User:Dfeuer/Compact Subspace of Linearly Ordered Space/Converse Proof 2

Theorem
Let $(X, \preceq, \tau)$ be a totally ordered space.

Let $Y$ be a nonempty subset of $X$.

Suppose that for each nonempty subset, $S$, of $Y$:
 * $S$ has a supremum and an infimum in $X$.
 * $\sup_X S, \inf_X S \in Y$.

Then $Y$ is a compact subspace of $X$.

Proof
All interval notation is taken in $Y$ unless subscripted with an $X$. E.g., $[a,\to)=\{y\in Y:a\le y\}$, while $[a,\to)_X=\{x\in X:a\le x\}$.

By Equivalence of GO-Space Definitions/Two implies One, $Y$ has a basis consisting of sets that are convex in $Y$.

By Compactness from Basis, to show $Y$ compact we need only show that a cover of $Y$ by open convex sets in $Y$ has a finite subcover.

Let $\mathcal U$ be an open cover of $Y$ all of whose elements are convex and nonempty.

Define a relation $\sim$ on $\mathcal U$ by letting $U \sim V$ iff there is a finite family $\left\{{ U_0, \dots, U_n }\right\} \subseteq \mathcal U$ such that:
 * $U=U_0$, $V=U_n$, and $U_k\cap U_{k+1} \ne \varnothing$ for $k = 0, \dots, n-1$.

$\sim$ is an equivalence relation on $\mathcal U$:

For $U\in\mathscr{U}$ let $[U]$ be the $\sim$-class of $U$. Then $\mathscr{C}=\left\{\bigcup[U]:U\in\mathscr{U}\right\}$ is a partition of $Y$ into order-convex open sets, so each $[U]$ is in fact clopen. Note that since its elements are order-convex, $\mathscr{C}$ inherits a natural linear order from $Y$, which I will also denote by $\le$.

It’s not hard to show that (1) and (2) imply that $\inf C,\sup C\in C$ for each $C\in\mathscr{C}$; let $a_C=\inf C$ and $b_C=\sup C$, so that $C=[a_C,b_C]$. Let $C\in\mathscr{C}$, and suppose that $a_C\ne\inf Y$. Since $[a_C,\to)$ is open in $Y$ there is an $x\in X$ such that $x<a_C$ and for all $y\in(\leftarrow,a_C)$ we have $y\le x$. Let $u=\sup\big(Y\cap(\leftarrow,x)_X\big)$; then $u\in Y$, so $u=b_D$ for some $D\in\mathscr{C}$. Clearly $D$ is the immediate predecessor of $C$ in $\mathscr{C}$. A similar argument shows that if $b_C\ne\sup Y$, then $C$ has an immediate successor in $\mathscr{C}$.

Fix $C_0\in\mathscr{C}$. Given $C_n\in\mathscr{C}$ for some $n\in\Bbb N$, either $C_n$ is the maximum element of $\mathscr{C}$, in which case the construction stops, or $C_n$ has an immediate successor in $\mathscr{C}$, and we define $C_{n+1}$ to be that successor. Suppose that the construction does not stop at any finite stage. Let $a=\sup\{a_n:n\in\Bbb N\}$. Then $a\notin\bigcup_{n\in\Bbb N}C_n$, so $a=a_D$ for some $D\in\mathscr{C}$, and this $D$ has no immediate predecessor in $\mathscr{C}$. This is impossible, so the construction must stop at some finite stage. A similar argument working to the left shows that $\mathscr{C}$ must in fact be finite.

Fix $C\in\mathscr{C}$. There are $U,V\in\mathscr{U}$ such that $a_C\in U$ and $b_C\in V$. Then $U,V\subseteq C$, so $U\sim V$, and there is a finite family $\{U_0,\dots,U_n\}\subseteq\mathscr{U}$ such that $U=U_0$, $V=U_n$, and $U_k\cap U_{k+1}\ne\varnothing$ for $k=0,\dots,n-1$; clearly $\{U_k:k=0,\dots,n\}$ is a finite subfamily of $\mathscr{U}$ covering $C$, and it follows that $\mathscr{U}$ has a finite subcover.