[Math] is this “function” a surjective, but not injective function
functions
this would be something like
$f(x)=x$ for $x\leq1$
$f(x)=x-1$ for $x>1$
Would this fullfill "give an example for a surjective but not injective function $f: \mathbb{N} \rightarrow\mathbb{N}$ "?
Best Answer
Yes, but dont plot a line for a map from $\mathbb{N}$ onto $\mathbb{N}$, that is misleading on the first glance :-) (better plot points to stress the discreteness of $\mathbb{N}$)
For your first question, suppose that we had two elements of $A$ with the same coordinate: that is, we had $(a, b) \in A$ and $(a, c) \in A$. Then by definition of $A$, we have that $b^2 = a = c^2$, so $b^2 = c^2$. So does it follow that $b = c$? (It doesn't.)
For the second, you are correct that it is injective: For if $f(n) = f(m)$, then $$(2n, n + 3) = (2m, m + 3) \implies n + 3 = m + 3 \implies n = m$$ You're also correct that it's not onto, since it never hits $(1, 0)$. If it were onto, then you'd select an arbitrary element of $\Bbb{Z} \times \Bbb{Z}$ and find an element of $\Bbb{Z}$ mapping to it.
Best Answer
Yes, but dont plot a line for a map from $\mathbb{N}$ onto $\mathbb{N}$, that is misleading on the first glance :-) (better plot points to stress the discreteness of $\mathbb{N}$)