Homepage Solution manuals Terence Tao Analysis I Exercise 3.6.2 (Empty set has cardinality zero)

Exercise 3.6.2 (Empty set has cardinality zero)

Show that a set X has cardinality 0 if and only if X is the empty set.

Answers

Proof.

We first show that if a set X  has cardinality 0 , then X = .

Suppose X has cardinality 0 , that is, # ( X ) = 0 . Then by Definition 3.6.1 and Definition 3.6.5, there exists a bijection

f : X { i N : 1 i 0 }

But { i N : 1 i 0 } = because we can’t have both i 1 and i 0 . Thus, f : X .

Since f is bijective, we have that it is injective (one-to-one) and surjective (onto). Since f is surjective, we have that the forward image is equal to the codomain (Tao calls codomain Range), that is, f ( X ) = . Since f is injective, we have, by Exercise 3.4.5,

f ( X ) = f 1 ( f ( X ) ) = f 1 ( ) X = f 1 ( )

That is, the domain X equals the inverse image f 1 ( ) , which, by definition, equals { x X : f ( x ) } . But this set must be empty since if it wasn’t, there would exist some object y f 1 ( ) which would imply f ( y ) , which is impossible since has no elements. Hence, f 1 ( ) = . But we had that X = f 1 ( ) . Thus, we must have X = , as was to be shown.

We now show that if X  is empty, then it has cardinality 0 .

Suppose X = . Let Y be the singleton set { y } ; the existence of such a set is guaranteed by the Singleton sets and pair sets Axiom. Then we have # ( Y ) = 1 (this is easy to show). By Lemma 3.6.9, we have # ( Y { y } ) = 0 . But Y { y } = , implying # ( ) = 0 # ( X ) = 0 , as was to be shown.

User profile picture
2024-02-09 04:00
Comments