Ask your own question, for FREE!
Mathematics 21 Online
OpenStudy (anonymous):

g

OpenStudy (anonymous):

\[P(A) ~ \left\{ 0,1 \right\}^A\]

OpenStudy (anonymous):

There's ~ between the two

OpenStudy (anonymous):

In this case \( \{0,1\}^A \) means take the Cartesian product \(|A|\) times?

OpenStudy (anonymous):

that is actually the next part of this question

OpenStudy (anonymous):

How would you show the equivalence of a function to a set?

OpenStudy (anonymous):

One is a set of functions, the other is a set of sets.

OpenStudy (anonymous):

It's got to do with this idea if A ~ B then it means there exists a bijection from A to B. Or there's exists injections from A to B and B to A.

OpenStudy (anonymous):

Well if the functions map from elements of the set to 0 or 1, you could interpret 0 as the element not being in a subset and 1 as being in the subset.

OpenStudy (anonymous):

So each function could represent a subset.

OpenStudy (anonymous):

I had that idea in my mind, but couldn't formalize it into a proof

OpenStudy (anonymous):

Just do induction on \(|A|\).

OpenStudy (anonymous):

Or do you have to prove it for the infinite case?

OpenStudy (anonymous):

well yeah both for finite and infinite A

OpenStudy (anonymous):

Let \(S_i\subseteq \mathcal{P}(A) \). We map \(S_i \) to \(f_i\) when the following is true: \( S_i = \{x\in A | f_i(x)=1\}\)

OpenStudy (anonymous):

Also \(f_i \in \{0,1\}^A\)

OpenStudy (anonymous):

Then you could try to show a mapping from \(i\) to a subset/function

OpenStudy (anonymous):

Hmmm, actually you might try a proof by contradiction.

OpenStudy (anonymous):

interesting

OpenStudy (anonymous):

It seems you'd need axiom of choice to do this for the infinite case.

OpenStudy (anonymous):

Let \(S_i \in \mathcal{P}(A)\) (clearly \(S_i\subseteq A\)) Let \(f_j \in \{0,1\}^A\) (where \(f_j:A\to \{0,1\} \)) Let \(G: \{0,1\}^A\to \mathcal{P}(A)\) We can define the \(G\) as follows: \(G(f_j) = \{x\in A|f_j(x)=1\}\) \(G\) is a function which takes a function and returns a set. Let \( H: \mathcal{P}(A) \to \{0,1\}^A\) We can define \(H\subseteq A\times \{0,1\}\) as follows: \(H(S_i) = \{(x,0)|x\notin S_i\} \cup\{(x,1) |x\in S_i\} \) \(H\) is a function that takes a set and returns a function.

OpenStudy (anonymous):

At this point it just becomes a matter of rigor. We've show a mapping from subsets to functions, and we've shown a mapping from functions to subsets.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!