Does Every Set Have a Unique Power Set? Understanding Cantor's Proof

  • Thread starter cragar
  • Start date
In summary, the conversation discusses a proof by Cantor that states for every set X, the cardinality of X is less than the cardinality of its power set, P(X). The proof uses a function f from X into P(X) and defines a set Y as the elements in X that are not in f(X). By contradiction, it is shown that f is not a function of X onto P(X), proving that |P(X)| ≠ |X|. It is then explained that this is because we want a one-to-one function from X to P(X), so x cannot be mapped to itself. The conversation also clarifies that the elements of P(X) are subsets, not elements, of X.
  • #1
cragar
2,552
3
Im trying to understand this proof by Cantor.
For every set [itex] X, |X|<|P(x)| [/itex]
Proof. Let f be a function from X into P(x)
the set [itex] Y=(x \in X: x \notin f(x) ) [/itex]
is not in the range of f:
if [itex] z \in X [/itex] where such that f(z)=Y, then [itex] z \in Y [/itex]
if and only if [itex] z \notin Y [/itex], a contradiction. Thus f is not
a function of X onto P(x).
Hence |P(x)|≠|X|, the function
f(x)={x} is a one-to-one function of X into P(x) and so
|X|≤|P(x)|. it follows that
|X|<|P(x)|.
I don't understand why z can't be in Y and f(z).
I guess that's because they defined it that way.
Is it because we want to find a one-to-one function from
the set to the power set, and because we want it to be one-to-one
we want to map every x to a unique element in the power set we don't want x to get mapped to itself. Is that the reason. And do we need z to be in Y and f(z) for it to be onto.
 
Mathematics news on Phys.org
  • #2
cragar said:
[itex] Y=(x \in X: x \notin f(x) ) [/itex]

I don't understand why z can't be in Y and f(z).
I guess that's because they defined it that way.

yes
Is it because… we don't want x to get mapped to itself.

but x can't get mapped to itself … x and f(x) are in different spaces
 
  • #3
so if x got mapped to itself, it wouldn't be onto.
 
  • #4
cragar said:
so if x got mapped to itself, it wouldn't be onto.

We CAN'T map x to itself. Since x is not an element of P(X).
 
  • #5
Is it because… we don't want x to get mapped to itself.

The element x is not in P(X).
P(X) contains the set containing x (that is, it contains {x}), but it does not contain x itself. Remember that the power is the set of subsets of X.
 
  • #6
this might be a dumb question, but maybe we didn't do a very good job of defining our funtion from the set to the powerset. why can't x be in P(x)
 
  • #7
cragar said:
this might be a dumb question, but maybe we didn't do a very good job of defining our funtion from the set to the powerset. why can't x be in P(x)

The elements of P(X) are subsets, not elements, of X. P(X) contains {x}, but not x itself.
 
  • #8
cragar said:
this might be a dumb question, but maybe we didn't do a very good job of defining our funtion from the set to the powerset. why can't x be in P(x)

A simple example will help you. Take X={1,2,3}, then P(X)=\{∅,{1},{2},{3},{1,2},{2,3},{1,3},{1,2,3}}. As you see, 1 is not an element of P(X). But {1} is an element of P(X).
 
  • #9
ok thanks for the responses, it makes more sense now.
 

FAQ: Does Every Set Have a Unique Power Set? Understanding Cantor's Proof

What is the powerset?

The powerset, also known as the power set or the set of all subsets, is a mathematical concept that refers to the collection of all possible subsets of a given set. It includes the empty set and the original set itself as subsets.

How is the powerset calculated?

The powerset can be calculated by using the formula 2^n, where n is the number of elements in the original set. This means that if a set has 3 elements, its powerset will have 2^3 = 8 subsets.

What is the significance of the powerset?

The powerset has many applications in mathematics and computer science. It is used in set theory, combinatorics, and probability. It is also essential in computer programming, especially in designing data structures and algorithms.

How is the powerset represented?

The powerset can be represented using set notation, where the curly braces {} indicate a set and the elements are separated by commas. For example, if the original set is {1, 2, 3}, its powerset will be {{}, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}.

Can the powerset be infinite?

Yes, the powerset can be infinite. This happens when the original set is infinite, or when the number of elements in the original set is infinite. For example, the powerset of the set of all positive integers is infinite.

Similar threads

Replies
13
Views
2K
Replies
1
Views
1K
Replies
12
Views
1K
Replies
3
Views
1K
Replies
2
Views
1K
Replies
2
Views
674
Replies
2
Views
805
Back
Top