3
$\begingroup$

Usually the notion of cofinality is used for cardinals, though there seems to be no problem defining it for non-cardinal limit ordinals also: the cofinality of a limit $\alpha$ is the least $\gamma$ such that there is a less than $\gamma$ sequence of ordinals less than $\gamma$ such that the $\operatorname{sup}$ of the sequence is $\alpha$. But running through some examples leaves me wondering whether the notion is interesting: $\operatorname{cf} (\omega \cdot n) = \omega$, and $\operatorname{cf}(\epsilon_0) = \omega$, since $\omega, \omega^\omega, \omega^{\omega^\omega}, \dots$ is a confinal sequence.

My question is, can we prove that some non-cardinal ordinals are regular? More particularly, are there any countable ordinals that can be proven regular?

  • 0
    I$n$ fact, many texts define [cofinality](http://en.wikipedia.org/wiki/Cofinality) for ordinals. You can find some of then using [google books](http://books.google.com/books?id=v8fNwmk7g4kC&pg=PA49&d$q$=cofinality+ordinal&q=cofinality+ordinal&redir_esc=y#v=one$p$age).2012-05-18

1 Answers 1

4

The answer is no. Every regular ordinal is a cardinal.

The reason is simple, if $\alpha$ is not a cardinal, then it has a bijection with some smaller $\gamma$. This bijection is a sequence of order type $\gamma$ which is cofinal in $\alpha$. Therefore the cofinality of $\alpha$ is at most $\gamma<\alpha$.

If you want this sequence to be strictly increasing you can inductively thin out the sequence resulting from the bijection, at each step either you have finished and have an order type smaller than $\gamma$ or you will have a strictly increasing sequence of order type $\gamma$. Either way, we have $<\alpha$.