Exercise 7.2.6

If X is a subset of ω α such that | X | < α , then | ω α X | = α .

Answers

Lemma 1. If κ and λ are cardinal numbers and κ λ < α for some ordinal α , then κ + λ < α .

Proof. We have

κ + λ = λ + κ (by the commutativity of cardinal addition) λ + λ (by property (d) in section 5.1) = λ 1 + λ 1 = λ ( 1 + 1 ) (by property (g) in section 5.1) = λ 2 .

If λ is finite then clearly λ 2 is finite so that κ + λ λ 2 < α . On the other hand if λ is infinite then λ = β where β < α since β = λ < γ . Thus we have κ + λ λ 2 = 2 λ = 2 β = β < α by Corollary 7.2.2. Hence in either case κ + λ < α as desired. □

Main Problem.

Proof. First, we clearly have that ω α X and X are disjoint and ( ω α X ) X = ω α so that, by the definition of cardinal addition, we have

| ω α X | + | X | = | ( ω α X ) X | = | ω α | = α .

Now suppose that | ω α X | < α Since ω α X ω α and X ω α are both sets of ordinals, they are clearly both well ordered by < . Thus | ω α X | | X | or | X | | ω α X | by Lemma ??. Since we also have | ω α X | < α and | X | < α , in either case it follows from Lemma 1 that

α = | ω α X | + | X | < α ,

which is clearly a contradiction. Thus it must be that | ω α X | α so that α | ω α X | by Corollary ??. Since ω α X ω α we clearly also have that | ω α X | | ω α | = α . Hence | ω α X | = α by the Cantor-Bernstein Theorem. □

User profile picture
2024-07-15 11:42
Comments