Ordinal Multiplication via Cantor Normal Form/Infinite Exponent

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

Let $x > 1$.

Let $y \ge \omega$ where $\omega$ denotes the minimally inductive set.

Let $\sequence {a_i}$ be a sequence of ordinals that is strictly decreasing on $1 \le i \le n$.

Let $\sequence {b_i}$ be a sequence of ordinals such that $0 < b_i < x$ for all $1 \le i \le n$.

Then:


 * $\ds \sum_{i \mathop = 1}^n \paren {x^{a_i} b_i} \times x^y = x^{a_1 \mathop + y}$

Proof
It follows that:

By multiplying the inequalities by $x^y$ on the left:

Solving for both sides of the inequality:

Therefore:

Also see

 * Definition:Cantor Normal Form