Fixed-point lemma for normal functions: Difference between revisions

Content deleted Content added
m disamb.
m Correct html entity.
Line 7:
== Proof ==
 
First of all, it is clear that for any α ∈ Ord, ''f''(α) ≥ α. If this was not the case, we could choose a minimal α with ''f''(α) < α; then, since ''f'' is normal and thus monotone, ''f''(''f''(α)) < ''f''(α), which is a contradiction to α being minimal.
 
We now declare a sequence &lt;&alpha;<sub>''n''</sub>&gt; (''n'' &lt; &omega;) by setting &alpha;<sub>0</sub> = &alpha;, and &alpha;<sub>''n'' + 1</sub> = ''f''(&alpha;<sub>''n''</sub>) for ''n'' &lt; &omega;, and define &beta; = sup &lt;&alpha;<sub>''n''</sub>&gt;. There are three possible cases: