Elementary Set Theory – Union of a Finite Set and a Countably Infinite Set is Countably Infinite

elementary-set-theory

Ok, here is the problem statement:

Prove that if $S$ is any finite set of real numbers, then the union of $S$ and the integers is countably infinite.

This seems pretty obvious to me, knowing that 2 countable sets are countable. But is there some step by step way to prove this? Like do I need to prove bijectivity or something? Thanks!

Best Answer

Yes, give a bijection between $\Bbb N$ and $\Bbb Z\cup S$, that is a sequence in the latter which uses each element exactly once.

Say, $S\setminus\Bbb Z=\{s_1,..,s_k\}$. Then for example this sequence gives a bijection: $$(s_1,s_2,...,s_k,0,1,-1,2,-2,3,-3,4,-4,\dots)$$ That is, $1$ will be mapped to $s_1$, $k+1$ will be mapped to $0$, $k+2$ to $1$, and so on...

Related Question