Berge s Maximum Theorem

Similar documents
A LITTLE REAL ANALYSIS AND TOPOLOGY

Economics 204 Summer/Fall 2017 Lecture 7 Tuesday July 25, 2017

Properties of Walrasian Demand

Week 5 Lectures 13-15

Econ Lecture 7. Outline. 1. Connected Sets 2. Correspondences 3. Continuity for Correspondences

That is, there is an element

Lecture 7. Econ August 18

Preliminary draft only: please check for final version

Mathematical Appendix

LECTURE 15: COMPLETENESS AND CONVEXITY

Math 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.

Appendix B Convex analysis

2.4 The Extreme Value Theorem and Some of its Consequences

Lecture 5: The Bellman Equation

Mathematics II, course

3 Lecture Separation

Some Background Material

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries

3 Measurable Functions

MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.

Bayesian Persuasion Online Appendix

Midterm 1. Every element of the set of functions is continuous

Math 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M

Notes on Measure Theory and Markov Processes

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )

REVIEW OF ESSENTIAL MATH 346 TOPICS

Metric Spaces. DEF. If (X; d) is a metric space and E is a nonempty subset, then (E; d) is also a metric space, called a subspace of X:

Dynamic Programming Theorems

Math 117: Topology of the Real Numbers

Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption

Problem Set 2: Solutions Math 201A: Fall 2016

15 Real Analysis II Sequences and Limits , Math for Economists Fall 2004 Lecture Notes, 10/21/2004

2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.

Department of Economics Working Paper Series

Mathematical Methods in Economics (Part I) Lecture Note

Module MA3486: Fixed Point Theorems and Economic Equilibria Hilary Term 2016 Appendices

106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

Stat 8931 (Exponential Families) Lecture Notes The Eggplant that Ate Chicago (the Notes that Got out of Hand) Charles J. Geyer November 2, 2016

Recursive Methods. Introduction to Dynamic Optimization

Chapter 4. Measure Theory. 1. Measure Spaces

Best approximations in normed vector spaces

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Tijmen Daniëls Universiteit van Amsterdam. Abstract

ADVANCE TOPICS IN ANALYSIS - REAL. 8 September September 2011

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1

Logical Connectives and Quantifiers

M17 MAT25-21 HOMEWORK 6

R N Completeness and Compactness 1

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.

ABSTRACT ALGEBRA: A PRESENTATION ON PROFINITE GROUPS

MTG 5316/4302 FALL 2018 REVIEW FINAL

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n

1 Jan 28: Overview and Review of Equilibrium

NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

ECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko

ANALYSIS WORKSHEET II: METRIC SPACES

Stochastic Dynamic Programming: The One Sector Growth Model

Convex Analysis and Economic Theory Winter 2018

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.

Equilibrium Analysis of Dynamic Economies

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.

Prohorov s theorem. Bengt Ringnér. October 26, 2008

Chapter 4. Maximum Theorem, Implicit Function Theorem and Envelope Theorem

Maths 212: Homework Solutions

Definition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :

This exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table

Optimization. A first course on mathematics for economists

2. The Concept of Convergence: Ultrafilters and Nets

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

Introduction to Convex Analysis Microeconomics II - Tutoring Class

Econ Slides from Lecture 1

Direct Limits. Mathematics 683, Fall 2013

CHAPTER 7. Connectedness

Competitive Market Mechanisms as Social Choice Procedures

i c Robert C. Gunning

Notes for Functional Analysis

1 Lecture 4: Set topology on metric spaces, 8/17/2012

Lebesgue Measure. Dung Le 1

Continuity. Chapter 4

MORE ON CONTINUOUS FUNCTIONS AND SETS

Contents. An example 5. Mathematical Preliminaries 13. Dynamic programming under certainty 29. Numerical methods 41. Some applications 57

Analogy Principle. Asymptotic Theory Part II. James J. Heckman University of Chicago. Econ 312 This draft, April 5, 2006

