Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Given a set of Euclidean Vectors with $N$ dimensions, whose distance from a Euclidean Vector, $R$, is less than some Constant, $C$.

Can the max distance between any two vectors in the set be determined?

I have been searching for some sort of proof or rule but I can't seem to fine one, when I picture a sphere with $R$ at the center, I believe the max distance would be $2C$. However I am unsure if this is true for dimensions greater than $3$.

share|improve this question
1  
True in all dimensions. It's the triangle inequality, true in any metric space. –  Gerry Myerson Dec 7 '12 at 4:54

1 Answer 1

up vote 0 down vote accepted

The triangle inequality gives $\|x+y\| \leq \|x+z\| + \|z+y\|$ for any points $x,y,z$.

In your case, you have a set $A$ such that $\|a-R\| < C$ for all $a \in A$. Hence if $a_1,a_2 \in A$, you have $\|a_1-a_2\| \leq \|a_1-R\|+\|R-a_2\| < 2C$.

Following a point made by Cameron below, the term $\max$ is used when the actual limit can be attained at some point. So it would be more correct to say that the supremum (or least upper bound) of the distance is $\sup_{a_1,a_2 \in A} \|a_1-a_2\| = 2C$.

share|improve this answer
    
In other words, then, for the given set, the answer is no. The least upper bound of the distance would be $2C$, but the max is never achieved. –  Cameron Buie Dec 7 '12 at 5:52
    
I suspect given the question that the distinction between $\sup$ and $\max$ is superfluous. –  copper.hat Dec 7 '12 at 6:14
    
Probably, but I figured I'd mention it, just in case. –  Cameron Buie Dec 7 '12 at 6:15

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.