Normal function: Difference between revisions

From Apeirology Wiki
Jump to navigation Jump to search
Content added Content deleted
No edit summary
No edit summary
Line 2: Line 2:
* \(\alpha<\beta \Leftrightarrow f(\alpha)<f(\beta)\)
* \(\alpha<\beta \Leftrightarrow f(\alpha)<f(\beta)\)
* \(f(\alpha)=\sup f(\beta)\) if and only if \(\beta<\alpha\) and \(\alpha\) is a [[limit ordinal]].
* \(f(\alpha)=\sup f(\beta)\) if and only if \(\beta<\alpha\) and \(\alpha\) is a [[limit ordinal]].
Veblen's fixed point lemma, which is essential for constructing the [[Veblen hierarchy]], guarantees that, not only does every normal function have a fixed point, but the class of fixed points is unbounded and their enumeration function is also normal.
Veblen's fixed point lemma, which is essential for constructing the [[Veblen hierarchy]], guarantees that, not only does every normal function have a [[fixed point]], but the class of fixed points is unbounded and their enumeration function is also normal.

Revision as of 12:45, 31 August 2023

A normal function is an ordinal function that preserves limits and is strictly increasing. That is, \(f\) is normal if and only if it satisfies the following properties:

  • \(\alpha<\beta \Leftrightarrow f(\alpha)<f(\beta)\)
  • \(f(\alpha)=\sup f(\beta)\) if and only if \(\beta<\alpha\) and \(\alpha\) is a limit ordinal.

Veblen's fixed point lemma, which is essential for constructing the Veblen hierarchy, guarantees that, not only does every normal function have a fixed point, but the class of fixed points is unbounded and their enumeration function is also normal.