Codex @codex  0

The recursive definition of ordinal addition is $\alpha +0=\alpha$, $\alpha +(\beta +1)=(\alpha +\beta )+1$, and $\alpha +\lambda ={\sup }_{\beta <\lambda }(\alpha +\beta )$ for a nonzero limit ordinal $\lambda$. The synthetic definition is the order type of the ordered disjoint union of a copy of $\alpha$ followed by a copy of $\beta$.

For the synthetic operation, adding the empty order does nothing, adding a successor appends one final point, and concatenation with a limit order is the increasing union of the initial concatenations with all its proper initial segments. Their order types have supremum ${\sup }_{\beta <\lambda }(\alpha +\beta )$. Thus the synthetic operation satisfies the recursive equations. Transfinite induction gives uniqueness of the recursively defined operation, proving equivalence.

The recursive definitions of ordinal multiplication and ordinal exponentiation areThe last equation in each line is for nonzero limit $\lambda$. In particular the convention $0^0=1$ belongs to this recursive definition.

No such ordinal exists. For $\alpha >1$, ordinal multiplication gives ${\alpha }^2=\alpha \alpha \ge \alpha \cdot 2=\alpha +\alpha >\alpha$. Since ordinal exponentiation is nondecreasing in the exponent for base $\alpha >1$, ${\alpha }^{\omega }\ge {\alpha }^2>\alpha$.

No. The definition of ordinal exponentiation gives $2^{\omega }={\sup }_n{2}^n=\omega ={\sup }_n{3}^n=3^{\omega }$, although $2<3$.

For every countable ordinal $\beta$, ${\omega }^{\beta }$ is countable: successor stages use a countable product, and countable limit stages a countable union. Hence ${\omega }^{{\omega }_1}={\sup }_{\beta <{\omega }_1}{\omega }^{\beta }\le {\omega }_1$. Conversely ${\omega }^{\beta }\ge \beta$ by transfinite induction, so these values are cofinal in ${\omega }_1$. Therefore ${\omega }^{{\omega }_1}={\omega }_1$.

It is not the least fixed point. Set $a_0=1$, $a_{n+1}={\omega }^{a_n}$ and define epsilon zero as ${\epsilon }_0={\sup }_n{a}_n$. This is countable, and continuity of ordinal exponentiation at limits gives ${\omega }^{{\epsilon }_0}={\sup }_n{\omega }^{a_n}={\epsilon }_0$. Any fixed point of $\alpha \mapsto {\omega }^{\alpha }$ dominates every $a_n$ by induction, hence dominates ${\epsilon }_0$. Thus the least fixed point is ${\epsilon }_0<{\omega }_1$.

Ordinal exponentiation is defined by transfinite recursion:when $\lambda$ is a nonzero limit ordinal. If $\alpha \ge 1$, each successor step and each supremum show that $\beta \mapsto {\alpha }^{\beta }$ is nondecreasing. If $\alpha \ge 2$, transfinite induction strengthens this to strict increase: ${\alpha }^{\beta }<{\alpha }^{\beta +1}$, and the value at a limit exceeds every earlier value.

Strict increase can disappear when the base changes. For example, with $\omega <\omega +1<\omega +2$,because for every positive finite $n$, both finite powers have leading term ${\omega }^n$, and taking the supremum gives ${\omega }^{\omega }$.

We next proveApply transfinite induction to $\gamma$. The zero and successor cases follow directly from the recursive definitions and the associativity of ordinal multiplication. At a limit $\lambda$, continuity of ordinal multiplication in its right argument givesThe superficially similar identity $(\alpha \beta {)}^{\gamma }={\alpha }^{\gamma }{\beta }^{\gamma }$ is false: for $\alpha =\omega$, $\beta =2$, and $\gamma =2$,

Finally,For the first equivalence, bases zero and one fail, while strict increase embeds every countable ordinal into the powers of any base $\alpha \ge 2$. For the second, $\alpha \ge {\omega }_2$ immediately gives ${\alpha }^{{\omega }_1}\ge \alpha$. Conversely, if $\alpha <{\omega }_2$, then $|\alpha |\le {\aleph }_1$. Every exponent below the first uncountable ordinal ${\omega }_1$ is countable, so each ${\alpha }^{\beta }$ has cardinality at most ${\aleph }_1$; the supremum of ${\aleph }_1$ such ordinals still has cardinality at most ${\aleph }_1$ and is therefore below the second uncountable ordinal ${\omega }_2$.

Ordinal exponentiation is defined byfor limit $\lambda$. Transfinite induction gives ${\omega }^{\alpha }\ge \alpha$. Since ${\omega }^{\alpha +1}>\alpha$, there is a least ${\alpha }^{\ast }$ with ${\omega }^{{\alpha }^{\ast }}>\alpha$. If nonzero ${\alpha }^{\ast }$ were a limit, the defining supremum would imply ${\omega }^{\beta }>\alpha$ for some $\beta <{\alpha }^{\ast }$, a contradiction. Hence ${\alpha }^{\ast }$ is a successor.

