Added to Favorites

Popular Searches

Nearby Words

In mathematics, the epsilon numbers are a collection of transfinite numbers whose defining property is that they are fixed points of an exponential map. Consequently, they are not reachable from 0 via a series of applications of the chosen exponential map and of "weaker" operations like addition and multiplication. The original epsilon numbers were introduced by Georg Cantor in the context of ordinal arithmetic; they are the ordinal numbers ε that satisfy the equation

- $varepsilon\; =\; omega^varepsilon$,

The least such ordinal is ε_{0} (pronounced epsilon nought or epsilon zero), which can be viewed as the "limit" obtained by transfinite recursion from a sequence of smaller limit ordinals:

- $varepsilon\_0\; =\; omega^\{omega^\{omega^cdots\}\}\; =\; sup\; \{\; omega,\; omega^\{omega\},\; omega^\{omega^\{omega\}\},\; omega^\{omega^\{omega^omega\}\},\; dots\; \}$

Larger ordinal fixed points of the exponential map are indexed by ordinal subscripts, resulting in ε_{1}, ε_{2}, ... ε_{ω}, ε_{ω+1}, ... $varepsilon\_\{varepsilon\_0\}$, .... The ordinal ε_{0} is still countable, as is any epsilon number whose index is countable (there exist uncountable ordinals, and uncountable epsilon numbers whose index is an uncountable ordinal).

The smallest epsilon number ε_{0} is very important in many induction proofs, because for many purposes, transfinite induction is only required up to ε_{0} (as in Gentzen's consistency proof and the proof of Goodstein's theorem). Its use by Gentzen to prove the consistency of Peano arithmetic, along with Gödel's second incompleteness theorem, show that Peano arithmetic cannot prove the well-foundedness of this ordering (it is in fact the least ordinal with this property, and as such, in proof-theoretic ordinal analysis, is used as a measure of the strength of the theory of Peano arithmetic).

A more general class of epsilon numbers has been identified by John Horton Conway in the surreal number system, consisting of all surreals that are fixed points of the base ω exponential map x → ω^{x}.

The standard definition of ordinal exponentiation with base α>1 is:

- $alpha^0\; =\; 1\; ,$,
- $alpha^\{beta+1\}\; =\; alpha^beta\; cdot\; alpha$,
- $alpha^kappa\; =\; sup\_\{lambda\; <\; kappa\}\; alpha^lambda$ for limit $kappa$.

From this definition, it follows that for any fixed ordinal α, the mapping $beta\; mapsto\; alpha^beta$ is a normal function, so it has arbitrarily large fixed points by the fixed-point lemma for normal functions. When $alpha\; =\; omega$, these fixed points are precisely the ordinal epsilon numbers. The smallest of these, ε₀, is the supremum of the sequence

- $0,\; omega^0\; =\; 1,\; omega^1\; =\; omega,\; omega^omega,\; omega^\{omega^omega\},\; ldots,\; omega\; uparrow\; uparrow\; k,\; ldots$

