Stochastic Dynamic Programming: The One Sector Growth Model
|
|
- Christal Parrish
- 5 years ago
- Views:
Transcription
1 Stochastic Dynamic Programming: The One Sector Growth Model Esteban Rossi-Hansberg Princeton University March 26, 2012 Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
2 References We will study stochastic dynamic programing using the application in Section 13.3 in SLP. It requires previous knowledge of Chapters 8 to 12. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
3 Sequential Problem The problem we will study is given in sequential form by } max E {y t } t=0 { β t U (x t y t ) t=0 s.t. x t+1 = z t f (y t ) t = 0, 1,... 0 y t x t t = 0, 1,... x 0 0 given Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
4 Recursive Problem The functional equation of this problem is given by [ ] v (x) = max U (x y) + β v [f (y) z] µ (dz) 0 y x (1) where x is the quantity of output, y is the quantity carried over as capital for for next period s production, and x y is the quantity consumed. Next period, a technology shock z is realized which is drawn from the distribution µ, and so f (y) z units of output are produced tomorrow. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
5 Utility We impose the following assumptions on utility: U1: 0 < β < 1; U2: U is continuous; U3: U is strictly increasing; U4: U is strictly concave; U5: U is continuously differentiable. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
6 Technology We also impose the following assumptions on technology: T1: f is continuous; T2: f (0) > 0, and for some x > 0 : x f (x) x, all 0 x x, and f (x) < x all x > x. Used to bound the state space. In particular define the state space to be given by X = [0, x] with Borel sets X T3: f is strictly increasing; T4: f is (weakly) concave; T5: f is continuously differentiable and βf (0) > 1. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
7 Technology We will impose the following assumptions on technology shocks: Z1: Z = [1, z], where 1 < z < +, with Borel sets Z; Used for the integral of the functional equation to be well defined. Remember that a Borel Algebra is the smallest σ algebra in R containing all open sets. Any set in this σ-algebra is called a Borel set. Z2: {z t } is an i.i.d. sequence of shocks, each drawn according to the probability measure µ on (Z, Z) Needed in order for z not to be a state variable. Z3: For some α > 0, µ ((a, b]) α (b a), all (a, b] Z. So that µ assigns probability to all nondegenerate subintervals in Z. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
8 Existence and Uniqueness of Value Function Lemma There is a unique bounded continuous function v : X R satisfying [ ] v (x) = max U (x y) + β v [f (y) z] µ (dz) 0 y x Furthermore v is strictly increasing and strictly concave. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
9 Proof: Blackwell To prove this we want to use Theorem 9.6 in SLP which in turn uses Theorem 4.6 which is an application of the Theorem of the Maximum and the Contraction Mapping Theorem. In particular, we want to prove that the Blackwell suffi cient conditions for a contraction hold. A contraction (with modeulus β (0, 1)) is defined as an operator T : S S, where (S, ρ) is a metric space, such that ρ (Tx, Ty) βρ (x, y) all x, y S. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
10 Proof: Blackwell The Blackwell suffi cient conditions are given by: 1 Monotonicity: If B (X ) is the space of bounded functions on X with the sup norm, and T : B (X ) B (X ) is a functional operator. If f, g B (X ) and f (x) g (x), all x X (Tf ) (x) (Tg) (x), all x X. 2 Discounting: There exists some β (0, 1) such that all f B (X ), a 0, x X. [T (f + a)] (x) (Tf ) (x) + βa, If this conditions are satisfied, Theorem 3.3. in SLP guarantees that the operator T is a contraction. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
11 Proof: CMT If T is a contraction, then the Contraction Mapping Theorem (3.2 in SLP) says that if (B (X ), ρ) is a complete metric space Remember, a space with a metric (positive distance, symmetry, and triangle inequality) and every Cauchy sequence converges for all ε > 0, N (ε) s.t. ρ (x n, x m ) < ε all n, m > N (ε)) and T is a contraction then T has a unique fixed point v and for any v 0, ρ (T n v 0, v) β n ρ (v 0, v). Theorem 4.6 is an application of this result for bounded continuous functions. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
12 Proof: Theorem of the Maximum We can use the Theorem of the Maximum to say that the policy correspondence is compact valued and u.h.c. The Theorem of the Maximum says that if we have two functions defined by h (x) = max f (x, y) y Γ(x ) G (x) = {y Γ (x) : f (x, y) = h (x)} where f is continuous and Γ is compact valued and continuous correspondence. Then h is continuous and G is non-empty compact-valued and u.h.c for every sequence x n x and every sequence{y n } such that y n Γ (x n ), all n, there exists a convergent subsequence of y n whose limit point y is in Γ (x) (no open boundaries) Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
13 Proof: CMT and Theorem of the Maximum For our purposes we need to show none of these arguments fails because of the integral in (1). In particular we need to show that v [f (y) z] µ (dz) is bounded and continuous if v and f are bounded and continuous. This is trivially true in this case since the conditional probability of z given z is the same as the unconditional probability. That is, the transition function for the state is such that Q (z, dz ) = µ (dz ). If this was not the case we would need to guarantee that Q satisfies the Feller property, namely that if f is bounded and continuous, f ( z ) Q ( z, dz ) is also bounded and continuous, which is equivalent to Q being continuous in z. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
14 Proof: Increasing To show that v is strictly increasing, we will use a corollary of the Contraction Mapping Theorem. First note that the space of bounded, continuous and weakly increasing and weakly concave functions is a complete metric space. Given this, if the operator T maps this set into the set of strictly increasing and concave functions, we know that the fixed point has to be strictly increasing and strictly concave. Because of U3 the operator maps increasing functions into strictly increasing ones. And because of U4 the same is true for concavity in x and y. Note that Γ (x) = [0, x] is also increasing in x. Hence v is strictly increasing. For all θ [0, 1] if y Γ (x) and y Γ (x ) θy + (1 θ) y Γ ( θx + (1 θ) x ). Hence v strictly increasing and concave. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
15 Characterization of the Policy Function Lemma The policy function g : X X is single valued, continuous, and strictly increasing, with g (0) = 0 and 0 < g (x) < x, all 0 < x x. Furthermore the consumption function c : X X defined by c (x) = x g (x) is also strictly increasing. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
16 Proof The first part comes from the fact that we are maximizing a continuous and strictly concave function in a convex set, so there is a unique maximum. Since a single valued u.h.c. correspondence is a continuous function g is continuous. To show that g is increasing, suppose not. Then for x > x, U (x g (x)) U ( x g ( x )) which implies by the first order condition, U (x g (x)) = β v [f (g (x)) z] f (g (x)) zµ (dz), that v [f (g (x)) z] f (g (x))zµ (dz) v [ f ( g ( x )) z ] f ( g ( x )) zµ (d a contradiction with v strictly concave. Hence g is strictly increasing. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
17 Proof To show that g (0) = 0 notice that Γ (0) = {0}, and for some x, such that 0 < g (x) < x suppose g (x) = x. Tthis implies, that since g (x) is strictly increasing that g (g (x)) = g (x). But next period we need g (f (g (x)) z) = g (x) all z. But g (f (g (x)) z) > g (g (x)) = g (x), for some z. A contradiction. To show that c (x) is increasing, notice that since v is strictly concave, x > x implies v (x) < v (x) and so by T3, T4, and g increasing v [f (g (x)) z] f (g (x) zµ (dz) < v [ f ( g ( x )) z ] f ( g ( x )) zµ (d which implies that So by U4 c (x) is increasing. U (c (x)) < U ( c ( x )). Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
18 Differentiability Lemma v is continuously differentiable with v (x) = U [x g (x)]. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
19 Proof: Benaviste and Scheinkman With assumptions U4 and U5 this is just an application of the Benaviste and Scheinkman Theorem (SLP 4.10): v is differentiable at x if there exists a concave, differentiable function W (x) defined on a neighborhood of x with the property that W (x) v (x) with = if x = x, on that neighborhood. Define W (x) = U (x g (x )) + β v [f (g (x )) z] µ (dz), then since g (x ) maximizes the RHS for x = x we know that W (x) < v (x). Clearly W (x) = U [x g (x)]. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
20 Euler Equation The Euler equation for this problem is therefore given by U (c (x)) = β U [c (f (g (x)) z)] f (g (x))zµ (dz), (2) and the policy function defines a Markov process on X corresponding to the stochastic equation x t+1 = f (g (x t )) z t+1. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
21 Transition Function We can define the transition function P using f, g and µ. For this, define the transition function P by P (x, A) = µ (z Z : f (g (x)) z A), all A X. In principle need to show that P (x, ) is a probability measure (see Theorem 8.9). Notice that since f and g are continuous we know that h ( x ) P ( x, dx ) = h (f (g (x)) z) µ (dz) X and so if h is a continuous function, the Lebesgue Dominated Convergence Theorem implies that if x n x h (f (g (x n )) z) µ (dz) = h (f (g (x)) z) µ (dz). lim n Z Hence P has the Feller property. Since X is compact, we can conclude that: Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31 Z Z
22 Invariant Measure Lemma P has at least one invariant measure. See Theorem in SLP. The proof is an application of Helly s Theorem that states that if {µ n } is a sequence of probability measures on ( R l, B ) with the property that (i) for some a, b R l, µ n ((, a]) = 0 and µ n ((, b]) = 1, n = 1, 2,... Then there exists a probability measure µ with µ ((, a]) = 0 and µ ((, b]) = 1 and a subsequence of {µ n } that converges to it. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
23 Weak Convergence We now want to prove that this invariant measure λ is unique and that the system converges weakly to it from any initial condition. That is T n λ 0 λ. The notation is defined by the operator T. It is an operator that maps distributions today, given the transition function, into distributions tomorrow. In particular, in our example, (T λ 0 ) (A) = P (x, A) λ 0 (dx). A sequence of measures is said to converge weakly if for f C (S) (the set of bounded continuous functions) fdλ n = fdλ or lim n x lim λ n (A) = λ (A) all A X. n Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
24 Unique Invariant Measure To prove this we want to apply Theorem in SLP. The key to prove this result is to show that P is monotone ( f nondecreasing Tf (x) = f (x ) P (x, dx )), has the Feller property, and satisfies the Mixing condition. The Mixing conditions says that: There exists c X, ε > 0, and N 1 such that P N (0, [c, x]) ε and P N ( x, [0, c]) ε. Monotone: Notice that in this case the fact that g is strictly increasing implies that the LHS of h ( x ) P ( x, dx ) = h (f (g (x)) z) µ (dz) X is strictly increasing and so P is monotone (the conditional expectation operator associated maps monotone into monotone functions). Feller: Shown above. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31 Z
25 Mixing Mixing: This is in general the hardest part of these problems. Let z be the mean of µ, that is, z = zµ (dz) and let x be the unique value satisfying βf [g (x )] z = 1. (3) We want to show that the mixing condition holds for point x. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
26 Mixing For any x X and z Z define the sequence {φ n (x, z)} by φ 0 (x, z) = x, φ n+1 (x, z) = f [g (φ n (x, z))] z, n = 0, 1, 2,... Note that φ n (x, z) is the quantity of goods available at the beginning of period n if x is the quantity at the beginning of period 0 and the shock is constant at z. Note also that since f and g are continuous and strictly increasing, φ n is also continuous and strictly increasing in both arguments. This implies by Z3 that P n (x, (φ n (x, z δ), φ n (x, z)]) = (µ (δ)) n α n δ n and P n (x, (φ n (x, 1), φ n (x, 1 + δ)]) = (µ (δ)) n α n δ n. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
27 Mixing We want to use these two inequalities to show the result. Consider the case of x = 0, and therefore the sequence {φ n (0, z)}. Since φ 0 (0, z) = 0 < f (0) z = f [g (0)] z = φ 1 (0, z), it follows by induction, since f and g are monotone, that the sequence is nondecreasing. Note that here assumption T5 is crucial, if it is not satisfied then {0} is an ergodic set. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
28 Mixing Since the sequence is bounded above by x, it converges to some value ξ X, where ξ = f [g (ξ)] z. Hence, from the first order condition in (2) U [c (ξ)] = β U [c (f [g (ξ)] z)] f [g (ξ)] zµ (dz) ( )] ξz = βf [g (ξ)] U [c zµ (dz) z > βf [g (ξ)] U [c (ξ)] zµ (dz) = βf [g (ξ)] U [c (ξ)] z, where the inequality follows from z/ z < 1 and U4. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
29 Mixing So 1 > βf [g (ξ)] z which implies by (3) and T4 that ξ > x. Hence there exists an N 1 such that φ N (0, z) > x, and a δ > 0 such that φ N (0, z δ) > x. Hence and so x < φ N (0, z δ) < φ N (0, z) < x, P N (0, (x, x]) P N (0, (φ N (0, z δ), φ N (0, z)]) α n δ n. This shows the first part of the result. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
30 Mixing To show the second, consider the sequence {φ n ( x, 1)} which is such that φ 0 ( x, z) = x > f ( x) f [g ( x)] = φ 1 ( x, 1). Thus by induction and f and g nondecreasing, the sequence is nonincreasing. Since it is bounded from below by 0, it converges to a value υ = f [g (υ)]. And so U [c (υ)] = β U [c (f [g (υ)] z)] f [g (υ)] zµ (dz) = βf [g (υ)] U [c (υz)] zµ (dz) < βf [g (υ)] U [c (υ)] zµ (dz) = βf [g (υ)] U [c (υ)] z, where the inequality follows from z Z. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
31 Mixing Hence 1 < βf [g (υ)] z and by T4 υ < x. As before, choose N 1 such that φ N ( x, 1) < x, and a δ > 0 such that φ N ( x, 1 + δ) < x. Hence and so x > φ N ( x, 1 + δ) > φ N ( x, 1) > 0, P N ( x, (0, x ]) P N ( x, (φ N ( x, 1), φ N ( x, 1 + δ)]) α n δ n. Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, / 31
Lecture 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 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 informationOutline Today s Lecture
Outline Today s Lecture finish Euler Equations and Transversality Condition Principle of Optimality: Bellman s Equation Study of Bellman equation with bounded F contraction mapping and theorem of the maximum
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 informationMacro 1: Dynamic Programming 1
Macro 1: Dynamic Programming 1 Mark Huggett 2 2 Georgetown September, 2016 DP Warm up: Cake eating problem ( ) max f 1 (y 1 ) + f 2 (y 2 ) s.t. y 1 + y 2 100, y 1 0, y 2 0 1. v 1 (x) max f 1(y 1 ) + f
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 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 informationBasic Deterministic Dynamic Programming
Basic Deterministic Dynamic Programming Timothy Kam School of Economics & CAMA Australian National University ECON8022, This version March 17, 2008 Motivation What do we do? Outline Deterministic IHDP
More informationEconomics 8105 Macroeconomic Theory Recitation 3
Economics 8105 Macroeconomic Theory Recitation 3 Conor Ryan September 20th, 2016 Outline: Minnesota Economics Lecture Problem Set 1 Midterm Exam Fit Growth Model into SLP Corollary of Contraction Mapping
More informationEconomics 2010c: Lecture 2 Iterative Methods in Dynamic Programming
Economics 2010c: Lecture 2 Iterative Methods in Dynamic Programming David Laibson 9/04/2014 Outline: 1. Functional operators 2. Iterative solutions for the Bellman Equation 3. Contraction Mapping Theorem
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
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 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 informationAdvanced Economic Growth: Lecture 21: Stochastic Dynamic Programming and Applications
Advanced Economic Growth: Lecture 21: Stochastic Dynamic Programming and Applications Daron Acemoglu MIT November 19, 2007 Daron Acemoglu (MIT) Advanced Growth Lecture 21 November 19, 2007 1 / 79 Stochastic
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 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 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 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 informationEconomics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011
Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure
More informationThe Principle of Optimality
The Principle of Optimality Sequence Problem and Recursive Problem Sequence problem: Notation: V (x 0 ) sup {x t} β t F (x t, x t+ ) s.t. x t+ Γ (x t ) x 0 given t () Plans: x = {x t } Continuation plans
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationand C be the space of continuous and bounded real-valued functions endowed with the sup-norm 1.
1 Proof T : C C Let T be the following mapping: Tϕ = max {u (x, a)+βeϕ [f (x, a, ε)]} (1) a Γ(x) and C be the space of continuous and bounded real-valued functions endowed with the sup-norm 1. Proposition
More informationUNIVERSITY OF VIENNA
WORKING PAPERS Cycles and chaos in the one-sector growth model with elastic labor supply Gerhard Sorger May 2015 Working Paper No: 1505 DEPARTMENT OF ECONOMICS UNIVERSITY OF VIENNA All our working papers
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationSocial Welfare Functions for Sustainable Development
Social Welfare Functions for Sustainable Development Thai Ha-Huy, Cuong Le Van September 9, 2015 Abstract Keywords: criterion. anonymity; sustainable development, welfare function, Rawls JEL Classification:
More informationNonparametric one-sided testing for the mean and related extremum problems
Nonparametric one-sided testing for the mean and related extremum problems Norbert Gaffke University of Magdeburg, Faculty of Mathematics D-39016 Magdeburg, PF 4120, Germany E-mail: norbert.gaffke@mathematik.uni-magdeburg.de
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationSlides II - Dynamic Programming
Slides II - Dynamic Programming Julio Garín University of Georgia Macroeconomic Theory II (Ph.D.) Spring 2017 Macroeconomic Theory II Slides II - Dynamic Programming Spring 2017 1 / 32 Outline 1. Lagrangian
More informationLecture 4: Dynamic Programming
Lecture 4: Dynamic Programming Fatih Guvenen January 10, 2016 Fatih Guvenen Lecture 4: Dynamic Programming January 10, 2016 1 / 30 Goal Solve V (k, z) =max c,k 0 u(c)+ E(V (k 0, z 0 ) z) c + k 0 =(1 +
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 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 informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
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 informationLecture 1: Dynamic Programming
Lecture 1: Dynamic Programming Fatih Guvenen November 2, 2016 Fatih Guvenen Lecture 1: Dynamic Programming November 2, 2016 1 / 32 Goal Solve V (k, z) =max c,k 0 u(c)+ E(V (k 0, z 0 ) z) c + k 0 =(1 +
More informationPaul-Eugène Parent. March 12th, Department of Mathematics and Statistics University of Ottawa. MAT 3121: Complex Analysis I
Paul-Eugène Parent Department of Mathematics and Statistics University of Ottawa March 12th, 2014 Outline 1 Holomorphic power Series Proposition Let f (z) = a n (z z o ) n be the holomorphic function defined
More informationDYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION
DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION UNIVERSITY OF MARYLAND: ECON 600. Alternative Methods of Discrete Time Intertemporal Optimization We will start by solving a discrete time intertemporal
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationAccuracy Properties of the Statistics from Numerical Simulations
Accuracy Properties of the Statistics from Numerical Simulations Manuel S. Santos Department of Economics Arizona State University Adrian Peralta-Alva Department of Economics University of Minnesota and
More informationWeak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria
Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then
More informationThe Kadec-Pe lczynski theorem in L p, 1 p < 2
The Kadec-Pe lczynski theorem in L p, 1 p < 2 I. Berkes and R. Tichy Abstract By a classical result of Kadec and Pe lczynski (1962), every normalized weakly null sequence in L p, p > 2 contains a subsequence
More informationSolution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1
Solution Sangchul Lee March, 018 1 Solution of Homework 7 Problem 1.1 For a given k N, Consider two sequences (a n ) and (b n,k ) in R. Suppose that a n b n,k for all n,k N Show that limsup a n B k :=
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationEstimation of Dynamic Regression Models
University of Pavia 2007 Estimation of Dynamic Regression Models Eduardo Rossi University of Pavia Factorization of the density DGP: D t (x t χ t 1, d t ; Ψ) x t represent all the variables in the economy.
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 informationMeasures and Measure Spaces
Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture 6: Uniformly continuity and sequence of functions 1.1 Uniform Continuity Definition 1.1 Let (X, d 1 ) and (Y, d ) are metric spaces and
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More information2. What is the fraction of aggregate savings due to the precautionary motive? (These two questions are analyzed in the paper by Ayiagari)
University of Minnesota 8107 Macroeconomic Theory, Spring 2012, Mini 1 Fabrizio Perri Stationary equilibria in economies with Idiosyncratic Risk and Incomplete Markets We are now at the point in which
More informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More informationContents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.
Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationADVANCED MACROECONOMIC TECHNIQUES NOTE 3a
316-406 ADVANCED MACROECONOMIC TECHNIQUES NOTE 3a Chris Edmond hcpedmond@unimelb.edu.aui Dynamic programming and the growth model Dynamic programming and closely related recursive methods provide an important
More informationASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES ABSTRACT
ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES T. DOMINGUEZ-BENAVIDES, M.A. KHAMSI AND S. SAMADI ABSTRACT In this paper, we prove that if ρ is a convex, σ-finite modular function satisfying
More information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationExamples of Dual Spaces from Measure Theory
Chapter 9 Examples of Dual Spaces from Measure Theory We have seen that L (, A, µ) is a Banach space for any measure space (, A, µ). We will extend that concept in the following section to identify an
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 informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationLecture 6: Contraction mapping, inverse and implicit function theorems
Lecture 6: Contraction mapping, inverse and implicit function theorems 1 The contraction mapping theorem De nition 11 Let X be a metric space, with metric d If f : X! X and if there is a number 2 (0; 1)
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationSimple Consumption / Savings Problems (based on Ljungqvist & Sargent, Ch 16, 17) Jonathan Heathcote. updated, March The household s problem X
Simple Consumption / Savings Problems (based on Ljungqvist & Sargent, Ch 16, 17) subject to for all t Jonathan Heathcote updated, March 2006 1. The household s problem max E β t u (c t ) t=0 c t + a t+1
More informationValue Iteration and Action ɛ-approximation of Optimal Policies in Discounted Markov Decision Processes
Value Iteration and Action ɛ-approximation of Optimal Policies in Discounted Markov Decision Processes RAÚL MONTES-DE-OCA Departamento de Matemáticas Universidad Autónoma Metropolitana-Iztapalapa San Rafael
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 informationUniversity of Warwick, EC9A0 Maths for Economists Lecture Notes 10: Dynamic Programming
University of Warwick, EC9A0 Maths for Economists 1 of 63 University of Warwick, EC9A0 Maths for Economists Lecture Notes 10: Dynamic Programming Peter J. Hammond Autumn 2013, revised 2014 University of
More informationChapter II. Metric Spaces and the Topology of C
II.1. Definitions and Examples of Metric Spaces 1 Chapter II. Metric Spaces and the Topology of C Note. In this chapter we study, in a general setting, a space (really, just a set) in which we can measure
More informationChapter 3. Dynamic Programming
Chapter 3. Dynamic Programming This chapter introduces basic ideas and methods of dynamic programming. 1 It sets out the basic elements of a recursive optimization problem, describes the functional equation
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 information01. Review of metric spaces and point-set topology. 1. Euclidean spaces
(October 3, 017) 01. Review of metric spaces and point-set topology Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 017-18/01
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 information5 Birkhoff s Ergodic Theorem
5 Birkhoff s Ergodic Theorem Birkhoff s Ergodic Theorem extends the validity of Kolmogorov s strong law to the class of stationary sequences of random variables. Stationary sequences occur naturally even
More informationElements of Convex Optimization Theory
Elements of Convex Optimization Theory Costis Skiadas August 2015 This is a revised and extended version of Appendix A of Skiadas (2009), providing a self-contained overview of elements of convex optimization
More informationLebesgue Integration on R n
Lebesgue Integration on R n The treatment here is based loosely on that of Jones, Lebesgue Integration on Euclidean Space We give an overview from the perspective of a user of the theory Riemann integration
More informationAn Application to Growth Theory
An Application to Growth Theory First let s review the concepts of solution function and value function for a maximization problem. Suppose we have the problem max F (x, α) subject to G(x, β) 0, (P) x
More informationSOLUTIONS TO SOME PROBLEMS
23 FUNCTIONAL ANALYSIS Spring 23 SOLUTIONS TO SOME PROBLEMS Warning:These solutions may contain errors!! PREPARED BY SULEYMAN ULUSOY PROBLEM 1. Prove that a necessary and sufficient condition that the
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationECON 2010c Solution to Problem Set 1
ECON 200c Solution to Problem Set By the Teaching Fellows for ECON 200c Fall 204 Growth Model (a) Defining the constant κ as: κ = ln( αβ) + αβ αβ ln(αβ), the problem asks us to show that the following
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 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 informationat time t, in dimension d. The index i varies in a countable set I. We call configuration the family, denoted generically by Φ: U (x i (t) x j (t))
Notations In this chapter we investigate infinite systems of interacting particles subject to Newtonian dynamics Each particle is characterized by its position an velocity x i t, v i t R d R d at time
More informationAn introduction to Mathematical Theory of Control
An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018
More informationDiscussion Class Notes
Department of Economics University of Minnesota Macroeconomic Theory Varadarajan V. Chari Spring 2015 Discussion Class Notes Keyvan Eslami The following notes are prepared as a complement to V.V. Chari
More informationStochastic Optimal Growth with a Non-Compact State Space
Federal Reserve Bank of Minneapolis Research Department Stochastic Optimal Growth with a Non-Compact State Space Yuzhe Zhang Working Paper 639 October 25 ABSTRACT This paper studies the stability of a
More informationLecture 3. Econ August 12
Lecture 3 Econ 2001 2015 August 12 Lecture 3 Outline 1 Metric and Metric Spaces 2 Norm and Normed Spaces 3 Sequences and Subsequences 4 Convergence 5 Monotone and Bounded Sequences Announcements: - Friday
More informationLecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.
Lecture 2 1 Martingales We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. 1.1 Doob s inequality We have the following maximal
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
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 informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationDynamic Discrete Choice Structural Models in Empirical IO
Dynamic Discrete Choice Structural Models in Empirical IO Lecture 4: Euler Equations and Finite Dependence in Dynamic Discrete Choice Models Victor Aguirregabiria (University of Toronto) Carlos III, Madrid
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 informationOptimal Growth Models and the Lagrange Multiplier
CORE DISCUSSION PAPER 2003/83 Optimal Growth Models and the Lagrange Multiplier Cuong Le Van, H. Cagri Saglam November 2003 Abstract We provide sufficient conditions on the objective functional and the
More informationCHAPTER 1. Metric Spaces. 1. Definition and examples
CHAPTER Metric Spaces. Definition and examples Metric spaces generalize and clarify the notion of distance in the real line. The definitions will provide us with a useful tool for more general applications
More informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationProblem Set 1: Solutions Math 201A: Fall Problem 1. Let (X, d) be a metric space. (a) Prove the reverse triangle inequality: for every x, y, z X
Problem Set 1: s Math 201A: Fall 2016 Problem 1. Let (X, d) be a metric space. (a) Prove the reverse triangle inequality: for every x, y, z X d(x, y) d(x, z) d(z, y). (b) Prove that if x n x and y n y
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More information