Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose we have a denumerable set $S$ with a total order $\preceq$. Is there necessarily an isomorphism $\phi:S\to\mathbb{N}$ such that $x\preceq y \Leftrightarrow \phi(x)\leq\phi(y)$?

Specifically in the case of $S=\mathbb{Q}$ I can't find one, so I wonder about the general principle.

If we allow the image to be $\mathbb{Q}$ then it seems possible, but I'm not sure it will work if we restrict it to the naturals (or even the integers).

share|cite|improve this question
up vote 1 down vote accepted

No, of course not. For example, $\mathbb{N}$ has a smallest element, and hence so does any order isomorphic to it. But $\mathbb{Q}$ has no smallest element, so is not isomoprhic to $\mathbb{N}$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.