Notes on Complex Analysis

1 Stochastic Dynamic Programming

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.

Chapter 1 - Preference and choice

The Tychonoff Theorem

Chapter 3 Continuous Functions

The Uniform Weak Law of Large Numbers and the Consistency of M-Estimators of Cross-Section and Time Series Models

Stochastic Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania

Midterm 1 Solutions Thursday, February 26

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.

Econ 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS. Carmen Astorne-Figari Washington University in St. Louis.

Analysis and Linear Algebra. Lectures 1-3 on the mathematical tools that will be used in C103

Generalized Neyman Pearson optimality of empirical likelihood for testing parameter hypotheses

Stochastic convexity in dynamic programming

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We will begin our study of topology from a set-theoretic point of view. As the subject

Transcription:

Berge s Maximum Theorem References: Acemoglu, Appendix A.6 Stokey-Lucas-Prescott, Section 3.3 Ok, Sections E.1-E.3 Claude Berge, Topological Spaces (1963), Chapter 6

Berge s Maximum Theorem So far, we ve simply assumed that each of our constrained optimization problems has a solution that varies smoothly with the parameters. Weierstrass extreme value theorem says that a continuous function attains its maximum (and minimum) on a compact set. Berge s maximum theorem imposes additional restrictions on the objective function and constraint set to guarantee that the problem s solution varies smoothly with the parameters.

The Problem n choice variables: x X R n m parameters: θ Θ R m objective function: F : X Θ R set of feasible values for x given θ: G : Θ X (G : Θ X ) The problem: sup F (x, θ) x G(θ)

The Problem Because G is a multi-valued correspondence, not a function, we need to generalize more familiar notions of continuity. Start by assuming that G is compact valued: for all θ Θ, G(θ) X R n is compact. Since X is a subset of R n, this just means that G(θ) is closed and bounded (Heine-Borel theorem).

The Problem Notions of continuity for (compact valued) correspondences can be expressed in terms of sets or sequences. The set definitions will help us visualize what the definitions require. The sequence definitions will help us complete our proofs.

Continuity Concepts for Correspondences The correspondence G is upper hemicontinuous at θ Θ if G(θ) is nonempty and if, for every open set X X with G(θ) X (every open subset X of X containing G(θ)), there exists a δ > 0 such that for every θ N δ (θ) (every θ in some δ-neighborhood of θ), G(θ ) X (G(θ ) is contained in X as well).

Continuity Concepts for Correspondences Take any θ near θ. G(θ ) must also be in X. G can t suddenly explode.

Continuity Concepts for Correspondences The compact valued correspondence G is upper hemicontinuous at θ Θ if G(θ) is nonempty and if, for every sequence {θ j } with θ j θ and every sequence {x j } with x j G(θ j ) for all j, there exists a convergent subsequence {x jk } such that x jk x G(θ). If G is not compact valued, then these conditions are sufficient, but not necessary, for G to be upper hemicontinuous.

Continuity Concepts for Correspondences G is not upper hemi continuous at θ 0.

Continuity Concepts for Correspondences G is not upper hemi continuous at θ 0. The red open set contains G(θ 0 ) but not G(θ ) immediately to the right of θ 0.

Continuity Concepts for Correspondences G is not upper hemi continuous at θ 0. There is no convergent subsequence along the red arrow that converges to a point x 0 G(θ 0 ).

Continuity Concepts for Correspondences The correspondence G is lower hemicontinuous at θ Θ if G(θ) is nonempty and if, for every open set X X with G(θ) X (every open subset X of X intersecting with G(θ)), there exists a δ > 0 such that for every θ N δ (θ), G(θ ) X (some δ-neighborhood of θ such that G(θ ) also intersects with X for every θ in that neighborhood).

Continuity Concepts for Correspondences Take any θ near θ. G(θ ) must also intersect with X. G can t suddenly implode.

