Missing step in standard proof of |P(N)|=|R|

  • Context: Graduate 
  • Thread starter Thread starter nomadreid
  • Start date Start date
  • Tags Tags
    Proof Standard
Click For Summary
SUMMARY

This discussion centers on establishing a one-to-one correspondence between the power set of natural numbers, denoted as P(N), and the set of real numbers, R. The conversation highlights the use of binary expansions to encode subsets of N, demonstrating that while |P(N)| ≤ |R| can be shown, a bijection between P(N) and the set of infinite binary sequences, {0,1}^N, must also be established. The participants clarify that a subset A of N can be constructed by defining membership based on the binary sequence, thus confirming the bijection needed for |P(N)| = |R|.

PREREQUISITES
  • Understanding of power sets, specifically P(N)
  • Familiarity with binary expansions and their applications
  • Knowledge of bijections in set theory
  • Basic concepts of real numbers and their intervals, particularly [0,1)
NEXT STEPS
  • Research the classical diagonal argument and its implications for cardinality
  • Explore the concept of bijections in set theory, focusing on P(N) and {0,1}^N
  • Study the properties of binary sequences and their relation to subsets of natural numbers
  • Examine the implications of Cantor's theorem on the sizes of infinite sets
USEFUL FOR

Mathematicians, students of set theory, and anyone interested in the foundations of mathematics and the concept of infinity.

nomadreid
Gold Member
Messages
1,773
Reaction score
256
There are several ways to show the one-to-one correspondence between P(N) (= the power set of the natural numbers) and the set of the reals (or, equivalently, the set of reals in the interval [0,1).) Continued fractions, and all that. However, one argument is the following (sorry, this argument is from memory, and so I looked for a source; I don't know if the following is a valid source to cite, but if not, please ignore: http://scientiststhesis.tumblr.com/post/52431140481/powersets-infinities-and-the-diagonal-argument): one uses the binary expansion of a real number between 0 and 1 to encode a subset of N (via: construct set S such that: if nth place in expansion =0, then n not in S; nth place in expansion =1, then n is in S.) However, this encoding actually only makes a correspondence between ordered subsets of N and [0,1). Since there are many elements in the set of ordered subsets of N for every element in P(N), this only proves that |P(N)| ≤ |R|. So, how does one then make the correspondence between the set of ordered subsets of N and P(N)?
(The source cited above starts with the classical diagonal argument about |N|≤|R| before stating the above attempt at |P(N)| = |R|.)
Thanks for any feedback.
 
Physics news on Phys.org
The link you provided seems to make a bijection between ##\mathbb{R}## and ##\{0,1\}^\mathbb{N}## (= the set of all functions ##\mathbb{N}\rightarrow \mathbb{R}##, or equivalently, the set of all infinite binary sequences).

You are correct that you still have to make a bijection between ##\mathcal{P}(\mathbb{N})## and ##\{0,1\}^\mathbb{N}##. The idea is to take an element
[tex](x_1,x_2,x_3,x_4,...)\in \{0,1\}^\mathbb{N}[/tex]
So we have a sequence of zeroes and ones. We now construct a subset ##A## of ##\mathbb{N}## using the rule that ##n\in A## if and only if ##x_n=1##.

For example,
[tex](1,1,0,0,0,0,0,0,...)[/tex]
gives us ##\{1,2\}##. While
[tex](1,0,1,0,1,0,1,0,1,0,...)[/tex]
gives us the odd numbers.

I leave it to you to verify this is a bijection.
 
  • Like
Likes   Reactions: 1 person
Thanks, micromass. Everything is clear now.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K