0

I understand the Cantor's proof for why $S<2^S$, but also we know that ordinals $\omega\sim\omega^2\sim\omega^3...$. This approaches to $\omega^{\omega}$, what should be at least not less than $2^{\omega}$. What do I miss with this logic?

1 Answers1

2

You are confusing two different notions of exponentiation: the cardinal exponentiation and the ordinal exponentiation.

$2^\omega$ can mean either

  1. The cardinality of the power set of $\omega$ (or the set of functions $\omega\to 2$), or
  2. The ordinal number corresponding to the order type of finite binary sequences, ordered lexicographically.

The latter is a countably infinite ordinal (which is, in fact, equal to $\omega$, so it also happens to be cardinal). The former is an uncountable cardinal, the continuum.

Likewise, $\omega^\omega$ can mean one of the two:

  1. The cardinality of the set of functions $\omega\to \omega$,
  2. The ordinal number corresponding to the order type of finite sequences with values in $\omega$.

Here, the former is a cardinal number (in fact, equal to the continuum), while the latter is a countable ordinal (which is strictly between $\omega$ and the continuum).

Especially when there is risk of confusion, it is good practice to use $\aleph_0$ when talking about $\omega$ as a cardinal (in particular, when you mean to use cardinal exponentiation), $\omega$ when you mean to talk about it as an ordinal, and $\mathbf N$ when you mean to talk about it as a set of integers. Then it would be pretty clear that $\aleph_0=\omega=2^\omega<\omega^\omega<2^{\aleph_0}=\aleph_0^{\aleph_0}$ and $\omega\sim 2^\omega\sim \omega^\omega\not\sim 2^{\aleph_0}\sim \aleph_0^{\aleph_0}$.

tomasz
  • 35,474