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

Size: px
Start display at page:

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

Transcription

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 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

2 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

3 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

4 *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

5 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

Lecture 5: The Bellman Equation

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 information

Stochastic Dynamic Programming: The One Sector Growth Model

Stochastic 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 information

Recursive Methods. Introduction to Dynamic Optimization

Recursive 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 information

Stochastic Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania

Stochastic 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 information

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

Banach Spaces V: A Closer Look at the w- and the w -Topologies BS V c Gabriel Nagy Banach Spaces V: A Closer Look at the w- and the w -Topologies Notes from the Functional Analysis Course (Fall 07 - Spring 08) In this section we discuss two important, but highly non-trivial,

More information

Moral Hazard: Characterization of SB

Moral Hazard: Characterization of SB Moral Hazard: Characterization of SB Ram Singh Department of Economics March 2, 2015 Ram Singh (Delhi School of Economics) Moral Hazard March 2, 2015 1 / 19 Characterization of Second Best Contracts I

More information

Mathematics II, course

Mathematics 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 information

The WhatPower Function à An Introduction to Logarithms

The WhatPower Function à An Introduction to Logarithms Classwork Work with your partner or group to solve each of the following equations for x. a. 2 # = 2 % b. 2 # = 2 c. 2 # = 6 d. 2 # 64 = 0 e. 2 # = 0 f. 2 %# = 64 Exploring the WhatPower Function with

More information

A SHORT INTRODUCTION TO BANACH LATTICES AND

A SHORT INTRODUCTION TO BANACH LATTICES AND CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,

More information

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

Selçuk Demir WS 2017 Functional Analysis Homework Sheet Selçuk Demir WS 2017 Functional Analysis Homework Sheet 1. Let M be a metric space. If A M is non-empty, we say that A is bounded iff diam(a) = sup{d(x, y) : x.y A} exists. Show that A is bounded iff there

More information

AN INTRODUCTION TO MATHEMATICAL ANALYSIS ECONOMIC THEORY AND ECONOMETRICS

AN INTRODUCTION TO MATHEMATICAL ANALYSIS ECONOMIC THEORY AND ECONOMETRICS AN INTRODUCTION TO MATHEMATICAL ANALYSIS FOR ECONOMIC THEORY AND ECONOMETRICS Dean Corbae Maxwell B. Stinchcombe Juraj Zeman PRINCETON UNIVERSITY PRESS Princeton and Oxford Contents Preface User's Guide

More information

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

Contents. 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 information

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

TWO MAPPINGS RELATED TO SEMI-INNER PRODUCTS AND THEIR APPLICATIONS IN GEOMETRY OF NORMED LINEAR SPACES. S.S. Dragomir and J.J. RGMIA Research Report Collection, Vol. 2, No. 1, 1999 http://sci.vu.edu.au/ rgmia TWO MAPPINGS RELATED TO SEMI-INNER PRODUCTS AND THEIR APPLICATIONS IN GEOMETRY OF NORMED LINEAR SPACES S.S. Dragomir and

More information

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

Optimal Control. Macroeconomics II SMU. Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112 Optimal Control Ömer Özak SMU Macroeconomics II Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112 Review of the Theory of Optimal Control Section 1 Review of the Theory of Optimal Control Ömer

More information

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

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books. Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define

More information

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

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is

More information

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

AP Exercise 1. This material is created by   and is for your personal and non-commercial use only. 1 AP Exercise 1 Question 1 In which of the following situations, does the list of numbers involved make an arithmetic progression, and why? (i) The taxi fare after each km when the fare is Rs 15 for the

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 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 information

Introduction to Functional Analysis

Introduction to Functional Analysis Introduction to Functional Analysis Carnegie Mellon University, 21-640, Spring 2014 Acknowledgements These notes are based on the lecture course given by Irene Fonseca but may differ from the exact lecture

More information

Economics 8105 Macroeconomic Theory Recitation 3

Economics 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 information

Social Welfare Functions for Sustainable Development

Social 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 information

CITY UNIVERSITY OF HONG KONG

CITY UNIVERSITY OF HONG KONG CITY UNIVERSITY OF HONG KONG Topics in Optimization: Solving Second-Order Conic Systems with Finite Precision; Calculus of Generalized Subdifferentials for Nonsmooth Functions Submitted to Department of

