Show that if a set $A$ in a metric space is bounded, so is each subset $B \subseteq A$.
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
If $A$ is bounded then there exists $x \in M$ and $r>0$ such that for all $a \in A$, we have $d(x,a) <r$. So how would you show that each subset $B \subseteq A$ is bounded?
Definition: A metric space $M$ is called bounded if there exists some number $r>0$, such that $d(x,y) \leq r$ for all $x, y \in M$.
Since you are assuming $A$ to be bounded then there is some number $k$ such that $d(x,a) \leq k$ for all $x,a\in A$. Since $B \subset A$ and this condition happens for all elements in $A$, therefore it should happen for elements in $B$ as well.