Bourbaki

Exercise 4, § 3

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

Theory of Sets, III, 229

Let E be a set and let ff be a mapping of P(E)−{∅}\mathfrak{P}(\mathrm{E}) - \{\emptyset\} into E such that for each non-empty subset X of E we have f(X)∈Xf(\mathrm{X}) \in \mathrm{X} ("choice function").

(a) Let b\mathfrak{b} be a cardinal and let A be the set of all x∈Ex \in \mathrm{E} such that Card (f−1(x))⩽b\mathrm{Card}\,(\overset{-1}{f}(x)) \leqslant \mathfrak{b}. Show that, if a=Card (A)\mathfrak{a} = \mathrm{Card}\,(\mathrm{A}), then 2a⩽1+ab2^{\mathfrak{a}} \leqslant 1 + \mathfrak{a}\mathfrak{b} (note that if Y⊂A\mathrm{Y} \subset \mathrm{A} and Y≠∅\mathrm{Y} \neq \emptyset, then f(Y)∈Af(\mathrm{Y}) \in \mathrm{A}).

(b) Let B be the set of all x∈Ex \in \mathrm{E} such that, for each non-empty subset X of f−1(x)\overset{-1}{f}(x), Card (X)⩽b\mathrm{Card}\,(\mathrm{X}) \leqslant \mathfrak{b}. Show that Card (B)⩽b\mathrm{Card}\,(\mathrm{B}) \leqslant \mathfrak{b}.

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.