More information

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

Fisica Matematica. Stefano Ansoldi. Dipartimento di Matematica e Informatica. Università degli Studi di Udine. Corso di Laurea in Matematica Fisica Matematica Stefano Ansoldi Dipartimento di Matematica e Informatica Università degli Studi di Udine Corso di Laurea in Matematica Anno Accademico 2003/2004 c 2004 Copyright by Stefano Ansoldi and

More information

4. Convex Sets and (Quasi-)Concave Functions

4. Convex Sets and (Quasi-)Concave Functions 4. Convex Sets and (Quasi-)Concave Functions Daisuke Oyama Mathematics II April 17, 2017 Convex Sets Definition 4.1 A R N is convex if (1 α)x + αx A whenever x, x A and α [0, 1]. A R N is strictly convex

More information

Lecture 7. Econ August 18

Lecture 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 information

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit

More information

Preliminary draft only: please check for final version

Preliminary 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 information

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.

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. Math 304 Final Exam (May 8) Spring 206 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. Name: Section: Question Points

More information

Brownian Motion and Conditional Probability

Brownian Motion and Conditional Probability Math 561: Theory of Probability (Spring 2018) Week 10 Brownian Motion and Conditional Probability 10.1 Standard Brownian Motion (SBM) Brownian motion is a stochastic process with both practical and theoretical

More information

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

Name :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)(CSE/IT)/SEM-4/M-401/ MATHEMATICS - III Name :. Roll No. :..... Invigilator s Signature :.. 202 MATHEMATICS - III Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

The fundamental theorem of linear programming

The fundamental theorem of linear programming The fundamental theorem of linear programming Michael Tehranchi June 8, 2017 This note supplements the lecture notes of Optimisation The statement of the fundamental theorem of linear programming and the

More information

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

(c) For each α R \ {0}, the mapping x αx is a homeomorphism of X. A short account of topological vector spaces Normed spaces, and especially Banach spaces, are basic ambient spaces in Infinite- Dimensional Analysis. However, there are situations in which it is necessary

More information

TRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN. School of Mathematics

TRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN. School of Mathematics JS and SS Mathematics JS and SS TSM Mathematics TRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN School of Mathematics MA3484 Methods of Mathematical Economics Trinity Term 2015 Saturday GOLDHALL 09.30

More information

Dynamic Programming Theorems

Dynamic 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 information

Weak Topologies, Reflexivity, Adjoint operators

Weak Topologies, Reflexivity, Adjoint operators Chapter 2 Weak Topologies, Reflexivity, Adjoint operators 2.1 Topological vector spaces and locally convex spaces Definition 2.1.1. [Topological Vector Spaces and Locally convex Spaces] Let E be a vector

More information

1 Directional Derivatives and Differentiability

1 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 information

Fixed Term Employment Contracts. in an Equilibrium Search Model

Fixed Term Employment Contracts. in an Equilibrium Search Model Supplemental material for: Fixed Term Employment Contracts in an Equilibrium Search Model Fernando Alvarez University of Chicago and NBER Marcelo Veracierto Federal Reserve Bank of Chicago This document

More information

Semi-infinite programming, duality, discretization and optimality conditions

Semi-infinite programming, duality, discretization and optimality conditions Semi-infinite programming, duality, discretization and optimality conditions Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205,

More information

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

d(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 information

Seventeen generic formulas that may generate prime-producing quadratic polynomials

Seventeen generic formulas that may generate prime-producing quadratic polynomials Seventeen generic formulas that may generate prime-producing quadratic polynomials Marius Coman Bucuresti, Romania email: mariuscoman13@gmail.com Abstract. In one of my previous papers I listed forty-two

More information

THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS

THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS. STATEMENT Let (X, µ, A) be a probability space, and let T : X X be an ergodic measure-preserving transformation. Given a measurable map A : X GL(d, R),

More information

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.

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. This monograph is motivated by a fundamental rigidity problem in Riemannian geometry: determine whether the metric of a given Riemannian symmetric space of compact type can be characterized by means of

More information

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

SOME ELEMENTARY GENERAL PRINCIPLES OF CONVEX ANALYSIS. A. Granas M. Lassonde. 1. Introduction Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 5, 1995, 23 37 SOME ELEMENTARY GENERAL PRINCIPLES OF CONVEX ANALYSIS A. Granas M. Lassonde Dedicated, with admiration,

More information

Spaces with Ricci curvature bounded from below

Spaces with Ricci curvature bounded from below Spaces with Ricci curvature bounded from below Nicola Gigli February 23, 2015 Topics 1) On the definition of spaces with Ricci curvature bounded from below 2) Analytic properties of RCD(K, N) spaces 3)

