Bourbaki

Exercise 24, § 6

Tag 03O4, permanent. Cite it as [Bourbaki, Tag 03O4].

Theory of Sets, III, 248

Bourbaki marks this one as harder than the rest.

Let F\mathfrak{F} be a set of subsets of a set E such that for each A∈FA \in \mathfrak{F} we have Card (A)=(A) = Card (F)=a⩾ℵ0(\mathfrak{F}) = \mathfrak{a} \geqslant \aleph_0. Show that E has a subset P such that Card (P)=a(P) = \mathfrak{a} and such that no set of F\mathfrak{F} is contained in P. (If a=ℵα\mathfrak{a} = \aleph_\alpha, define by transfinite induction two injective mappings ξ→f(ξ)\xi \to f(\xi), ξ→g(ξ)\xi \to g(\xi) of ωα\omega_\alpha into E such that the sets P=f(ωα)P = f(\omega_\alpha) and Q=g(ωα)Q = g(\omega_\alpha) do not intersect and such that each of them meets every subset A∈FA \in \mathfrak{F}.)

(b) Suppose, moreover, that for each subset G\mathfrak{G} of F\mathfrak{F} such that Card (G)<a(\mathfrak{G}) < \mathfrak{a}, the complement in E of the union of the sets A∈GA \in \mathfrak{G} has cardinal ⩾a\geqslant \mathfrak{a}. Show that E then has a subset P such that Card (P)=a(P) = \mathfrak{a} and such that, for each A∈GA \in \mathfrak{G}, Card (P∩A)<a(P \cap A) < \mathfrak{a} (similar method).

Solution

No solution has been written yet.

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.