If $A$ is a any set and $B = \{0,1\}$, how do I show $P(A) \sim Map(A,B)$.
Can someone provide me a detailed instruction? I heard this place is really helpful.
If $A$ is a any set and $B = \{0,1\}$, how do I show $P(A) \sim Map(A,B)$.
Can someone provide me a detailed instruction? I heard this place is really helpful.
Let $X$ be a subset of $A$ and define the function $\chi_X:A\to \{0,1\}$ by $$\chi_X(a)=\begin{cases} 1\; ;\text{ if } a\in X\\0\; ;\text{ if }a\in A\setminus X\end{cases}$$
This function simply says "yes" ($1$) or "no" ($0$) to the question "Is $a\in X$?"
Consider the map $\mu:P(A)\to B^A$ defined by $\mu(X)=\chi_X$. If $\chi_X$ is identical to $\chi_Y$ it follows by definition that $X=Y$, so this is injective. On the other hand, every $f\in B^A$ defines a subset of $A$ by $X_f=\{x\in A:f(x)=1\}$. So the function is a bijection.
$P(A)$ is the set of all subsets of $A$. Choosing a subset $S$ of $A$ consists exactly in choosing for each element of $A$ whether it belongs to $S$ or not, which can be seen as assigning $1$ to $a \in A$ if $a \in S$ and $0$ otherwise, which is exactly defining a map from $A$ to $B$.