Tutorials › Stochastic Calculus › Stationary Increments, Symmetry, and Sign Reversal

Brownian Motion Essentials · Tutorial 40 of 600

Stationary Increments, Symmetry, and Sign Reversal

Learn why Brownian increments are stationary even though Brownian levels are not, and how sign reversal preserves the law of the entire process.

Advanced 10 min read

What You'll Learn

  • Distinguish stationary increments from stationary process levels.
  • Derive joint laws for increments over shifted disjoint intervals.
  • Prove that the negative of Brownian motion is Brownian motion.
  • Connect finite-dimensional symmetry to equality of Brownian path laws.
  • Use sign reversal to relate probabilities of path events.
  • Identify common errors about time shifts and signs.

Stationary Increments Are Not Stationary Levels

Brownian motion changes its distribution as time passes: \(B_t\) has variance \(t\), so its level at time \(t\) does not have the same law as its level at an earlier time. Its increments have a different property. The change over an interval has a distribution determined by the interval’s length, not by its starting time. This is called stationary increments. The centered Gaussian increment law is also symmetric about zero, which leads to an exact symmetry of the entire Brownian path law under sign reversal.

Work on a filtered probability space \((\Omega,\mathcal{F},(\mathcal{F}_t)_{t\ge0},\mathbb{P})\) carrying a standard Brownian motion \((B_t)_{t\ge0}\). Thus \(B_0=0\), its paths are continuous almost surely, and for \(0\le s<t\), \(B_t-B_s\) is independent of \(\mathcal{F}_s\) and has distribution \(N(0,t-s)\). In particular, increments over disjoint time intervals are independent.

Definition: Brownian motion has stationary increments if, for every \(h\ge0\) and \(0\le s\le t\), the increment \(B_{s+h}-B_{t+h}\) has the same distribution as \(B_s-B_t\), whenever these times are in the time domain. Equivalently, using increments in increasing-time order, \(B_{t+h}-B_{s+h}\) has the same law as \(B_t-B_s\). The distribution may depend on the interval length \(t-s\), but not on its starting time \(s\).

For Brownian motion the defining Gaussian increment property gives the precise statement \(B_{s+h}-B_{t+h}\sim N(0,t-s)\) when \(s\le t\). More generally, shifting a finite collection of ordered disjoint intervals by the same amount preserves the joint law of their increments. This follows because each increment remains centered Gaussian with the same interval length, and the increments remain independent.

Joint Laws on Shifted Intervals

Theorem: Let \(0\le a_1<b_1\le a_2<b_2\le\cdots\le a_n<b_n\), and let \(h\ge0\). Then the vector \((B_{b_i+h}-B_{a_i+h})_{i=1}^n\) has the same distribution as \((B_{b_i}-B_{a_i})_{i=1}^n\). Its coordinates are independent, and its \(i\)th coordinate has distribution \(N(0,b_i-a_i)\).

Proof. The shifted intervals \([a_i+h,b_i+h]\) are disjoint except possibly for shared endpoints, just as the original intervals are. Brownian increments over these intervals are therefore independent. By the Gaussian increment property, \(B_{b_i+h}-B_{a_i+h}\) has law \(N(0,(b_i+h)-(a_i+h))=N(0,b_i-a_i)\). The unshifted increments are also independent and have these same respective distributions. Independent random vectors with matching coordinate distributions have the same joint distribution, proving the assertion. \(\square\)

This is a statement about increments, not about the levels \(B_t\). In particular, it does not assert that shifting time leaves the process unchanged. The distinction matters: the distribution of \(B_t\) changes with \(t\), while the distribution of an increment depends only on the elapsed time.

Worked Example: Two Shifted Increments

Consider the increments \(X=B_3-B_2\) and \(Y=B_9-B_5\), and compare them with the increments over the intervals shifted two time units earlier: \(X'=B_1-B_0\) and \(Y'=B_7-B_3\).

The first interval has length \(3-2=1\), and the second has length \(9-5=4\). Thus \(X\sim N(0,1)\), \(Y\sim N(0,4)\), and \(X,Y\) are independent. The shifted intervals \([0,1]\) and \([3,7]\) have the same lengths and are disjoint, so \(X'\sim N(0,1)\), \(Y'\sim N(0,4)\), and \(X',Y'\) are independent as well. Hence \((X,Y)\) and \((X',Y')\) have the same joint law.

