Order and Topology in the Same Coordinates
An order on a set determines which points lie between others, while the order topology turns that information into neighborhoods. If two linearly ordered sets have the same order structure, then their order topologies should have the same open-set structure as well. The precise map expressing that sameness is an order isomorphism, and we will prove that it is a homeomorphism.
A linear order on a set \(X\) is an order relation \(\leq\) in which any two points are comparable. Write \(x<y\) when \(x\leq y\) and \(x\ne y\). Equip \(X\) with its order topology, denoted \(\mathcal{T}_X\). For \(a,b\in X\), the open interval \((a,b)\) means \(\{x\in X:a<x<b\}\); the open rays \((-\infty,b)\) and \((a,\infty)\) mean \(\{x\in X:x<b\}\) and \(\{x\in X:a<x\}\), respectively.
Including \(X\) matters: in a one-point ordered set, every interval and ray is empty, but \(X\) itself is a neighborhood of its unique point. More generally, this family is a basis because it covers \(X\), and the intersection of two of its members, if it contains a point, is again an interval, a ray, or \(X\). In fact, the intersection is bounded below by the larger of the lower bounds present and above by the smaller of the upper bounds present; a bound that is absent leaves that side unbounded. The empty ordered set is covered as well: its basis consists of \(X=\varnothing\).
The Homeomorphism Theorem
Recall that a map is continuous if the preimage of every open set is open. A homeomorphism is a bijection that is continuous and whose inverse is continuous. We first show why the basic open sets are preserved.
Proof. If \(X\) is empty, bijectivity implies that \(Y\) is empty. The unique map between them and its inverse are continuous, since the only open set in either space is \(\varnothing\). Now suppose the sets are nonempty. Surjectivity and order preservation give \(f((a,b))=(f(a),f(b))\): if \(x\in(a,b)\), then \(f(a)<f(x)<f(b)\); conversely, if \(y\in(f(a),f(b))\), write \(y=f(x)\) using surjectivity. The order equivalence gives \(a<x<b\). The same argument gives \(f((-\infty,b))=(-\infty,f(b))\) and \(f((a,\infty))=(f(a),\infty)\). Also \(f(X)=Y\). These statements remain valid if one of the intervals or rays is empty, and when \(X\) is a singleton the only nonempty basis set is \(X\), which maps to \(Y\).
Every open set \(V\subseteq Y\) is a union of basis sets. The preimage of each such basis set is a basis set in \(X\), by the equalities just proved, so \(f^{-1}(V)\) is a union of open sets and is open. Thus \(f\) is continuous. The inverse \(f^{-1}:Y\to X\) is also an order isomorphism: if \(y<y'\), write \(y=f(x)\) and \(y'=f(x')\); order equivalence implies \(x<x'\). Applying the same basis argument to \(f^{-1}\) proves that it is continuous. Therefore \(f\) is a homeomorphism. \(\square\)
For linearly ordered sets, the inverse-order condition follows automatically from a bijection that preserves order in the weak sense \(x\leq x'\Rightarrow f(x)\leq f(x')\). Indeed, if \(x<x'\), injectivity makes \(f(x)\ne f(x')\), so preservation gives \(f(x)<f(x')\). Conversely, if \(f(x)<f(x')\), then \(x\) cannot equal \(x'\), and \(x>x'\) would imply \(f(x)>f(x')\); hence \(x<x'\). This explains why the theorem can also be phrased using an order-preserving bijection.
Worked Examples
Worked Example: The Real Line and the Open Unit Interval
Give \(\mathbb{R}\) its standard order and order topology, and give \((0,1)\) its usual order and order topology. Define \(g:\mathbb{R}\to(0,1)\) by \[ g(x)= \begin{cases} \dfrac{1}{2(1-x)},&x<0,\\[4pt] 1-\dfrac{1}{2(1+x)},&x\geq 0. \end{cases} \] We verify that this is an order isomorphism.
If \(x<0\), then \(1-x>1\), so \(0<g(x)<\frac12\). For \(0<y<\frac12\), solving \(y=1/[2(1-x)]\) gives \(x=1-1/(2y)<0\), so every such \(y\) occurs exactly once. If \(x\geq0\), then \(1+x\geq1\), so \(\frac12\leq g(x)<1\). For \(\frac12\leq y<1\), solving \(y=1-1/[2(1+x)]\) gives \(x=1/[2(1-y)]-1\geq0\), so each such \(y\) occurs exactly once. The two ranges together are \((0,1)\), and they do not overlap except that the second includes \(\frac12\), which the first does not. Thus \(g\) is a bijection.
On the negative part, if \(x_1<x_2<0\), then \(1-x_1>1-x_2>0\), so \(1/[2(1-x_1)]<1/[2(1-x_2)]\). On the nonnegative part, if \(0\leq x_1<x_2\), then \(1+x_1<1+x_2\), so \(1/[2(1+x_1)]>1/[2(1+x_2)]\), and therefore \(g(x_1)<g(x_2)\). If \(x_1<0\leq x_2\), then \(g(x_1)<\frac12\leq g(x_2)\). Hence \(g\) is strictly increasing and is an order isomorphism.
Check: \(g(-1)=1/[2(1-(-1))]=1/4\), \(g(0)=1-1/[2(1+0)]=1/2\), and \(g(1)=1-1/[2(1+1)]=3/4\). The inverse formulas give \(g^{-1}(1/4)=1-1/(2\cdot1/4)=-1\), \(g^{-1}(1/2)=1/[2(1-1/2)]-1=0\), and \(g^{-1}(3/4)=1/[2(1-3/4)]-1=1\). By the theorem, \(g\) is a homeomorphism.
Worked Example: Two Bounded Intervals
Give \([2,5]\) and \([10,16]\) their respective orders as subsets of \(\mathbb{R}\), and equip each with its own order topology. Define \(f:[2,5]\to[10,16]\) by \(f(x)=2x+6\). At the endpoints, \(f(2)=2\cdot2+6=10\) and \(f(5)=2\cdot5+6=16\), so the image has the required endpoints. If \(2\leq x_1<x_2\leq5\), then \(f(x_2)-f(x_1)=2(x_2-x_1)>0\). The inverse formula \(f^{-1}(y)=(y-6)/2\) maps \([10,16]\) back to \([2,5]\), so \(f\) is an order isomorphism and hence a homeomorphism.
For a direct check of the endpoint neighborhoods, the target ray \((-\infty,12)\) in the order on \([10,16]\) is \([10,12)\). Its preimage is \(\{x\in[2,5]:2x+6<12\}=[2,3)\), the corresponding initial ray in \([2,5]\). Likewise, the target interval \((10,14)\) has preimage \(\{x\in[2,5]:10<2x+6<14\}=(2,4)\). These computations illustrate how endpoint and interior basic sets are carried across the map.
Worked Example: A Finite Chain
Let \(X=\{p,q,r\}\) with \(p<q<r\), and \(Y=\{0,1,2\}\) with \(0<1<2\). Give both sets their order topologies and define \(h(p)=0\), \(h(q)=1\), and \(h(r)=2\). This is a bijection, and the three ordered points are sent to the three ordered points, so \(h\) and its inverse preserve order.
In \(X\), the ray \((-\infty,q)\) is \(\{p\}\), the interval \((p,r)\) is \(\{q\}\), and the ray \((q,\infty)\) is \(\{r\}\). Thus every singleton is open, and every subset of \(X\), being a union of singletons, is open. The same calculation in \(Y\) gives \((-\infty,1)=\{0\}\), \((0,2)=\{1\}\), and \((1,\infty)=\{2\}\), so \(Y\) also has the discrete topology. The theorem gives a homeomorphism; directly, the preimage under \(h\) of each singleton in \(Y\) is a singleton in \(X\), and therefore every open set has open preimage.
Why the Hypotheses Matter
The proof depends on more than a formula that happens to preserve some comparisons. Bijectivity ensures every point of a target interval or ray comes from the source, which is needed for the equalities between images of basic sets. It also ensures that the map has an inverse. A bijection that does not preserve the order in both directions need not carry intervals and rays to the corresponding basic sets; an order-preserving map that is not onto does not meet the theorem’s hypotheses at all.
Common pitfall. Consider the inclusion \(i:[0,1)\to[0,1]\), \(i(x)=x\), with both intervals given their order topologies. It preserves order, but it is not a bijection onto the stated target. A tempting but incorrect endpoint calculation is \(i([0,1))=[0,1]\). In fact, \(1\) is not in the image: if \(i(x)=1\), then the formula \(i(x)=x\) forces \(x=1\), and \(1\notin[0,1)\). Thus the actual image is \([0,1)\), and \(i\) is not a homeomorphism onto \([0,1]\), since it is not surjective. If the codomain is instead its image \([0,1)\), the inclusion is an order isomorphism and the theorem does apply. Always check the domain, codomain, and image before invoking the result.
Order isomorphisms are useful because they let us transfer topological questions across a change of ordered coordinates. Once the order isomorphism has been verified, the theorem supplies continuity in both directions without requiring a separate neighborhood calculation at every point. The basis argument explains exactly why: intervals, rays, and the whole space are carried to their counterparts.
Check Your Understanding
For each question, specify the order topology being used and justify your answer from the definitions or the theorem.
- Show that the identity map between a linearly ordered set and itself is an order isomorphism, including when the set is empty or has one point.
- For \(f:[0,3]\to[4,10]\) defined by \(f(x)=2x+4\), verify that the endpoints are mapped correctly and give the inverse formula.
- In a chain \(a<b<c<d\), find a basic open set equal to \(\{b\}\), and explain why each singleton is open.
- Explain where surjectivity is used in the proof that an order isomorphism maps \((a,b)\) onto \((f(a),f(b))\).
- For the inclusion \([0,1)\to[0,1]\), identify the point that is not in the image and explain why the map is not a homeomorphism onto its stated codomain.