advanced28 min studyLesson 671 in Mathematics

Brownian paths and quadratic variation

Specify the filtration and convergence mode behind Brownian roughness and its quadratic clock.

On this page

What you’ll understand

  • State Brownian independent increments relative to a filtration.
  • Calculate the mean and variance of a quadratic-variation sum.
  • Separate fixed-partition convergence in probability from almost-sure dyadic convergence.

Brownian motion is continuous, yet its small increments accumulate a nonzero sum of squares. That combination forces a different chain rule from ordinary calculus. Throughout this module we use a complete probability space with a complete, right-continuous filtration, the usual conditions. A Brownian motion is adapted to that filtration, and each future increment is independent of the information available at its starting time. Enlarging the filtration to reveal future increments can invalidate this property.

Time controls increment size

A standard one-dimensional Brownian motion starts at zero, has continuous paths almost surely, and has Gaussian increments of mean zero and variance equal to elapsed time. Thus the typical increment over a short interval is of square-root time scale, rather than proportional to time. Independent increments are asserted relative to the chosen filtration, not merely relative to the displayed process values. This is the information condition that later makes left-endpoint stochastic sums have mean zero.

Brownian scaling says that c−1/2Wctc^{-1/2}W_{ct} is again standard Brownian motion for positive cc. It preserves distributions of complete paths, not equality of a particular rescaled path with the original one. A deterministic piecewise-linear drawing can approximate Brownian paths in a suitable probabilistic construction, but each individual drawing has finite variation. A property shared by every finite approximation need not survive its limit: total variation is a central example of this mismatch.

Wt−Ws∼N(0,t−s),E[(Wt−Ws)2]=t−s,E[(Wt−Ws)4]=3(t−s)2W_t-W_s\sim N(0,t-s),\qquad \mathbb E[(W_t-W_s)^2]=t-s,\qquad \mathbb E[(W_t-W_s)^4]=3(t-s)^2
The Gaussian second and fourth moments determine the fluctuation of quadratic-variation sums.↔ Scroll wide equations horizontally.

A precise partition statement

Fix a finite horizon and a deterministic partition. Sum the squared Brownian increments over its intervals. Independence gives mean equal to the horizon, and the fourth-moment identity gives variance twice the sum of squared interval lengths. This variance is bounded by twice the horizon times the mesh. Therefore, along any sequence of deterministic partitions whose mesh tends to zero, the sums converge in mean square, and hence in probability, to the horizon.

For a fixed horizon and its dyadic equal subdivisions, the variance bounds are summable. Chebyshev's inequality and the Borel–Cantelli lemma then strengthen the conclusion to almost-sure convergence along that sequence. This does not assert one common probability-one event on which every conceivable sequence of path-dependent partitions gives the same limit. Adaptively choosing intervals from a fully observed path requires separate hypotheses and can change the statement. Convergence mode and permitted partition class belong to the theorem.

Qπ=∑i(Wti+1−Wti)2,EQπ=T,Var⁡(Qπ)=2∑i(Δti)2≤2T∣π∣Q_\pi=\sum_i(W_{t_{i+1}}-W_{t_i})^2,\qquad \mathbb E Q_\pi=T,\quad \operatorname{Var}(Q_\pi)=2\sum_i(\Delta t_i)^2\leq2T|\pi|
This bound proves mean-square convergence for deterministic partitions of a fixed interval.↔ Scroll wide equations horizontally.

Why ordinary variation cannot work

For a continuous function of finite total variation, a squared-increment sum is bounded by its largest increment times its total variation. Uniform continuity drives the first factor to zero as the mesh shrinks. Its quadratic variation along such partitions is therefore zero. Brownian dyadic quadratic variation is positive on every fixed interval of positive length, so Brownian paths cannot have finite total variation there. This argument explains the obstruction without pretending to differentiate a typical Brownian path.

The process identity [W]t=t[W]_t=t supplies the extra clock in Itô calculus. For a diffusion with a drift term and a Brownian coefficient, the drift contributes no continuous quadratic variation, while the squared Brownian coefficient controls it. That later statement uses stochastic integration, not a rule for multiplying infinitesimals as ordinary real numbers. The familiar shorthand that the square of a Brownian differential equals elapsed time summarizes a proved limiting calculation; it is not a replacement for specifying the limit.

A nonuniform Brownian partition

Partition the interval from zero to two into lengths one quarter, three quarters, and one. Compute the expectation and variance of its squared-increment sum. Then compute both quantities for a uniform partition into sixteen intervals.

  1. For the nonuniform partition the increment variances add to two. Thus the expectation of the sum of squares is two, irrespective of how unequally the interval was divided.

  2. The variance is twice the sum of the squared lengths: twice (1/16+9/16+1)(1/16+9/16+1), which is 13/413/4. This is a coarse estimate of the quadratic clock and can fluctuate substantially.

  3. For sixteen equal intervals each length is one eighth. The expectation is still two, while the variance is 2⋅16⋅(1/8)2=1/22\cdot16\cdot(1/8)^2=1/2. Refinement has reduced variance without changing the target value.

The result

The quadratic clock is determined by elapsed time; partition size determines the precision of this finite squared-increment estimator.

Explore the model

Interactive lab

Interactive lab · probability

Square-root scaling in a finite random walk

Pause/Reset, then set both success probability to 0.5 and trials to 16. Predict the displayed success count has mean eight and variance four. Transform it on paper into (2K−16)/4(2K-16)/4, which has mean zero and variance one. Reset and set both probability to 0.5 and trials to 25; the analogous normalization divides by five.

Square-root scaling in a finite random walkThese are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Current readings: Mean · np: 5; Variance · np(1−p): 2.5; Total probability: 1. All parameters are adjustable with the labeled controls below.03581000.070.150.220.3Successes kP(X = k)k = 0 · P = 9.77e-4
Exact probabilityHighlighted outcomeMean np
Mean · np
5
Variance · np(1−p)
2.5
Total probability
1
t = 0 s

These are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forExact binomial bars illustrate square-root scaling for a finite walk. They do not generate Brownian paths or calculate quadratic variation.

Check your understanding

Which quadratic-variation conclusion has been proved here?

Try it yourself

For a uniform partition of the interval from zero to three into twelve pieces, compute the quadratic sum's variance and a Chebyshev upper bound for deviation from three by at least one. What happens to that bound when the number of pieces is quadrupled?

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Use 2T2/n2T^2/n for the variance, and remember that Chebyshev bounds probabilities rather than giving their exact values.

Compare with the solution

The variance is 2⋅9/12=3/22\cdot9/12=3/2, so Chebyshev gives the formal upper bound 3/23/2, or the useful capped bound one. With forty-eight pieces the variance is 3/83/8, giving upper bound 3/83/8. The improvement comes from refinement; neither bound says the finite-partition sum is deterministic. The first numerical bound is valid but uninformative because probabilities cannot exceed one.

Take it with you

  • Brownian increments must be independent of the specified past filtration.
  • Quadratic variation has a partition class and a convergence mode.
  • Positive quadratic variation excludes continuous finite-variation paths.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.