Continuity Concepts for Correspondences The correspondence G is lower hemicontinuous at θ Θ if G(θ) is nonempty and if, for every x G(θ) and every sequence {θ j } such that θ j θ, there is a J 1 and a sequence {x j } such that x j G(θ j ) for all j J and x j x. The correspondence G is continuous at θ Θ if it is both upper and lower hemicontinuous at θ. The correspondence G is continuous if it is continuous at every θ Θ.

Continuity Concepts for Correspondences G is not lower hemicontinuous at θ 0.

Continuity Concepts for Correspondences G is not lower hemicontinuous at θ 0. The red open set intersects with G(θ 0 ) but not with G(θ ) immediately to the left of θ 0.

Continuity Concepts for Correspondences G is not lower hemicontinuous at θ 0. There is no sequence with x j G(θ j ) converging from the left to the red point x G(θ 0 ).

Example: Perfect Substitutes max U(c 1 + c 2 ) subject to 1 c 1 + pc 2, c 1 0, c 2 0, c 1,c 2 where U > 0 and p ε > 0. c1 = c2 = 1 for p > 1 [0, 1] for p = 1 0 for 1 > p ε 0 for p > 1 [0, 1] for p = 1 1/p for 1 > p ε Both demand correspondences are upper but not lower hemicontinuous.

Example: Perfect Substitutes c 1 is upper but not lower hemicontinuous.

Example: Perfect Substitutes c 2 is upper but not lower hemicontinuous.

Continuity Concepts for Correspondences To build up more intuition, let s construct a correspondence that is both upper and lower hemicontinuous. Let f : Θ R and g : Θ R be continuous functions satisfying f (θ) g(θ) for all θ Θ. G(θ) = {x R f (θ) x g(θ)} is nonempty for all θ Θ. Let s show that it meets the other requirements for upper and lower hemicontinuity.

Continuity Concepts for Correspondences G(θ) is both upper and lower hemicontinuous. Hence G(θ) is continuous.

Upper Hemicontinuity Fix θ Θ and let {θ j } be a sequence with θ j θ. Since G is nonempty, we can find a sequence {x j } with x j G(θ j ) for all j. Does this sequence have a convergent subsequence with limit x G(θ)?

Upper Hemicontinuity Yes! Since θ j θ, there exists a closed and bounded set ˆΘ Θ R such that, for some J 1, all θ j with j J and θ will be contained in ˆΘ. Moreover, since f and g are continuous, once θ j, j J are contained in the closed and bounded set ˆΘ, all of the x j, j J, will also lie in some closed and bounded subset of R.

Upper Hemicontinuity By the Bolzano-Weierstrass theorem, the sequence {θ j, x j } in R 2 has a convergent subsequence with limit point (θ, x). And since each element of this subsequence satisfies f (θ jk ) x jk g(θ jk ) and f and g are continuous, the limit point x must satisfy x G(θ) as well.

Lower Hemicontinuity Fix θ Θ and x G(θ). Let {θ j } be a sequence with θ j θ. Is there a sequence {x j } with x j G(θ j ) for all j and x j x? Yes! If f (θ) = g(θ), then just take x j = g(θ j ) for all j. Clearly, x j G(θ j ) for all j and, since g is continuous, x j g(θ) = x.

Lower Hemicontinuity If, on the other hand, f (θ) < g(θ), note that x f (θ) g(θ) f (θ) is well-defined and, since x G(θ), lies between zero and one.

Lower Hemicontinuity Therefore, the sequence {x j } with [ x j = 1 x f (θ) ] [ ] x f (θ) f (θ j ) + g(θ j ) g(θ) f (θ) g(θ) f (θ) satisfies x j G(θ j ) and, since f and g are continuous, x j [ 1 x f (θ) ] [ ] x f (θ) f (θ) + g(θ) g(θ) f (θ) g(θ) f (θ) = f (θ) + x f (θ) = x.

