please try to solve that questions.
Show that the set 2 of even integers is countable.
I presume you know the theorem that if two sets are isomorphic then they have the same cardinality?
The function is an isomorphism between the two sets as you can easily show. Thus since is countably infinite so is the set 2 .
(If you don't have this theorem available, note that you can put the two sets in one to one correspondence using the above function and go from there.)
-Dan
It probably depends on the text you are using. My Topology book defines cardinality first, then introduces a proof that two sets with the same cardinality are necessarily isomorphic.
Frankly your definition might be a cleaner approach. The book rather confused me when going over this.
-Dan
I owe apologies to both of you gentlemen. The word I was remembering before the bijections was "countable" not "cardinality." Yes, in my book also it defines the bijection between sets as a definition for two sets to have the same cardinality.
-Dan
Georg Cantor developed one of the Jewels from 20th Century mathematics. The concept of sizes of sets (even infinite sets). So some infinite sets have more elements than others. Countable is any finite set, or any set which has as many elements as the number of integers. It can be shown to be the smallest type of infinite set. The Countiuum are the real numbers and they are larger. I can explain the theory but if you are not familar with the some set theory you will not follow.