Bourbaki

Exercise 10, § 6

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

Theory of Sets, III, 241

Bourbaki marks this one as harder than the rest.

Let ω\omega or ω0\omega_0 denote the ordinal Ord (N) (§ 2, Exercise 14). The set of all integers is then a well-ordered set isomorphic to the set of all ordinals <ω< \omega. For each integer nn we denote again by nn (by abuse of language) the ordinal Ord ([0,n[)([0, n[).

(a) Show that for each cardinal a\mathfrak{a} the relation "ξ\xi is an ordinal and Card (ξ)<a(\xi) < \mathfrak{a}" is collectivizing (use Zermelo's theorem). Let W(a)W(\mathfrak{a}) denote the set of all ordinals ξ\xi such that Card (ξ)<a(\xi) < \mathfrak{a}.

(b) For each ordinal α>0\alpha > 0 define a function fαf_\alpha on the well-ordered set O′(α)O'(\alpha) of ordinals ⩽α\leqslant \alpha by transfinite induction as follows : fα(0)=ω0=ωf_\alpha(0) = \omega_0 = \omega, and for each ordinal ξ\xi such that 0<ξ⩽α0 < \xi \leqslant \alpha, fα(ξ)f_\alpha(\xi) is the least upper bound (§ 2, Exercise 14 (d)) of the set of ordinals ζ\zeta such that Card(ζ)⩽Card(fα(η))\mathrm{Card}(\zeta) \leqslant \mathrm{Card}(f_\alpha(\eta)) for at least one ordinal η<ξ\eta < \xi. Show that, if 0⩽η<ξ⩽α0 \leqslant \eta < \xi \leqslant \alpha, then Card(fα(η))<Card(fα(ξ))\mathrm{Card}(f_\alpha(\eta)) < \mathrm{Card}(f_\alpha(\xi)) and that, if ξ⩽α⩽β\xi \leqslant \alpha \leqslant \beta, then fα(ξ)=fβ(ξ)f_\alpha(\xi) = f_\beta(\xi). Put ωα=fα(α)\omega_\alpha = f_\alpha(\alpha); ωα\omega_\alpha is said to be the initial ordinal with index α\alpha. We have ωα⩾α\omega_\alpha \geqslant \alpha. Put ℵα=Card(ωα)\aleph_\alpha = \mathrm{Card}(\omega_\alpha); ℵα\aleph_\alpha is said to be the aleph of index α\alpha. In particular, ℵ0=Card (N)\aleph_0 = \mathrm{Card}\ (\mathbf{N}).

(c) Show that for each infinite cardinal a\mathfrak{a} the least upper bound λ\lambda of the set of ordinals W(a)W(\mathfrak{a}) is an initial ordinal ωα\omega_\alpha, and that a=ℵα\mathfrak{a} = \aleph_\alpha (consider the least ordinal μ\mu such that ωμ⩾λ\omega_\mu \geqslant \lambda); in other words, ωα\omega_\alpha is the least ordinal ξ\xi such that Card(ξ)=ℵα\mathrm{Card}(\xi) = \aleph_\alpha. For each ordinal α\alpha the mapping ξ→ℵξ\xi \rightarrow \aleph_\xi, defined on O′(α)O'(\alpha), is an isomorphism of the well-ordered set O′(α)O'(\alpha) onto the well-ordered set of cardinals ⩽ℵα\leqslant \aleph_\alpha; in particular, ℵα+1\aleph_{\alpha+1} is the least cardinal >ℵα> \aleph_\alpha. Show that, if α\alpha has no predecessor, then for every strictly increasing mapping ξ→σξ\xi \rightarrow \sigma_\xi of an ordinal β\beta into α\alpha such that α=sup⁡ξ<βσξ\alpha = \sup_{\xi < \beta} \sigma_\xi, we have

∑ξ<βℵσξ=ℵα.\sum_{\xi < \beta} \aleph_{\sigma_\xi} = \aleph_\alpha.

(d) Deduce from (c) that ωξ\omega_\xi is a normal ordinal functional symbol (§ 2, Exercise 17).

Solution

No solution has been written yet.

Cited by

Cites

Transcribed from the printed volume. Not translated.