Zermelo-Fraenkel Set Theory
Zermelo-Fraenkel Set Theory
Zermelo-Fraenkel Set Theory
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
CHAPTER 6. CARDINALS 49<br />
By Exercise 122.3, not every initial is regular. E.g., if α is a limit such that α < ω α , then<br />
cf(ω α ) = cf(α) α < ω α . For instance, cf(ω ω ) = ω; by Exercise 122.3 and Lemma 6.34,<br />
cf(ω ω1 ) = cf(ω 1 ) = ω 1 < ω ω1 .<br />
The least regular initial is ω. All successor initials are regular:<br />
Lemma 6.34 (AC) ω α+1 is regular.<br />
Proof. Assume that ω α+1 has a cofinal subset B such that B < 1 ω α+1 . For every β ∈ B,<br />
choose an injection : β → ω α . Then ω α+1 = ⋃ B 1<br />
⋃β∈B β × {β} 1 ω α × B 1 ω α × ω α<br />
= 1 ω α . □<br />
Note that this proof shows, in particular, the familiar fact that a countable union of<br />
countable sets is countable. But, even this needs AC.<br />
The following lemma presents the close connection between ordinal and cardinal notions.<br />
Lemma 6.35<br />
1. cf(ℵ α ) = |cf(ω α )|, and hence<br />
2. ℵ α is regular iff ω α is regular.<br />
Proof. Using the AC-free definition, this can be shown without AC. Here is a proof using<br />
AC: Assume that β = cf(ω α ) and that f : β → ω α is an order-preserving map onto a<br />
cofinal subset of ω α . Then ω α = ⋃ ξ