PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
additively indecomposable (Definition)

An ordinal $\alpha$ is called additively indecomposable if it is not $0$ and for any $\beta,\gamma<\alpha$ , we have $\beta+\gamma<\alpha$ . The set of additively indecomposable ordinals is denoted $\indecomp$ .

Obviously $1\in\indecomp$ , since $0+0<1$ . No finite ordinal other than $1$ is in $\indecomp$ . Also, $\omega\in\indecomp$ , since the sum of two finite ordinals is still finite. More generally, every infinite cardinal is in $\indecomp$ .

$\indecomp$ is closed and unbounded, so the enumerating function of $\indecomp$ is normal. In fact, $f_\indecomp(\alpha)=\omega^\alpha$ .

The derivative $f_\indecomp^\prime(\alpha)$ is written $\epsilon_\alpha$ . Ordinals of this form (that is, fixed points of $f_\indecomp$ ) are called epsilon numbers. The number $\epsilon_0=\omega^{\omega^{\omega^{\cdot^{\cdot^\cdot}}}}$ is therefore the first fixed point of the series $\omega,\omega^\omega\!,\omega^{\omega^\omega}\!\!,\ldots$




Anyone with an account can edit this entry. Please help improve it!

"additively indecomposable" is owned by mathcam. [ full author list (3) | owner history (2) ]
(view preamble | get metadata)

View style:

See Also: ordinal arithmetic

Also defines:  epsilon number, epsilon zero

Attachments:
proof of theorems in additively indecomposable (Proof) by mathcam
Log in to rate this entry.
(view current ratings)

Cross-references: series, number, fixed points, derivative, normal, enumerating function, unbounded, closed, cardinal, infinite, sum, finite, ordinal
There are 3 references to this entry.

This is version 8 of additively indecomposable, born on 2003-02-23, modified 2005-03-03.
Object id is 4056, canonical name is AdditivelyIndecomposable.
Accessed 5977 times total.

Classification:
AMS MSC03E10 (Mathematical logic and foundations :: Set theory :: Ordinal and cardinal numbers)
 03F15 (Mathematical logic and foundations :: Proof theory and constructive mathematics :: Recursive ordinals and ordinal notations)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)