Epsilon number information

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 finite 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 },\,

in which ω is the smallest infinite ordinal.

The least such ordinal is ε₀ (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 ^{\cdot ^{\cdot ^{\cdot }}}}}=\sup\{\omega ,\omega ^{\omega },\omega ^{\omega ^{\omega }},\omega ^{\omega ^{\omega ^{\omega }}},\dots \}\,,

where $sup$ is the supremum, which is equivalent to set union in the case of the von Neumann representation of ordinals.

Larger ordinal fixed points of the exponential map are indexed by ordinal subscripts, resulting in $\varepsilon _{1},\varepsilon _{2},\ldots ,\varepsilon _{\omega },\varepsilon _{\omega +1},\ldots ,\varepsilon _{\varepsilon _{0}},\ldots ,\varepsilon _{\varepsilon _{1}},\ldots ,\varepsilon _{\varepsilon _{\varepsilon _{\cdot _{\cdot _{\cdot }}}}},\ldots$ .^[1] The ordinal $ε 0$ is still countable, as is any epsilon number whose index is countable. Uncountable ordinals also exist, along with uncountable epsilon numbers whose index is an uncountable ordinal.

The smallest epsilon number $ε 0$ appears 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).

Many larger epsilon numbers can be defined using the Veblen function.

A more general class of epsilon numbers has been identified by John Horton Conway and Donald Knuth in the surreal number system, consisting of all surreals that are fixed points of the base ω exponential map $x \to ω x$ .

Hessenberg (1906) defined gamma numbers (see additively indecomposable ordinal) to be numbers $γ > 0$ such that $α + γ = γ$ whenever $α < γ$ , and delta numbers (see multiplicatively indecomposable ordinal) to be numbers $δ > 1$ such that $αδ = δ$ whenever $0 < α < δ$ , and epsilon numbers to be numbers $ε > 2$ such that $α ε = ε$ whenever $1 < α < ε$ . His gamma numbers are those of the form $ω β$ , and his delta numbers are those of the form $ω ω β$ .

^ Stephen G. Simpson, Subsystems of Second-order Arithmetic (2009, p.387)

[1] Stephen G. Simpson, Subsystems of Second-order Arithmetic (2009, p.387)

Epsilon number information

and 24 Related for: Epsilon number information

Epsilon number

Epsilon

E0

Machine epsilon

Transfinite number

Surreal number

Epsilon calculus

Epsilon Eridani

Alpha Epsilon Pi

Epsilon Team

Uniform convergence

Limit of a function

Delta Kappa Epsilon

Glossary of set theory

Lambda Phi Epsilon

E

Abundant number

Computable number

Ergun equation

Dyadic rational

Binomial approximation

Plotting algorithms for the Mandelbrot set

Ordinal notation

Autoregressive conditional heteroskedasticity