Bourbaki

Exercise 16, § 2

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

Theory of Sets, III, 226

Bourbaki marks this one as harder than the rest.

An ordinal ρ>0\rho > 0 is said to be indecomposable if there exists no pair of ordinals ξ\xi, η\eta such that ξ<ρ\xi < \rho, η<ρ\eta < \rho, and ξ+η=ρ\xi + \eta = \rho.

(a) An ordinal ρ\rho is indecomposable if and only if ξ+ρ=ρ\xi + \rho = \rho for every ordinal ξ\xi such that ξ<ρ\xi < \rho.

(b) If ρ>1\rho > 1 is an indecomposable ordinal and if α\alpha is any ordinal >0> 0, then αρ\alpha\rho is indecomposable, and conversely (use Exercise 15 (f)).

(c) If ρ\rho is indecomposable and if 0<α<ρ0 < \alpha < \rho, then ρ=αξ\rho = \alpha\xi, where ξ\xi is an indecomposable ordinal (use Exercise 15 (f)).

(d) Let α\alpha be an ordinal >0> 0. Show that there exists a greatest indecomposable ordinal among the indecomposable ordinals ⩽α\leqslant \alpha (consider the decompositions α=ρ+ξ\alpha = \rho + \xi, where ρ\rho is indecomposable).

(e) If E is any set of indecomposable ordinals, deduce from (d) that the least upper bound of E (Exercise 14 (d)) is an indecomposable ordinal.

Solution

No solution has been written yet.

Cited by

Cites

Transcribed from the printed volume. Not translated.