Difference between revisions of "User:Evin-/Draft:Ordinal"

(Created page with "'''Ordinals''' are an extension of the natural numbers. Ordinals can be used to describe the order type of a set. The order type of the natural numbers is the first infinite o...")
 
Line 4: Line 4:
  
 
The smallest ordinal that can't be constructed from <math>\omega</math> by addition, multiplication, and exponentiation is <math>\varepsilon_0</math>, the first fixed point of the map <math>\alpha\mapsto\omega^\alpha</math>.
 
The smallest ordinal that can't be constructed from <math>\omega</math> by addition, multiplication, and exponentiation is <math>\varepsilon_0</math>, the first fixed point of the map <math>\alpha\mapsto\omega^\alpha</math>.
 +
 +
== The Veblen <math>\phi</math> functions ==
 +
Based on the definition of <math>\varepsilon_0</math>, Oswald Veblen in 1908 introduced an ordinal-indexed hierarchy of functions. <math>\phi_0(n)=\omega^n</math> and <math>\phi_k</math> enumerates the common fixed points of <math>\phi_m</math> for all <math>m<k</math>.

Revision as of 10:13, 5 June 2020

Ordinals are an extension of the natural numbers. Ordinals can be used to describe the order type of a set. The order type of the natural numbers is the first infinite ordinal, $\omega$. Ordinals can be added and multiplied. The sum of two ordinals $a$ and $b$ is the ordinal that describes the order type of a set with order type a concatenated with one of order type b. Warning! Ordinal addition is not commutative. For example $1+\omega=\omega$, while $\omega+1>\omega$.

Every ordinal characterizes the order type of the ordered ordinals less than it. For example, $0,1,2,\dotsb,\omega$ has order type $\omega+1$.

The smallest ordinal that can't be constructed from $\omega$ by addition, multiplication, and exponentiation is $\varepsilon_0$, the first fixed point of the map $\alpha\mapsto\omega^\alpha$.

The Veblen $\phi$ functions

Based on the definition of $\varepsilon_0$, Oswald Veblen in 1908 introduced an ordinal-indexed hierarchy of functions. $\phi_0(n)=\omega^n$ and $\phi_k$ enumerates the common fixed points of $\phi_m$ for all $m<k$.