I know that the continuum hypothesis has been shown to be neither true nor false.
However, I think I have come across a disproof of the hypothesis. So in relation to this, has there been any concrete disproof of the continuum hypothesis ever given before?
Here's a basic idea of what I thought could disprove the Continuum Hypothesis:
Consider the set B of all possible binary sequences. Then set B is countable (for reference see why is the set of all binary sequences not countable?). Now since this set is countably infinite, we know that
$$|B| = a$$
I have used the symbol $a$ in place of the traditional symbol of aleph-zero.
Now if I try to compute the cardinality of B using permutations, I get
$$|B| = 2^0 + 2^1 + 2^2+... + 2^a$$ (counting all possible strings of all lengths. The last term is $2^a$ because the length of a binary sequence of infinite length is a countable infinity)
So, if I combine the above 2 equations, $$2^0 + 2^1 + 2^2+... + 2^a = a$$ Computing the sum of the geometric progression on the left (there is no constraint in the derivation of this formula which says that it cannot be applied for infinite terms) $$2^0 (2^a - 1)/(2-1) = 2^a - 1$$
However, if the continuum hypothesis were to be true, we have just shown that the cardinality of the set B is an uncountable infinity ($ = 2^a - 1$), which is false. Therefore, the continuum hypothesis cannot be true.
There may be errors in this reasoning, so I welcome any suggestions.