Realized variance adds up squared log returns over a period. In a constructed model whose log price moves as , with in years and a standard Brownian motion, each return shrinks when returns are sampled more often, so one might expect the sum of their squares to shrink to zero. It does not. Over one year it settles near , whatever the drift . This lesson defines the partition limit behind that fact, proves it for Brownian motion in mean square from Gaussian fourth moments, shows why paths of finite variation give zero instead, and states the corresponding formulas for diffusions and their covariation.
Key terms
Partition mesh
Definition A partition of is a finite set of times with and interval lengths . Its mesh is the length of its longest interval,
For a process , the quadratic sum over is
The partitions in this lesson are deterministic, fixed before any path is seen. A sequence of partitions with may be nested or not, and its intervals need not be equal. The requirement is that the longest interval shrinks, so adding many points in one region while a long gap remains elsewhere does not make the mesh small.
In plain words The mesh measures how coarse a grid is at its coarsest place. Driving it to zero means sampling every part of the interval more and more finely, not just some parts.
Example The equal grid with intervals of has mesh . The partition with the points for followed by the single point has intervals but mesh , because of the gap from to . Refining only the left half never drives the mesh to zero.
Mean-square convergence
Definition Random variables with converge in mean square, or in , to a random variable with when
They converge in probability to when for every fixed . Chebyshev’s inequality in the form
shows that mean-square convergence implies convergence in probability. The converse fails. Neither mode implies almost-sure convergence of the whole sequence, although convergence in probability gives almost-sure convergence along some subsequence. When the limit is a constant , the mean-square error splits as , variance plus squared bias.
In plain words Mean-square convergence makes the average squared error small. Convergence in probability only makes large errors rare, and a rare error may still be huge.
Example For the Brownian quadratic sum on the equal grid of with intervals, the next card shows that the mean is exactly and the mean-square error is . With , Chebyshev gives . That bound is for and says nothing, while for it is . For the converse, let on an event of probability and otherwise. Then , so in probability, while .
Quadratic variation
Definition A process has quadratic variation on when in probability for every sequence of partitions of with . For a standard Brownian motion and every partition of ,
so in mean square and in probability whenever , and . To prove it, note that each increment is , so , and these add to . Its fourth moment is , so . Increments over disjoint intervals are independent, so the variances add, and gives the bound. Since the mean is exactly , the mean-square error equals the variance and tends to zero, and Chebyshev gives
When , for example for dyadic partitions, these bounds are summable and the Borel-Cantelli lemma upgrades the result to almost-sure convergence. The limit is taken along partitions fixed in advance and is not a supremum over partitions. The supremum of over all partitions of is infinite almost surely, a path result stated here without proof.
In plain words A single squared increment is random, with mean equal to its interval length and a standard deviation times as large, so it has no tendency to equal that length. Over many independent intervals these errors average out and the sum concentrates at the elapsed time. Quadratic variation records how much squared movement a path accumulates, and for Brownian motion that amount is the clock itself.
Example On the constructed equal grid of with , the quadratic sum has mean and variance , a standard deviation of about . With the variance is and the standard deviation about , ten times smaller. On an equal grid with independent standard normal , a scaled chi-square variable with degrees of freedom. For this gives , far below the Chebyshev bound . The sum on any finite grid is random, and only its limit is .
Finite variation
Definition The total variation of a path on is
the supremum over all partitions of , and has finite variation when . Monotone paths have finite variation, continuously differentiable paths have , and an integral with is continuous with finite variation. If is continuous with finite variation, then
because is uniformly continuous on , so its largest increment over the partition tends to zero while the total variation stays fixed. The same reasoning gives for every continuous path . Continuity of is needed. A path that adds a single jump of size to a continuous finite variation path has quadratic sums tending to .
In plain words A path of finite variation travels a finite total distance, so as its moves get small, their squares get small faster and add up to nothing. A smooth or integrated drift therefore contributes no quadratic variation.
Example The constructed path has . On the equal grid each increment is , so
which is for and and tends to zero. By contrast , since every squared Brownian increment is multiplied by . The coefficient is the same in both paths, but a smooth increment is of order and a Brownian increment of order .
Brownian roughness
Definition Almost surely, a Brownian path has infinite total variation on every interval with . For one interval , choose partitions with , so that almost surely. On a path with the finite variation bound would force , since the path is continuous, which contradicts . So , and applying this to the countably many intervals with rational endpoints gives the statement for every interval. Consequently, almost every path is monotone on no interval, and the pathwise Stieltjes integral, which is built for integrators of finite variation, is not available for integrals against . That is why the Itô integral is constructed in The Ito integral and isometry. The stronger theorem that almost every Brownian path is nowhere differentiable is stated, not proved, in the course, and it does not follow from infinite variation alone.
In plain words A Brownian path wiggles at every scale. On finer and finer grids its squared moves still add up to the elapsed time, while its absolute moves add up to more and more without bound, so the path travels an infinite distance on every interval, however short.
Example On the equal grid of with intervals, each has mean , so
about for and for , while the variance of this sum is for every . The absolute sums grow like while the quadratic sums settle at . Infinite variation and nowhere differentiability are different properties. The function with is differentiable at every point of and still has infinite variation there.
Quadratic covariation
Definition For processes and on , the quadratic covariation is the limit in probability of the cross sums
when it exists. Since , it equals whenever both quadratic variations exist, and . The Cauchy-Schwarz inequality for the sums gives . If and are independent standard Brownian motions and with , then is a standard Brownian motion and . Each cross term has mean and variance , so the cross sum has mean and variance at most . For a continuous Itô process
with an adapted, jointly measurable drift satisfying and a predictable coefficient satisfying almost surely, and built in the same way from a drift , a coefficient and a Brownian motion for the same filtration with , the course states without proof
For constant coefficients these follow from the cards above, because the drift terms have finite variation and drop out of every cross sum. The shorthand , , and summarizes these partition limits and is not an identity between real numbers. For processes with jumps the squared jump sizes also enter. A Poisson process has , the number of jumps up to time .
In plain words Covariation is the joint version of quadratic variation. Only the Brownian parts contribute, through the product of their coefficients and the correlation of their drivers, while drifts and other smooth terms drop out. Unlike a quadratic variation, a covariation can be negative.
Example For constructed drivers with on and equal intervals, the cross sum has mean exactly and variance . For on the same grid,
with , which tends to , since the drift contribution and the cross terms vanish in the limit.
Check yourself
- On with equal intervals, find the mean, the variance and the standard deviation of the Brownian quadratic sum , and the Chebyshev bound for .
Show the answer
Each interval has length . The mean is . The variance is
so the standard deviation is . Chebyshev gives
The exact probability from the chi-square law with degrees of freedom is about , so the bound is crude, but it is enough to prove the limit because it tends to zero as the mesh shrinks.
- The path for and for on has finite variation. A classmate concludes that its quadratic variation is zero. Compute on the equal grid with intervals, find the limit, and name the hypothesis the classmate overlooked.
Show the answer
The total variation is , so the path does have finite variation. Every interval of the grid has the increment with , except the one interval with , whose increment is . Hence
The zero limit holds only for continuous paths of finite variation. Here the jump of size sits inside one interval of every partition, and its square survives in the limit. A realized variance computed from data with a large discrete move picks up that move in the same way.
- Let and with , where and are independent standard Brownian motions, and let . Find , , and the ratio . Why can be negative when cannot, and why does the term not matter?
Show the answer
Since , the process is a standard Brownian motion with . Then
using . The ratio is , the correlation of the drivers. A quadratic variation is a limit of sums of squares, so it is never negative, while a cross sum has terms of either sign. The drift is continuous with finite variation, so its quadratic sums and its cross sums with the continuous paths of and tend to zero. On any finite grid the cross sum even has mean exactly , since the drift multiplies increments of with mean zero.