- #1
Kindayr
- 161
- 0
Homework Statement
Find a condition on a metric space [itex](X,d)[/itex] that ensures that there exist subsets [itex]A,B[/itex] of [itex]X[/itex] with [itex]A\subset B[/itex] such that [itex]diam(A)=diam(B)[/itex].
Homework Equations
[itex]diam(A)=\sup\{d(r,s):r,s\in A\}[/itex];
[itex]A\subseteq B\implies diam(A)\leq diam(B)[/itex].
The Attempt at a Solution
Well I know examples of where this is true (ie, let [itex]A=(-\infty,5]\cup [-5,\infty)\subset (-\infty,4]\cup [-4,\infty)=B[/itex]). But I don't know which condition allows this to be true. Any help is good. Thank you!