Maximum theorem

The maximum theorem provides conditions for the continuity of an optimized function and the set of its maximizers as a parameter changes. The statement was first proven by Claude Berge in 1959.[1] The theorem is primarily used in mathematical economics.

Statement of theorem

Let X and \Theta be metric spaces, f:X\times\Theta\to\mathbb{R} be a function jointly continuous in its two arguments, and C:\Theta\twoheadrightarrow X be a compact-valued correspondence.

For x in X and \theta in \Theta, let

f^*(\theta)=\max\{f(x,\theta)|x\in C(\theta)\} and
C^*(\theta)=\mathrm{arg}\max\{f(x,\theta)|x\in C(\theta)\}=\{x\in C(\theta)\,|\,f(x,\theta)=f^*(\theta)\}.

If C is continuous (i.e. both upper and lower hemicontinuous) at some \theta, then f^* is continuous at \theta and C^* is non-empty, compact-valued, and upper hemicontinuous at \theta.

Interpretation

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, \Theta is the parameter space, f(x,\theta) is the function to be maximized, and C(\theta) gives the constraint set that f is maximized over. Then, f^*(\theta) 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

The proof relies primarily on the sequential definitions of upper and lower hemicontinuity.

Because C is compact-valued and f is continuous, the extreme value theorem guarantees the constrained maximum of f is well-defined and C^*(\theta) is non-empty for all \theta in \Theta. Then, let \theta_n be a sequence converging to \theta and x_n \in C^*(\theta_n) be a sequence in X. Since C is upper hemicontinuous, there exists a convergent subsequence x_{n_k}\to x \in C(\theta).

If it is shown that x \in C^*(\theta), then

\lim_{k \to \infty} f^*(\theta_{n_k}) = \lim_{k \to \infty} f(x_{n_k},\theta_{n_k}) = f(x,\theta) = f^*(\theta)

which would simultaneously prove the continuity of f^* and the upper hemicontinuity of C^*.

Suppose to the contrary that x \not\in C^*(\theta), i.e. there exists an \hat{x}\in C(\theta) such that f(\hat{x},\theta) > f(x,\theta). Because C is lower hemicontinuous, there is a further subsequence of n_k such that \hat{x}_{n_j} \in C(\theta_{n_j}) and \hat{x}_{n_j} \to \hat{x}. By the continuity of f and the contradiction hypothesis,

\lim_{j \to \infty} f(\hat{x}_{n_j},\theta_{n_j}) = f(\hat{x},\theta) > f(x,\theta) = \lim_{j \to \infty} f(x_{n_j},\theta_{n_j}).

But this implies that for sufficiently large j,

f(\hat{x}_{n_j},\theta_{n_j}) > f(x_{n_j},\theta_{n_j})

which would mean x_{n_j} is not a maximizer, a contradiction of x_n \in C^*(\theta_n). This establishes the continuity of f^* and the upper hemicontinuity of C^*.

Because C^*(\theta) \subset C(\theta) and C(\theta) is compact, it is sufficient to show C^* is closed-valued for it to be compact-valued. This can be done by contradiction using sequences similar to above.

Variants and generalizations

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

If f is concave 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.[2]

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

Examples

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,

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

Notes

  1. Ok, p. 306
  2. Sundaram, p. 239
  3. Feinberg, Zadoianchuk, Kasyanov, Theorem 1.2

References

  • Claude Berge (1963). Topological Spaces. Oliver and Boyd. 
  • Efe Ok (2007). Real analysis with economics applications. Princeton University Press. ISBN 0-691-11768-3. 
  • Rangarajan K. Sundaram (1996). A first course in optimization theory. Cambridge University Press. ISBN 978-0-521-49770-1. 
  • Feinberg, Eugene A.; Kasyanov, Pavlo O.; Zadoianchuk, Nina V. (January 2013). "Berge’s theorem for noncompact image sets". Journal of Mathematical Analysis and Applications 397 (1): 255–259. doi:10.1016/j.jmaa.2012.07.051. 
This article is issued from Wikipedia - version of the Friday, August 07, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.