Exercise 13, § 6
Tag 03NT, permanent. Cite it as [Bourbaki, Tag 03NT].
Theory of Sets, III, 243
Bourbaki marks this one as harder than the rest.
(a) Let be an ordinal functional symbol (§2, Exercise 17), defined for and such that the relation implies . Show that, if , then for every ordinal (argue by contradiction). Deduce that there exists such that for all (take to be the least indecomposable ordinal ; cf. Exercise 11 (a)).
(b) Let be the ordinal functional symbol defined in §2, Exercise 17 (b). Suppose that the relations and imply , so that the relations and imply (§ 2, Exercise 17 (d)). Show that for each ordinal there exists at most a finite number of ordinals for which the equation has at least one solution. (Note that if is the least solution of and if is the least solution of , then the relation implies .)
(c) A critical ordinal with respect to is any infinite ordinal such that for all such that . Show that a critical ordinal (with respect to ) has no predecessor. If there exists a set A of ordinals such that for all , and if is the least upper bound of A, show that is a critical ordinal.
(d) Let (defined for ). Define inductively , for . Show that the least upper bound of the sequence is a critical ordinal with respect to .
(e) Show that the least upper bound of every set of critical ordinals with respect to is again a critical ordinal, and that every critical ordinal is indecomposable (note that for all ).
Solution
No solution has been written yet.