|
I have some home work with problems such as... Determine whether each of these sets is the power set of a set:
So yes 1 is the power set of {a}. But what about 2? Since power sets have to have $2^k$ members then no it can't be a power set. It would have to be P(∅) = {∅, {∅}} correct? Since it must contain 2 members. However, when I try to check myself with Wolfram Alpha, it says P({}) = {{}}... why? I thought it must have $2^k$ members! |
|||||||||||||||||
|
|
We want to make a power set, so start with the set bars: $$ P(\emptyset) = \{\text{stuff goes here}\}. $$ What do we fill this set with? As with any other power set, we fill it with all subsets of the big set in question. Here, the big set in question is $\emptyset$, which has exactly one subset (namely, $\emptyset$). So, we write that one subset into the power set to get $$ P(\emptyset) = \{\emptyset\}. $$ Notice the empty set contains $0$ elements, while its power set contains $2^0 = 1$ elements. |
|||||||||
|
|
One way you can see that $\emptyset$ cannot be a power set is that by Cantor's theorem the power set of any set $A$ has strictly greater cardinality than $A$. Now which set $A$ could have strictly smaller cardinality than the empty set? |
|||
|
|
|
Every powerset must contain at least one member, namely $\emptyset$. The set $\emptyset$ itself contains no members, so it cannot be the powerset of any set. The powerset of $\emptyset$ is $\{\emptyset\}$, which has exactly $1 = 2^0$ members. It is the smallest powerset, in the strict sense that it is a proper subset of every other powerset, all of which contain at least two members. (Specifically, the powerset of any set $S \ne \emptyset$ has at least $\emptyset$ and $S$ as members.) |
|||
|
|