in which every element is the image of its predecessor under the mapping $beta\; mapsto\; omega^beta$. (The general term is given using Knuth's up-arrow notation; the $uparrow\; uparrow$ operator is equivalent to tetration.) Just as ω^{ω} is defined as the supremum of { ω^{k} } for natural numbers k, the smallest ordinal epsilon number ε₀ may also be denoted $omega\; uparrow\; uparrow\; omega$; this notation is much less common than ε₀.

The next epsilon number after $varepsilon\_0$ is

- $varepsilon\_1\; =\; sup\{varepsilon\_0\; +\; 1,\; varepsilon\_0\; cdot\; omega,\; \{varepsilon\_0\}^omega,\; \{varepsilon\_0\}^\{\{varepsilon\_0\}^omega\},\; ldots\}$,

- $varepsilon\_1\; =\; sup\{0,\; 1,\; varepsilon\_0,\; \{varepsilon\_0\}^\{varepsilon\_0\},\; \{varepsilon\_0\}^\{\{varepsilon\_0\}^\{varepsilon\_0\}\},\; ldots\}$,

An epsilon number indexed by a limit ordinal α is constructed differently. The number $varepsilon\_alpha$ is the supremum of the set of epsilon numbers $\{\; varepsilon\_beta,\; beta\; <\; alpha\; \}$. The first such number is $varepsilon\_omega$; its form as a tetration expression appears below. Whether or not the index α is a limit ordinal, $varepsilon\_alpha$ is a fixed point not only of base ω exponentiation but also of base γ exponentiation for all ordinals $1\; <\; gamma\; <\; varepsilon\_alpha$.

Since the epsilon numbers are an unbounded subclass of the ordinal numbers, they are enumerated using the ordinal numbers themselves. For any ordinal number $alpha$, $varepsilon\_alpha$ is the least epsilon number (fixed point of the exponential map) not already in the set $\{\; varepsilon\_beta,\; beta\; <\; alpha\; \}$. It might appear that this is the non-constructive equivalent of the constructive definition using iterated exponentiation; but the two definitions are equally non-constructive at steps indexed by limit ordinals, which represent transfinite recursion of a higher order than taking the supremum of an exponential series.

The following facts about epsilon numbers are very straightforward to prove:

- Although it is quite a large number, $varepsilon\_0$ is still countable, being a countable union of countable ordinals; in fact, $varepsilon\_alpha$ is countable if and only if $alpha$ is countable.
- The union (or supremum) of any nonempty set of epsilon numbers is an epsilon number; so for instance

- $varepsilon\_omega\; =\; sup\{varepsilon\_0,\; varepsilon\_1,\; varepsilon\_2,\; ldots\}$

- is an epsilon number. Thus, the mapping $n\; mapsto\; varepsilon\_n$ is a normal function.

- Every uncountable cardinal number is an epsilon number.

The construction using the base ω exponential map is the original, due to Cantor; but one can obtain additional perspective using the base 2 exponential map. Its fixed points consist of ω itself, followed by the epsilon numbers:

- $begin\{align\}$

The elements in parentheses are part of the exponential sequence but do not fit the general term obtained by tetration. (This is to be expected, since $x\; uparrow\; uparrow\; k$ is 1 when k=0 and x when k=1.)

An epsilon number indexed by a limit ordinal is the supremum not of an exponential sequence but of a sequence of epsilon numbers:

- $begin\{align\}$

The general formula is thus

- $varepsilon\_alpha\; =\; omega\; uparrow\; uparrow\; omega^\{(1+alpha)\}$,

The fixed points of the "epsilon mapping" $x\; mapsto\; varepsilon\_x$ form a normal function, whose fixed points form a normal function, whose …; this is known as the Veblen hierarchy (the Veblen functions with base φ_{0}(α)=ω^{α}). In the notation of the Veblen hierarchy, the epsilon mapping is φ_{1}, and its fixed points are enumerated by φ_{2}. Observing that the epsilon mapping coincides, for $x\; >\; varepsilon\_0$, with $x\; rightarrow\; omega\; uparrow\; uparrow\; x$, one can speak instead of the fixed points of this "base ω tetration" map. The smallest few fixed points of the epsilon mapping are:

- $phi\_2(0)\; =\; omega\; uparrow\; uparrow\; uparrow\; omega,,$

The process of defining successively "stronger" normal functions φ_{0}, φ_{1}, φ_{2}, ... (or equivalently $x\; ,rightarrow,\; omega^x$, $x\; ,rightarrow,\; omega\; uparrow\; uparrow\; x$, $x\; ,rightarrow,\; omega\; uparrow\; uparrow\; uparrow\; x$, ..., which are not quite the same maps for small x but have the same fixed points) leads to a sequence of least fixed points:

- $\{phi\_1(0)\; =\; epsilon\_0\; =\; omega\; uparrow\; uparrow\; omega,,\; phi\_2(0)\; =\; omega\; uparrow\; uparrow\; uparrow\; omega,,\; phi\_3(0)\; =\; omega\; uparrow^4\; omega,,\; ldots\}$.

Continuing in this vein, one can define maps φ_{α} for progressively larger ordinals α (including, by this rarefied form of transfinite recursion, limit ordinals), with progressively larger least fixed points φ_{α+1}(0). The least ordinal not reachable from 0 by this procedure—i. e., the least ordinal α for which φ_{α}(0)=α, or equivalently the first fixed point of the map $alpha\; ,rightarrow,\; phi\_alpha(0)$—is the Feferman–Schütte ordinal Γ_{0}. In a set theory where such an ordinal can be proven to exist, one has a map Γ that enumerates the fixed points Γ_{0}, Γ_{1}, Γ_{2}, ... of $alpha\; ,rightarrow,\; phi\_alpha(0)$; these are all still epsilon numbers, as they lie in the image of φ_{β} for every β≤Γ_{0}, including of the map φ_{1} that enumerates epsilon numbers.

In On Numbers and Games, the classic exposition on surreal numbers, John Horton Conway provided a number of examples of concepts that had natural extensions from the ordinals to the surreals. One such function is the the $omega$-map $n\; mapsto\; omega^n$; this mapping generalises naturally to include all surreal numbers in its domain, which in turn provides a natural generalisation of the Cantor normal form for surreal numbers.

It is natural to consider any fixed point of this expanded map to be an epsilon number, whether or not it happens to be strictly an ordinal number. Some examples of non-ordinal epsilon numbers are

- $varepsilon\_\{-1\}\; =\; \{0,\; 1,\; omega,\; omega^omega,\; ldots\; mid\; varepsilon\_0\; -\; 1,\; omega^\{varepsilon\_0\; -\; 1\},\; ldots\}$

- $varepsilon\_\{frac\{1\}\{2\}\}\; =\; \{varepsilon\_0\; +\; 1,\; omega^\{varepsilon\_0\; +\; 1\},\; ldots\; mid\; varepsilon\_1\; -\; 1,\; omega^\{varepsilon\_1\; -\; 1\},\; ldots\}$.

There is a natural way to define $varepsilon\_n$ for every surreal number n, and the map remains order-preserving. Conway goes on to define a broader class of "irreducible" surreal numbers that includes the epsilon numbers as a particularly-interesting subclass.

The surreal epsilon numbers form a subclass of the class of surreals that are fixed points of the base 2 exponential map x → 2^{x} (or equivalently of the base y exponential map for any other finite base y > 1). This latter class is the most general idea of "epsilon number" (exponential fixed point), in the same sense in which the surreals are the most general kind of "number" (ordered field); but it differs from the ordinal epsilon numbers in critical respects (beginning with the fact that ω is a fixed point of x → 2^{x} but not of x → ω^{x}). The fixed points of x → 2^{x} can also be indexed by the surreals; for every surreal x with birthday α, there is a fixed point F(x) with birthday $omega\; uparrow\; uparrow\; omega^alpha$.

If the birthday of x is a successor ordinal α+1, S_{α} contains either a greatest element y such that y<x or a least element z such that z>x (or both). The fixed point F(x) is the exponential attractor of F(y)+1 and/or F(z)−1, i. e., the surreal number obtained by transfinite recursion from a series formed by iterated base 2 exponentiation starting at F(y)+1 or F(z)−1. (More precisely, iterated exponentiation attracts any non-fixed-point surreal number to one of the gaps above the reals in the surreal number system. The exponential attractor is the result of transfinite recursion "into the gap", i. e., the simplest surreal number lying beyond the gap.) As usual, the case where the birthday of x is a limit ordinal α is handled using Conway cuts in the transfinite union of previous generations.

The unique fixed point of x → 2^{x} with birthday $omega\; uparrow\; uparrow\; omega^0\; =\; omega$ is ω itself, which we may label F(0). The two fixed points with birthday $omega\; uparrow\; uparrow\; omega^1\; =\; varepsilon\_0$ are $omega^\{omega^\{varepsilon\_0\}\}\; =\; varepsilon\_0$ and $omega^\{omega^\{-varepsilon\_0\}\}$ (the smallest infinite number in generation ε₀); they are the exponential attractors of ω+1 and ω−1 respectively, and may be labeled F(1) and F(−1). The largest and smallest infinite numbers in generation ε_{1} are F(2)=ε_{1} and F(−2) respectively; Conway's ε_{−1} also appears in generation ε_{1} as F(^{1}/_{2}), and his $varepsilon\_\{frac\{1\}\{2\}\}$ appears in generation ε_{2} as F(^{3}/_{2}).

- J.H. Conway, On Numbers and Games (1976) Academic Press ISBN 0-12-186350-6

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday September 16, 2008 at 08:03:21 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday September 16, 2008 at 08:03:21 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.