trash
- 13
- 0
Homework Statement
Let A=\{f:\mathbb{Z}\to\mathbb{Z}: f(n)\neq 0 \text{for a finite number of n}\}, prove that A is countable.
Homework Equations
I'm considering using that it would be equivalent to prove that the set A'=\{f:\mathbb{N}\to\mathbb{N}: f(n)\neq 0 \text{for a finite number of n}\} is countable.
The Attempt at a Solution
I'm dividing this solution in two steps, first proving what I stated en (2), this is, that A and A' have the same cardinal. I'm still trying to prove this.
(...)
Then prove A' is countable, I define A'_k = \{f:\mathbb{N}\to\mathbb{N}: f(n)\neq 0 \text{ for k numbers}, I want to prove that every A'_k is countable. I define now the function g_k:A'_k\to \underbrace{\mathbb{N}\times\dots\times\mathbb{N}}_{\text{2k}} by g_k(f)=(n_1,\dots,n_k,f(n_1),\dots,f(n_k)) where n_1,n_2,\dots are the points where f is not zero.
This function defines (or at least it seems to me) an injection to the set A'_k to a countable set.
A problem is that only a finite product of countable sets is countable, can I still conclude A' after take the union of the A'_k?.