2023-07-09

319: For Monotone Continuous Operation from Ordinal Numbers Collection into Ordinal Numbers Collection, Image of Limit Ordinal Number Is Limit Ordinal Number

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

A description/proof of that for monotone continuous operation from ordinal numbers collection into ordinal numbers collection, image of limit ordinal number is limit ordinal number

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 for any monotone continuous operation from the ordinal numbers collection into the ordinal numbers collection, the image of any limit ordinal number is a limit ordinal number.

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 monotone continuous operation, f:OO where O is the all the ordinal numbers collection, and any limit ordinal number, o1, o2:=f(o1) is a limit ordinal number.


2: Proof


By the definition of continuousness, o2=oo1f(o). f(o)f(o1)=o2 as f is monotone, and o2 is nonzero, because o1 is nonzero and there is at least 1 such an o. So, oo1f(o)oo2o. The issue is that is there oo1 such that of(o) for each oo2? Let us suppose that there was no oo1 such that of(o) for an oo2. By the proposition that the inclusion relation satisfies the trichotomy on the ordinal numbers collection, f(o)o for every oo1, so, o2=oo1f(o)oo2, because oo2 if oo2 by the proposition that the inclusion relation is equivalent with the membership relation for the ordinal numbers collection, a contradiction. So, there is an oo1 such that of(o) for each oo2, so, oo2ooo1f(o). So, oo2o=oo1f(o)=o2. By the proposition that any ordinal number is a limit ordinal number if and only if it is nonzero and is the union of its all the members, o2 is a limit ordinal number.


References


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