Let $(X,d)$ be a metric space. The diameter of a set $A\subset X$ is defined to be
$\operatorname{diam}(A)= \sup\{d(x,y):x,y\in A\}$.
Suppose $A_1, \dots, A_n$ is a finite collection of subsets of $X$ each with finite diameter.
Prove that $\bigcup\limits_{i=1}^n A_i$ has finite diameter.
My approach:
I am trying to show that $\operatorname{diam}(\bigcup\limits_{i=1}^n A_i)\leq \operatorname{diam}(A_1)+\operatorname{diam}(A_2)+\cdots+\operatorname{diam}(A_n)$. If we can show that since each $A_i$ has finite diameter then $\operatorname{diam}(\bigcup\limits_{i=1}^n A_i)$ must also have a finite diameter.
But I stumbled on how to show that inequality, should we use the triangle inequality somewhere? But not very sure how to write it.
Thanks very much!
It is not true that $\operatorname{diam}\left(\bigcup\limits_{i=1}^n A_i\right)\leq \operatorname{diam}(A_1)+\operatorname{diam}(A_2)+\cdots+\operatorname{diam}(A_n)$. For example, suppose the diameter of each of ten sets is two inches. But one of those ten sets is in Constantinople and another is in Adelaide.
Pick a point $a_i$ in each of the sets $A_i$. Find the the two indices $k,\ell$ such that $d(a_k,a_\ell) = \max \{ d(a_i,a_j) : i,j \in \{ 1,\ldots,n \} \}$. Given points $x\in A_k$, $y\in A_\ell$, we have $$ d(x,y) \le d(x,a_k)+d(a_k,a_\ell) + d(a_\ell, y) \le \underbrace{\operatorname{diam}(A_k) + d(a_k,a_\ell) + \operatorname{diam}(A_\ell)}. $$ Then show that the quantity over the $\underbrace{\text{underbrace}}$ is an upper bound on the diameter of the union.