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

Let $A$ a set of ordinals. We know that $\sup A:=\bigcup A$ is an ordinal. Frequently, in proofs, one use that it is a limit ordinal. I would want to know when it is.

To show that it is limit : let $\beta<\sup A$, there exists an ordinal $\gamma\in A$ so that $\beta<\gamma\leq \sup A$ (if not, every $\gamma\in A$ is least than $\beta$ so $\sup A\leq \beta$, contradiction). So, I want to say that if $\gamma<\sup A$ then $\sup A$ is limit ($|A|$ is it necessary limit ?). For example, $\sup(\omega+2)=\omega+1$ successor

But if the unique $\gamma$ such that $\beta<\gamma\leq \sup A$ is $\gamma=\sup A$, it means that $\sup A=\max A$ and it is limit iff $\max A$ is limit.

If we can't find a $\gamma\in A$, maybe we can find an ordinal $\gamma$ such that $\beta<\gamma<\sup A$, that is, when $\beta\in\bigcup\bigcup A$ so when $\bigcup A=\bigcup\bigcup A$.

Can somebody make the notion of $sup$ clearest for me ? Thanks.

share|cite|improve this question
If $A$ has a largest member $\alpha=\max A$, then $\sup A=\alpha$; if $A$ has no largest member, then $\sup A$ is a limit ordinal. – Brian M. Scott May 14 '12 at 10:17
Thanks. I knew it was trivial ... – Marc Moretti May 14 '12 at 14:06
@Marc: You can (and should) write an answer to your own question and accept it. – Asaf Karagila May 16 '12 at 15:55
up vote 1 down vote accepted

The $sup$ is ok for me. Thanks

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.