Berge s Maximum Theorem
|
|
- Luke Harmon
- 5 years ago
- Views:
Transcription
1 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
2 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.
3 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(θ)
4 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).
5 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.
6 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).
7 Continuity Concepts for Correspondences Take any θ near θ. G(θ ) must also be in X. G can t suddenly explode.
8 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.
9 Continuity Concepts for Correspondences G is not upper hemi continuous at θ 0.
10 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.
11 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 ).
12 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).
13 Continuity Concepts for Correspondences Take any θ near θ. G(θ ) must also intersect with X. G can t suddenly implode.
14 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 θ Θ.
15 Continuity Concepts for Correspondences G is not lower hemicontinuous at θ 0.
16 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.
17 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 ).
18 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.
19 Example: Perfect Substitutes c 1 is upper but not lower hemicontinuous.
20 Example: Perfect Substitutes c 2 is upper but not lower hemicontinuous.
21 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.
22 Continuity Concepts for Correspondences G(θ) is both upper and lower hemicontinuous. Hence G(θ) is continuous.
23 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(θ)?
24 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.
25 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.
26 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.
27 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.
28 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.
29 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.
30 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.
31 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.
32 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.
33 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 (θ)?
34 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.
35 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 )
36 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 (θ).
37 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.
38 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.
39 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.
40 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 )?
41 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.
42 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 ).
43 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.
44 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.
45 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.
46 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.
A LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationEconomics 204 Summer/Fall 2017 Lecture 7 Tuesday July 25, 2017
Economics 204 Summer/Fall 2017 Lecture 7 Tuesday July 25, 2017 Section 2.9. Connected Sets Definition 1 Two sets A, B in a metric space are separated if Ā B = A B = A set in a metric space is connected
More informationProperties of Walrasian Demand
Properties of Walrasian Demand Econ 2100 Fall 2017 Lecture 5, September 12 Problem Set 2 is due in Kelly s mailbox by 5pm today Outline 1 Properties of Walrasian Demand 2 Indirect Utility Function 3 Envelope
More informationWeek 5 Lectures 13-15
Week 5 Lectures 13-15 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all
More informationEcon Lecture 7. Outline. 1. Connected Sets 2. Correspondences 3. Continuity for Correspondences
Econ 204 2011 Lecture 7 Outline 1. Connected Sets 2. Correspondences 3. Continuity for Correspondences 1 Connected Sets Definition 1. Two sets A, B in a metric space are separated if Ā B = A B = A set
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationLecture 7. Econ August 18
Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar
More informationPreliminary draft only: please check for final version
ARE211, Fall2012 ANALYSIS6: TUE, SEP 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 6) Contents 1. Analysis (cont) 1 1.9. Continuous Functions 1 1.9.1. Weierstrass (extreme value) theorem 3 1.10. An inverse image
More informationMathematical Appendix
Ichiro Obara UCLA September 27, 2012 Obara (UCLA) Mathematical Appendix September 27, 2012 1 / 31 Miscellaneous Results 1. Miscellaneous Results This first section lists some mathematical facts that were
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationMath 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.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More information2.4 The Extreme Value Theorem and Some of its Consequences
2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or
More informationLecture 5: The Bellman Equation
Lecture 5: The Bellman Equation Florian Scheuer 1 Plan Prove properties of the Bellman equation (In particular, existence and uniqueness of solution) Use this to prove properties of the solution Think
More informationMathematics II, course
Mathematics II, course 2013-2014 Juan Pablo Rincón Zapatero October 24, 2013 Summary: The course has four parts that we describe below. (I) Topology in Rn is a brief review of the main concepts and properties
More information3 Lecture Separation
3 Lecture 3 3.1 Separation We are now going to move on to an extremely useful set of results called separation theorems. Basically, these theorems tell us that, if we have two convex sets, then we can
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationEC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries
EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going
More information3 Measurable Functions
3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability
More informationMATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.
MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for
More informationBayesian Persuasion Online Appendix
Bayesian Persuasion Online Appendix Emir Kamenica and Matthew Gentzkow University of Chicago June 2010 1 Persuasion mechanisms In this paper we study a particular game where Sender chooses a signal π whose
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationMath 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
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationNotes on Measure Theory and Markov Processes
Notes on Measure Theory and Markov Processes Diego Daruich March 28, 2014 1 Preliminaries 1.1 Motivation The objective of these notes will be to develop tools from measure theory and probability to allow
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationMetric 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:
Metric Spaces DEF. A metric space X or (X; d) is a nonempty set X together with a function d : X X! [0; 1) such that for all x; y; and z in X : 1. d (x; y) 0 with equality i x = y 2. d (x; y) = d (y; x)
More informationDynamic Programming Theorems
Dynamic Programming Theorems Prof. Lutz Hendricks Econ720 September 11, 2017 1 / 39 Dynamic Programming Theorems Useful theorems to characterize the solution to a DP problem. There is no reason to remember
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More informationBoundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption
Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption Chiaki Hara April 5, 2004 Abstract We give a theorem on the existence of an equilibrium price vector for an excess
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More information15 Real Analysis II Sequences and Limits , Math for Economists Fall 2004 Lecture Notes, 10/21/2004
14.102, Math for Economists Fall 2004 Lecture Notes, 10/21/2004 These notes are primarily based on those written by Andrei Bremzen for 14.102 in 2002/3, and by Marek Pycia for the MIT Math Camp in 2003/4.
More information2.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 α.
Chapter 2. Basic Topology. 2.3 Compact Sets. 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 α. 2.32 Definition A subset
More informationDepartment of Economics Working Paper Series
Department of Economics Working Paper Series On the Existence and Characterization of Markovian Equilibrium in Models with Simple Non-Paternalistic Altruism Olivier F. Morand University of Connecticut
More informationMathematical Methods in Economics (Part I) Lecture Note
Mathematical Methods in Economics (Part I) Lecture Note Kai Hao Yang 09/03/2018 Contents 1 Basic Topology and Linear Algebra 4 1.1 Review of Metric Space and Introduction of Topological Space........ 4
More informationModule MA3486: Fixed Point Theorems and Economic Equilibria Hilary Term 2016 Appendices
Module MA3486: Fixed Point Theorems and Economic Equilibria Hilary Term 2016 Appendices D. R. Wilkins Copyright c David R. Wilkins 2013 2018 Contents A Proofs of Basic Results of Real Analysis 67 B Alternative
More information106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)
106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationStat 8931 (Exponential Families) Lecture Notes The Eggplant that Ate Chicago (the Notes that Got out of Hand) Charles J. Geyer November 2, 2016
Stat 8931 (Exponential Families) Lecture Notes The Eggplant that Ate Chicago (the Notes that Got out of Hand) Charles J. Geyer November 2, 2016 1 Extended Real Numbers The extended real number system R
More informationRecursive Methods. Introduction to Dynamic Optimization
Recursive Methods Nr. 1 Outline Today s Lecture finish off: theorem of the maximum Bellman equation with bounded and continuous F differentiability of value function application: neoclassical growth model
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationBest approximations in normed vector spaces
Best approximations in normed vector spaces Mike de Vries 5699703 a thesis submitted to the Department of Mathematics at Utrecht University in partial fulfillment of the requirements for the degree of
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationTijmen Daniëls Universiteit van Amsterdam. Abstract
Pure strategy dominance with quasiconcave utility functions Tijmen Daniëls Universiteit van Amsterdam Abstract By a result of Pearce (1984), in a finite strategic form game, the set of a player's serially
More informationADVANCE TOPICS IN ANALYSIS - REAL. 8 September September 2011
ADVANCE TOPICS IN ANALYSIS - REAL NOTES COMPILED BY KATO LA Introductions 8 September 011 15 September 011 Nested Interval Theorem: If A 1 ra 1, b 1 s, A ra, b s,, A n ra n, b n s, and A 1 Ě A Ě Ě A n
More informationEC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1
EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationR N Completeness and Compactness 1
John Nachbar Washington University in St. Louis October 3, 2017 R N Completeness and Compactness 1 1 Completeness in R. As a preliminary step, I first record the following compactness-like theorem about
More informationMATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.
MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if
More informationABSTRACT ALGEBRA: A PRESENTATION ON PROFINITE GROUPS
ABSTRACT ALGEBRA: A PRESENTATION ON PROFINITE GROUPS JULIA PORCINO Our brief discussion of the p-adic integers earlier in the semester intrigued me and lead me to research further into this topic. That
More informationMTG 5316/4302 FALL 2018 REVIEW FINAL
MTG 5316/4302 FALL 2018 REVIEW FINAL JAMES KEESLING Problem 1. Define open set in a metric space X. Define what it means for a set A X to be connected in a metric space X. Problem 2. Show that if a set
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More information1 Jan 28: Overview and Review of Equilibrium
1 Jan 28: Overview and Review of Equilibrium 1.1 Introduction What is an equilibrium (EQM)? Loosely speaking, an equilibrium is a mapping from environments (preference, technology, information, market
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko
ECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko Indirect Utility Recall: static consumer theory; J goods, p j is the price of good j (j = 1; : : : ; J), c j is consumption
More informationANALYSIS WORKSHEET II: METRIC SPACES
ANALYSIS WORKSHEET II: METRIC SPACES Definition 1. A metric space (X, d) is a space X of objects (called points), together with a distance function or metric d : X X [0, ), which associates to each pair
More informationStochastic Dynamic Programming: The One Sector Growth Model
Stochastic Dynamic Programming: The One Sector Growth Model Esteban Rossi-Hansberg Princeton University March 26, 2012 Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, 2012 1 / 31 References
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More information1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.
Advanced Calculus I, Dr. Block, Chapter 2 notes. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. 2. Definition. A sequence is a real-valued function
More informationEquilibrium Analysis of Dynamic Economies
Equilibrium Analysis of Dynamic Economies Preliminary Version Juan Manuel Licari Department of Economics University of Pennsylvania April, 2005 Abstract We study equilibrium properties of discrete-time,
More informationWalker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015
Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of
More informationSequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.
Sequences Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Usually, instead of using the notation s(n), we write s n for the value of this function calculated at n. We
More informationProhorov s theorem. Bengt Ringnér. October 26, 2008
Prohorov s theorem Bengt Ringnér October 26, 2008 1 The theorem Definition 1 A set Π of probability measures defined on the Borel sets of a topological space is called tight if, for each ε > 0, there is
More informationChapter 4. Maximum Theorem, Implicit Function Theorem and Envelope Theorem
Chapter 4. Maximum Theorem, Implicit Function Theorem and Envelope Theorem This chapter will cover three key theorems: the maximum theorem (or the theorem of maximum), the implicit function theorem, and
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationDefinition 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 :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationThis exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT25-2 Summer Session 2 207 Practice Final August 24th, 207 Time Limit: Hour 40 Minutes Name: Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More informationOptimization. A first course on mathematics for economists
Optimization. A first course on mathematics for economists Xavier Martinez-Giralt Universitat Autònoma de Barcelona xavier.martinez.giralt@uab.eu II.3 Static optimization - Non-Linear programming OPT p.1/45
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationIntroduction to Convex Analysis Microeconomics II - Tutoring Class
Introduction to Convex Analysis Microeconomics II - Tutoring Class Professor: V. Filipe Martins-da-Rocha TA: Cinthia Konichi April 2010 1 Basic Concepts and Results This is a first glance on basic convex
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More informationDirect Limits. Mathematics 683, Fall 2013
Direct Limits Mathematics 683, Fall 2013 In this note we define direct limits and prove their basic properties. This notion is important in various places in algebra. In particular, in algebraic geometry
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationCompetitive Market Mechanisms as Social Choice Procedures
Competitive Market Mechanisms as Social Choice Procedures Peter J. Hammond 1 Department of Economics, Stanford University, CA 94305-6072, U.S.A. 1 Introduction and outline 1.1 Markets and social choice
More informationi c Robert C. Gunning
c Robert C. Gunning i ii MATHEMATICS 218: NOTES Robert C. Gunning January 27, 2010 ii Introduction These are notes of honors courses on calculus of several variables given at Princeton University during
More informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) November 6, 2015 1 Lecture 18 1.1 The convex hull Let X be any vector space, and E X a subset. Definition 1.1. The convex hull of E is the
More information1 Lecture 4: Set topology on metric spaces, 8/17/2012
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture : Set topology on metric spaces, 8/17/01 Definition 1.1. Let (X, d) be a metric space; E is a subset of X. Then: (i) x E is an interior
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationMORE ON CONTINUOUS FUNCTIONS AND SETS
Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly
More informationContents. An example 5. Mathematical Preliminaries 13. Dynamic programming under certainty 29. Numerical methods 41. Some applications 57
T H O M A S D E M U Y N C K DY N A M I C O P T I M I Z AT I O N Contents An example 5 Mathematical Preliminaries 13 Dynamic programming under certainty 29 Numerical methods 41 Some applications 57 Stochastic
More informationAnalogy Principle. Asymptotic Theory Part II. James J. Heckman University of Chicago. Econ 312 This draft, April 5, 2006
Analogy Principle Asymptotic Theory Part II James J. Heckman University of Chicago Econ 312 This draft, April 5, 2006 Consider four methods: 1. Maximum Likelihood Estimation (MLE) 2. (Nonlinear) Least
More informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More information1 Stochastic Dynamic Programming
1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationChapter 1 - Preference and choice
http://selod.ensae.net/m1 Paris School of Economics (selod@ens.fr) September 27, 2007 Notations Consider an individual (agent) facing a choice set X. Definition (Choice set, "Consumption set") X is a set
More informationThe Tychonoff Theorem
Requirement for Department of Mathematics Lovely Professional University Punjab, India February 7, 2014 Outline Ordered Sets Requirement for 1 Ordered Sets Outline Ordered Sets Requirement for 1 Ordered
More informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
More informationThe Uniform Weak Law of Large Numbers and the Consistency of M-Estimators of Cross-Section and Time Series Models
The Uniform Weak Law of Large Numbers and the Consistency of M-Estimators of Cross-Section and Time Series Models Herman J. Bierens Pennsylvania State University September 16, 2005 1. The uniform weak
More informationStochastic Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania
Stochastic Dynamic Programming Jesus Fernande-Villaverde University of Pennsylvania 1 Introducing Uncertainty in Dynamic Programming Stochastic dynamic programming presents a very exible framework to handle
More informationMidterm 1 Solutions Thursday, February 26
Math 59 Dr. DeTurck Midterm 1 Solutions Thursday, February 26 1. First note that since f() = f( + ) = f()f(), we have either f() = (in which case f(x) = f(x + ) = f(x)f() = for all x, so c = ) or else
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationEcon 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS. Carmen Astorne-Figari Washington University in St. Louis.
Econ 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS Carmen Astorne-Figari Washington University in St. Louis August 12, 2010 INTRODUCTION General form of an optimization problem: max x f
More informationAnalysis and Linear Algebra. Lectures 1-3 on the mathematical tools that will be used in C103
Analysis and Linear Algebra Lectures 1-3 on the mathematical tools that will be used in C103 Set Notation A, B sets AcB union A1B intersection A\B the set of objects in A that are not in B N. Empty set
More informationGeneralized Neyman Pearson optimality of empirical likelihood for testing parameter hypotheses
Ann Inst Stat Math (2009) 61:773 787 DOI 10.1007/s10463-008-0172-6 Generalized Neyman Pearson optimality of empirical likelihood for testing parameter hypotheses Taisuke Otsu Received: 1 June 2007 / Revised:
More informationStochastic convexity in dynamic programming
Economic Theory 22, 447 455 (2003) Stochastic convexity in dynamic programming Alp E. Atakan Department of Economics, Columbia University New York, NY 10027, USA (e-mail: aea15@columbia.edu) Received:
More informationWe 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
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationWe will begin our study of topology from a set-theoretic point of view. As the subject
p. 1 Math 490-01 Notes 5 Topology We will begin our study of topology from a set-theoretic point of view. As the subject expands, we will encounter various notions from analysis such as compactness, continuity,
More information