Organizational Stuffs: Typed by Vinh Nguyen. Date May 18, 2011
Organizational Stuffs: Typed by Vinh Nguyen. Date May 18, 2011
Organizational Stuffs: Typed by Vinh Nguyen. Date May 18, 2011
V
1
(H) +q
V
1
(T)]
where p
and q
=
1
u-d
(1 +r -d) > 0 and q
= 1 - p
=
1
u-d
(u-1 -r).
The formula for D
0
above is called the delta-hedging formula. With X
0
and D
0
as given above,
the investor has emulated the short position in the derivative security. The derivative security
that pays V
1
at time 1 should be priced at
V
0
= X
0
=
1
1+r
[p
V
1
(H) +q
V
1
(T)] .
This formula is called the risk-neutral pricing formula. Neither does the risk-neutral pric-
1. 1. 110503 - Typed. nb 3
Printed by Mathematica for Students
ing formula nor the delta-hedging formula depend on the actual probabilities of the coin toss
turning head or tail. Note that they don't depend on the initial stock price S
0
either.
2. Multiperiod Model
We can extend the 2-period model above to a general multiperiod model. For example, the path
of possible stock prices in a 4-period binomial model looks like:
(Figure is from Shreve, Vol I, page 8.) Here S
0
= 4, u = 2, and d =
1
2
. We solve the multiperiod
model recursively, reducing it to the 2-period model, which we have solved above. The details
are in the following theorem.
Theorem. (Theorem 1.2.2 in Shreve, Vol I) (Hedging the multiperiod bino-
mial model)
Consider an N-period binomial asset-pricing model, with 0 < d < 1 +r < u, and with
p
=
1
u-d
(1 +r -d) > 0 and q
= 1 - p
=
1
u-d
(u-1 -r).
4 1. 1. 110503 - Typed. nb
Printed by Mathematica for Students
Let V
N
be a random variable (a derivative security paying off at time N) depending on the first
N coin tosses w
1
w
2
w
N
(each w
n
= H or T). Note that all possible values of V
N
are completely
specified by the problem. Define recursively backward in time the sequence of random variables
V
N-1
, V
N-2
, , V
0
by
V
n
(w
1
w
n
) =
1
1+r
[p
V
n+1
(w
1
w
n
H) +q
V
n+1
(w
1
w
n
T)],
so that each V
n
depends on the first n coin tosses w
1
w
n
, where n ranges between N -1 and 0.
Next define
D
n
(w
1
w
n
) =
V
n+1
(w
1
w
n
H)-V
n+1
(w
1
w
n
T)
S
n+1
(w
1
w
n
H)-S
n+1
(w
1
w
n
T)
,
where again n ranges between 0 and N -1. If we set X
0
= V
0
and define recursively forward in
time the portfolio values X
1
, , X
N
by the wealth equation:
X
n+1
(w
1
w
n
w
n+1
) = D
n
(w
1
w
n
) S
n+1
(w
1
w
n
w
n+1
)
+(1 +r) (X
n
(w
1
w
n
) -D
n
(w
1
w
n
) S
n
(w
1
w
n
))
then we will have
X
N
(w
1
w
N
) = V
N
(w
1
w
N
) for all w
1
w
N
.
Proof. See Shreve, Vol 1, page 12.
3. Probability Space
Definition. A probability space is a triple (W, F, P). These symbols are explained as fol-
lows.
(1) W is a nonempty set called the set of outcomes. A single element w of W is called an out-
1. 1. 110503 - Typed. nb 5
Printed by Mathematica for Students
come, whereas a subset A of W is called an event.
(2) F is a subset of the powerset of W: F 2
W
. Moreover, F is a s-algebra on W, meaning:
(i) F;
(ii) A F implies A
c
W\ A F;
(iii) a sequence of sets A
1
, A
2
, belongs to F implies |
n=1
A
n
F.
(3) P, called a probability measure, is a real-valued function that that assigns every element
A F with a number P(A), called the probability of A, such that
(i) P(A) [0, 1] for all A F;
(ii) P(W) = 1;
(iii) (Countable Additivity) whenever A
1
, A
2
, is a sequence of disjoint sets in F, then
P||
n=1
A
n
] = _
n=1
P(A
n
).
Lemma. (1) A F, B F imply A|B F and AB F.
(2) If A
1
, A
2
, is a sequence in F, then
n=1
A
n
F.
(3) P(A
c
) = 1 -P(A).
Definition. Let (W, F, P) be a probability space. If a set A F satisfies P(A) = 1. we say that
the event A occurs almost surely.
4. Random Variable
The Borel s-algebra on the real line is the smallest s-algebra containing all open (closed)
sets. Openess and closedness are based on the natural topology on . Notation: sometimes, we
use both symbols ] a, b[ and (a, b) to denote the open interval from a to b.
Definition. Let (W, F, P) be a probability space and let be endowed with the Borel s-alge-
bra B. Then, a random variable X is a function X : (W, F) (, B) such that X is measur-
able, meaning: G B implies X
-1
(G) F.
A random variable X on (W, F, P) induces the probability measure m
X
: B [0, 1], called the
distribution measure of X, defined as
6 1. 1. 110503 - Typed. nb
Printed by Mathematica for Students
m
X
(B) = P|X
-1
(B)].
We also define the cumulative distribution function (cdf) F
X
:
F
X
(x) = P(X x).
If we know m
X
, then we can retrieve F
X
because F
X
(x) = m
X
(-, x]. On the other hand, suppose
we know F
X
. Then, noting [x, y] =
n=1
|x -
1
n
, y|, we have
m
X
[x, y] = lim
n
m
X
|x -
1
n
, y| = lim
n
|F
X
(y) -F
X
|x -
1
n
]].
And once the distribution measure m
X
[a, b] is known for every interval [a, b] , it is deter-
mined for every Borel subset of . Therefore, in principle, knowing the cdf F
X
for a random
variable X is the same as knowing its distribution measure m
X
.
Next class: integrals and expectations.
1. 1. 110503 - Typed. nb 7
Printed by Mathematica for Students