LMKIYHAQ
- 26
- 0
Homework Statement
You have a set A. Let B^{A} be the set of all functions mapping A into the set B={0,1}. Prove the cardinality ofB^{A} = the cardinality of the power set of A.
2. Homework Equations [/b
The Attempt at a Solution
I feel about 50% sure about the proof. What do you think? Since A is a set, A has n elements where n is a natural number. Let g be the function mapping A into B s.t {n\inA : n = 0 or n = 1}. So for each n in A there are 2 distinct possibilities (i. e mapping to 0 or 1). Since B^{A} is the set containing all functions of type g, the cardinality of B^{A} = 2^{n}, which is also known as the cardinality of the power set of A.
Thanks for helping!