The power set $\mathcal{P}(X) = \text{Map}(X, \{0, 1\})$. Hence, $|\text{Map}(\Bbb N, Y)| = |\Bbb R|$ where $|Y|=2$. Prove for any finite set $Y$, the equality still holds.
I know I can map the powerset to the real numbers by considering an element in the powerset of naturals and using the subset as a way to create a decimal expansion, reversing it with a binary expression to get the backwards case.
Formally, an element $A\in \mathcal{P}(\mathbb{N})$ is a subset of the naturals. So, $$f(A)=\sum_{k\in A}\frac{1}{10^k}:\mathcal{P}(\mathbb{N})\rightarrow[0, 1]$$
The reverse is:
$$g(x)=\{i:n_i=1\}\subset \mathbb{N}:(0,1)\rightarrow\mathcal{P}(\mathbb{N}).$$
I wonder if I can do something similar for the question here where we kind of extend the powerset from a 2 to a 3 and onwards