2023-07-23

326: Cantor Normal Form Is Unique

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that Cantor normal form is unique

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that the Cantor normal form for any nonzero ordinal number is unique.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any nonzero ordinal number, o, o can be expressed as o=ωo1n1+ωo2n2+...+ωoknk, which is a Cantor normal form, where ω is the natural numbers set, oi is an ordinal number, and ni is a natural number (as an ordinal number), but that {o1,n1,o2,n2,...,ok,nk} is the only possibility.


2: Proof


By sequentially applying the logarithm theorem of the ordinal numbers arithmetic, o can be expressed as that: 1st, o=ωo1n1+ρ1 where ρ1ωo1, 2nd, ρ1=ωo2n2+ρ2 where ρ2ωo2 and o2o1, because ωo2∈=ρ1ωo1, and so on, and the sequence, ωo1,ωo2,... is finite by the proposition that any descending sequence of ordinal numbers is finite. The expression is unique as far as it is generate by the procedure, but the issue is whether there is another expression generated otherwise, or not.

Let us prove that ωλnωσ for any λσ and any natural number n. ωσ=ωσ1+0 is the unique form for the logarithm theorem of the ordinal numbers arithmetic. As ωλωσ, there is a ρ1 such that ωσ=ωλ+ρ1 by the subtraction theorem of the ordinal numbers arithmetic, but ωλρ1 because it cannot be a form for the logarithm theorem of the ordinal numbers arithmetic and obviously ρ1 cannot equal ωλ. Then, ωλ2=ωλ+ωλωλ+ρ1=ωσ, so, by the subtraction theorem of the ordinal numbers arithmetic, there is a ρ2 such that ωσ=ωλ2+ρ2, but ωλρ2 again, and ωλ3=ωλ2+ωλωλ2+ρ2=ωσ, and so on. So, for any natural number n, ωλnωσ.

Let us suppose that o=ωo1n1+ωo2n2+...+ωolnl (o1,o2,...,ol is in the descending order without loss of generality) is another expression. oωo1(n1+1), because ωolnlωol1, so, ωol1nl1+ωolnlωol1(nl1+1); ωol1(nl1+1)ωol2, so, ωol2nl2+ωol1(nl1+1)ωol2(nl2+1), and so on. If o1o1, oωo1(n1+1)ωo1ωo1n1o, a contradiction. By the symmetricalness, also o1o1 is impossible, so, o1=o1.

If n1n1, n1+1∈=n1, but oωo1(n1+1)∈=ωo1(n1)∈=o, a contradiction. By the symmetricalness, also n1n1 is impossible, so, n1=n1.

By the left cancellation law of the ordinal numbers arithmetic, ωo2n2+ωo3n3+...+ωoknk=ωo2n2+ωo3n3+...+ωolnl. And by the likewise argument, o2=o2 and n2=n2, and so on. Obviously, l has to equal k.


References


<The previous article in this series | The table of contents of this series | The next article in this series>