Itô's Lemma and Stochastic Calculus › Why Ordinary Calculus Fails
Quantitative FinanceAll chapters 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 and we want to know how changes when changes by a small amount . The strategy in ordinary calculus is to approximate the function locally using its derivatives. The Taylor expansion gives us this approximation:
where:
-
: value of the function at
-
: first derivative of
-
: second derivative of
-
: small change in
In ordinary calculus, when we take the limit , 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:
where:
- : differential change in the function
- : first derivative of with respect to
- : differential change in
This works because is infinitesimally smaller than . We have . 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 is replaced by a Brownian motion . Over a small time interval , the change in Brownian motion is . While the expected value of is zero, its variance is . This variance property is the source of all the complications that follow.
Here's the critical observation: what is the expected value of ? To answer this, we use the fundamental relationship between moments:
where:
-
: expected value operator
-
: increment of Brownian motion over time
-
: variance operator
This result has important consequences: behaves like , not like . 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 into subintervals of length . The quadratic variation of Brownian motion over is defined as the sum of squared increments:
where:
-
: number of subintervals in the partition
-
: value of Brownian motion at time
-
: increment of Brownian motion over the -th interval
Each squared increment has expected value . The variance of each squared increment is . This variance result follows from the fact that if is a standard normal random variable, then follows a chi-squared distribution with 1 degree of freedom, which has variance 2.
The sum has expected value and variance given by:
where:
-
: number of subintervals
-
: length of each subinterval ()
-
: total time horizon
The variance of the sum involves a key computation:
where:
-
: variance operator
-
: variance of a squared Brownian increment
As the partition becomes finer (as increases), something important occurs. The variance goes to zero while the expected value stays fixed at . This means the sum converges in a stronger sense than expectation alone. The sum converges in mean square to the constant :
where:
-
: convergence in mean square ( norm)
-
: deterministic limit of the quadratic variation
The symbolic result 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.
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))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
The simulation confirms that the quadratic variation converges to with decreasing variance as the partition becomes finer. The standard deviation follows the theoretical prediction of . 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 .