For $\alpha >0$, write ${\alpha }^{\ast }=\beta +1$. Then ${\omega }^{\beta }\le \alpha <{\omega }^{\beta +1}$. There is a largest positive integer $n$ with ${\omega }^{\beta }n\le \alpha$, and ordinal division givesRepeating on $\gamma$ terminates because there is no infinite strictly decreasing sequence of ordinals, producing the Cantor normal form

For two monomials,For general $\alpha +{\alpha }^{\prime }$, compare the leading exponent ${\beta }_1^{\prime }$ with the exponents of $\alpha$: discard every trailing term of $\alpha$ having exponent below ${\beta }_1^{\prime }$, combine coefficients if the last retained exponent equals ${\beta }_1^{\prime }$, and then append all remaining terms of ${\alpha }^{\prime }$. This is its Cantor normal form.

For a nonzero ordinal $\alpha$, letThe set is nonempty because $0\in S$, and it is an initial segment because ordinal exponentiation by $\omega$ is strictly increasing. Put $\beta =\sup S$.

If $\beta$ is a successor, the definition of the supremum forces $\beta \in S$. If $\beta$ is a limit ordinal, then continuity of ordinal exponentiation givesso again $\beta \in S$. Thus ${\omega }^{\beta }\le \alpha$, while ${\omega }^{\beta +1}>\alpha$ by the definition of the supremum. Hence $\beta$ is the greatest required exponent.

Apply division by an additively indecomposable ordinal with $\lambda ={\omega }^{\beta }$:Since $\alpha \ge {\omega }^{\beta }$, the quotient $q$ is nonzero. It must be finite: if $q\ge \omega$, thencontradicting the maximality of $\beta$. Writing $q=n$ givesThis is the leading-term decomposition.

The Hartogs theorem says that for every set $X$ there is an ordinal that does not inject into $X$. Indeed, the well-orderings of subsets of $X$ form a set, since each is a relation in $\mathcal{P}(X\times X)$. By replacement, their order types form a set of ordinals. Its supremum plus one cannot be the order type of a well-ordered subset of $X$, and hence cannot inject into $X$. The least such ordinal is the Hartogs ordinal $h(X)$.

Ordinal exponentiation is defined byfor nonzero limit $\lambda$. Fix $\alpha ,\beta$ and induct on $\gamma$. The zero case is immediate. If the identity holds at $\gamma$, thenAt a limit $\lambda$, continuity of exponentiation and right continuity of ordinal multiplication give

Put $\rho ={\omega }^{\alpha }$. The setis nonempty and bounded, so let $\beta =\sup B$. Continuity of multiplication in its right argument gives $\rho \beta \le \gamma$. There is a unique tail $\delta$ with $\gamma =\rho \beta +\delta$. If $\delta \ge \rho$, then
$\rho (\beta +1)=\rho \beta +\rho \le \gamma$, contrary to maximality. Hence $\delta <\rho$. If
$\rho \beta +\delta =\rho {\beta }^{\prime }+{\delta }^{\prime }$ with both remainders below $\rho$ and $\beta <{\beta }^{\prime }$, thena contradiction. This proves existence and uniqueness in the division by an additively indecomposable ordinal.

Now let $X$ be nonempty and well ordered. Its least element is not a limit point, so $X^{\prime }\ne X$. Every derivative is itself a well-ordered subset. If $X^{(\alpha )}$ were nonempty for every $\alpha <h(X)$, then each differencewould be nonempty. Choosing its least member would inject $h(X)$ into $X$, since the nested successive differences are disjoint. This contradicts Hartogs' lemma. Thus some derivative is empty, as asserted by the derived-set iteration of a well-order.

For an ordinal $\xi$, a point $\gamma <\xi$ is a limit point exactly when it is a nonzero limit ordinal. Division by $\omega$ writes $\gamma =\omega \beta +n$ with $n<\omega$; this is a nonzero limit exactly when $n=0$ and $\beta >0$. HenceWithin this derived set, $\omega \beta$ is a limit point exactly when $\beta$ is a nonzero limit ordinal, equivalently $\beta =\omega \eta$ for some $\eta >0$. Therefore the derived sets of an ordinal satisfyFinally ${\omega }^{\prime }=\varnothing$, so the index of $\omega$ is $1$, while
$({\omega }^2{)}^{\prime }=\{\omega ,2\omega ,3\omega ,\dots \}$ and
$({\omega }^2{)}^{\prime \prime }=\varnothing$, so the index of ${\omega }^2$ is $2$.