Itô's Lemma and Stochastic Calculus › Why Ordinary Calculus Fails

Michael BrenndoerferNovember 23, 20257 min read
Quantitative FinanceAll chapters
Part 5 of 15Stochastic Calculus and Pricing Theory
Chapter 27Itô's Lemma and Stochastic Calculus › Why Ordinary Calculus Fails
Reading section 3 of 11 · Why Ordinary Calculus Fails · 7 minSection 3 of 11 · 7 min

Book contents

Section 3 of 11 · 7 min read

Itô's Lemma and Stochastic Calculus › Why Ordinary Calculus FailsOne section · Sections in this chapter3 / 11 ↓
Reading tools Definitions & inline links

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

Before deriving Itô's Lemma, we need to understand why ordinary calculus cannot be applied directly to stochastic processes. Standard calculus fails because Brownian motion paths are irregular. Unlike smooth functions that we encounter in standard calculus, Brownian motion exhibits roughness at every scale. This roughness changes how we think about differentiation and integration.

The Taylor Expansion Approach

Suppose we have a smooth function f(x)f(x) and we want to know how ff changes when xx changes by a small amount Δx\Delta x. The strategy in ordinary calculus is to approximate the function locally using its derivatives. The Taylor expansion gives us this approximation:

f(x+Δx)=f(x)+f′(x)Δx+12f′′(x)(Δx)2+16f′′′(x)(Δx)3+⋯f(x + \Delta x) = f(x) + f'(x) \Delta x + \frac{1}{2} f''(x) (\Delta x)^2 + \frac{1}{6} f'''(x) (\Delta x)^3 + \cdots

where:

  • f(x)f(x): value of the function at xx

  • f′(x)f'(x): first derivative of ff

  • f′′(x)f''(x): second derivative of ff

  • Δx\Delta x: small change in xx

In ordinary calculus, when we take the limit Δx→0\Delta x \to 0, all terms beyond the first-order term become negligible. This is because higher powers of small quantities become vanishingly small compared to the first power. The resulting differential form is:

df=f′(x) dxdf = f'(x) \, dx

where:

  • dfdf: differential change in the function ff
  • f′(x)f'(x): first derivative of ff with respect to xx
  • dxdx: differential change in xx

This works because (Δx)2(\Delta x)^2 is infinitesimally smaller than Δx\Delta x. We have lim⁡Δx→0(Δx)2Δx=0\lim_{\Delta x \to 0} \frac{(\Delta x)^2}{\Delta x} = 0. The second-order term vanishes in the limit, leaving only the familiar first-order derivative expression that forms the foundation of differential calculus.

The Problem with Brownian Motion

Now consider what happens when xx is replaced by a Brownian motion WtW_t. Over a small time interval Δt\Delta t, the change in Brownian motion is ΔWt∼N(0,Δt)\Delta W_t \sim \mathcal{N}(0, \Delta t). While the expected value of ΔWt\Delta W_t is zero, its variance is Δt\Delta t. This variance property is the source of all the complications that follow.

Here's the critical observation: what is the expected value of (ΔWt)2(\Delta W_t)^2? To answer this, we use the fundamental relationship between moments:

E[(ΔWt)2]=Var(ΔWt)+(E[ΔWt])2(decomposition of second moment)=Δt+0(properties of Brownian increment)=Δt(simplify)\begin{aligned} \mathbb{E}[(\Delta W_t)^2] &= \text{Var}(\Delta W_t) + (\mathbb{E}[\Delta W_t])^2 && \text{(decomposition of second moment)} \\ &= \Delta t + 0 && \text{(properties of Brownian increment)} \\ &= \Delta t && \text{(simplify)} \end{aligned}

where:

  • E[⋅]\mathbb{E}[\cdot]: expected value operator

  • ΔWt\Delta W_t: increment of Brownian motion over time Δt\Delta t

  • Var(⋅)\text{Var}(\cdot): variance operator

This result has important consequences: (ΔWt)2(\Delta W_t)^2 behaves like Δt\Delta t, not like (Δt)2(\Delta t)^2. When we sum many such terms over an interval, the second-order terms don't vanish as they would in ordinary calculus. Instead, they accumulate to a finite, deterministic quantity. This accumulation is the fundamental reason why the ordinary chain rule fails for stochastic processes and why we need a modified version, namely Itô's Lemma.

The Quadratic Variation of Brownian Motion

Let's make the preceding observation mathematically precise. We want to understand what happens when we sum up squared increments of Brownian motion over an interval. Partition the interval [0,T][0, T] into nn subintervals of length Δt=T/n\Delta t = T/n. The quadratic variation of Brownian motion over [0,T][0, T] is defined as the sum of squared increments:

∑i=1n(Wti−Wti−1)2=∑i=1n(ΔWi)2\sum_{i=1}^{n} (W_{t_i} - W_{t_{i-1}})^2 = \sum_{i=1}^{n} (\Delta W_i)^2

where:

  • nn: number of subintervals in the partition

  • WtiW_{t_i}: value of Brownian motion at time tit_i

  • ΔWi\Delta W_i: increment of Brownian motion over the ii-th interval

Each squared increment (ΔWi)2(\Delta W_i)^2 has expected value Δt\Delta t. The variance of each squared increment is 2(Δt)22(\Delta t)^2. This variance result follows from the fact that if ZZ is a standard normal random variable, then Z2Z^2 follows a chi-squared distribution with 1 degree of freedom, which has variance 2.

The sum has expected value and variance given by:

E[∑i=1n(ΔWi)2]=n⋅Δt=T\mathbb{E}\left[\sum_{i=1}^{n} (\Delta W_i)^2\right] = n \cdot \Delta t = T

where:

  • nn: number of subintervals

  • Δt\Delta t: length of each subinterval (T/nT/n)

  • TT: total time horizon

The variance of the sum involves a key computation:

Var[∑i=1n(ΔWi)2]=n⋅2(Δt)2=2T2n→0 as n→∞\text{Var}\left[\sum_{i=1}^{n} (\Delta W_i)^2\right] = n \cdot 2(\Delta t)^2 = \frac{2T^2}{n} \to 0 \text{ as } n \to \infty

where:

  • Var\text{Var}: variance operator

  • 2(Δt)22(\Delta t)^2: variance of a squared Brownian increment

As the partition becomes finer (as nn increases), something important occurs. The variance goes to zero while the expected value stays fixed at TT. This means the sum converges in a stronger sense than expectation alone. The sum converges in mean square to the constant TT:

∑i=1n(ΔWi)2→L2T\sum_{i=1}^{n} (\Delta W_i)^2 \xrightarrow{L^2} T

where:

  • →L2\xrightarrow{L^2}: convergence in mean square (L2L^2 norm)

  • TT: deterministic limit of the quadratic variation

The symbolic result (dWt)2=dt(dW_t)^2 = dt distinguishes stochastic from ordinary calculus. In ordinary calculus, the quadratic variation of any smooth function is zero. In stochastic calculus, Brownian motion has positive, finite quadratic variation equal to the length of the time interval. This non-zero quadratic variation is what forces us to include second-order terms in our calculus.

In[2]:
Code
import numpy as np

np.random.seed(42)

# Demonstrate convergence of quadratic variation
T = 1.0
n_partitions = [10, 50, 100, 500, 1000, 5000]
n_simulations = 1000

# Store results
quadratic_variations = {n: [] for n in n_partitions}

for n in n_partitions:
    dt = T / n
    for _ in range(n_simulations):
        # Generate increments
        dW = np.random.normal(0, np.sqrt(dt), n)
        # Compute quadratic variation
        qv = np.sum(dW**2)
        quadratic_variations[n].append(qv)

# Pre-calculate statistics for display
results = []
for n in n_partitions:
    qv_array = np.array(quadratic_variations[n])
    mean_qv = np.mean(qv_array)
    std_qv = np.std(qv_array)
    theoretical_std = np.sqrt(2 * T**2 / n)
    results.append((n, mean_qv, std_qv, theoretical_std))
Out[3]:
Console
Quadratic Variation of Brownian Motion over [0, 1]
=======================================================
  Partitions         Mean      Std Dev       Theory
-------------------------------------------------------
          10       1.0068       0.4524       0.4472
          50       1.0028       0.2036       0.2000
         100       0.9967       0.1396       0.1414
         500       1.0025       0.0626       0.0632
        1000       1.0017       0.0444       0.0447
        5000       0.9997       0.0198       0.0200
Out[4]:
Visualization
Box plot grid showing quadratic variation distributions narrowing around 1.0 as partition size increases from 10 to 5000.
Convergence of quadratic variation to T=1. Box plots display the distribution of realized quadratic variation across 1,000 simulations for increasing partition sizes n. As n increases, the spread of the distribution narrows around the theoretical limit (dashed line), visually demonstrating convergence in mean square.

The simulation confirms that the quadratic variation converges to T=1T = 1 with decreasing variance as the partition becomes finer. The standard deviation follows the theoretical prediction of 2T2/n\sqrt{2T^2/n}. This numerical evidence reinforces the theoretical result: as we refine our partition, the sum of squared Brownian increments becomes increasingly concentrated around the deterministic value TT.