2023-05-07

274: Ordinal Number Is Grounded and Its Rank Is Itself

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

A description/proof of that ordinal number is grounded and its rank is itself

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 any ordinal number is grounded and its rank is itself.

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


Any ordinal number, o, is grounded, and its rank, rank o, is itself, which is rank o=o.


2: Proof


For any ordinal number, δ, the ordering by membership is a partial ordering, because for any oδ, \oo, and for any o,o,oδ such that oo and oo, oo.

Let us prove that oVo where V0= and Vo={PowVo|oo}. As the collection of all the ordinal numbers is not any set in the ZFC set theory, we cannot use the transfinite induction principle on the collection, so, let us think of any ordinal number, δ, which is a well-ordered set, and if oVo for each oδ, oVo will hold for any ordinal number, o, because any ordinal number is a member of an ordinal number.

Let us define the subset, S:={oδ|oVo}, of δ. For any oδ, if seg oS, oS? For any oo, oVo, oPowVo. By the proposition that any ordinal number is a transitive set and the proposition that for any transitive set with the at least partial ordering by membership (supposing that the ordering by membership is really a partial ordering), any element is the initial segment up to it, o=seg o. For any po, there is an oo such that p=o, Vo=ooPowVo, but oPowVo as is shown before, so, pVo, so, oVo, so, oS. By the transfinite induction principle, oVo for every oδ.

So, any ordinal number is grounded.

Let us prove that there is no ordinal number, oo, such that oVo, for any ordinal number, o. As before, let us think of any ordinal number, δ, and use the transfinite induction principle on δ, then, the proposition will hold for any ordinal number, after all.

Let us define the subset, S:={oδ| there is no oo such that oVo}, of δ. For any oδ, if seg oS, oS? Let us suppose that there was an oo such that oVo. As Vo=ooPowVo, for any po, pooPowVo, so, pPowVo for an o, but p can be chosen to be o because o=seg o, then, oPowVo, so, oVo, a contradiction against the supposition that seg oS, so, there is no oo such that oVo, so, oS. By the transfinite induction principle, there is no oo such that oVo for every oδ.

So, rank o=o for any ordinal number o.


References


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