Exercise 5.1.10

If X contains a countable subset, then X is Dedekind infinite.

Answers

Proof. Suppose that X is a set with a countable subset Y . Then by Exercise 5.1.9 Y is Dedekind infinite so that there is a Z Y X such that there is a bijective f : Y Z . So define the following g : X X by

g ( x ) = { f ( x ) x Y x x Y

for any x X . Now since Z Y there is a y Y such that y Z , noting that since Y X , y X .

First we claim that y ran ( g ) . So suppose that it is so that there is an x X such that g ( x ) = y . If x Y then by definition g ( x ) = f ( x ) = y , but this is a contradiction since f : Y Z but y Z . On the other hand if x Y then we have g ( x ) = x = y , which is also a contradiction since y = x Y . Since a contradiction follows in either case it must be that there is no such x so that y ran ( g ) . Hence ran ( g ) X .

Clearly g is a surjective map from X to ran ( g ) so we now show that it is injective. So consider any x 1 , x 2 X where x 1 x 2 .

Case: x 1 Y and x 2 Y . Then

g ( x 1 ) = f ( x 1 ) f ( x 2 ) = g ( x 2 )

since f is injective.

Case: x 1 Y and x 2 Y . Then

g ( x 1 ) = x 1 x 2 = g ( x 2 ) .

Case: x 1 Y and x 2 Y . Then g ( x 1 ) = f ( x 1 ) Z but g ( x 2 ) = x 2 Y so that x 2 Z either since Z Y . Hence f ( x 1 ) x 2 so that

g ( x 1 ) = f ( x 1 ) x 2 = g ( x 2 ) .

Thus in all cases g ( x 1 ) g ( x 2 ) so that g is injective since x 1 and x 2 were arbitrary.

Therefore we have shown that g is a bijective map from X to ran ( g ) X so that X is Dedekind infinite by definition. □

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