|
|
|
|
proof of theorems in additively indecomposable
|
(Proof)
|
|
- $\mathbb{H}$ is closed.
Let $\{\alpha_i\mid i<\kappa\}$ be some increasing sequence of elements of $\mathbb{H}$ and let $\alpha=\sup \{\alpha_i\mid i<\kappa\}$ Then for any $x,y<\alpha$ it must be that $x<\alpha_i$ and $y<\alpha_j$ for some $i,j<\kappa$ But then $x+y<\alpha_{\max\{i,j\}}<\alpha$
- $\mathbb{H}$ is unbounded.
Consider any $\alpha$ and define a sequence by $\alpha_0=S\alpha$ and $\alpha_{n+1}=\alpha_n+\alpha_n$ Let $\alpha_\omega=\sup_{n<\omega}\alpha_n$ be the limit of this sequence. If $x,y<\alpha_\omega$ then it must be that $x<\alpha_i$ and $y<\alpha_j$ for some $i,j<\omega$ and therefore $x+y<\alpha_{\max\{i,j\}+1}$ Note that $\alpha_\omega$ is, in fact, the next element of $\mathbb{H}$ since every element in the sequence is clearly additively decomposable.
- $f_\mathbb{H}(\alpha)=\omega^\alpha$
Since $0$ is not in $\mathbb{H}$ we have $f_\mathbb{H}(0)=1$
For any $\alpha+1$ we have $f_\mathbb{H}(\alpha+1)$ is the least additively indecomposable number greater than $f_\mathbb{H}(\alpha)$ Let $\alpha_0=Sf_\mathbb{H}(\alpha)$ and $\alpha_{n+1}=\alpha_n+\alpha_n=\alpha_n\cdot 2$ Then $f_\mathbb{H}(\alpha+1)=\sup_{n<\omega} \alpha_n=\sup_{n<\omega}S\alpha\cdot 2\cdots 2=f_\mathbb{H}(\alpha)\cdot\omega$ The limit case is trivial since $\mathbb{H}$ is closed and unbounded, so $f_\mathbb{H}$ is continuous.
|
"proof of theorems in additively indecomposable" is owned by mathcam. [ full author list (3) | owner history (2) ]
|
|
(view preamble | get metadata)
Cross-references: continuous, number, additively indecomposable, limit, unbounded, sequence, increasing, closed
There is 1 reference to this entry.
This is version 6 of proof of theorems in additively indecomposable, born on 2003-02-23, modified 2004-03-12.
Object id is 4057, canonical name is ProofOfTheoremsInAditivelyIndecomposable.
Accessed 2450 times total.
Classification:
| AMS MSC: | 03E10 (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
|
|
|
|
|
|
|
|
|
|
|