The name is absent

(i) Monotonicity: If m(x) ≤ n(x)∀x ∈ R₊ then

T (m) + δa

The second line follows from the fact that the densities f₁ (u), f₂ (u) integrate to one.

Points (i) and (ii) are sufficient to show that T is a contraction mapping. This implies that we can
start with an arbitrary function m() and repeated application ofT will converge to the unique fixed
point, the true value function.

We will next show that T maps concave functions into concave functions. Hence, if we start
with a concave function m and repeatedly apply T , all resulting functions will be concave as well.
This implies that the unique attractor, the true value function, is concave as well.

Concavity: ∀X₁,X₂ ∈ R₊ define the optimal loading as l₁ and l₂, respectively. Note that
for the convex combination X3 = θX1 + (1 — θ)X2, where θ ∈ (0, 1), the convex combination

27

<<   25   26   27   28   29   30   31   >>

More intriguing information