# Vector Theory Question

I am having trouble getting started on this multi-part problem. Could anyone take a look and provide some insight on how I might go about coming to a solution for the first part.

Q: Assume for two arbitrary vectors v and u that ||u|| = 3 and ||v|| = 5. What is the maximum value of ||v + u||?

I've rewritten the magnitudes in their equation form but still am not having any light bulbs go off:

||u||=$\sqrt{(u_1)^2+(u_2)^2}$ ||v||=$\sqrt{(v_1)^2+(v_2)^2}$

Any help is appreciated, thanks.

-
Have you seen the triangle inequality? If you have, can equality in it be obtained? – Jason Polak Sep 30 '11 at 21:49
No, I have not. – Matt Sep 30 '11 at 21:53
Do you know how to add vectors by the parallelogram law? – Américo Tavares Sep 30 '11 at 21:56
The parallelogram law is by far the most sensible way to do things intuitively, and that is formalised by the triangle inequality. But here's a brute force way. Rotate the whole system. This obviously won't change any lengths or angles or anything. Specifically, rotate it until the vector u becomes (3,0). Now v still has size 5, so can be anything of the form (5 cos x, 5 sin x) for some number x. Which one maximises || u + v ||? – Billy Sep 30 '11 at 22:25
This problem is a close variation of this one. (Indeed, the same magnitudes of 3 and 5 are present.) – anon Sep 30 '11 at 23:28

## 1 Answer

I am of a different vein of thought than the comments above - there are a couple of comments about the triangle inequality and other things. These are very good, and necessary for a full proof, but I think that none of these are necessary for a geometric intuition of the situation.

The magnitude of a vector u can be interpreted in a could of different ways: as the length of an arrow from one point to a point displaced by u away, or as the distance between the origin and the point u, for example. Let's think of the latter.

So where are the vectors x of unit length in the real plane? These are all vectors on the unit circle - alternatively, each point on the unit circle can be thought of as the tip of a vector of unit length. Similarly, the tips of the vectors of length 3 lie on a circle of radius 3 in the plane.

We have two vectors here, one of length 3 and one of length 5. And we are trying to maximize the length of them being added together. Well, let's draw two circles on a sheet of paper, concentric, and think of the smaller one having radius 3 and the larger having radius 5. Then we can think to ourselves: hmm, I want to get the largest possible result vector. How can we get this?

Well, let's choose a vector of length 3. How? Well, mark a point on the smaller circle. That's a vector of length 3. Now we want to know what vectors can result when we add a vector of length 5. What's that mean? That's like drawing a circle of radius 5 around our 'chosen' vector of length 3. And we want to see how far we can get from the origin.

Do this a couple more times for a couple more points - one will see that despite its fancy name, the 'chosen one' is very insignificant. Any initial point chosen will give the same maximal answer. In any case, the answer should quickly become apparent (I recommend using a point on say, the x-axis as your first point). If you are clever or imaginative, then you might even see how this generalizes in higher dimensions readily. But with n-spheres instead of circles.

And while some consider this geometric idea nearly complete in proof, an actual proof that it's maximal (in my opinion) would rely on the triangle inequality or CS.

-