Exercise 33, § 6
Theory of Sets, III, p. 93
Bourbaki marks this one as harder than the rest.
Let be two cardinals such that , at least one of the two being infinite. Let E be a set, a subset of , such that and for every . We propose to show that there exists a subset such that and that any two of the sets belonging to have the same intersection. One may proceed as follows: a) Let c be the smallest of the cardinals , and let be the smallest ordinal of cardinal c. We consider an injective mapping from into , and we put ; we may suppose that , and there is therefore a bijection of onto M, ordering M. b) For every , let be the order type of the subset of M (we have ) and let be the unique increasing bijective mapping from onto . We denote by the set of the when runs through . Now prove that there exists at least one ordinal such that . We designate by the smallest of these ordinals; the union of the for has a cardinal . c) Now prove that there exists a subset such that and that the mapping from into M is injective. Now prove, by induction on , that there exists a subset of cardinal c such that the element is independent of for and for every . Now prove that the intersection N of the for has cardinal c (consider its complement). Let Q be the set of the for . d) For every , we define by induction an ordinal by the following condition: it is the smallest ordinal in such that is a strict upper bound, in , of the union of the for . Now prove that for in , we have .
Solution
No solution has been written yet.