Continuity Concepts for Correspondences In the special case where f (θ) = g(θ) for all θ, so that G(θ) is single-valued, then the assumption that g is a continuous function implies that G is continuous correspondence. In fact the converse is also true. Assume that G(θ) is single-valued, with G(θ) = g(θ) for some function g. If G is either an upper or lower hemicontinuous correspondence, then g is a continuous function. See the notes for a proof.

Berge s Maximum Theorem Let X R n and Θ R m. Let F : X Θ R be a continuous function, and let G : Θ X be a compact valued and continuous correspondence. Then the maximum value function V (θ) = max F (x, θ) x G(θ) is well-defined and continuous, and the optimal policy correspondence x (θ) = {x G(θ) F (x, θ) = V (θ)} is nonempty, compact valued, and upper hemicontinuous.

Berge s Maximum Theorem To prove the theorem, fix θ Θ. Note first that since G(θ) is nonempty and compact, and since F (, θ) is continuous, Weierstrass extreme value theorem implies that V (θ) is well-defined and that x (θ) is nonempty. Next, we will show that x (θ) is compact valued.

Berge s Maximum Theorem Since x (θ) G(θ) and G(θ) is compact, it follows that x (θ) is bounded. Let {x j } be a sequence with x j x (θ) for all j and x j x. Since G(θ) is closed, it must be that x G(θ). And since V (θ) = F (x j, θ) for all j and F is continuous, it follows that F (x, θ) = V (θ). Hence, x x (θ), so x (θ) is closed. Therefore, by the Heine-Borel theorem, x (θ) is compact valued.

Berge s Maximum Theorem Now we will show that x (θ) is upper hemicontinuous. Fix θ Θ and let {θ j } be any sequence with θ j θ. Then let {x j } be a sequence with x j x (θ j ) for all j. Is there a convergent subsequence with x jk x x (θ)?

Berge s Maximum Theorem Yes! Since G is upper hemicontinuous, there exists a subsequence {x jk } converging to x G(θ). Now, let x G(θ) as well. Since G is lower hemicontinuous, there exists a sequence {x j k } with x j k G(θ jk ) and x j k x. And since F (x jk, θ jk ) F (x j k, θ jk ) for all k and F is continuous, it follows that F (x, θ) F (x, θ). Moreover, this condition holds for any x G(θ). It follows that x x (θ), so that x is upper hemicontinuous.

Berge s Maximum Theorem Finally, we will show that V (θ) is continuous. Fix θ Θ, and let {θ j } be any sequence with θ j θ. Choose x j x (θ j ) for all j and let v = lim sup V (θ j ) j and v = lim inf j V (θ j )

Berge s Maximum Theorem Then there exists a subsequence {x jk } such that v = lim k F (x jk, θ jk ). But since x is upper hemicontinuous, these exists a subsequence of {x jkl } of {x jk } converging to x x (θ) Hence v = lim l F (x jkl, θ jkl ) = F (x, θ) = V (θ).

Berge s Maximum Theorem There also exists a subsequence {x jk } such that v = lim k F (x jk, θ jk ). But since x is upper hemicontinuous, these exists a subsequence of {x jkl } of {x jk } converging to x x (θ) Hence v = lim l F (x jkl, θ jkl ) = F (x, θ) = V (θ). Therefore, V (θ j ) V (θ), completing the proof.

Example: Utility Maximization max U(c 1, c 2 ) subject to I p 1 c 1 + p 2 c 2, c 1 0, c 2 0. c 1,c 2 To apply Berge s theorem, we need U to be continuous and G(I, p 1, p 2 ) = {(c 1, c 2 ) R 2 I p 1 c 1 + p 2 c 2, c 1 0, c 2 0} to be compact valued and continuous.

Example: Utility Maximization Clearly, for any I > 0, p 1 > 0, and p 2 > 0, G is nonempty and compact valued. We only need to show that G satisfies the remaining requirements for upper and lower hemicontinuity.

