Given $ (X, d)$ a metric space, $ A, B \subset X$, show that $ d(A, B)=d (\overline {A}, B) $.
I'm not being able to show that $ d(A,B) \leq d (\overline {A}, B) $. Can anybody help me? The set $\overline {A}$ is the closure of $A$
Given $ (X, d)$ a metric space, $ A, B \subset X$, show that $ d(A, B)=d (\overline {A}, B) $.
I'm not being able to show that $ d(A,B) \leq d (\overline {A}, B) $. Can anybody help me? The set $\overline {A}$ is the closure of $A$
That is the trivial direction. The distance is an infimum, so if you take an infimum over a larger set, then the infimum can never increase. More precisely, $d(C,B)\le d(A,B)$ for all $A,B,C\subseteq X$ with $A\subseteq C$. To prove that simply note simply look at the sets over which the infima are taken, and note which is contained in which.
Hint:
Use the triangle inequality to show that for any $\varepsilon>0$, $$d(\overline A,B)\le d(A,B)\le d(\overline A,B)+\varepsilon.$$