Proof the Binomial Model Converges to Black–Scholes
The binomial options-pricing model converges to Black–Scholes as the number of steps in fixed physical time goes to infinity. I present Chi-Cheng Hsia's 1983 proof of this result.
Published
03 June 2023
This is a companion post to my post on the binomial options-pricing
model. Please see that post
for an expository treatment of the binomial model. The goal here is to prove
that the binomial model converges to Black–Scholes in the limit. This proof is from (Hsia, 1983).
Setup
First, let’s state both models and introduce notation. Let
CSS∗Ktnpπ2udr0rμσ2a=price of call at time zero=price of stock at time zero=price of stock at expiry=strike price=time to expiry=number of price changes in time t=probability of an up move=risk-neutral probability of an up move=up factor=down factor=one plus risk-free interest rate for one period t/n=one plus risk-free interest rate for unit time=mean of stock price=variance of stock price=smallest number of up moves for the call to end in-the-money.
The binomial model assumes the stock price is a discrete-time process
{Sn}, which is a multiplicative random walk:
Sn=SX1X2⋯Xn=Sn−1Xn,(4)
where Xi (the up or down factor) is drawn i.i.d. based on a Bernoulli random variable, or
P(Xi=u)=p,P(Xi=d)=1−p.(5)
Black–Scholes assumes the stock price is a continuous-time process
S(t), which is geometric Brownian
motion. Thus,
S(t) is defined as
S(t)=SeY(t),Y(t)=σB(t)+μt,(6)
where B(t) is Brownian motion, and where Y(t) is Brownian motion with
drift:
Y(t)∼N(μt,σ2t),B(t)∼N(0,t).(7)
S(t) is lognormally distributed with parameters μ and σ2
or equivalently logS(t) is normally distributed with parameters μ and σ2.
Note that in the main post,
the risk-neutral probability π2 is denoted π and variable here called
π1 is denoted ρ. However, I have adopted slightly different notation here so that variable
names “align” in Equation 1.
Proof
From Equation 1, it is clear that all we have to do to prove convergence
from the binomial model to Black–Scholes is to prove that as n→∞,
To do this, we first invoke the DeMoivre-Laplace’s
theorem
(CLT) to show that each binomial distribution converges to its respective normal distribution. See
A1 for a brief review of this
central limit theorem. To see this, let j denote the
binomial random variable (if j is the outcome of a coin toss, it is heads or
an up move with probability p). Then by the
symmetry of the binomial distribution, we have
where μj=E[j] and σj2=V[j]. Be careful with
the sign in step !. Thus, the CLT tells us that as n→∞,
then
B(a;n,q)→dN(σj−a+μj).(10)
Now let’s give a name to the fraction inside the normal CDF. The fraction looks a lot like the d1 and d2 terms in Black–Scholes, so let’s just call it d:
d=σj−a+μj.(11)
Since j is a binomial random variable, we know μj=np and σj=np(1−p). And we know that a is
a=log(u/d)log(K/S)−nlogd+ζ,ζ∈[0,1).(12)
See A2 for a derivation of a. So we can plug these values into Equation 6 to get
How can we simplify this? The key insight is to realize that most of the terms
in the last line above can be represented as the mean and standard deviation of
the log return from S to S∗. We can see this by computing the mean
and variance of the lognormal random variable log(S∗/S), giving us
See A3 for a
derivation. Finally, observe that the ζ term will disappear once we will take
n→∞. So the upper bound in our Gaussian integral can be written as
d=Vq[log(S∗/S)]log(S/K)+E[log(S∗/S)].(15)
And we know that the variance of the log return is
V[log(S∗/S)]=Vq[Y(t)]=σ2t.(16)
This is a standard property of Brownian and geometric Brownian motion, and
it should be clear from Equations 6 and 7.
To summarize so far, we have shown that B(a;n,π1) and B(a;n,π2) can
both be written as
To finish our proof, we just need to show that d=d1 when the
binomial parameter is π1 and that d=d2 when the binomial parameter is π2. Or in other words,
as n→∞,E[log(S∗/S)]={[logr+(1/2)σ2]t[logr−(1/2)σ2]tfor π=π1,for π=π2.(18)
Let’s first prove this result for π2, the risk-neutral probability.
The definition of our multiplicative
random walk (Equation 4) allows us to represent the raw return from zero to n as
S∗/S=X1X2⋯Xn=i=1∏nXi.(19)
Now the expectation of each multiplicative factor Xi can be written as
E[Xi]=E[Si/Si−1]=π2u+(1−π2)d.(20)
By risk-neutrality, we know the one-period expectation is equal to the
one-period interest rate r0 or
π2u+(1−π2)d=r0.(21)
And since each multiplicative factor is i.i.d., the total expectation is
Finally, we need to use a
property of the continuous-time process. If Z is a lognormal random variable
with parameters ν and s2, then its expected value is
E[Z]=exp(ν+21s2).(23)
And note that since S∗ is lognormally distributed,
S∗∼lognormal(logS+μt,σ2t),(24)
then S∗/S is lognormally distributed and log(S∗/S) is normally distributed,
S∗/Slog(S∗/S)∼lognormal(μt,σ2t),∼N(μt,σ2t).(25)
This allows us to write expectation and log expectation as
rttlogr=E[S∗/S]=exp(μt+21σ2t),=μt+21σ2t,(26)
which we can rewrite in terms of μt=E[log(S∗/S)] as
E[log(S∗/S)]=[logr−21σ2]t(27)
as desired.
The proof of line convergence when π=π1 is the roughly the same. Let’s
repeat our logic from above but for S/S∗. First, we can write
S/S∗=X1X2⋯Xn1(28)
by Equation 4. Following the same logic as above, we know the expected value
of Si−1/Si is
Perhaps the most notable observation about this proof is that we do not
need to specify the risk-neutral probability π2. We can choose π2 however
we would like, and we still get convergence. We will use this fact when fitting the binomial model in the
main post. The condition that must hold, however, is the
no-arbitrage condition. We used this assumption in Equation 21.
Appendix
A1. De Moivre–Laplace theorem
Let Xn be a binomially distributed random variable with parameters n and p, and let X be a normally
distributed random variable with parameters np and np(1−p),
Xn∼binom(n,p),X∼N(np,np(1−p)).(A1.1)
The De Moivre–Laplace (central limit) theorem states that the probability mass
function of Xn approximates the probability density function (PDF) of X for
large n: