If I have two groups of kids in front of me, for example two different classes, how can I decide if the two groups have the same size? Of course I can count both groups, but I can also ask every kid from group A to give his hand to a kid from group B, so they pair up. If, in the end, everyone is paired up, both groups have the same size. If some kid from group A doesn't manage to give his hand to anybody, because every kid from group B is taken, then the group A had more kids... and if some kid from group B doesn't get the hand from any kid from group A, then group B had more kids! When we want to compare the sizes of two sets this is one of the things we can do! Instead of counting the two sets, we can try to pair them up. If we manage to do that, the sets have the same size! Sometimes pairing two sets is a hard task and instead we opt for a different thing: remember that if a≤b and b≤a then a=b; hence, if a set A is not smaller than a set B and if that same set B is also not smaller than the set A, then the two sets have the same size.
We will follow this train of thought to show that the set of natural numbers N and the set of rational numbers Q have the same size. To show that Q is not smaller than N , we can show that for any number n∈N there is a number q∈Q that is associated with n, and furthermore there are some numbers q′∈Q that are not associated with any natural n. If we write this association as a function f:N→Q, we can take f(n)=n73 for example. Function f is injective, and that is what tells us that |N|≤|Q| (the notation |S| represents the cardinality of the set S, the size of S). In a way, we are seeing N as the group A and Q as the group B in the third image above.
We are left with showing that |N|≥|Q|, which will let us conclude that |N|=|Q|. For that - if we keep seeing N as A and Q as B - we need to construct a situation similar to that of the second image. We will find a function f:N→Q that is surjective, i.e. for any number q∈Q there will be at least a natural that is associated with it. For some rationals q it may happen that there are different naturals n1≠n2 such that f(n1)=f(n2); that is, different naturals may be associated with the same rational. In the second picture, this may be seen as having every kid from group A give his hand to a kid in group B, even if the kid from group B is already taken: Creating this function is easy and we present a sketch of how to calculate it: The white squares are the naturals, and the position of the square determines f(n). The line determines the numerator and the column the denominator, in such a way that f(1)=1, f(4)=31 and f(13)=32.
It is easy to see that the function represented by the table, which is filled diagonally - as the arrows suggest - is surjective and is also not injective: f(1)=f(9)=1. Because it is surjective we have that |N|≥|Q|. Because we already knew |N|≤|Q| we get |N|=|Q|, i.e. there are as many naturals as rationals, which is funny if we think that, on one hand, the naturals are inside the rationals and on the other hand there are plenty of rationals that are not naturals, that is N⊊Q. When we are talking about finite sets, A⊊B means that A is smaller than B, but that is no longer true if we are working with infinite sets... In a way, an infinite set is a set that fits inside itself...
We will follow this train of thought to show that the set of natural numbers N and the set of rational numbers Q have the same size. To show that Q is not smaller than N , we can show that for any number n∈N there is a number q∈Q that is associated with n, and furthermore there are some numbers q′∈Q that are not associated with any natural n. If we write this association as a function f:N→Q, we can take f(n)=n73 for example. Function f is injective, and that is what tells us that |N|≤|Q| (the notation |S| represents the cardinality of the set S, the size of S). In a way, we are seeing N as the group A and Q as the group B in the third image above.
We are left with showing that |N|≥|Q|, which will let us conclude that |N|=|Q|. For that - if we keep seeing N as A and Q as B - we need to construct a situation similar to that of the second image. We will find a function f:N→Q that is surjective, i.e. for any number q∈Q there will be at least a natural that is associated with it. For some rationals q it may happen that there are different naturals n1≠n2 such that f(n1)=f(n2); that is, different naturals may be associated with the same rational. In the second picture, this may be seen as having every kid from group A give his hand to a kid in group B, even if the kid from group B is already taken: Creating this function is easy and we present a sketch of how to calculate it: The white squares are the naturals, and the position of the square determines f(n). The line determines the numerator and the column the denominator, in such a way that f(1)=1, f(4)=31 and f(13)=32.
It is easy to see that the function represented by the table, which is filled diagonally - as the arrows suggest - is surjective and is also not injective: f(1)=f(9)=1. Because it is surjective we have that |N|≥|Q|. Because we already knew |N|≤|Q| we get |N|=|Q|, i.e. there are as many naturals as rationals, which is funny if we think that, on one hand, the naturals are inside the rationals and on the other hand there are plenty of rationals that are not naturals, that is N⊊Q. When we are talking about finite sets, A⊊B means that A is smaller than B, but that is no longer true if we are working with infinite sets... In a way, an infinite set is a set that fits inside itself...
- RGS
The naturals, the rationals and sets that fit inside themselves
Reviewed by Unknown
on
May 11, 2018
Rating:

No comments: