Is the Cardinality of the Reals Equal to the Power Set of the Naturals?

  • Thread starter Thread starter pjmunki
  • Start date Start date
AI Thread Summary
The discussion centers on Cantor's conclusion that the cardinality of the set of real numbers is equal to the cardinality of the power set of natural numbers, expressed as 2^aleph0. A bijective mapping is established between sequences of 1's and 0's representing subsets of natural numbers and real numbers in the interval [0,1] when expressed in binary. The issue of ambiguity in binary representation, such as 0.011... equating to 0.100..., is acknowledged but deemed negligible since it occurs countably. Ultimately, this leads to the conclusion that the cardinality of the power set of natural numbers is indeed equal to the cardinality of the reals. Therefore, |2N| = |R| is affirmed through this reasoning.
pjmunki
Messages
1
Reaction score
0
C(reals) = C(P(naturals))??

hello,
Could someone help me please.
I am studying Cantor's set theory at present, but am a little confused as to why he concludes that the cardinality of the set of real numbers is equal to the cardinal number of the power set of naturals (2^aleph0).

Thanks.
 
Physics news on Phys.org
The elements of 2N can be treated as sequences of 1's and 0's where a sequence corresponding to a subset A of N has a 1 in the n th position if n is in A.

You should have no trouble seeing that this mapping is bijective.

Now, if you look at the real numbers on [0,1] base 2, you get numbers like:
0.10101011101000110...
which are also sequences of ones and zeros. So there's a natural mapping.

Unfortunately there is a problem because
0.011111111111111111111111...=
0.100000000000000000000000...
in the reals.

But that only occurs a countable number of (N) times. So we can certainly construct a bijection to [0,1] + N.

So we have |2N| = |[0,1] + N|

but you should already know that |[0,1] + N|=|[0,1]|=|R|
(Cantor certainly did)

So by substitution we get:
|2N |=|R|
 
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top