Exercise 3.6.6
Let , , be sets. Show that the sets and have equal cardinality by constructing an explicit bijection between the two sets. Conclude that for any natural numbers , , . Use a similar argument to also conclude .
This stack exchange post helped with this exercise (link), as well as this solution (link).
Let's start with . This is a set of all the functions from to . Let's denote an element of this set .
So where and .
Now is the set of all functions from to . Let's denote an element of this set .
So where and .
Let's now consider . This is a set of all the functions from to . Let's denote an element of this set .
So where , and is an ordered pair with .
We need a bijection, let's call it which maps to . That is
Noting that takes one parameter , and takes two , helps suggest a possible mapping.
UNSURE
That is, maps to which we define to be .
We now need to show that , as we have defined it, is indeed a bijection.
Let's show is surjective. For every there exists a such that . UNSURE
Let's now show is injective. TODO
No comments:
Post a Comment