and C be the space of continuous and bounded real-valued functions endowed with the sup-norm 1.

Similar documents
Lecture 5: The Bellman Equation

Stochastic Dynamic Programming: The One Sector Growth Model

Recursive Methods. Introduction to Dynamic Optimization

Stochastic Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania

Banach Spaces V: A Closer Look at the w- and the w -Topologies

Moral Hazard: Characterization of SB

Mathematics II, course

The WhatPower Function à An Introduction to Logarithms

A SHORT INTRODUCTION TO BANACH LATTICES AND

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

AN INTRODUCTION TO MATHEMATICAL ANALYSIS ECONOMIC THEORY AND ECONOMETRICS

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

TWO MAPPINGS RELATED TO SEMI-INNER PRODUCTS AND THEIR APPLICATIONS IN GEOMETRY OF NORMED LINEAR SPACES. S.S. Dragomir and J.J.

Optimal Control. Macroeconomics II SMU. Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets

AP Exercise 1. This material is created by and is for your personal and non-commercial use only.

Course 212: Academic Year Section 1: Metric Spaces

Introduction to Functional Analysis

Economics 8105 Macroeconomic Theory Recitation 3

Social Welfare Functions for Sustainable Development

CITY UNIVERSITY OF HONG KONG

Fisica Matematica. Stefano Ansoldi. Dipartimento di Matematica e Informatica. Università degli Studi di Udine. Corso di Laurea in Matematica

4. Convex Sets and (Quasi-)Concave Functions

Lecture 7. Econ August 18

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

Preliminary draft only: please check for final version

No books, no notes, no calculators. You must show work, unless the question is a true/false, yes/no, or fill-in-the-blank question.

Brownian Motion and Conditional Probability

Name :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)(CSE/IT)/SEM-4/M-401/ MATHEMATICS - III

The fundamental theorem of linear programming

(c) For each α R \ {0}, the mapping x αx is a homeomorphism of X.

TRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN. School of Mathematics

Dynamic Programming Theorems

Weak Topologies, Reflexivity, Adjoint operators

1 Directional Derivatives and Differentiability

Fixed Term Employment Contracts. in an Equilibrium Search Model

Semi-infinite programming, duality, discretization and optimality conditions

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

Seventeen generic formulas that may generate prime-producing quadratic polynomials

THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS

Theorem 2. Let n 0 3 be a given integer. is rigid in the sense of Guillemin, so are all the spaces ḠR n,n, with n n 0.

SOME ELEMENTARY GENERAL PRINCIPLES OF CONVEX ANALYSIS. A. Granas M. Lassonde. 1. Introduction

Spaces with Ricci curvature bounded from below

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7

Microeconomics II. MOSEC, LUISS Guido Carli Problem Set n 3

Reproducing Kernel Hilbert Spaces

Pairwise Comparison Dynamics for Games with Continuous Strategy Space

Outline Today s Lecture

Errata Applied Analysis

Simultaneous zero inclusion property for spatial numerical ranges

Victoria Martín-Márquez

Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space

ECONOMICS 001 Microeconomic Theory Summer Mid-semester Exam 2. There are two questions. Answer both. Marks are given in parentheses.

Macro 1: Dynamic Programming 1

Some SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen

Approximation of Minimal Functions by Extreme Functions

Geometry in a Fréchet Context: A Projective Limit Approach

Bounded uniformly continuous functions

6. MESH ANALYSIS 6.1 INTRODUCTION

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

ITEC2620 Introduction to Data Structures

Separation in General Normed Vector Spaces 1

The Way of Analysis. Robert S. Strichartz. Jones and Bartlett Publishers. Mathematics Department Cornell University Ithaca, New York

Mathematical Appendix

LECTURE 9 LECTURE OUTLINE. Min Common/Max Crossing for Min-Max

The Skorokhod reflection problem for functions with discontinuities (contractive case)

Economics 204 Fall 2012 Problem Set 3 Suggested Solutions

Fundamentals of Differential Geometry

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane

Berge s Maximum Theorem

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION

