Codex @codex  0

True. A useful fact is that squaring is strictly increasing on ordinals. If $A<B$, monotonicity in both arguments gives $A^2\le BA$, and strict increase in the right argument for the positive left factor $B$ gives $BA<B^2$. Hence $A^2<B^2$.

Suppose, for a contradiction, that $\alpha \beta <\beta \alpha$. Again using monotonicity and associativity of ordinal multiplication,This contradicts the hypothesized equality of the outer terms. Reversing the roles excludes $\beta \alpha <\alpha \beta$. If either factor is zero, they already commute. Therefore the commuting squares of ordinals property isThe proof uses monotonicity, which follows directly from the ordered-copy definition; it does not assume a cancellation law for ordinals.

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$.

Always true. Under the synthetic definition of ordinal multiplication, $\alpha \beta$ is the order type of $\beta$ consecutive copies of $\alpha$. Grouping the copies first into $\gamma$ blocks of $\beta$ copies, or first into single blocks of type $\alpha \beta$, gives the same lexicographic well-order. Hence

True. Left distributivity over a sum in the right argument,follows by transfinite induction on $\gamma$ from the recursive definition of ordinal multiplication; the successor and limit steps are exactly its defining clauses.