More information

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Prof. Wickerhauser Due Friday, February 5th, 2016 Please do Exercises 3, 6, 14, 16*, 17, 18, 21*, 23*, 24, 27*. Exercises marked

More information

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

Microeconomics II. MOSEC, LUISS Guido Carli Problem Set n 3 Microeconomics II MOSEC, LUISS Guido Carli Problem Set n 3 Problem 1 Consider an economy 1 1, with one firm (or technology and one consumer (firm owner, as in the textbook (MWG section 15.C. The set of

More information

Reproducing Kernel Hilbert Spaces

Reproducing Kernel Hilbert Spaces Reproducing Kernel Hilbert Spaces Lorenzo Rosasco 9.520 Class 03 February 9, 2011 About this class Goal In this class we continue our journey in the world of RKHS. We discuss the Mercer theorem which gives

More information

Pairwise Comparison Dynamics for Games with Continuous Strategy Space

Pairwise Comparison Dynamics for Games with Continuous Strategy Space Pairwise Comparison Dynamics for Games with Continuous Strategy Space Man-Wah Cheung https://sites.google.com/site/jennymwcheung University of Wisconsin Madison Department of Economics Nov 5, 2013 Evolutionary

More information

Outline Today s Lecture

Outline 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 information

Errata Applied Analysis

Errata Applied Analysis Errata Applied Analysis p. 9: line 2 from the bottom: 2 instead of 2. p. 10: Last sentence should read: The lim sup of a sequence whose terms are bounded from above is finite or, and the lim inf of a sequence

More information

Simultaneous zero inclusion property for spatial numerical ranges

Simultaneous zero inclusion property for spatial numerical ranges Simultaneous zero inclusion property for spatial numerical ranges Janko Bračič University of Ljubljana, Slovenia Joint work with Cristina Diogo WONRA, Munich, Germany, June 2018 X finite-dimensional complex

More information

Victoria Martín-Márquez

Victoria Martín-Márquez A NEW APPROACH FOR THE CONVEX FEASIBILITY PROBLEM VIA MONOTROPIC PROGRAMMING Victoria Martín-Márquez Dep. of Mathematical Analysis University of Seville Spain XIII Encuentro Red de Análisis Funcional y

More information

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

Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Yasuhito Tanaka, Member, IAENG, Abstract In this paper we constructively

More information

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

ECONOMICS 001 Microeconomic Theory Summer Mid-semester Exam 2. There are two questions. Answer both. Marks are given in parentheses. Microeconomic Theory Summer 206-7 Mid-semester Exam 2 There are two questions. Answer both. Marks are given in parentheses.. Consider the following 2 2 economy. The utility functions are: u (.) = x x 2

More information

Macro 1: Dynamic Programming 1

Macro 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 information

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

Some SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen Title Author(s) Some SDEs with distributional drift Part I : General calculus Flandoli, Franco; Russo, Francesco; Wolf, Jochen Citation Osaka Journal of Mathematics. 4() P.493-P.54 Issue Date 3-6 Text

More information

Approximation of Minimal Functions by Extreme Functions

Approximation of Minimal Functions by Extreme Functions Approximation of Minimal Functions by Extreme Functions Teresa M. Lebair and Amitabh Basu August 14, 2017 Abstract In a recent paper, Basu, Hildebrand, and Molinaro established that the set of continuous

More information

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

Geometry in a Fréchet Context: A Projective Limit Approach Geometry in a Fréchet Context: A Projective Limit Approach Geometry in a Fréchet Context: A Projective Limit Approach by C.T.J. Dodson University of Manchester, Manchester, UK George Galanis Hellenic

More information

Bounded uniformly continuous functions

Bounded uniformly continuous functions Bounded uniformly continuous functions Objectives. To study the basic properties of the C -algebra of the bounded uniformly continuous functions on some metric space. Requirements. Basic concepts of analysis:

More information

6. MESH ANALYSIS 6.1 INTRODUCTION

6. MESH ANALYSIS 6.1 INTRODUCTION 6. MESH ANALYSIS INTRODUCTION PASSIVE SIGN CONVENTION PLANAR CIRCUITS FORMATION OF MESHES ANALYSIS OF A SIMPLE CIRCUIT DETERMINANT OF A MATRIX CRAMER S RULE GAUSSIAN ELIMINATION METHOD EXAMPLES FOR MESH

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis 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 information

ITEC2620 Introduction to Data Structures

ITEC2620 Introduction to Data Structures ITEC2620 Introduction to Data Structures Lecture 6a Complexity Analysis Recursive Algorithms Complexity Analysis Determine how the processing time of an algorithm grows with input size What if the algorithm

More information

Separation in General Normed Vector Spaces 1

Separation in General Normed Vector Spaces 1 John Nachbar Washington University March 12, 2016 Separation in General Normed Vector Spaces 1 1 Introduction Recall the Basic Separation Theorem for convex sets in R N. Theorem 1. Let A R N be non-empty,

More information

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

The Way of Analysis. Robert S. Strichartz. Jones and Bartlett Publishers. Mathematics Department Cornell University Ithaca, New York The Way of Analysis Robert S. Strichartz Mathematics Department Cornell University Ithaca, New York Jones and Bartlett Publishers Boston London Contents Preface xiii 1 Preliminaries 1 1.1 The Logic of

More information

Mathematical Appendix

Mathematical 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 information

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

LECTURE 9 LECTURE OUTLINE. Min Common/Max Crossing for Min-Max Min-Max Problems Saddle Points LECTURE 9 LECTURE OUTLINE Min Common/Max Crossing for Min-Max Given φ : X Z R, where X R n, Z R m consider minimize sup φ(x, z) subject to x X and maximize subject to z Z.

More information

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

The Skorokhod reflection problem for functions with discontinuities (contractive case) The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection

More information

Economics 204 Fall 2012 Problem Set 3 Suggested Solutions

Economics 204 Fall 2012 Problem Set 3 Suggested Solutions Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.

More information

Fundamentals of Differential Geometry

Fundamentals of Differential Geometry - Serge Lang Fundamentals of Differential Geometry With 22 luustrations Contents Foreword Acknowledgments v xi PARTI General Differential Theory 1 CHAPTERI Differential Calculus 3 1. Categories 4 2. Topological

More information

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

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

More information

Berge s Maximum Theorem

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

More information

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

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability... Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................

More information

USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION

USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION YI WANG Abstract. We study Banach and Hilbert spaces with an eye towards defining weak solutions to elliptic PDE. Using Lax-Milgram

More information

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.

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. Chapter 0 Discrete Time Dynamic Programming 0.1 The Finite Horizon Case Time is discrete and indexed by t =0; 1;:::;T,whereT

More information

CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS

CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS Abstract. The aim of this paper is to characterize in terms of classical (quasi)convexity of extended real-valued functions the set-valued maps which are

More information

Topological properties of Z p and Q p and Euclidean models

Topological properties of Z p and Q p and Euclidean models Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete

More information

CALCULUS AB/BC SUMMER REVIEW PACKET (Answers)

CALCULUS AB/BC SUMMER REVIEW PACKET (Answers) Name CALCULUS AB/BC SUMMER REVIEW PACKET (Answers) I. Simplify. Identify the zeros, vertical asymptotes, horizontal asymptotes, holes and sketch each rational function. Show the work that leads to your

More information

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

Weak and strong moments of l r -norms of log-concave vectors Weak and strong moments of l r -norms of log-concave vectors Rafał Latała based on the joint work with Marta Strzelecka) University of Warsaw Minneapolis, April 14 2015 Log-concave measures/vectors A measure

More information

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

Some analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim Some analysis problems. Let f be a continuous function on R and let for n =,2,..., F n (x) = x (x t) n f(t)dt. Prove that F n is n times differentiable, and prove a simple formula for its n-th derivative.

More information

On a Class of Multidimensional Optimal Transportation Problems

On a Class of Multidimensional Optimal Transportation Problems Journal of Convex Analysis Volume 10 (2003), No. 2, 517 529 On a Class of Multidimensional Optimal Transportation Problems G. Carlier Université Bordeaux 1, MAB, UMR CNRS 5466, France and Université Bordeaux

More information

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

7. Let X be a (general, abstract) metric space which is sequentially compact. Prove X must be complete. Math 411 problems The following are some practice problems for Math 411. Many are meant to challenge rather that be solved right away. Some could be discussed in class, and some are similar to hard exam

More information

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION CHRISTIAN GÜNTHER AND CHRISTIANE TAMMER Abstract. In this paper, we consider multi-objective optimization problems involving not necessarily

More information

1 Inner Product Space

1 Inner Product Space Ch - Hilbert Space 1 4 Hilbert Space 1 Inner Product Space Let E be a complex vector space, a mapping (, ) : E E C is called an inner product on E if i) (x, x) 0 x E and (x, x) = 0 if and only if x = 0;

More information

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

Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations Research

More information

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

Walker Ray Econ 204 Problem Set 2 Suggested Solutions July 22, 2017 Walker Ray Econ 204 Problem Set 2 Suggested s July 22, 2017 Problem 1. Show that any set in a metric space (X, d) can be written as the intersection of open sets. Take any subset A X and define C = x A

More information

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA 3 Boolean Algebra 3.1 BOOLEAN ALGEBRA In 1854, George Boole introduced the following formalism which eventually became Boolean Algebra. Definition. An algebraic system consisting of a set B of elements

More information

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

Advanced 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 information

Classes of Linear Operators Vol. I

Classes of Linear Operators Vol. I Classes of Linear Operators Vol. I Israel Gohberg Seymour Goldberg Marinus A. Kaashoek Birkhäuser Verlag Basel Boston Berlin TABLE OF CONTENTS VOLUME I Preface Table of Contents of Volume I Table of Contents

More information

MA651 Topology. Lecture 10. Metric Spaces.

MA651 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 information

Cores for generators of some Markov semigroups

Cores for generators of some Markov semigroups Cores for generators of some Markov semigroups Giuseppe Da Prato, Scuola Normale Superiore di Pisa, Italy and Michael Röckner Faculty of Mathematics, University of Bielefeld, Germany and Department of

More information

A Course in Real Analysis

A Course in Real Analysis A Course in Real Analysis John N. McDonald Department of Mathematics Arizona State University Neil A. Weiss Department of Mathematics Arizona State University Biographies by Carol A. Weiss New ACADEMIC

More information

Geometry and topology of continuous best and near best approximations

Geometry and topology of continuous best and near best approximations Journal of Approximation Theory 105: 252 262, Geometry and topology of continuous best and near best approximations Paul C. Kainen Dept. of Mathematics Georgetown University Washington, D.C. 20057 Věra

More information

Convexity in R N Supplemental Notes 1

Convexity in R N Supplemental Notes 1 John Nachbar Washington University November 1, 2014 Convexity in R N Supplemental Notes 1 1 Introduction. These notes provide exact characterizations of support and separation in R N. The statement of

More information

The Arzelà-Ascoli Theorem

The Arzelà-Ascoli Theorem John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps

More information

3 Measurable Functions

3 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 information

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

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation Statistics 62: L p spaces, metrics on spaces of probabilites, and connections to estimation Moulinath Banerjee December 6, 2006 L p spaces and Hilbert spaces We first formally define L p spaces. Consider

More information

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

A : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution: 1-5: Least-squares I A : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution: f (x) =(Ax b) T (Ax b) =x T A T Ax 2b T Ax + b T b f (x) = 2A T Ax 2A T b = 0 Chih-Jen Lin (National

More information

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

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 Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:

More information

Introductory Analysis 2 Spring 2010 Exam 1 February 11, 2015

Introductory Analysis 2 Spring 2010 Exam 1 February 11, 2015 Introductory Analysis 2 Spring 21 Exam 1 February 11, 215 Instructions: You may use any result from Chapter 2 of Royden s textbook, or from the first four chapters of Pugh s textbook, or anything seen

More information

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

Could Nash equilibria exist if the payoff functions are not quasi-concave? Could Nash equilibria exist if the payoff functions are not quasi-concave? (Very preliminary version) Bich philippe Abstract In a recent but well known paper (see [11]), Reny has proved the existence of

More information