Time is discrete and indexed by t =0; 1;:::;T,whereT<1. An individual is interested in maximizing an objective function given by. tu(x t ;a t ); (0.

CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS

Topological properties of Z p and Q p and Euclidean models

CALCULUS AB/BC SUMMER REVIEW PACKET (Answers)

Weak and strong moments of l r -norms of log-concave vectors

Some analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim

On a Class of Multidimensional Optimal Transportation Problems

7. Let X be a (general, abstract) metric space which is sequentially compact. Prove X must be complete.

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION

1 Inner Product Space

Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations

Walker Ray Econ 204 Problem Set 2 Suggested Solutions July 22, 2017

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA

Advanced Economic Growth: Lecture 21: Stochastic Dynamic Programming and Applications

Classes of Linear Operators Vol. I

MA651 Topology. Lecture 10. Metric Spaces.

Cores for generators of some Markov semigroups

A Course in Real Analysis

Geometry and topology of continuous best and near best approximations

Convexity in R N Supplemental Notes 1

The Arzelà-Ascoli Theorem

3 Measurable Functions

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation

A : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution:

Thus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a

Introductory Analysis 2 Spring 2010 Exam 1 February 11, 2015

Could Nash equilibria exist if the payoff functions are not quasi-concave?

Transcription:

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 1 T maps continuous and bounded real-valued functions into the space of continuous and bounded real-valued functions i.e. T : C C Proof. Assumptions: (iv) Γ (x) is a non-empty, continuous (u.h.c and l.h.c.), and compact-valued correspondence. 2. in addition to ϕ C. Since u (x, a) is bounded and ϕ ( ) is bounded, the sum of two bounded functions is also bounded. The maximum of a bounded function is also bounded. Therefore, Tϕis bounded. To deal with continuity, let us consider the Theorem of the Maximum. First of all, we need to show that u (x, a)+βeϕ [f (x, a, ε)] (2) is continuous. As f ( ) and ϕ are continuous functions, the composite function (ϕ f) is also continuous and, moreover, as the expectation is a linear operator, E [ϕ f] is a continuous function. Therefore, (2) is continuous and, given the assumptions on the constraint correspondence Γ (x), we can invoke the Theorem of the Maximum 3 to ensure that Tϕis continuous. 1 C is a complete metric space. 2 f ( ) being continuous implies that the stochastic structure satisfies the Feller property. The Feller property states that Z E [ϕ (x t+1 ) x t = x, a t = a] = ϕ [f (x, a, ε)] df (ε x, a) 3 Theorem of the Maximum. Let X R l,y R m, h (x) = max y Γ(x) f (x, y) and G (x) ={y Γ (x) :f (x, y) =h (x)} such that f : X Y R is a continuous function and let Γ : X Y be a compactvalued and continuous correspondence. Then the function h : X R is continuous, and the correspondence G : X Y is non-empty, compact-valued, and u.h.c. 1

ALTERNATIVE PROOF: Since the space of continuous and bounded real-valued functions endowed with the sup-norm is a complete metric space and T is a contraction, we can use the Contraction Mapping Theorem to ensure that there exists a unique fixed point i.e.! ϕ C s.t. ϕ = Tϕ Therefore, by the previous proof we have that Tϕ C, then, as there exists a unique fixed point, ϕ must also belong to C. 2 Proving T maps INCREASING functions into increasing functions In particular, we want to show T : D D where D is the space of increasing, continuous, and bounded real-valued functions (endowed with the sup-norm i.e. D is a complete metric space. Thus. we could use the alternative way of proving the statement). Proof. Standard assumptions: In order to show that T maps increasing functions into increasing functions, we need the following additional assumptions: (vi) u ( ) is increasing (vii) Γ (x) is increasing in the following sense x, x 0 X s.t. x 0 x = Γ (x 0 ) Γ (x) (viii) f (x, a, ε) is increasing in x. Let ϕ be a continuous, bounded, and increasing real-valued function. Given the standard assumptions, we can invoke either the Theorem of the Maximum or the Extreme Value Theorem, to argue the existence of an optimal solution to the optimization problem stated in (1) for any x X. Let x, x 0 X s.t. x 0 x, and a, a 0 be the corresponding optimal solution when the state is given by x and x 0. By assumption (vii), we have a Γ (x) Γ (x 0 )= a Γ (x 0 ) By assumptions (vi) and (viii), u ( ) and f ( ) are increasing functions, therefore u (x, a)+βeϕ[f (x, a, ε)] u (x 0,a)+βEϕ[f (x 0,a,ε)] (3) 2

where u (x 0,a)+βEϕ[f (x 0,a,ε)] u (x 0,a 0 )+βeϕ[f (x 0,a 0,ε)] (4) Hence, by (3) and (4), we can conclude that where u (x, a)+βeϕ[f (x, a, ε)] u (x 0,a 0 )+βeϕ[f (x 0,a 0,ε)] u (x, a)+βeϕ[f (x, a, ε)] = (T ϕ)(x) u (x 0,a 0 )+βeϕ[f (x 0,a 0,ε)] = (T ϕ)(x 0 ) So, x x 0 = Tϕ(x) Tϕ(x 0 ). 3 Proving T maps STRICLY INCREASING functions into strictly increasing functions Note that the space of continuous, bounded, and strictly increasing real-valued functions endowed with the sup-norm is not a complete metric space. Here, theproofhastobedonebyusingatwostepsprocedure. Proof. We need an extra assumption: (ix) u ( ) is strictly increasing First step: show T maps increasing functions into increasing functions. Second step: As u ( ) is strictly increasing and βeϕ[f (x, a, ε)] is increasing, u (x, a) +βeϕ[f (x, a, ε)] is stricly increasing since the sum of an increasing and a strictly increasing function is a strictly increasing function (CHECK!!!!!). The max operator preserves such a property, therefore Tϕis strictly increasing. Since we already have ϕ D (D is the space of continuous, increasing, anb bounded real-valued functions) s.t. ϕ = Tϕ, and that Tϕis strictly increasing, it directly follows that ϕ is strictly increasing. 4 Proving T maps CONCAVE functions into concave functions Proof. Let ϕ be a concave, continuous, and bounded real-valued function. Let x 0 >xand a 0,abe the corresponding optimal solutions. Standard assumptions: Additional assumptions: 3

*forconcavity: (x) u ( ) is concave in (x, a) (xi) Γ (x) is convex in the following sense θ [0, 1], a Γ (x), a 0 Γ (x 0 ) θa+(1 θ ) a 0 Γ (θ x+(1 θ ) x 0 ) (xii) f (a, x, ε) is concave in (x, a) (xiii) ϕ ( ) is increasing (in addition to concave, continuous, and bounded) We want to show the following Tϕ[θ x+(1 θ ) x 0 ] θtϕ( x)+(1 θ ) Tϕ(x 0 ) By assumption (xi), [θa+(1 θ ) a 0 ] is feasible but not necessarily optimal Tϕ[θ x+(1 θ ) x 0 ] u [θ x+(1 θ ) x 0,θa+(1 θ) a 0 ]+ +βeϕ[f (θ x+(1 θ ) x 0,θa+(1 θ) a 0,ε)] By concavity of u ( ) Tϕ[θ x+(1 θ ) x 0 ] θu (x, a)+(1 θ) u (x 0,a 0 )+ (5) +βeϕ[f (θ x+(1 θ ) x 0,θa+(1 θ) a 0,ε)] By concavity of f ( ) and increasigness of ϕ ( ) we have βeϕ[f (θ x+(1 θ ) x 0,θa+(1 θ) a 0,ε)] βeϕ[θf(x, a, ε)+(1 θ) f (x 0,a 0,ε)] β [θeϕ [f (x, a, ε)] + (1 θ) Eϕ[f (x 0,a 0,ε)]] Therefore, (5) will be as follows Proof. Tϕ[θ x+(1 θ ) x 0 ] θ [u (x, a)+βeϕf(x, a, ε)]] + +(1 θ) [u (x 0,a 0 )+βeϕf(x 0,a 0,ε)]] = Tϕ[θ x+(1 θ ) x 0 ] θtϕ ( x)+(1 θ ) Tϕ ( x 0 ) 5 Proving T maps STRICTLY CONCAVE functions into strictly concave functions Proof. We have to use a two-step proof. First of all, let ϕ be a strictly concave, continuous, and bounded real-valued function. Secondly, consider the following assumptions: Standard assumptions: 4

