Macroeconomics/Math Review
From Wikibooks, the open-content textbooks collection
Contents |
[edit] Introduction
We have a Bellman equation and first we want to know if there exists a value function that satisfies the equation and second we want to know the properties of such a solution. In order to answer the question we will define a mapping which maps a function to another function, and a fixed point of the mapping is to be a solution. The mapping we discussed is a mapping on the set of functions, which is a bit abstract. So today we will look at the math review.
So first we consider a set,
, For us what it will be relevant to describe a sort of distance between any two points in a set. We will use the concept of a metric.
[edit] Metric
A metric is a function
with the properties that it is non-negative,
, symmetric, ρ(x,y) = ρ(y,x), and satisfies the triangle inequality,
,
A common metric is euclidean distance,
, Another is
,
[edit] Space
A space, is a set of objects equipped with some general properties and structure
We may be interested in a metric space, a space with a metric such as, (S,ρ) where S is the set of all bounded rational functions, and ρ is some distance function. Once we have a metric space we can discuss convergence and continuity.
[edit] convergence
A sequence,
, converges to x,
, if
s.t. ρ(xn,yn) < ε for n > Nε,
[edit] Cauchy sequence
A sequence ,
, is called a Cauchy sequence if
for n,m > Nε,
Question: does every Cauchy sequence converge?
[edit] Completeness
The metric space, (S,ρ) is complete if every Cauchy sequence converges.
[edit] examples of completeness
is complete.- ((0,1),ρE) is not complete. Proof: let
, So {xn} os Cauchy, but does not converge to a point in our set (0,1), - ([0,1],ρE) is complete. Are all closed sets complete? A closed subspace of a complete space is complete.
- ({0,1,2},ρE) is complete.
[edit] Contraction Mapping
A mappting
is a contraction mapping on a metric space, (S,ρ), if
such that
, Sometimes we write T(x) instead of TX,
This means that any two points in our set, S, are mapped such that after the mapping the distance between the points shrinks.
[edit] examples of contraction mapping
- Tx = .9x is a contraction mapping on [(0,1],ρE),
Now we state the contraction mapping theorem.
[edit] Contraction mapping theorem
If (S,ρ) is complete and
is a contraction mapping, then
with Tx * = x * ,
We will prove this theorem for a general metric space later on. However, we must remember that it is necessary for this proof that the space be complete.
Let us now look at a criteria to verify that a mapping is a contraction mapping.
[edit] Contraction Mapping criteria
For
and ρ = ρE, Let
satisfy the following two conditions:
- (M, monotonic condition)
and
, and
, if
then
, - (D, discout condition)
, for
,
.
Then T is a contraction mapping.