Article · Wikipedia archive · Last revised Jul 13, 2026

Maximum theorem

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. The theorem is primarily used in mathematical economics and optimal control.

Last revised
Jul 13, 2026
Read time
≈ 15 min
Length
3,401 w
Citations
17
Source

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

Maximum Theorem.2345 Let X {\displaystyle X} and Θ {\displaystyle \Theta } be topological spaces, f : X × Θ R {\displaystyle f:X\times \Theta \to \mathbb {R} } be a continuous function on the product X × Θ {\displaystyle X\times \Theta } , and C : Θ X {\displaystyle C:\Theta \rightrightarrows X} be a compact-valued correspondence such that C ( θ ) {\displaystyle C(\theta )\neq \emptyset } for all θ Θ {\displaystyle \theta \in \Theta } . Define the marginal function (or value function) f : Θ R {\displaystyle f^{*}:\Theta \to \mathbb {R} } by

f ( θ ) = sup { f ( x , θ ) : x C ( θ ) } {\displaystyle f^{*}(\theta )=\sup\{f(x,\theta ):x\in C(\theta )\}}

and the set of maximizers C : Θ X {\displaystyle C^{*}:\Theta \rightrightarrows X} by

C ( θ ) = a r g max { f ( x , θ ) : x C ( θ ) } = { x C ( θ ) : f ( x , θ ) = f ( θ ) } {\displaystyle C^{*}(\theta )=\mathrm {arg} \max\{f(x,\theta ):x\in C(\theta )\}=\{x\in C(\theta ):f(x,\theta )=f^{*}(\theta )\}} .

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

Variants

