Lecture5 2021
Lecture5 2021
Lecture 5
February, 2021
1 / 29
In the last lecture
2 / 29
• Extend the notions from single period model to multi-period
model: Videos 2 and 3
• Arbitrage in multi-period models: Video 3
• Replicating on a two-period tree: Video 4
• Complete models and conditional probabilities: Video 5
• Conditional Expectation: Video 6
3 / 29
Market model
1 Time t = 0, 1, 2, . . . , T .
2 A probability space (Ω, P) with the filtration (Ft )t=0,...,T .
3 A money market account (Bt ), which evolves according to
Bt = (1 + r)t B0 , B0 = 1.
4 A collection of n financial assets whose prices are given by
stochastic processes
4 / 29
Trading strategy
A trading strategy is a stochastic process (φt )0≤t≤T with values in
Rn+1 :
φt = (φ0t , φ1t , . . . , φnt ).
n
X n
X
φ0t Bt+1 + φit St+1
i
= φ0t+1 Bt+1 + φit+1 St+1
i
.
i=1 i=1
5 / 29
Good trading strategies
6 / 29
Value process
n
X
Vt (φ) = φ0t Bt + φit Sti , t = 0, . . . , T.
i=1
7 / 29
Increment process
8 / 29
Gains process
t−1
X n X
X t−1
Gt (φ) = φ0s ∆Bs+1 + φis ∆Ss+1
i
, t = 1, . . . , T.
s=0 i=1 s=0
9 / 29
Discounted...
Discounted prices:
Sti
Ŝti = .
Bt
10 / 29
Discounted...
Vt (φ)
V̂t (φ) = .
Bt
n X
X t−1
Ĝt (φ) = φis ∆Ŝs+1
i
, t = 1, . . . , T .
i=1 s=0
11 / 29
Arbitrage
12 / 29
Arbitrage (in discounted terms 1)
13 / 29
Arbitrage (in discounted terms 2)
14 / 29
Arbitrage - a weaker condition
15 / 29
Contingent claim
VT (φ) = X,
i.e. the terminal value of the trading strategy is equal to the payoff
of the contingent claim.
16 / 29
Financial market
3
4
6 S2 = 9 ω1
=
S1 = 8 1
4
2
5
(
S2 = 6 ω2
S0 = 5
3
5
2
7
6 S2 = 6 ω3
!
S1 = 4 5
7
(
S2 = 3 ω4
B0 = 1 / B1 = 1 / B2 = 1
17 / 29
Complete market
18 / 29
Conditional probability
P(B ∩ A)
P(B|A) = .
P(A)
Sn
Let A1 , . . . , An ⊂ Ω satisfy i=1 Ai = Ω and Ai ∩ Aj = ∅ if i 6= j.
Then n
X
P(B) = P(B|Ai ) P(Ai ).
i=1
19 / 29
Conditional probability on a tree
3
4
7
S2 = 12 ω1
@
S1 = 8
1
4
2
5
'
S2 = 6 ω2
S0 = 5
3
5
2
7
7 S2 = 6 ω3
S1 = 4
5
7
'
S2 = 3 ω4
20 / 29
Conditional expectation
ω ∈ Ai .
P
E(X|G)(ω) = x x P(X = x|Ai ),
Here
P({X = x} ∩ Ai )
P(X = x|Ai ) =
P(Ai )
denotes the conditional probability of the event {ω|X(ω) = x}
given the event Ai .
21 / 29
Conditional expectation on a tree
3
4
7
S2 = 12 ω1
@
S1 = 8
1
4
2
5
'
S2 = 6 ω2
S0 = 5
3
5
2
7
7 S2 = 6 ω3
S1 = 4
5
7
'
S2 = 3 ω4
22 / 29
Properties of conditional expectation
23 / 29
Properties of conditional expectation 2
E(X|G) = E(X)
24 / 29