I am given this equivalence relation:
$$R = \{( f, g ) \in (\mathbb{N} \rightarrow \{0, 1\}) \times (\mathbb{N} \rightarrow \{0, 1\}) \ \vert \ \exists N \in \mathbb{N} \ \forall i \geq N : f (i) = g (i) \}$$
I need to find a bijection between 2 arbitrary equivalence classes. I was trying for a long time without success, any help will be appreciated.
Added: thank you very much for your answers. I now need to find the cardinality of each equivalence class. I think the answer is ℵ but cant seem to find an injective function from N → {0, 1} to [f]. any ideas ?
Let $F:\mathbb{N} \rightarrow \{0,1 \}$ be a function and let $[F]$ be its equivalent class. For $f\in [F]$ we define
$$ l_F(f):= \min\{ N\in \mathbb{N} \ \vert \ \forall i\geq N: f(i)=F(i) \}.$$
Define for $n\in \mathbb{N}$
$$ S_n(F) := \{ f\in [F] \ \vert \ l_F(f)=n \}.$$
Clearly, $(S_n(F))_{n\in \mathbb{N}}$ forms a partition of $[F]$.
Thus, we can reduce the problem of finding a bijection from [F] to [G] to find bijections
$$ \phi_n : S_n(F) \rightarrow S_n(G).$$
One possibility would be to define
$$ \phi_n (f)(i) = \begin{cases} f(i),& 0\leq i \leq n-1; \\ G(i),& i\geq n. \end{cases}$$
Added: Putting all this maps into a single map, this would do the following. It takes a function $f\in [F]$ and doesn't change it, where it differes from F and sends all the values coinciding with F to the respective values of G. The advantage of this procedure is that it immediately generalises to any target.