Perhaps we can at least describe what a powerset is. This should be fairly easy to grasp. Consider a set S of cardinality 3:
S = { A, B, C }
Now consider all subsets of S, starting with the null, or empty, set:
{}, { A }, { B }, { C }, { A, B }, { A, C }, { B, C}, { A, B, C }
As you can see, there are 8 subsets. It’s no coincidence that it’s 2[sup]3[/sup]. Anyway, the set of all subsets of S is called the powerset of S:
P(S) = { {}, { A }, { B }, { C }, { A, B }, { A, C }, { B, C}, { A, B, C } }
In general, if a set has N elements, its powerset will have 2[sup]N[/sup] elements. If N is finite, then it’s obvious that 2[sup]N[/sup] > N. However, for infinite N’s, we’ve seen trickery before, but in this case, 2[sup]N[/sup] > N works for infinite N’s as well. As DrMatrix said before: “The power set is always larger than the set. Given any set, you can construct a set with a larger cardinality, by using the power set.”