Upper Hemicontinuity Fix (I, p 1, p 2 ) R 3 ++, and let {I j, p 1j, p 2j } be a sequence in R 3 ++ with (I j, p 1j, p 2j ) (I, p 1, p 2 ). Since G is non-empty, there is a sequence {c 1j, c 2j } with (c 1j, c 2j ) G(I j, p 1j, p 2j ) for all j. Is there a convergent subsequence {c 1jk, c 2jk } with limit point (c 1, c 2 ) G(I, p 1, p 2 )?

Upper Hemicontinuity Yes! Since (I j, p 1j, p 2j ) (I, p 1, p 2 ), there is a closed and bounded set ˆΘ R 3 ++ R 3, such that, for some J 1, all of the (I j, p 1j, p 2j ), j J, and (I, p 1, p 2 ) are contained in ˆΘ. Moreover, the structure of G in this case implies that all of the (c 1j, c 2j ) G(I j, p 1j, p 2j ) for j J will lie in a closed and bounded subset of R 2.

Upper Hemicontinuity Thus, for all j J, all elements of the sequence {I j, p 1j, p 2j, c 1j, c 2j } lie in a closed and bounded subset of R 5. By the Bolzano-Weierstrass theorem, this sequence has a convergent subsequence {I jk, p 1jk, p 2jk, c 1jk, c 2kk } with limit point (I, p 1, p 2, c 1, c 2 ). And since each element of this convergent subsequence satisfies I jk p 1jk c 1jk + p 2jk c 2jk, c 1jk 0, and c 2jk 0, it is easy to see that the limit point will also have to satisfy (c 1, c 2 ) G(I, p 1, p 2 ).

Lower Hemicontinuity Fix (I, p 1, p 2 ) R 3 ++ and (c 1, c 2 ) G(I, p 1, p 2 ). Then let {I j, p 1j, p 2j } be a sequence in R 3 ++ with (I j, p 1j, p 2j ) (I, p 1, p 2 ). Is there a sequence {c 1j, c 2j } with (c 1j, c 2j ) G(I j, p 1j, p 2j ) for all j and (c 1j, c 2j ) (c 1, c 2 )? Yes! If c 1 = c 2 = 0, then {c 1j, c 2j } = {0, 0} works.

Lower Hemicontinuity So suppose that c 1 > 0 and/or c 2 > 0. Construct {c 1j, c 2j } with ( ) ( ) Ij p1 c 1 + p 2 c 2 c 1j = c 1 I p 1j c 1 + p 2j c 2 and c 2j = ( ) ( ) Ij p1 c 1 + p 2 c 2 c 2. I p 1j c 1 + p 2j c 2 Clearly, c 1j 0 and c 2j 0 for all j.

Lower Hemicontinuity In addition ( ) ( ) Ij p1 c 1 + p 2 c 2 p 1j c 1j + p 2 c 2j = (p 1j c 1 + p 2j c 2 ) I p 1j c 1 + p 2j c 2 ( ) p1 c 1 + p 2 c 2 = I j I j, I so that (c 1j, c 2j ) G(I j, p 1j, p 2j ) for all j. Moreover, (c 1j, c 2j ) (c 1, c 2 ), completing the proof.

Example: Utility Maximization For the problem max U(c 1, c 2 ) subject to I p 1 c 1 + p 2 c 2, c 1 0, c 2 0, c 1,c 2 we now know that if U is continuous: 1. V (I, p 1, p 2 ) is well-defined and continuous. 2. c 1 (I, p 1, p 2 ) and c (I, p 1, p 2 ) are nonempty, compact valued, and upper hemicontinuous correspondences. And if we assume as well that U is strictly concave, the Marshallian (Walrasian) demand functions c 1 (I, p 1, p 2 ) and c (I, p 1, p 2 ) are single-valued and continuous.