Prove that $d (A \cup B) \leq d(A)+ d(B)$, given that $ A \cap B \neq \varnothing$.
Here $d$ stands for the diameter of the set. Please note that my knowledge is limited to metric spaces only, with no knowledge of topology at all.
My attempt:
I'm trying to use the relation that $A \subset B \Rightarrow d(A) \leq d(B)$
I prove this result in the following way:
If $a,b \in A$, then $a,b \in B$, so { $d(a,b) : a,b \in A$ }$ \subset$ {$d(a,b) : a,b \in B$}
So, sup { $d(a,b) : a,b \in A$ }$ \subset$ sup {$d(a,b) : a,b \in B$}
Is this part correct?
Now, using this result:
$ A \subset A \cup B$ and $ B \subset A \cup B$
So $d(A) \leq d(A \cup B)$ and $d(B) \leq d(A \cup B)$
Adding, $d(A)+ d(B) \leq 2d(A \cup B)$
This is where I'm stuck.
Let $D$ be the set of all distances between points in $A \cup B$, that is $D = {d(a,b) \mid a, b \in A \cup B}$. Then, $\text{diam }A \cup B = \sup D$. In all cases, we have $d(a,b) \leq \text{diam } A + \text{diam } B$. Therefore, $\text{diam }A + \text{diam }B$ is an upper bound for $D$. But $\sup D$ is the least upper bound of $D$, so $\sup D \leq \text{diam } A + \text{diam }B$. And, since $\sup D = \text{diam } A \cup B$, we have the desired result.
– 1Teaches2Learn Jun 13 '21 at 05:23