Additional assumptions: *forconcavity: (xi) Γ (x) is convex in the following sense θ [0, 1], a Γ (x), a 0 Γ (x 0 ) θa+(1 θ ) a 0 Γ (θ x+(1 θ ) x 0 ) (xii) f (a, x, ε) is concave in (x, a) (xiii) ϕ ( ) is increasing (in addition to strictly concave, continuous, and bounded) (xiv) u ( ) is strictly concave in (x, a) FIRST STEP: Given the above assumptions we can show that Tϕ is a continuous, concave, and bounded real-valued functions. Now, since the space of continuous, concave, and bounded real-valued functions (D) endowed with the sup-norm is a complete metric space, and T is a contraction by assumption, we can use the Contraction Mapping Theorem to ensure that there exists a unique fixed point ϕ D (i.e.! ϕ D s.t. ϕ = Tϕ). SECOND STEP: Since the space of continuous, strictly concave, and bounded real-valued functions is not complete, we cannot invoke the Contraction Mapping Theorem. However, we will use the following reasoning. By assumption (xiv) we have that u ( ) is strictly concave. Since the sum of a concave function (βeϕ[f (x, a, ε)]) and a strictly concave function (u (x, a)), is a strictly concave function. Then, u (x, a) +β E ϕ[f (x, a, ε)] is strictly concave. The max operator preserves such a curvature property. So, Tϕis strictly concave. Therefore, since we already have ϕ = T ϕ, and T ϕ is stricly concave, it follows that ϕ is strictly concave. 5