## FANDOM

9,750 Pages

In ordinal analysis, a normal function is a function $$f: \text{On} \mapsto \text{On}$$ that is strictly increasing and continuous. That is, $$\alpha < \beta \Rightarrow f(\alpha) < f(\beta)$$ and $$\alpha \in \text{Lim} \Rightarrow f(\alpha) = \sup\{f(\beta) : \beta < \alpha\}$$.

A trivial example of a normal function is the identity function $$f(\alpha)=\alpha$$. Less trivial examples include functions such as $$f(\alpha)=1+\alpha$$ or $$f(\alpha)=\omega^\alpha$$.

Normal functions are subject to an important property given by the fixed-point lemma, which states that a normal function has arbitrarily large fixed points. The derivative $$f'$$ of an ordinal function $$f$$ is defined as the enumerating function of the fixed points of $$f$$, so we can say that every normal function has a derivative. Not only this, but the derivative of a normal function is itself a normal function — so every normal function also has a second derivative, third derivative, etc. Even further, the procedure can be iterated transfinitely (by taking the common fixed points of lower derivatives) and we will always have normal functions. This forms the basis of the Veblen hierarchy, which is created from increasing derivatives of the function $$f(\alpha)=\omega^\alpha$$.