Professional Documents
Culture Documents
The Mathematics of Arbitrage 52
The Mathematics of Arbitrage 52
N
qn ξn = x, (3.16)
n=1
and
N
pn U (ξn ) = L(ξ1 , . . . , ξN , y(x)). (3.17)
n=1
N
u(x) = pn U (ξn ). (3.18)
n=1
N
Indeed, the inequality u(x) ≥ n=1 pn U (ξn ) follows from (3.16) and (3.8),
while the reverse inequality follows from (3.17) and the fact that, for all
ξ1 , . . . , ξN verifying the constraint (3.3), we have:
N
pn U (ξn ) ≤ L(ξ1 , . . . , ξN , y(x)) ≤ L(ξ1 , . . . , ξN , y(x)).
n=1
T (x)(ωn ) = ξn , n = 1, . . . , N .
T (x) ∈ C(x) for the optimiser X
We shall write X
Combining (3.15), (3.17) and (3.18) we note that the value functions u
and v are conjugate:
We then have:
(i) The value functions u(x) and v(y) are conjugate and u inherits the qual-
itative properties of U listed in the beginning of this chapter.