Maximum theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The maximum theorem provides conditions for the continuity of an optimized function and the set of its maximizers with respect to its parameters. The statement was first proven by Claude Berge in 1959.[1] The theorem is primarily used in mathematical economics and optimal control.

Statement of theorem

[edit | edit source]

Maximum Theorem.[2][3][4][5] Let X and Θ be topological spaces, f:X×Θ be a continuous function on the product X×Θ, and C:ΘX be a compact-valued correspondence such that C(θ) for all θΘ. Define the marginal function (or value function) f*:Θ by

f*(θ)=sup{f(x,θ):xC(θ)}

and the set of maximizers C*:ΘX by

C*(θ)=argmax{f(x,θ):xC(θ)}={xC(θ):f(x,θ)=f*(θ)}.

If C is continuous (i.e. both upper and lower hemicontinuous) at θ, then the value function f* is continuous, and the set of maximizers C* is upper-hemicontinuous with nonempty and compact values. As a consequence, the sup may be replaced by max.

Variants

[edit | edit source]

The maximum theorem can be used for minimization by considering the function f instead.

Interpretation

[edit | edit source]

The theorem is typically interpreted as providing conditions for a parametric optimization problem to have continuous solutions with regard to the parameter. In this case, Θ is the parameter space, f(x,θ) is the function to be maximized, and C(θ) gives the constraint set that f is maximized over. Then, f*(θ) is the maximized value of the function and C* is the set of points that maximize f.

The result is that if the elements of an optimization problem are sufficiently continuous, then some, but not all, of that continuity is preserved in the solutions.

Proof

[edit | edit source]

Throughout this proof we will use the term neighborhood to refer to an open set containing a particular point. We preface with a preliminary lemma, which is a general fact in the calculus of correspondences. Recall that a correspondence is closed if its graph is closed.

Lemma.[6][7][8] If A,B:ΘX are correspondences, A is upper hemicontinuous and compact-valued, and B is closed, then AB:ΘX defined by (AB)(θ)=A(θ)B(θ) is upper hemicontinuous.

The continuity of f* in the maximum theorem is the result of combining two independent theorems together.

Theorem 1.[9][10][11] If f is upper semicontinuous and C is upper hemicontinuous, nonempty and compact-valued, then f* is upper semicontinuous.

Theorem 2.[12][13][14] If f is lower semicontinuous and C is lower hemicontinuous, then f* is lower semicontinuous.

Under the hypotheses of the Maximum theorem, f* is continuous. It remains to verify that C* is an upper hemicontinuous correspondence with compact values. Let θΘ. To see that C*(θ) is nonempty, observe that the function fθ:C(θ) by fθ(x)=f(x,θ) is continuous on the compact set C(θ). The Extreme Value theorem implies that C*(θ) is nonempty. In addition, since fθ is continuous, it follows that C*(θ) a closed subset of the compact set C(θ), which implies C*(θ) is compact. Finally, let D:ΘX be defined by D(θ)={xX:f(x,θ)=f*(θ)}. Since f is a continuous function, D is a closed correspondence. Moreover, since C*(θ)=C(θ)D(θ), the preliminary Lemma implies that C* is upper hemicontinuous.

Variants and generalizations

[edit | edit source]

A natural generalization from the above results gives sufficient local conditions for f* to be continuous and C* to be nonempty, compact-valued, and upper semi-continuous.

If in addition to the conditions above, f is quasiconcave in x for each θ and C is convex-valued, then C* is also convex-valued. If f is strictly quasiconcave in x for each θ and C is convex-valued, then C* is single-valued, and thus is a continuous function rather than a correspondence.[15]

If f is concave in X×Θ and C has a convex graph, then f* is concave and C* is convex-valued. Similarly to above, if f is strictly concave, then C* is a continuous function.[15]

It is also possible to generalize Berge's theorem to non-compact correspondences if the objective function is K-inf-compact.[16]

Examples

[edit | edit source]

Consider a utility maximization problem where a consumer makes a choice from their budget set. Translating from the notation above to the standard consumer theory notation,

  • X=+l is the space of all bundles of l commodities,
  • Θ=++l×++ represents the price vector of the commodities p and the consumer's wealth w,
  • f(x,θ)=u(x) is the consumer's utility function, and
  • C(θ)=B(p,w)={x|pxw} is the consumer's budget set.

Then,

Proofs in general equilibrium theory often apply the Brouwer or Kakutani fixed-point theorems to the consumer's demand, which require compactness and continuity, and the maximum theorem provides the sufficient conditions to do so.

See also

[edit | edit source]

Notes

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ The original reference is the Maximum Theorem in Chapter 6, Section 3 Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Famously, or perhaps infamously, Berge only considers Hausdorff topological spaces and only allows those compact sets which are themselves Hausdorff spaces. He also requires that upper hemicontinuous correspondences be compact-valued. These properties have been clarified and disaggregated in later literature.
  3. ^ Compare with Theorem 17.31 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). This is given for arbitrary topological spaces. They also consider the possibility that f may only be defined on the graph of C.
  4. ^ Compare with Theorem 3.5 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). They consider the case that Θ and X are Hausdorff spaces.
  5. ^ Theorem 3.6 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Compare with Theorem 7 in Chapter 6, Section 1 of Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Berge assumes that the underlying spaces are Hausdorff and employs this property for X (but not for C) in his proof.
  7. ^ Compare with Proposition 2.46 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). They assume implicitly that Θ and X are Hausdorff spaces, but their proof is general.
  8. ^ Compare with Corollary 17.18 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). This is given for arbitrary topological spaces, but the proof relies on the machinery of topological nets.
  9. ^ Compare with Theorem 2 in Chapter 6, Section 3 of Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Berge's argument is essentially the one presented here, but he again uses auxiliary results proven with the assumptions that the underlying spaces are Hausdorff.
  10. ^ Compare with Proposition 3.1 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). They work exclusively with Hausdorff spaces, and their proof again relies on topological nets. Their result also allows for f to take on the values ±.
  11. ^ Compare with Lemma 17.30 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). They consider arbitrary topological spaces, and use an argument based on topological nets.
  12. ^ Compare with Theorem 1 in Chapter 6, Section 3 of Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). The argument presented here is essentially his.
  13. ^ Compare with Proposition 3.3 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). They work exclusively with Hausdorff spaces, and their proof again relies on topological nets. Their result also allows for f to take on the values ±.
  14. ^ Compare with Lemma 17.29 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). They consider arbitrary topological spaces and use an argument involving topological nets.
  15. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  16. ^ Theorem 1.2 in Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

References

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).