Set Theory: Proving D has 2^d Subsets of Cardinality d

Punkyc7
Messages
415
Reaction score
0
Let D be a set that has cardinality d WTS that D has 2^{d} subsets of cardinal number d.


So I was thinking about slitting D into two sets C_{1} and C_{2} both of cardinality d. From there I think that there are d^{d} subsets that contain C_{1}. Since d is an infinite cardinal d^{d}=2^{d}.

Does that work or am I missing something>
 
Physics news on Phys.org
I have no idea what your question is. What does 'WTS' mean? And what are you trying to do?
 
want to show what I said I want to show. Were is the confusion?
 
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