For example, using \(\Phi\) for the standard normal CDF, independence gives \(\mathbb{P}(X>0,Y>0)=\mathbb{P}(X>0)\mathbb{P}(Y>0)=\tfrac12\cdot\tfrac12=\tfrac14\). The same calculation gives \(\mathbb{P}(X'>0,Y'>0)=\tfrac14\).

Check: The means are both zero, and the covariance matrices of the two vectors are both \(\begin{pmatrix}1&0\\0&4\end{pmatrix}\): the diagonal entries are the interval lengths and the off-diagonal entries are zero by independence. This agrees with the equality of joint laws.

Sign Reversal of Brownian Motion

A centered normal distribution is unchanged when its sign is reversed: if \(Z\sim N(0,v)\), then \(-Z\sim N(0,v)\). Applying this fact to Brownian increments shows that \(-B\) has the same Brownian increment laws as \(B\). There is also a pathwise way to see the transformation: a continuous path \(t\mapsto B_t(\omega)\) is sent to the continuous path \(t\mapsto -B_t(\omega)\).

Theorem: The process \(\widetilde B_t=-B_t\) is a standard Brownian motion with respect to the same filtration \((\mathcal{F}_t)\). Consequently, \(B\) and \(-B\) have the same finite-dimensional distributions.

Proof. First, \(\widetilde B_0=-B_0=0\), and its paths are continuous wherever the paths of \(B\) are continuous. It is adapted because \(B_t\) is \(\mathcal{F}_t\)-measurable, so \(-B_t\) is also \(\mathcal{F}_t\)-measurable. For \(s<t\), \(\widetilde B_t-\widetilde B_s=-(B_t-B_s)\). This increment is independent of \(\mathcal{F}_s\), since \(B_t-B_s\) is independent of \(\mathcal{F}_s\). Its law is \(N(0,t-s)\), because a centered normal variable has the same law as its negative. These are the defining properties of Brownian motion. Finally, for any finite set of times \(t_1,\ldots,t_n\), the vector \((\widetilde B_{t_1},\ldots,\widetilde B_{t_n})\) is therefore a Brownian finite-dimensional vector. It has the same law as \((B_{t_1},\ldots,B_{t_n})\), as can also be seen by expressing each level as a sum of independent centered Gaussian increments and negating all of them. \(\square\)

Equality of finite-dimensional distributions also gives equality of the laws of the continuous paths on a bounded time interval. Here is the precise link. Regard each continuous path on \([0,T]\) as a point of \(C([0,T])\), equipped with the uniform norm. Evaluation at any fixed time is measurable. Moreover, evaluations at rational times in \([0,T]\), together with the endpoint \(T\), determine the uniform distance between continuous paths: the supremum of their pointwise distance over this dense set equals the supremum over all times, by continuity. Thus these evaluations generate the Borel sets of \(C([0,T])\). The standard uniqueness theorem for probability measures on a sigma-algebra generated by a collection closed under finite intersections (the pi-lambda uniqueness theorem) then implies that two probability measures agreeing on all finite-time cylinder sets agree on the Borel sets of \(C([0,T])\). Applying it to \(B\) and \(-B\) proves equality of their path laws.

Worked Example: A Finite-Dimensional Sign Pattern

Consider the three increments \(Z_1=B_1\), \(Z_2=B_3-B_1\), and \(Z_3=B_4-B_3\). Their interval lengths are \(1\), \(2\), and \(1\), so the increments are independent with laws \(N(0,1)\), \(N(0,2)\), and \(N(0,1)\), respectively. Calculate the probability of the sign pattern \(Z_1>0,\ Z_2>0,\ Z_3<0\).

A nondegenerate centered normal variable has probability \(1/2\) of being positive and probability \(1/2\) of being negative. Independence therefore gives \(\mathbb{P}(Z_1>0,Z_2>0,Z_3<0)=\tfrac12\cdot\tfrac12\cdot\tfrac12=\tfrac18\). For the sign-reversed process, the corresponding increments are \(-Z_1,-Z_2,-Z_3\). The event \(-Z_1>0,\ -Z_2>0,\ -Z_3<0\) is exactly \(Z_1<0,\ Z_2<0,\ Z_3>0\), which also has probability \(\tfrac18\).

