Let $ \ A=\{0,1\} \ $. Prove that the countable product of $ \ A=\{0,1 \} \ $ has same cardinality to $ \ \mathbb{R} \ $.
Answer:
Let $ \ P(\mathbb{N}) \ $ be the power set of $ \ \mathbb{N} \ $.
Let $ \ \lambda: \prod_{i \in \mathbb{N}} A \to P(\mathbb{N}) \ $ (Cartesian product ) be the function defined as follows:
an element $ \ f \ $ in $ \ \prod_{i \in \mathbb{N}}A \ $ is a function $ \ f: \mathbb{N} \to \{0,1 \} \ $ .
So let $ \ \lambda(f)=\{ n \in \mathbb{N} |f(n)=0 \} \ $.
The proof will be complete if we show that $ \ \lambda \ $ is a bijective function.
I am unable to show $ \ \lambda \ $ is bijective .
Help me
If $\lambda(f) = \lambda(g)$ then $$f(n) = 0 \iff n \in \lambda(f) \iff n \in \lambda(g) \iff g(n) = 0$$ which also implies $f(n) = 1$ if and only if $g(n) = 1$ because $f $ and $g$ are functions to $\{0,1\}$. Therefore $f = g$. We conclude that $\lambda$ is injective.
Let $S \subseteq \mathbb{Z}^+$ be arbitrary and define $f: \mathbb{Z}^{+} \to \{0,1 \}$ as $$f(n) = \begin{cases} 0,& n \in S\\ 1,& n \notin S\\ \end{cases}$$
It is clear that $\lambda(f) = S$. Therefore $\lambda$ is surjective.