Math 2.0

statement theorem

Lagrange multipliers

Statement

Let U⊆RnU \subseteq \mathbb{R}^n be open, let m<nm < n, and let f ⁣:U→Rf \colon U \to \mathbb{R} and g=(g1,…,gm) ⁣:U→Rmg = (g_1, \dots, g_m) \colon U \to \mathbb{R}^m be of class C^1. Let M={x∈U:g(x)=0}M = \{x \in U : g(x) = 0\}, and let a∈Ma \in M be a local extremum of the restriction of ff to MM. Suppose that the gradients ∇g1(a),…,∇gm(a)\nabla g_1(a), \dots, \nabla g_m(a) are linearly independent. Then there is a unique λ=(λ1,…,λm)∈Rm\lambda = (\lambda_1, \dots, \lambda_m) \in \mathbb{R}^m such that ∇f(a)=λ1∇g1(a)+⋯+λm∇gm(a).\nabla f(a) = \lambda_1 \nabla g_1(a) + \dots + \lambda_m \nabla g_m(a).

Remarks

The numbers λi\lambda_i are the Lagrange multipliers. Equivalently, (a,λ)(a, \lambda) is a critical point of the Lagrangian L(x,λ)=f(x)−λ⋅g(x)L(x, \lambda) = f(x) - \lambda \cdot g(x). The hypothesis on the gradients is the constraint qualification. It says that the Jacobian matrix Dg(a)Dg(a) has rank mm. The proof uses the implicit function theorem. Near aa, the set MM is the graph of a C1C^1 function of n−mn - m variables. The gradient of ff is orthogonal to the tangent space of MM at aa. The condition is necessary, not sufficient. Each candidate point needs a further check, for example a comparison of values on a compact set MM.

Explanations

L1 human

At a constrained extremum, a small move along the constraint set does not change ff to first order. So ∇f(a)\nabla f(a) has no component along the constraint set, and it is a combination of the normals ∇gi(a)\nabla g_i(a). This turns a constrained problem into a system of n+mn + m equations in n+mn + m unknowns.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Lagrange_multiplier, Statement
  2. Web https://en.wikipedia.org/wiki/Lagrange_multiplier, Multiple constraints