I am solving some problems on order isomorphism.
I found this old problem Prove that $(\mathbb{N},\le)$ and $(\mathbb{Z}, \le)$ are not order isomorphic
I has solved this problem as follows:
Let $f: \mathbb{Z} \rightarrow \mathbb{N}$ is an order isomorphism. So, since $1\in \mathbb{N}$, $1=f(a)$ for $a\in \mathbb{Z}$. Now $a-1<a$ implies $f(a-1)<f(a) = 1$. So, $f(a-1) \in \mathbb{N}$ with $f(a-1)<1$. Hence contradiction!
Another solution: $f: \mathbb{N} \rightarrow \mathbb{Z}$ is an order isomorphism. Let $f(1) =a \in \mathbb{Z}$. Then $a-1 <a$ implies $f^{-1}(a-1)<f^{-1}(a)$. So, since $f^{-1}(a-1)>1$ we have $1<f^{-1}(a)$. So, $a= f(1)< f(f^{-1}(a)) = a$. Contradiction!
Am I correct?
But....Um.... but what are you asking that is not asked in that question? Why should I not consider this to be a duplicate?
– fleablood Jul 07 '22 at 16:38