Exercise 8.1.17

If B is an infinite set and A is a subset of B such that | A | < | B | , then | B A | = | B | .

Answers

Proof. Since B is infinite, it follows Theorem 8.1.5 that there is a unique ordinal α such that | B | = α , noting that this requires the Axiom of Choice. Thus there is a bijection f from B onto ω α . Clearly then, since A B , we have that f [ A ] ω α . Moreover, clearly f is a bijection from A to f [ A ] so that | f [ A ] | = | A | < | B | = α . It therefore follows from Exercise 7.2.6 that | ω α f [ A ] | = α . We now claim that f [ B A ] = ω α f [ A ] .

(⊆) So consider any y f [ B A ] so that there is an x B A such that y = f ( x ) . Since clearly x B , we have that y = f ( x ) ω α since f maps B onto ω α . Now suppose that also y f [ A ] so that there is a z A where y = f ( z ) . Then we have that y = f ( x ) = f ( z ) so that x = z since f is injective. Hence we have x = z A but also z = x A since z = x B A , which is a contradiction. So it must be that y f [ A ] so that indeed y ω α f [ A ] . Therefore f [ B A ] ω α f [ A ] since y was arbitrary.

(⊇) Now consider any y ω α f [ A ] so that y ω α and y f [ A ] . Since f is onto ω α , there is an x B such that y = f ( x ) . Moreover, since y f [ A ] we can be sure that x A . Therefore x B A . Since y = f ( x ) it therefore follows that y f [ B A ] so that ω α f [ A ] f [ B A ] since y was arbitrary.

Thus we have shown that f [ B A ] = ω α f [ A ] so that clearly f is a bijection from B A onto ω α f [ A ] . Hence we have that | B A | = | ω α f [ A ] | = α = | B | as desired. □

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