Inequality for Ordinal Exponentiation

Theorem
Let $x$ and $y$ be ordinals.

Let $x$ be a limit ordinal and let $y > 0$.

Let $\langle a_i \rangle$ be a sequence of ordinals that is strictly monotone decreasing on $1 \le i \le n$.

Let $\langle b_i \rangle$ be a sequence of natural numbers.

Then:


 * $\displaystyle \sum_{i \mathop = 1}^n \left({ x^{a_i} \times b_i }\right)^y \le x^{a_1 \mathop \times y} \times \left({ b_1 + 1 }\right)$

Proof

 * $\displaystyle \sum_{i \mathop = 1}^n \left({ x^{a_i} \times b_i }\right) \le x^{a_1} \times \left({ b_1 + 1 }\right)$ by Upper Bound of Ordinal Sum

So:

Also see

 * Cantor Normal Form