Exercise 14, § 2
Tag 03UO, permanent. Cite it as [Bourbaki, Tag 03UO].
Theory of Sets, III, 225
Bourbaki marks this one as harder than the rest.
An ordinal is the order-type of a well-ordered set (Exercise 13).
(a) Show that, if is a family of ordinals indexed by a well-ordered set , then the ordinal sum is an ordinal; \* and that if, moreover, is finite, the ordinal product is an ordinal (Exercise 11). \* The order-type of the empty set is denoted by 0, and that of a set with one element by 1 (by abuse of language, cf. § 3). Show that
for every ordinal .
(b) Show that the relation " is an ordinal and is an ordinal and " is a well-ordering relation, denoted by . (Note that, if and are ordinals, the relation is equivalent to " is equal to the order-type of a segment of " (no. 5, Theorem 3, Corollary 3): given a family of ordinals, consider a well-ordering on and take the ordinal sum of the family of sets ordered by the ; finally, use Proposition 2 of no. 1.)
(c) Let be an ordinal. Show that the relation " is an ordinal and " is collectivizing in , and that the set of ordinals is a well-ordered set such that . We shall often identify with .
(d) Show that for every family of ordinals there exists a unique ordinal such that the relation " is an ordinal and for all " is equivalent to . By abuse of language, is called the least upper bound of the family of ordinals , and we write (it is the greatest element of the union of and the set of the ). The least upper bound of the set of ordinals is either or an ordinal such that ; in the latter case, is said to be the predecessor of .
Solution
No solution has been written yet.