The maximum theorem can be used for minimization by considering the function f {\displaystyle -f} instead.

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, Θ {\displaystyle \Theta } is the parameter space, f ( x , θ ) {\displaystyle f(x,\theta )} is the function to be maximized, and C ( θ ) {\displaystyle C(\theta )} gives the constraint set that f {\displaystyle f} is maximized over. Then, f ( θ ) {\displaystyle f^{*}(\theta )} is the maximized value of the function and C {\displaystyle C^{*}} is the set of points that maximize f {\displaystyle 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

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.678 If A , B : Θ X {\displaystyle A,B:\Theta \rightrightarrows X} are correspondences, A {\displaystyle A} is upper hemicontinuous and compact-valued, and B {\displaystyle B} is closed, then A B : Θ X {\displaystyle A\cap B:\Theta \rightrightarrows X} defined by ( A B ) ( θ ) = A ( θ ) B ( θ ) {\displaystyle (A\cap B)(\theta )=A(\theta )\cap B(\theta )} is upper hemicontinuous.

The continuity of f {\displaystyle f^{*}} in the maximum theorem is the result of combining two independent theorems together.

Theorem 1.91011 If f {\displaystyle f} is upper semicontinuous and C {\displaystyle C} is upper hemicontinuous, nonempty and compact-valued, then f {\displaystyle f^{*}} is upper semicontinuous.

Theorem 2.121314 If f {\displaystyle f} is lower semicontinuous and C {\displaystyle C} is lower hemicontinuous, then f {\displaystyle f^{*}} is lower semicontinuous.

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

Variants and generalizations

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

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

If f {\displaystyle f} is concave in X × Θ {\displaystyle X\times \Theta } and C {\displaystyle C} has a convex graph, then f {\displaystyle f^{*}} is concave and C {\displaystyle C^{*}} is convex-valued. Similarly to above, if f {\displaystyle f} is strictly concave, then C {\displaystyle 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

Specific function

Let the parameter space be Θ = R {\displaystyle \Theta =\mathbb {R} } and the choice space be X = R {\displaystyle X=\mathbb {R} } . Consider the continuous objective function

f ( x , θ ) = ( x θ ) 2 , {\displaystyle f(x,\theta )=-(x-\theta )^{2},}

together with the constant constraint correspondence

C ( θ ) = [ 1 , 1 ] for all  θ R , {\displaystyle C(\theta )=[-1,1]\quad {\text{for all }}\theta \in \mathbb {R} ,}

which is compact-valued and continuous (it does not vary with θ {\displaystyle \theta } ).

The value function and the set of maximizers are

f ( θ ) = max x [ 1 , 1 ] ( x θ ) 2 , C ( θ ) = arg max x [ 1 , 1 ] ( x θ ) 2 . {\displaystyle f^{*}(\theta )=\max _{x\in [-1,1]}-(x-\theta )^{2},\qquad C^{*}(\theta )=\arg \max _{x\in [-1,1]}-(x-\theta )^{2}.}

Since f {\displaystyle f} is maximized by taking x {\displaystyle x} as close to θ {\displaystyle \theta } as the constraint allows, the unique maximizer is the projection of θ {\displaystyle \theta } onto [ 1 , 1 ] {\displaystyle [-1,1]} :

source ↗
C ( θ ) = { 1 θ < 1 , θ 1 θ 1 , 1 θ > 1 , {\displaystyle C^{*}(\theta )={\begin{cases}-1&\theta <-1,\\\theta &-1\leq \theta \leq 1,\\1&\theta >1,\end{cases}}}

and the corresponding value function is

f ( θ ) = { ( θ + 1 ) 2 θ < 1 , 0 1 θ 1 , ( θ 1 ) 2 θ > 1. {\displaystyle f^{*}(\theta )={\begin{cases}-(\theta +1)^{2}&\theta <-1,\\0&-1\leq \theta \leq 1,\\-(\theta -1)^{2}&\theta >1.\end{cases}}}

As the maximum theorem guarantees, f {\displaystyle f^{*}} is a continuous function of θ {\displaystyle \theta } , and the maximizer correspondence C {\displaystyle C^{*}} is upper hemicontinuous with nonempty, compact values. Because f {\displaystyle f} is strictly concave in x {\displaystyle x} , the maximizer is in fact single-valued, so C {\displaystyle C^{*}} is a continuous function.

Utility maximization problem

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 = R + l {\displaystyle X=\mathbb {R} _{+}^{l}} is the space of all bundles of l {\displaystyle l} commodities,
  • Θ = R + + l × R + + {\displaystyle \Theta =\mathbb {R} _{++}^{l}\times \mathbb {R} _{++}} represents the price vector of the commodities p {\displaystyle p} and the consumer's wealth w {\displaystyle w} ,
  • f ( x , θ ) = u ( x ) {\displaystyle f(x,\theta )=u(x)} is the consumer's utility function, and
  • C ( θ ) = B ( p , w ) = { x | p x w } {\displaystyle C(\theta )=B(p,w)=\{x\,|\,px\leq w\}} 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

See also

Notes

Notes

  1. Ok, Efe (2007). Real Analysis with Economics Applications. Princeton University Press. p. 306. ISBN 978-0-691-11768-3.
  2. The original reference is the Maximum Theorem in Chapter 6, Section 3 Claude Berge (1963). Topological Spaces. Oliver and Boyd. p. 116. 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 Charalambos D. Aliprantis; Kim C. Border (2006). Infinite Dimensional Analysis: A Hitchhiker's Guide. Springer. pp. 570. ISBN 9783540295860. This is given for arbitrary topological spaces. They also consider the possibility that f {\displaystyle f} may only be defined on the graph of C {\displaystyle C} .
  4. Compare with Theorem 3.5 in Shouchuan Hu; Nikolas S. Papageorgiou (1997). Handbook of Multivalued Analysis. Vol. 1: Theory. Springer-Science + Business Media, B. V. p. 84. They consider the case that Θ {\displaystyle \Theta } and X {\displaystyle X} are Hausdorff spaces.
  5. Theorem 3.6 in Beavis, Brian; Dobbs, Ian (1990). Optimization and Stability Theory for Economic Analysis. New York: Cambridge University Press. pp. 83–84. ISBN 0-521-33605-8.
  6. Compare with Theorem 7 in Chapter 6, Section 1 of Claude Berge (1963). Topological Spaces. Oliver and Boyd. p. 112. Berge assumes that the underlying spaces are Hausdorff and employs this property for X {\displaystyle X} (but not for C {\displaystyle C} ) in his proof.
  7. Compare with Proposition 2.46 in Shouchuan Hu; Nikolas S. Papageorgiou (1997). Handbook of Multivalued Analysis. Vol. 1: Theory. Springer-Science + Business Media, B. V. p. 53. They assume implicitly that Θ {\displaystyle \Theta } and X {\displaystyle X} are Hausdorff spaces, but their proof is general.
  8. Compare with Corollary 17.18 in Charalambos D. Aliprantis; Kim C. Border (2006). Infinite Dimensional Analysis: A Hitchhiker's Guide. Springer. pp. 564. ISBN 9783540295860. 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 Claude Berge (1963). Topological Spaces. Oliver and Boyd. p. 116. 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 Shouchuan Hu; Nikolas S. Papageorgiou (1997). Handbook of Multivalued Analysis. Vol. 1: Theory. Springer-Science + Business Media, B. V. p. 82. They work exclusively with Hausdorff spaces, and their proof again relies on topological nets. Their result also allows for f {\displaystyle f} to take on the values ± {\displaystyle \pm \infty } .
  11. Compare with Lemma 17.30 in Charalambos D. Aliprantis; Kim C. Border (2006). Infinite Dimensional Analysis: A Hitchhiker's Guide. Springer. pp. 569. ISBN 9783540295860. They consider arbitrary topological spaces, and use an argument based on topological nets.
  12. Compare with Theorem 1 in Chapter 6, Section 3 of Claude Berge (1963). Topological Spaces. Oliver and Boyd. p. 115. The argument presented here is essentially his.
  13. Compare with Proposition 3.3 in Shouchuan Hu; Nikolas S. Papageorgiou (1997). Handbook of Multivalued Analysis. Vol. 1: Theory. Springer-Science + Business Media, B. V. p. 83. They work exclusively with Hausdorff spaces, and their proof again relies on topological nets. Their result also allows for f {\displaystyle f} to take on the values ± {\displaystyle \pm \infty } .
  14. Compare with Lemma 17.29 in Charalambos D. Aliprantis; Kim C. Border (2006). Infinite Dimensional Analysis: A Hitchhiker's Guide. Springer. pp. 569. ISBN 9783540295860. They consider arbitrary topological spaces and use an argument involving topological nets.
  15. Sundaram, Rangarajan K. (1996). A First Course in Optimization Theory. Cambridge University Press. p. 237. ISBN 0-521-49770-1.
  16. Theorem 1.2 in 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. arXiv:1203.1340. doi:10.1016/j.jmaa.2012.07.051. S2CID 8603060.
References

References