Minimum vs. saddle

Minimum vs. saddle

Problem: Consider the function :

Determine the local extrema of by finding and analyzing its critical points.

Solution: We set and solve this system of equations for points . By computing the partials, we obtain:

The second equation implies because is never zero. Plugging this fact into the first equation gives which implies . So the critical points as given by components are and .

Now let us analyze these critical points using the discriminant. Compute:

Therefore , and in particular , . We also need and . The discriminant test concludes that is a local minimum, while is a saddle point.

3D plot: https://www.math3d.org/cDHxQockR
Attachments/Pasted image 20231029084407.png
Also try Desmos3d: https://www.desmos.com/3d/17d5d68086

Minimal distance

Minimal distance

Problem: Consider the surface given by points with coordinates satisfying . Find the point(s) closest to the origin.
Attachments/Pasted image 20231029090834.png

Solution: Our goal is to extremize the distance to the origin of an arbitrary point on the surface. The distance formula gives . This function will be extremized at the same place(s) that the function is extremized because is monotone increasing for positive inputs. So we minimize instead. Next we write the distance as a function of just two variables. Using the surface equation to determine , we write . Then:

Setting these simultaneously to zero and solving gives , and is or . The distance at these points is 3.
Attachments/Pasted image 20231029092053.png