I have the following definition of bounded subset in a metric space:
Let $X\subset M$ where $M$ is metric space. Then $X$ is said to be bounded if for all $x,y\in X, d(x,y) \le c$ for some $c$.
And I have these two definitions of a bounded function $f: X\to S$ where $X$ is arbitrary set and $S$ is a vector space with a norm $|\cdot|$ (made metric space through $d(x,y) := |x-y|$):
1) $f$ is said to be bounded if $f(X)$ is a bounded subset of $S$. 2) $f$ is said to be bounded if $|f(x)| \le k$ for some k.
I want to see whether these definitions are equivalent. 1 follows easily from 2 using triangle inequality:
$$|f(x) - f(y)| \le |f(x)|+|f(y)| \le 2c. $$
But I'm stuck in the converse. I think one problem is that the $0$ vector of $S$ is not necessarily in the image $f(X)$ but I'm still getting nothing from this. Any help will be appreciated.
For the converse, assume that $f(X)$ is bounded: there is a constant $c>0$ such that for any $y,y'\in f(X)$, we have $|y-y'|<c$.
Fix $x_0\in X$. Let $x\in X$ be any element of $X$. We have
$$|f(x)-f(x_0)|<c$$
On the other hand, by the reverse triangle inequality, we have
$$|f(x)|-|f(x_0)|\leq \bigl||f(x)|-|f(x_0)|\bigr|\leq|f(x)-f(x_0)|$$
It follows that $$|f(x)|<x+|f(x_0)|$$
This result being true for every $x\in X$, taking the right hand side to be $k$, we see that $f$ is a bounded function in the sense of $2)$.