Proving Cardinality of P(S) > S

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Cardinality
Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Prove that the cardinality of ##P(S)## is greater than the cardinality of S, where S is any set.

Homework Equations

The Attempt at a Solution


It would seem that we could simply define ##T: S \rightarrow P(S)## such that ##T(s) = \{s \}##. This is clearly an injection, so ##|S| \le |P(S)|##. That seemed too easy though, so I feel like I am doing something wrong.
 
Physics news on Phys.org
Mr Davis 97 said:
That seemed too easy though, so I feel like I am doing something wrong.
I think you are asked to prove strict inequality of cardinalities.
 
Krylov said:
I think you are asked to prove strict inequality of cardinalities.
So I have to show that there exists no bijection between ##S## and its powerset?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top