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

On Page 44, Set theory, Jech(2006)

(Show that) there are at least $\mathfrak{c}$ countable order-types of linearly ordered sets. [For every sequence $a = \{ a_n : n \in N\}$ of natural numbers consider the order-type $\tau_a=a_0+\xi+a_1+\xi+a_2+\dots$, where $\xi$ is the order type of the integers. Show that if $a \ne b$, then $\tau_a \ne \tau_b$. ($\mathfrak{c}$ is the cardinality of $R$) ]

On Page 19, two sets have the same order type, if and only if they are isomorphic in the sense that there is a bijective function$f$, and both $f$ and $f^{-1}$ are order-preserving. So I speculate that the answer should equal the cardinality of the set of initial segments of the least uncountable ordinal, which is $\omega_1$. I must have misunderstood the problem somehow.

Even more confusing to me is the hint. Allow me to follow the convention in Jech's textbook:

  • $1+\omega=\omega \ne \omega+1$
  • $2·\omega=\omega \ne \omega·2 =\omega+\omega$

Since the order-type of integers is the sum of that of negative integers and that of natural number, which is $\omega·2$ . Then we have: $\tau_a = (a_0+\omega)+\omega+(a_1+\omega)+……=\omega^2$, which is a constant function, just contrary to injective function as shall be shown.

share|cite|improve this question
The least uncountable ordinal is $\omega_1$, not $\mathfrak c$. The assertion that $\omega_1=\mathfrak c$ is the continuum hypothesis, which is both consistent with and independent of ZFC. – Brian M. Scott Nov 30 '12 at 12:47
@BrianM.Scott: Thank you for correction. – Metta World Peace Nov 30 '12 at 12:48
Also, $\xi\ne\omega\cdot2$; $\xi=\omega^*+\omega$, where $\omega^*$ is the reversal of $\omega$. Pictorially, $\omega\cdot 2$ is $\to\to$, while $\xi$ is $\leftarrow\to$. – Brian M. Scott Nov 30 '12 at 12:50
@BrianM.Scott: I can't follow you, but I realize I'm wrong with the help of your hint. – Metta World Peace Nov 30 '12 at 12:54
A complementary discussion can be found here:… – Andrés E. Caicedo Nov 30 '12 at 15:55
up vote 5 down vote accepted

I’ll use $\to$ to represent the order type of $\omega$ and $\leftarrow$ to represent that of $\omega^*$ and the negative integers, and I’ll use $\cdot$ to represent the order type of $1$. Then the order type of $3+\xi+2+\xi+0+\xi+1$ can be depicted thus:


More generally, the order type $\tau_a=a_0+\xi+a_1+\xi+a_2+\xi+\ldots$ looks like this:


For each $k\in\Bbb N$ the last element of the $a_k$ section is identifiable by the fact that it’s the $(k+1)$-st element of the order that does not have an immediate successor; the first element of the $a_k$ section is identifiable by the fact that it’s the $(k+1)$-st element of the order that does not have an immediate predecessor. This means that each element that isn’t part of a $\xi$ block can be identified individually. Now use this idea to show that $\tau_a=\tau_b$ iff $a=b$.

Added: I thought that the symbolism of the arrows was self-explanatory, but if it isn’t, perhaps these diagrams will help:




share|cite|improve this answer
Tons of thanks for your lucid explanation, sir. – Metta World Peace Nov 30 '12 at 13:11
@MettaWorldPeace: You’re very welcome. – Brian M. Scott Nov 30 '12 at 13:12

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.