Chapter 10

1.  For n = 1, 2, …, N, let Un denote any of the n1S random variables 1n(S0+S1++Sn1) max {S0, S1, …, Sn−1} min {S0, S1, …, Sn} and set An = {Sn > Un}. Then AnnS, and the functions in (a), (b) and (c) are of the form

τ(ω)={ min{ n|ωAn }if{ n|ωAn }0,Notherwise.

Therefore,

{ τ=n }=A1A2An1AnnS,n<N,

and

{ τ=N }=A1A2AN1N1SNS.

3.  We show by induction on k that

vk(Sk(ω))=f(Sk(ω))=0

(†)

for all k > n (= τ0(ω)). By definition of τ0, (†) holds for k = n. Suppose (†) holds for arbitrary kn. Since

vk(Sk(ω))=max(f(Sk(ω)),avk+1(Sk(ω)u)+bvk+1(Sk(ω)d))

and all terms comprising the expression on the right of this equation are nonnegative, (†) implies that

vk+1(Sk(ω)u)=vk+1(Sk(ω)d)=0,

that is, vk+1 (Sk+1(ω)) = ...

Get An Introduction to Financial Mathematics, 2nd Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.