Mathematicians consider two sets to be of the same size or more precisely "cardinality", if it is possible to construct a 1-1 map of elements from the first set to the second set. These maps can obviously be constructed for sets with finitely many elements, and they can be constructed for sets with an infinite number of elements as well. For instance, the set of all integers has the same cardinality of the set of all positive integers (just enumerate the integers alternating back and forth expanding from 0 - this constructs the 1-1 map).
We can prove that no such 1-1 map exists between the integers (an infinite set) and the decimals in the interval [0,1] (another infinite set). The proof is by contradiction, meaning that we assume such a 1-1 map exists and prove it leads to a contradiction, therefore our assumption that the 1-1 map exists must be false.
So suppose we were able to construct a map from all decimals in [0,1], by enumerating them according to some clever rule. Let d_i be the ith digit of number i in your mapping. For each I pick another different digit d_i'. Let's construct the number with decimal representation D = . d_0' d_1' d_2' ...
Assuming we have our 1-1 map, it must be somewhere in our mapping. Let's say it's element k. By our labeling concention the kth decimal digit of D is actually d_k. However, this contradicts our method of construction of D. Therefore our assumption that there is a 1-1 map between decimals in [0,1] and the integers must be false.
It is in this sense that there are infinities of different sizes.
> It is in this sense that there are infinities of different sizes.
They aren’t actually different sizes, though.
All this proves is that under specific set theoretic assumptions, a contradiction arises if you define “size” as “cardinality” and assume that a particular bijective relation exists between your two infinite sets.
It doesn’t actually mean the sets have different sizes, it just means they differ under a set of assumptions that may (or may not) be useful for your purposes.
I don’t have one that doesn’t admit a contradiction here … which I’d argue is because comparing the size of an infinite set is nonsensical, even if the properties used to do so are otherwise useful.
Similarly, I can also work around Russel’s paradox by introducing infinite universes, but that doesn’t actually resolve the paradox, it just provides a set (ha ha) of rules that may be leveraged to formalize the Set category and otherwise prove useful things.
Just because your formalization admits a proof by contradiction doesn’t actually prove two infinite sets have different sizes, it just proves that a contradiction exists under your assumptions.
If you aren't allowed to operate in a logical system with a concrete definition of "size", then you can't say things like "doesn't actually prove two infinite sets have different sizes". So the whole debate is moot.
We can prove that no such 1-1 map exists between the integers (an infinite set) and the decimals in the interval [0,1] (another infinite set). The proof is by contradiction, meaning that we assume such a 1-1 map exists and prove it leads to a contradiction, therefore our assumption that the 1-1 map exists must be false.
So suppose we were able to construct a map from all decimals in [0,1], by enumerating them according to some clever rule. Let d_i be the ith digit of number i in your mapping. For each I pick another different digit d_i'. Let's construct the number with decimal representation D = . d_0' d_1' d_2' ...
Assuming we have our 1-1 map, it must be somewhere in our mapping. Let's say it's element k. By our labeling concention the kth decimal digit of D is actually d_k. However, this contradicts our method of construction of D. Therefore our assumption that there is a 1-1 map between decimals in [0,1] and the integers must be false.
It is in this sense that there are infinities of different sizes.