I've been reading a book called Superfractals, and I'm having trouble with a particular proof:(adsbygoogle = window.adsbygoogle || []).push({});

Definitions:

The distance from a point [itex]x \in X[/itex] to a set [itex]B \in \mathbb{H}(X)[/itex] (where [itex]\mathbb{H}(X)[/itex] is the space of nonempty compact subsets of [itex]X[/itex] is:

[tex]D_B(x):=\mbox{min}\lbrace d(x,b):b \in B\rbrace[/tex]

The distance from [itex]A \in \mathbb{H}(X)[/itex] to [itex]B \in \mathbb{H}(X)[/itex] is:

[tex]D_B(A):=\mbox{max}\lbrace D_B(a):a \in A\rbrace[/tex]

for all [itex]A,B \in \mathbb{H}(X)[/itex].

The proof is to show that [itex]D_B(A) \leq D_B(C)+D_C(A)[/itex]. The proof goes:

[tex]\begin{array}{rcl}D_B(a) &=&\mbox{min}_{b \in B}d(a,b) \\

&\leq& \mbox{min}_{b \in B}(d(a,c)+d(c,b))\\

&=&d(a,c)+\mbox{min}_{b \in B}d(c,b)\\

\end{array}[/tex]

Then

[tex]D_B(a) \leq \mbox{min}_{c \in C}d(a,c)+\mbox{max}_{c \in C}\mbox{min}_{b \in B}d(c,b)[/tex]

How do we reach this last step?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Distance between sets (a triangle-type inequality)

Loading...

Similar Threads - Distance between sets | Date |
---|---|

I Minimum number of moves from a to b | Jan 8, 2018 |

I Proving non homeomorphism between a closed interval & ##\mathbb{R}## | Jul 10, 2017 |

I Difference between holomoprhic and analytic functions | May 31, 2017 |

I Difference between complex and real analysis | May 26, 2017 |

I Difference between tensor and vector? | Feb 27, 2017 |

**Physics Forums - The Fusion of Science and Community**