A well-order is a linearly ordered set in which every nonempty subset has a least element. First note that a well-order cannot be isomorphic to a proper initial segment of itself: the least element moved by such an isomorphism would have exactly the same predecessor set on each side, forcing it to be fixed. The same least-disagreement argument makes an isomorphism between initial segments unique.
Match to exactly when their strict predecessor sets are order-isomorphic. The preceding observation makes each match unique. Matches preserve order and fill initial segments on both sides, since restricting an isomorphism matches every earlier element. If both sides had an unmatched element, take the least unmatched and . Their predecessor sets would be exactly the already matched segments, so they too would match, a contradiction. Therefore the matching exhausts at least one well-order and gives an isomorphism of that whole set onto an initial segment of the other. Uniqueness follows from the same predecessor-set argument. The whole set is allowed as an initial segment; this includes equal order types.
For ordinal division, let and choose
This supremum is a set ordinal because bounds the displayed ordinals by . Strict increase and continuity of multiplication in the right argument imply . Take the order type of the remaining tail of after its initial segment of type . Then ; if it would contradict the strict upper inequality. Thus
The half-open intervals are disjoint, so is unique, and uniqueness of the tail gives uniqueness of . This is left-divisor ordinal division: the order of multiplication cannot be interchanged.
Apply it with . The remainder is finite. A nonzero remainder makes a successor, while a nonzero is a limit: for successor it ends in a full block of type , and for limit it is the supremum of the earlier blocks. Consequently

Articles by others on the same topic (0)

There are currently no matching articles.