Math 2.0

Operations research, mathematical programming Theorem

Envelope theorem

Builds on Differentiable function of several variablesGradientLocal minimum

Statement

Let XX be a set, let T⊆ℝkT \subseteq \R^k be open, and let f ⁣:X×T→ℝf \colon X \times T \to \R be a function. Let V(t)=sup⁡x∈Xf(x,t)V(t) = \sup_{x \in X} f(x, t) be the value function, and assume that VV is finite on TT. Let t0∈Tt_0 \in T and let x0∈Xx_0 \in X be a maximizer at t0t_0, that is, f(x0,t0)=V(t0)f(x_0, t_0) = V(t_0). If VV and t↦f(x0,t)t \mapsto f(x_0, t) are both differentiable at t0t_0, then ∇V(t0)=∇tf(x0,t0).\nabla V(t_0) = \nabla_t f(x_0, t_0).

Remarks

For every tt one has V(t)≥f(x0,t)V(t) \ge f(x_0, t), with equality at t=t0t = t_0. So t↦V(t)−f(x0,t)t \mapsto V(t) - f(x_0, t) has a local minimum at the interior point t0t_0, and its gradient vanishes there. In words: to first order, the change of the optimal value equals the direct effect of the parameter, with the maximizer held fixed.

Example: f(x,t)=tx−x2f(x, t) = tx - x^2 on ℝ×ℝ\R \times \R. The maximizer is x=t/2x = t/2 and V(t)=t2/4V(t) = t^2/4, so V′(t)=t/2V'(t) = t/2. The theorem predicts V′(t)=∂tf(x,t)=x=t/2V'(t) = \partial_t f(x, t) = x = t/2, which agrees.

The classical version assumes that XX is an open subset of ℝn\R^n, that ff is continuously differentiable, and that a maximizer x∗(t)x^*(t) depends differentiably on tt. Then the chain rule gives ∇V=∇tf+(∇xf) Dx∗\nabla V = \nabla_t f + (\nabla_x f) \, Dx^*, and the second term vanishes because ∇xf(x∗(t),t)=0\nabla_x f(x^*(t), t) = 0. For a constrained problem, the same idea shows that the derivative of the optimal value with respect to a constraint level is the corresponding Lagrange multiplier. Differentiability of VV is a real hypothesis: for X={−1,1}X = \set{-1, 1} and f(x,t)=xtf(x, t) = xt, the value V(t)=∣t∣V(t) = \abs{t} is not differentiable at 00.

Going deeper

For a student

The theorem is used throughout economics, for example to derive Hotelling's lemma and Roy's identity, and in optimization to compute sensitivities of optimal values. In optimal control and the calculus of variations, the same reasoning shows that the costate is the gradient of the value function, when the latter is differentiable. The version stated here, which needs no differentiability of the maximizer, is due to Paul Milgrom and Ilya Segal. When VV is not differentiable, one-sided derivatives of VV are given by Danskin's theorem under compactness assumptions.

Reading path

To understand this page from the ground up, read these 11 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Euclidean space object
  2. Function concept
  3. Local minimum concept
  4. Total derivative concept
  5. Function of several variables concept
  6. Differentiable function of several variables concept
  7. Limit of a function of several variables concept
  8. Partial derivative concept
  9. Differentiable function of several variables definition
  10. Gradient concept
  11. Envelope theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Envelope_theorem, For arbitrary choice sets
About this page
TagWK7MKDWRFF
URIm2://WK7MKDWRFF
Kindstatement, theorem
WritingW0 stub
MSC90C31, 49K40, 91B02
StatusThis copy of the site has no build data. Run m2 status WK7MKDWRFF.
UsesDifferentiable function of several variables, Gradient, Local minimum
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What links here

No page links to this page yet.