Maximizing Distance from Point on Sphere (1,1,-1): Lagrange Multipliers Method

Click For Summary

Homework Help Overview

The problem involves finding the point on the sphere defined by the equation x² + y² + z² = 25 that is farthest from the point (1, 1, -1). The discussion centers around the application of the Lagrange multipliers method to maximize the distance from the specified point.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss various methods for applying Lagrange multipliers, including setting up equations based on gradients and constraints. There are questions about the relationships between the variables x, y, and z, particularly regarding symmetry and algebraic manipulations. Some participants suggest different approaches to eliminate the multiplier λ.

Discussion Status

The discussion is active, with multiple participants offering different perspectives on how to approach the problem. Some guidance has been provided regarding the relationships between the variables and the use of symmetry, but no consensus has been reached on the best method to proceed.

Contextual Notes

Participants note potential algebraic mistakes and the importance of considering both maximizing and minimizing solutions. There is also mention of the need to clarify the relationship between the variables in terms of λ and the implications of symmetry in the problem setup.

Differentiate1
Messages
34
Reaction score
0
I'm stuck on this problem for the past hour. I've tried solving for all variables and none of the steps I'm doing are getting me to the right answer.

Find the point on sphere x^2+y^2+z^2=25 farthest from point (1,1,-1).

My steps:
http://i.imgur.com/c5kUj9g.png

Correct Answer: x= -5/sqrt(3)
y= -5/sqrt(3)
z= 5/sqrt(3)

Thanks in advance.

EDIT: On the part where I set negative lambda equal to "...", I made x=y to make solving for "z" easier since x and y are symmetrical.
 
Physics news on Phys.org
Differentiate1 said:
I'm stuck on this problem for the past hour. I've tried solving for all variables and none of the steps I'm doing are getting me to the right answer.

Find the point on sphere x^2+y^2+z^2=25 farthest from point (1,1,-1).

My steps:
http://i.imgur.com/c5kUj9g.png

Correct Answer: x= -5/sqrt(3)
y= -5/sqrt(3)
z= 5/sqrt(3)

Thanks in advance.

EDIT: On the part where I set negative lambda equal to "...", I made x=y to make solving for "z" easier since x and y are symmetrical.

