Definition:Order Isomorphism/Definition 1

Definition
Let $\left({S, \preceq_1}\right)$ and $\left({T, \preceq_2}\right)$ be ordered sets.

Let $\phi: S \to T$ be a bijection such that:


 * $\phi: S \to T$ is order-preserving
 * $\phi^{-1}: T \to S$ is order-preserving.

Then $\phi$ is an order isomorphism.

That is, $\phi$ is an order isomorphism :


 * $\phi$ is bijective
 * $\forall x, y \in S: x \mathop{\preceq_1} y \implies \phi \left({x}\right) \mathop{\preceq_2} \phi \left({y}\right)$
 * $\forall p, q \in T: p \mathop{\preceq_2} q \implies \phi^{-1} \left({p}\right) \mathop{\preceq_1} \phi^{-1} \left({q}\right)$

So an order isomorphism can be described as a bijection that preserves ordering in both directions.

Also see

 * Equivalence of Definitions of Order Isomorphism