To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Normal function

From Wikipedia, the free encyclopedia

In axiomatic set theory, a function f : Ord → Ord is called normal (or a normal function) if and only if it is continuous (with respect to the order topology) and strictly monotonically increasing. This is equivalent to the following two conditions:

  1. For every limit ordinal γ (i.e. γ is neither zero nor a successor), it is the case that f(γ) = sup {f(ν) : ν < γ}.
  2. For all ordinals α < β, it is the case that f(α) < f(β).

YouTube Encyclopedic

  • 1/3
    Views:
    10 593
    3 475
    10 291
  • The Normal Function of the Anterior Cruciate Ligament
  • Inverse Normal Function
  • TMJ 101 - Normal Jaw Function

Transcription

Examples

A simple normal function is given by f(α) = 1 + α (see ordinal arithmetic). But f(α) = α + 1 is not normal because it is not continuous at any limit ordinal; that is, the inverse image of the one-point open set {λ + 1} is the set {λ}, which is not open when λ is a limit ordinal. If β is a fixed ordinal, then the functions f(α) = β + α, f(α) = β × α (for β ≥ 1), and f(α) = βα (for β ≥ 2) are all normal.

More important examples of normal functions are given by the aleph numbers , which connect ordinal and cardinal numbers, and by the beth numbers .

Properties

If f is normal, then for any ordinal α,

f(α) ≥ α.[1]

Proof: If not, choose γ minimal such that f(γ) < γ. Since f is strictly monotonically increasing, f(f(γ)) < f(γ), contradicting minimality of γ.

Furthermore, for any non-empty set S of ordinals, we have

f(sup S) = sup f(S).

Proof: "≥" follows from the monotonicity of f and the definition of the supremum. For "≤", set δ = sup S and consider three cases:

  • if δ = 0, then S = {0} and sup f(S) = f(0);
  • if δ = ν + 1 is a successor, then there exists s in S with ν < s, so that δs. Therefore, f(δ) ≤ f(s), which implies f(δ) ≤ sup f(S);
  • if δ is a nonzero limit, pick any ν < δ, and an s in S such that ν < s (possible since δ = sup S). Therefore, f(ν) < f(s) so that f(ν) < sup f(S), yielding f(δ) = sup {f(ν) : ν < δ} ≤ sup f(S), as desired.

Every normal function f has arbitrarily large fixed points; see the fixed-point lemma for normal functions for a proof. One can create a normal function f'  : Ord → Ord, called the derivative of f, such that f' (α) is the α-th fixed point of f.[2] For a hierarchy of normal functions, see Veblen functions.

Notes

  1. ^ Johnstone 1987, Exercise 6.9, p. 77
  2. ^ Johnstone 1987, Exercise 6.9, p. 77

References

  • Johnstone, Peter (1987), Notes on Logic and Set Theory, Cambridge University Press, ISBN 978-0-521-33692-5
This page was last edited on 11 March 2024, at 20:35
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.