Check: The levels at times \(1,3,4\) are \(B_1=Z_1\), \(B_3=Z_1+Z_2\), and \(B_4=Z_1+Z_2+Z_3\). Their covariance matrix is \(\begin{pmatrix}1&1&1\\1&3&3\\1&3&4\end{pmatrix}\). For instance, \(\operatorname{Cov}(B_1,B_3)=\operatorname{Var}(Z_1)=1\), and \(\operatorname{Var}(B_4)=1+2+1=4\). Negating all three levels leaves each covariance unchanged, consistent with the theorem.

Path Events and What the Symmetry Says

For a path \(x\in C([0,T])\), define its sign reversal by \(R(x)(t)=-x(t)\). If \(A\) is a Borel set of paths, then \(R^{-1}(A)=\{x:R(x)\in A\}\) is also a Borel set, since \(R\) is continuous in the uniform norm. Equality of the path laws of \(B\) and \(-B\) gives \(\mathbb{P}(B\in A)=\mathbb{P}(-B\in A)=\mathbb{P}(B\in R^{-1}(A))\). This relates path events without requiring their probabilities to be explicitly computed.

Worked Example: A Path Event and Its Sign-Reversed Event

On \([0,1]\), let \(A\) be the event that \(\sup_{0\le t\le1}B_t>1\). Under sign reversal, \(\sup_{0\le t\le1}(-B_t)>1\) holds exactly when \(\inf_{0\le t\le1}B_t<-1\). The equivalence follows from \(\sup_t(-B_t)=-\inf_t B_t\). Therefore the path-law symmetry gives \(\mathbb{P}(\sup_{0\le t\le1}B_t>1)=\mathbb{P}(\inf_{0\le t\le1}B_t<-1)\).

Check: The threshold is strict on both sides: \(\sup B_t>1\) transforms to \(-\inf B_t>1\), which is equivalent to \(\inf B_t<-1\), not to \(\inf B_t\le-1\). This argument establishes equality of the probabilities but does not evaluate either one.

For a concrete path illustration, take the continuous function \(x(t)=t\) on \([0,1]\). Its sign reversal is \(R(x)(t)=-t\); the endpoint changes from \(1\) to \(-1\), while the uniform norm remains \(\sup_{0\le t\le1}|x(t)|=1\). This illustrates the transformation of paths, not a claim that either specific function is a Brownian sample path or has positive probability of occurring exactly.

Common Mistakes

Mistaking stationary increments for stationary levels. A common incorrect calculation is to infer that \(B_{s+t}\) has the same distribution as \(B_t\) because the increment over a length-\(t\) interval has the same law wherever it starts. For \(s=2\) and \(t=1\), \(B_3\sim N(0,3)\), whereas \(B_1\sim N(0,1)\); these distributions differ. The correct statement is \(B_3-B_2\sim N(0,1)\), matching the law of \(B_1-B_0\).

Reversing only some signs. The symmetry theorem negates every coordinate of a Brownian finite-dimensional vector, or every value of a path. It does not say that a selected coordinate may be negated while the others are held fixed without changing the joint law. For example, \(B_1\) and \(B_2-B_1\) are independent, but the level \(B_2\) includes both increments; changing one increment affects the joint vector of levels.

Using symmetry to evaluate a path probability without a further argument. Sign reversal equates probabilities of corresponding events, such as an upper crossing and a lower crossing. It does not by itself give their numerical values. Computing a maximum or a hitting probability requires additional results beyond this symmetry.

Check Your Understanding

Use the interval lengths, independence of disjoint Brownian increments, and sign symmetry to justify each answer.

  1. What is the distribution of \(B_{7}-B_4\), and why does its law not depend on the starting time \(4\)?
  2. For disjoint intervals of lengths \(2\) and \(3\), compute the probability that both corresponding Brownian increments are negative.
  3. Explain why \(B_5\) and \(B_2\) do not have the same distribution, even though increments are stationary.
  4. Write the event \(\sup_{0\le t\le T}(-B_t)>c\) in terms of the infimum of \(B\), for \(c>0\), preserving the strict inequality.
  5. Why does equality of finite-dimensional distributions extend to equality of Brownian path laws on \(C([0,T])\)?