Normal function =============== In axiomatic set theory, a function is called normal (or a normal function) if it is continuous (with respect to the order topology) and strictly monotonically increasing. This is equivalent to the following two conditions: # For every limit ordinal (i.e. is neither zero nor a successor), it is the case that . # For all ordinals , it is the case that . In axiomatic set theory, a function is called normal (or a normal function) if it is continuous (with respect to the order topology) and strictly monotonically increasing. This is equivalent to the following two conditions: For every limit ordinal (i.e. is neither zero nor a successor), it is the case that . For all ordinals , it is the case that . A simple normal function is given by (see ordinal arithmetic). But is not normal because it is not continuous at any limit ordinal (for example, f(\omega) = \omega+1 \ne \omega = \sup \{f(n) : n ). If is a fixed ordinal, then the functions , (for ), and (for ) are all normal. More important examples of normal functions are given by the aleph numbers f(\alpha) = \aleph_\alpha , which connect ordinal and cardinal numbers, and by the beth numbers f(\alpha) = \beth_\alpha . ==Notes== REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {Normal function}, url = {https://encyclopegia.org/a/normal-function} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - Normal function UR - https://encyclopegia.org/a/normal-function ER - CITE THIS ARTICLE ---------------- Cite this article: Normal function Derived from: https://en.wikipedia.org/w/index.php?oldid=1313132316 Licence: CC BY-SA 4.0 Snapshot: enwiki-001313132316 Permalink: /a/normal-function