I would solve for x, y and z in terms of λ. You should be able to show x=1/(1+λ) and y=1/(1+λ) so x=y (that's the symmetrical part). But you are making an algebraic mistake with z. What is z in terms of λ? How is z related to x and y? And remember solving x^2=c gives you two solutions. Try it again.
 
Dick said:
I would solve for x, y and z in terms of λ. You should be able to show x=1/(1+λ) and y=1/(1+λ) so x=y (that's the symmetrical part). But you are making an algebraic mistake with z. What is z in terms of λ? How is z related to x and y? And remember solving x^2=c gives you two solutions. Try it again.

I agree, but I would urge the OP to solve for λ, from an equation of the form λ^2 = K (for some computable K > 0). There is, of course, a sign ambiguity in λ itself, but the same choices are made for all three of x, y and z (rather than making a separate choice for each equation x^2 = u, y^2 = v and z^2 = w). Furthermore, one of the λ roots is for the maximization problem and the other is for the minimization problem.
 
Ray Vickson said:
I agree, but I would urge the OP to solve for λ, from an equation of the form λ^2 = K (for some computable K > 0). There is, of course, a sign ambiguity in λ itself, but the same choices are made for all three of x, y and z (rather than making a separate choice for each equation x^2 = u, y^2 = v and z^2 = w). Furthermore, one of the λ roots is for the maximization problem and the other is for the minimization problem.

There's more than one way to skin a cat. There's often a degree of cleverness involved in seeing an easy way to solve the Lagrange multiplier equations. I don't think in this case solving for λ is best. But it's just taste.
 
Dick said:
There's more than one way to skin a cat. There's often a degree of cleverness involved in seeing an easy way to solve the Lagrange multiplier equations. I don't think in this case solving for λ is best. But it's just taste.

But, is that not what you suggested in your first reply, when you suggested he solve for x, y and z in terms of λ?
 
Ray Vickson said:
But, is that not what you suggested in your first reply, when you suggested he solve for x, y and z in terms of λ?

Well, no. Why do you say that? Maybe I'm missing what you mean by 'solve for λ'. The OP already knows x=y from a symmetry in the equations. They are related to z in a similar sort of way. Solve for the variables in terms of λ. Not solve for λ, which is I thought what you were indicating would be a better idea. That's what I was suggesting. No real need to know λ.
 
Last edited:
Dick said:
Well, no. Why do you say that? Maybe I'm missing what you mean by 'solve for λ'. The OP already knows x=y from a symmetry in the equations. They are related to z in a similar sort of way. Solve for the variables in terms of λ. Not solve for λ, which is I thought what you were indicating would be a better idea. That's what I was suggesting. No real need to know λ.

Well, I said that because you wrote "I would solve for x, y and z in terms of λ." I agree, and then I would just plug in x(λ), y(λ) and z(λ) in the constraint to get an equation for λ. Solving that gives two roots (corresponding to two square roots); one gives the maximizing solution and the other the minimizing solution, although that is not 100% apparent without some further checking.

Of course you can do it in another way, but if the OP wants to learn about Lagrange multipliers then showing him one of the ways seems appropriate. I showed him one way, you showed him another. It won't harm him to see both.
 
We want to minimize the distance to (1, 1, -1), \sqrt{(x- 1)^2+ (y- 1)^2+ (z+ 1)^2}, which is the same as minizing the distance squared, f(x, y, z)= (x- 1)^2+ (y- 1)^2+ (z+ 1)^2, with the constraint g(x, y, z)= x^2+ y^2+ z^2= 25.

We have \nabla f= 2(x- 1)\vec{i}+ 2(y- 1)\vec{j}+ 2(z+ 1)\vec{k} and \nabla g= 2x\vec{i}+ 2y\vec{j}+ 2z\vec{k} and we want \nabla f= \lambda\nabla g for some "multiplier" \lambda. Setting corresponding components equal, we have
2(x- 1)= 2\lambda x
2(y- 1)= 2\lambda y and
2(z+ 1)= 2\lambda z

I find it is often simplest to eliminate \lambda by dividing one equation by another.
That is, \dfrac{x- 1}{y- 1}= \dfrac{x}{y} and \dfrac{x- 1}{z+ 1}= \dfrac{x}{z}.

Then (x- 1)y= x(y- 1) so xy- y= xy- x or y= x. (x- 1)z= x(z+ 1) so xz- z= xz+ x or z= -x.

Setting y= x and z= -x in the constraint x^2+ y^2+ z^2= 25 we have 3x^2= 25.
We can solve for two values of (x, y, z) from that. One gives the point of shortest distance, the other the point of longest distance.

Of course, the easy way to do this is to note that since x^2+ y^2+ z^2= 25 is a sphere with center at the origin, the shortest and longest distances from (1, 1, -1) to that sphere lie on the line through the center, (0, 0, 0), and (1, 1, -1). Determine where x= t, y= t, z= -t cross the sphere.
 
Last edited by a moderator:
HallsofIvy said:
We want to minimize the distance to (1, 1, -1), \sqrt{(x- 1)^2+ (y- 1)^2+ (z+ 1)^2}, which is the same as minizing the distance squared, f(x, y, z)= (x- 1)^2+ (y- 1)^2+ (z+ 1)^2, with the constraint g(x, y, z)= x^2+ y^2+ z^2= 25.

We have \nabla f= 2(x- 1)\vec{i}+ 2(y- 1)\vec{j}+ 2(z+ 1)\vec{k} and \nabla g= 2x\vec{i}+ 2y\vec{j}+ 2z\vec{k} and we want \nabla f= \lambda\nabla g for some "multiplier" \lambda. Setting corresponding components equal, we have
2(x- 1)= 2\lambda x
2(y- 1)= 2\lambda y and
2(z+ 1)= 2\lambda z

I find it is often simplest to eliminate \lambda by dividing one equation by another.
That is, \dfrac{x- 1}{y- 1}= \dfrac{x}{y} and \dfrac{x- 1}{z+ 1}= \dfrac{x}{z}.

Then (x- 1)y= x(y- 1) so xy- y= xy- x or y= x. (x- 1)z= x(z+ 1) so xz- z= xz+ x or z= -x.

Setting y= x and z= -x in the constraint x^2+ y^2+ z^2= 25 we have 3x^2= 25.
We can solve for two values of (x, y, z) from that. One gives the point of shortest distance, the other the point of longest distance.

Of course, the easy way to do this is to note that since x^2+ y^2+ z^2= 25 is a sphere with center at the origin, the shortest and longest distances from (1, 1, -1) to that sphere lie on the line through the center, (0, 0, 0), and (1, 1, -1). Determine where x= t, y= t, z= -t cross the sphere.

If we look at the Lagrange equations ##(\lambda-1) x = 1, ## etc., we see that we must have ##\lambda \neq 1##. Therefore, we can divide by ##\lambda - 1## to get ##x=v, y=v, z=-v##, where ##v = 1/(\lambda-1)##. The constraint gives ##3v^2 = 25##, so ##v = \pm 5/\sqrt{3}##, etc.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
10
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K