Diameter of a union of metric spaces

80past2
Messages
39
Reaction score
0

Homework Statement


suppose that a metric space A is a union A = B U C of two subsets of finite diameter. Prove A has finite diameter.


Homework Equations



The Diameter of a metric space M is sup D(a,b) for all a,b in M.

The Attempt at a Solution


Really, no idea where to begin. I just began this subject, and I'm not too well versed in thinking of what these objects really are. If I'm understanding this right, I can imagine having say two disjoint rectangles that are far apart, and these are my B and C, with A being the union of them. Then each B and C may have a diameter, which represents the maximum distance between any two points in them, and part of me wants to take the farthest point of one and connect it to the other, but that seems like that wouldn't always work.

The only thing I can think of is that since both sets have finite diameter, then neither set is infinite. Therefore there must exist a set of points that are the farthest apart...

But like I said, I'm new to this subject (metric spaces) and have no idea where to begin. Any help would be greatly appreciated. (In case it matters, I haven't studied topology, and balls begin in the next section (although I have learned a little about neighborhoods, not sure if that's the same thing)
 
Physics news on Phys.org
No, I'm sorry. This stuff is completely foreign to me. I have no idea how I can show this.
 
I suggest that you start by picking two reference points, say b and c, where b \in B and c \in C. Being points in a metric space, there is by definition some finite distance, say d(b,c), between them.

Now take arbitrary points x and y in B \cup C. See if you can find an upper bound for d(x,y) that doesn't depend on x and y.
 
You've got the solution in the thread I sent you! It's shwon in problem 3.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top