nLab
Lagrange multiplier

Contents

Idea following Loomis-Sternberg

X – finite dimensional real vector space

UX open

F:UR differentiable function

SU a smooth submanifold, which can be represented as a zero set of a differentiable map G:UY, whre Y is a real vector space and such that dG x is surjective for each xS.

We want to minimize F(x) for xS. It won’t work to set dF x=0 and solving for x as x will not be a critical point of F in general. The Lagrange multipliers are used to define another function L such that solving dL x=0 gives extrema of the constrained extremization problem.

Theorem (Loomis-Sternberg 3.12.2) Suppose F has a maximum on S at x. Then there is a function(al) l in Y * such that x is a critical point of the function FlG.

The proof uses implicit function theorem and the usual extremization arguments.

To get to a more familiar form of Lagrange multipliers, one uses the local coordinates (x 1,,x n) on U and sets Y=R m, so that G=(g 1,,g n). Now l:YR will be of the form l(y 1,,y m)= i=1 mλ iy i and FlG=F i=1 mλ ig i and d(FlG)=0 gives

Fx j i=1 mλ ig ix j=0,j=1,,n.\frac{\partial F}{\partial x_j} - \sum_{i = 1}^m\lambda_i\frac{\partial g^i}{\partial x_j} = 0,\,\,\,\,\,\,\,\,j = 1,\ldots, n.

This is n equations, which together with m equations G=(g 1,,g n)=0 for S give m+n equations for m+n unknowns x 1,,x n,λ 1,,λ m. The last m variables here are the Lagrange multipliers.

Applications

To spectral theory

The method of Lagrange multipliers affords an elementary proof of the spectral theorem for finite-dimensional real vector spaces, one which does not involve passage to the complex numbers and the fundamental theorem of algebra.

Proposition

Let A be a real symmetric n×n matrix. Then A is diagonalizable over the real numbers.

Proof

Consider the problem of maximizing the function f(x)=xAx where x n is subject to the constraint xx=1. (Such an extreme point exists, say by compactness.) By the symmetry of A, the gradient of f is easily calculated to be f(x)=2Ax, whereas the gradient of the Euclidean norm? xx is 2x. At a point x where a maximum is attained, we have f(x)=2Ax=λ(2x) for some Lagrange multiplier λ. Thus x is an eigenvector of A with eigenvalue λ. The usual arguments show that A restricts to a self-adjoint operator on the hyperplane orthogonal to x; by picking an orthonormal basis of this hyperplane, we may represent this restriction of A by a real symmetric matrix of size (n1)×(n1), and the argument repeats.

Literature

Revised on September 3, 2011 16:10:32 by Urs Schreiber (89.204.137.111)