Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

If $x_1, x_2, x_3, \ldots$ are ordinals such that $x_1\ge x_2\ge x_3\ge \ldots$, then there exists a positive integer $n$ such that $x_n=x_{n+1}=x_{n+2}=\ldots$.
I think that this statement is true, but I do not know if there is a possible way to find such integer $n$.

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

This is true because $\in$ is a well-founded relation, and $\alpha<\beta$ if and only if $\alpha\in\beta$. Therefore there is no infinite sequence which is strictly decreasing.

Note that the $n$ could be any $n\in\omega$. For example, $n,n-1,\ldots,2,1,0,0,0,\ldots$. This would be a sequence which only stabilizes after $n$ steps.

To see that this is true we can either use the fact that $x_i$ are all members of $x_0 + 1$, which is a well-ordered set. Therefore every non-empty set has a minimal element, in particular the set $\{x_i\mid i\in\omega\}$. Let $x$ be the minimum of that set, then $x=x_n$ for some $n$, and since we assumed $x_n\geq x_{n+1}$ we have that $x_k=x$ for all $k\geq n$.

(This claim may have other proofs depending on your definitions of ordinals, and the approach that you wish to take.)

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.