- #1
AxiomOfChoice
- 533
- 1
Suppose you know that a function [itex]g(x,y,z)[/itex] has a unique, non-degenerate minimum at some point [itex](x_0,y_0,z_0)[/itex]. How could you go about using the implicit function theorem to prove that [itex]f(x,y,z) = g(x,y,z) + C h(x,y,z)[/itex], where [itex]C[/itex] is some constant, has a minimum at some point [itex](x_c,y_c,z_c)[/itex]? Could we further show that [itex](x_c,y_c,z_c)[/itex] would need to be close to [itex](x_0,y_0,z_0)[/itex]?
I realize that I've left so many things unspecified that a lot of details will have to be omitted. But could you walk me through the basic program for proving something like this (e.g., things I'd have to show about the function [itex]h[/itex] or the constant [itex]C[/itex])?
I realize that I've left so many things unspecified that a lot of details will have to be omitted. But could you walk me through the basic program for proving something like this (e.g., things I'd have to show about the function [itex]h[/itex] or the constant [itex]C[/itex])?