Suppose $A$ is infinite. Also suppose $\exists g:A \rightarrow \mathbb {N}$ that is 1-1. This is all the info I have. I need to show the result in the title because then I would have some function $h$ that is a bijection from $A $ to $\mathbb{N} $ and that would mean that $A $ is countable. But I just do not see how to obtain that function $f $ in title...
Asked
Active
Viewed 87 times
1
-
As long as $A$ contains at least one element, there is a function $f:\Bbb N\to A$. If you want something to do with injections, surjections and bijections, then you should say exactly what you're after, and exactly what you're given. – Arthur Feb 20 '17 at 20:00
-
I assume you meant to say that $g$ is injective and that you'd like $f$ to be injective as well? If so, then note that any infinite set has a countably infinite subset – lulu Feb 20 '17 at 20:02
1 Answers
1
$|A| \leq \mathbb N$, by the existence of one injection ($g:A \to \mathbb N$). On the other hand, $|A|$ is infinite, so we know that $|\mathbb N| \leq |A|$. Hence there exists a bijection between them, and consider its inverse for the other injection.
Andres Mejia
- 21,467