It's interesting to note that you can have infinitely many different sizes of infinity. We usually donate the size of N (the natural set) as
N and proceed from there. This is known as a 'countably infinite' set, as is any set A if we can find a bijection f:
N -> A.
As an example, consider the set A of all even, positive integers, i.e. A = {2, 4, ...} Then we can construct a bijection f:
N -> A; let f(x) = 2x. This implies that the set of all even, positive integers is
the same size as the set of all positive integers.
As for there being infinitely many different sizes of infinity, here is a proof (and indeed a test of Simba's study of set theory
...)
"Consider the set A. If A is a finite set, then we know that the power set, P(A) (the set of all subsets of the set) is larger in magnitude than A. Indeed, |P(A)| = 2^|A|. This is quite easy to prove if you consider each element of A and whether or not it is included in each subset of A.
Now we move onto the pressing matter - proving that we can create a set
bigger than any existing set; even infinite sets. Let our infinite set be B.
For two sets to be of the same size, we require f: B -> P(B) to be a bijective function. If this is not the case, the sets are
not the same size. Our aim is to prove that f can not be a bijection.
Define
C={x∈B∣x∈/f(b)} where C⊆B.Now suppose f is a bijective function. Then
∃x∈B such that
f(x)=C.
Then
x∈C⟺x∈/f(x)⟺x∈/C.
A clear contradiction, so f is not a bijection. Hence the power set is larger than the infinite set we started with."
It's a really interesting field to look into if you are interested in set theory and such
.