---
title: Normal function
slug: normal-function
qid: 
snapshot: enwiki-001313132316
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1313132316
tags: [20477108, 23603337, 24043274, 24719580, 26220375, 60433035]
---

# Normal function

> [!note] Provenance
> Snapshot `enwiki-001313132316` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1313132316> · Licensed CC BY-SA 4.0

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==
