Content deleted Content added
add short description, as per WP:SHORTDESC |
Srich32977 (talk | contribs) trim Tags: Mobile edit Mobile app edit iOS app edit App section source |
||
(4 intermediate revisions by 3 users not shown) | |||
Line 18:
== Proof ==
The first step of the proof is to verify that
:<math>f(\beta) = f(\sup_{n<\omega} \alpha_n)</math>
:<math>\qquad = \sup_{n<\omega} f(\alpha_n)</math>
:<math>\qquad = \sup_{n<\omega} \alpha_{n+1}</math>
:<math>\qquad = \beta</math>
The last equality follows from the fact that the sequence
As an aside, it can be demonstrated that the
== Example application ==
The function ''f'' : Ord → Ord, ''f''(''α'') = ω<sub>''α''</sub> is normal (see [[initial ordinal]]). Thus, there exists an ordinal ''θ'' such that ''θ'' = ω<sub>''θ''</sub>. In fact, the lemma shows that there is a closed, unbounded class of such ''θ''.
==References==
{{refbegin}}
* {{cite book
| author = Levy, A.
Line 49 ⟶ 50:
| year = 1908
| pages = 280–292
| doi= 10.2307/1988605
| issue = 3
Line 55:
| issn= 0002-9947| doi-access = free
}}
{{refend}}
[[Category:Ordinal numbers]]
|