A Brownian bridge can be defined as standard Brownian motion conditioned on hitting zero at a fixed future time *T*, or as any continuous process with the same distribution as this. Rather than conditioning, a slightly easier approach is to subtract a linear term from the Brownian motion, chosen such that the resulting process hits zero at the time *T*. This is equivalent, but has the added benefit of being independent of the original Brownian motion at all later times.

Lemma 1LetXbe a standard Brownian motion andbe a fixed time. Then, the process

(1)

overis independent from.

*Proof:* As the processes are joint normal, it is sufficient that there is zero covariance between them. So, for times , we just need to show that is zero. Using the covariance structure we obtain,

as required. ⬜

This leads us to the definition of a Brownian bridge.

Definition 2A continuous processis aBrownian bridgeon the intervalif and only it has the same distribution asfor a standard Brownian motionX.

In case that, thenBis called astandard Brownian bridge.

There are actually many different ways in which Brownian bridges can be defined, which all lead to the same result.

- As a Brownian motion minus a linear term so that it hits zero at
*T*. This is definition 2. - As a Brownian motion
*X*scaled as . See lemma 9 below. - As a joint normal process with prescribed covariances. See lemma 7 below.
- As a Brownian motion conditioned on hitting zero at
*T*. See lemma 14 below. - As a Brownian motion restricted to the times before it last hits zero before a fixed positive time
*T*, and rescaled to fit a fixed time interval. See lemma 15 below. - As a Markov process. See lemma 13 below.
- As a solution to a stochastic differential equation with drift term forcing it to hit zero at
*T*. See lemma 18 below.

There are other constructions beyond these, such as in terms of limits of random walks, although I will not cover those in this post.

It is well known that Brownian motion has scaling invariance, so that it has the same distribution as for any fixed positive real *S*. Brownian bridges inherit the same invariance property.

Lemma 3Ifis a Brownian bridge on the intervalthenis a Brownian bridge on the interval. In particular,is a standard Brownian bridge.

*Proof:* We may suppose that for a standard Brownian motion *X*. As is also a standard Brownian motion, then

is a Brownian bridge, as required. ⬜

In particular, this means that every Brownian bridge can be written as a scaled version of a standard Brownian bridge. We could have restricted to in the definition above, without any real loss of generality. However, it is sometimes convenient to have Brownian bridges defined on non-unit intervals, so I did not make this restriction. I did, however, restrict to intervals of the form , although even this is not really necessary. Given any interval of the form and a standard Brownian motion *X*, we can construct a Brownian bridge by subtracting off a linear term which makes the process go to zero at each of the endpoints *S* and *T*.

Lemma 4LetXbe standard Brownian motion andbe fixed nonnegative times. Then, the process

is a Brownian bridge on the interval, and is independent ofover the range.

*Proof:* As is a Brownian motion and,

it follows from the definition that *B* is a Brownian bridge which, by lemma 1, is independent of over . It only remains to show that it is also independent of over . However, is independent of by the independent increments property, so is independent of *B*. ⬜

Lemma 4 extends in a straightforward way to an arbitrary collection of non-overlapping time intervals. This gives an independent collection of Brownian bridges, all of which are independent of the original Brownian motion at all times outside of these intervals. This is the situation shown in figure 1 above. The Brownian bridges are constructed on each interval of the Brownian motion by subtracting out a linear term, as shown in the top plot, and then rescaled to standard Brownian bridges in the bottom plot.

Lemma 5LetXbe standard Brownian motion andbe pairwise disjoint subintervals of. Then, the processesdefined by

(2)

are independent Brownian bridges, and are independent ofover the range.

*Proof:* For each , lemma 4 says that is a Brownian bridge independent of over . For any in *I*, as depends only on *X* over this range, we conclude that is independent of all such as required. ⬜

This result provides a very useful practical technique when simulating Brownian motion. Suppose we start by simulating at a fixed finite set of times. Then, if the values are later required at points outside of this set, we can ‘interpolate’ across each of the intervals between the original set of times using independent Brownian bridges. That is, if then,

Lemma 5 holds in exactly the same way if *X* is itself a Brownian bridge rather than a Brownian motion.

Lemma 6LetXbe a Brownian bridge on intervalandbe pairwise disjoint subintervals of. Then, the processesdefined by (2) are independent Brownian bridges, and are independent ofover the range.

*Proof:* Suppose that for a Brownian motion *Y*. Then, (2) also holds with *Y* in place of *X* and, hence, lemma 5 says that are independent Brownian bridges, and independent of over . Hence, they are also independent of *X* over this range as required. ⬜

An alternative method of describing a Brownian bridge is as a joint normal process, so that its distribution is completely determined by its means and covariances.

Lemma 7A continuous real valued stochastic processis a Brownian bridge if and only if it is joint normal with zero mean and covariances

(3)

for.

*Proof:* We suppose that *B* is given in terms of Brownian motion *X* by (1). As *X* is joint normal with zero mean, the same holds for *B*. For times , the covariances are given by,

as required. ⬜

Although equation (3) only holds for , by symmetry it can be written as

which holds for all , and is sometimes a more convenient form. As the covariance is invariant under replacing *s* and *t* by and respectively, we immediately see that Brownian bridges are preserved under time reversal.

Lemma 8Ifis a Brownian bridge on the interval on the interval, then so is.

Rather than subtracting a linear term, Brownian bridges can alternatively be constructed from Brownian motion by rescaling as follows.

Lemma 9LetXbe a Brownian motion and. Then, the processesdefined by

are Brownian bridges.

*Proof:* As *B* is clearly a joint normal process with zero mean, we just need to show that the covariances are of the form (3). For times then, as we obtain

as required. Then, is also a Brownian bridge by lemma 8. ⬜

If *B* is a standard Brownian bridge then, by definition, it is a continuous process with . Hence, we can consider extending the time index to all of by making it periodic with period one. To express this, use to denote the fractional part of time *t*. That is, is a real number in the interval equal to , where is the largest integer less than or equal to *t*. Then, is periodic with period one, and equal to *B* on the unit interval. It would be good if this was invariant under time translations, so that has the same joint distribution as for each fixed real *T*. We know that this cannot be true, since hits zero at all integer times. However, we do obtain invariance if, as well as translating the time index we subtract a constant so that it is equal to zero at time zero.

Lemma 10IfBis a Brownian bridge then, for any fixed time, the process

overis also a Brownian bridge.

*Proof:* This can be proven by computing covariances and showing that it agrees with (3). However, I will take slightly different approach. Consider splitting the process into the intervals and . The process exchanges these intervals, and translates them in space so that it is zero at times 0 and 1 (and is continuous at time , where the exchanged intervals are joined). Lemma 6 shows that this decomposes the Brownian bridge into a pair of bridges, and joins them back together in the opposite order, so gives a Brownian bridge again.

More precisely, supposing that (wlog), applying lemma 6 to the intervals and , we can write

for independent Brownian bridges on intervals and respectively, which are independent of . Then,

As has the same distribution as , lemma 6 shows that this process is again a Brownian bridge. ⬜

Another method of demonstrating this invariance is to subtract a constant value from so that the resulting process is invariant under time translation. This works if we subtract the average value of *B*, and follows easily from lemma 10.

Corollary 11LetBbe a standard Brownian bridge with mean, and define the processover. Then, for any fixed time, the processhas the same joint distribution as.

*Proof:* Let which, by lemma 10, is a standard Brownian bridge with mean . We can write

which, therefore, has the same joint distribution as . ⬜

Corollary 11 defines a continuous periodic process which is invariant under time translation, from which the original Brownian bridge is obtained via . This invariant process can be described as joint normal with prescribed covariances.

Lemma 12The processXdefined by corollary 11 is joint normal with zero mean and covariances

for all times.

*Proof:* As a standard Brownian bridge is joint normal with zero mean, the same holds for *X*. By translation invariance and periodicity,

Hence,

where is a constant independent of *t*. As the integral of over the unit interval is zero, we obtain as required. ⬜

I now move on to the next way that Brownian bridges can be described — as a Markov process.

Lemma 13A continuous processis a Brownian bridge if and only if(almost surely) and it is Markov (with respect to its natural filtration) such that for allthen, conditional on,is normally distributed with mean and variance given by,

*Proof:* Since the joint distribution of Markov processes are uniquely determined by their initial value and transition probabilities, it is sufficient to show that a Brownian bridge *B* is Markov as described, and the converse statement follows automatically. First, by lemma 6, is a Brownian bridge over independently of . Taking shows that is normal with zero mean and variance independently of as required. ⬜

Brownian bridges are commonly defined as Brownian motion conditioned on hitting zero at time *T*. This is a bit problematic, since the hitting zero at any fixed positive time *T* is a zero probability event, so cannot be conditioned on. Instead, we consider conditioning on being close to zero, rather than exactly equal to zero, and show that a Brownian bridge is obtained in the limit.

Lemma 14Letbe a standard Brownian motion andbe a sequence of measurable subsets ofwith positive measure. We suppose that, for every,for sufficiently largen. Then, the distribution ofconditioned ontends weakly to that of a Brownian bridge asngoes to infinity.

*Proof:* Let be the space of continuous functions and be the coordinate process defined by over . We also let be the sigma-algebra on generated by , which is just the Borel sigma-algebra corresponding to the topology of uniform convergence on . If is the probability measure on with respect to which *Z* is a Brownian motion, then weak convergence of distributions, as stated in the lemma, just means that

(4) |

as for each bounded continuous function .

By lemma 1, for a Brownian bridge *B* independent of . Hence, writing ,

For any fixed , we have on the event for all sufficiently large *n*. So, by continuity of , tends to as . Hence, (4) follows from bounded convergence. ⬜

Next, Brownian bridges can be constructed by a restricting a standard Brownian motion *X* to the time interval , where is the last time in a fixed interval at which *X* hits zero, and rescaling to the unit interval.

Lemma 15LetXbe a Brownian motion,Tbe a fixed positive time and

Then, the processoveris a standard Brownian bridge independent of.

We note that is not a stopping time since, for any time , the event is equivalent to the event that does not hit zero on . This is not measurable with respect to and, so, is not a stopping time for the natural filtration of *X*. Instead, the event mentioned is in the sigma-algebra generated by meaning that it is a stopping time in the reversed time direction. In fact, lemma 15 is just a special case of a more general result for such ‘time-reversed stopping times’, which I prove now.

Lemma 16LetXbe a Brownian motion andbe a random time such thatis measurable w.r.t.for each. Then, the processdefined by

is a standard Brownian bridge independent of.

*Proof:* The process is also a standard Brownian motion, as can be determined by computing covariances and, with respect to its natural filtration, is a stopping time. Hence, by the strong Markov property, the process is standard Brownian motion independently of or, equivalently, of . By scaling invariance of Brownian motion, is a Brownian motion, again independent of . So, by lemma 9, is a Brownian bridge independent of . ⬜

Finally, I move on to the description of Brownian bridges as semimartingales, which decompose into martingale and finite variation terms. In the following lemma, we compute the finite variation process *V* such that a Brownian bridge *B* decomposes as for a local martingale *W* and, furthermore, show that this local martingale term is a standard Brownian motion. We work with respect to the natural filtration of *B*, augmented with the zero probability events.

Lemma 17IfBis a Brownian bridge on intervalthen the process

has integrable variation and,

is a standard Brownian motion over.

*Proof:* As is normal with zero mean and variance , we have where is the absolute expected value of a standard normal. Hence, the expected variation of *V* on the interval is

as claimed. It only remains to show that *W* is a Brownian motion. We first show that it is a martingale. For times then, by lemma 13, we have

So, is a martingale. Next, as definition 2 expresses a Brownian bridge as standard Brownian motion plus a linear term, its quadratic variation is the same as for standard Brownian motion, . Then, as *V* is continuous with finite variation, the quadratic variation of *W* is also given by so, by Lévy’s characterization, is standard Brownian motion. ⬜

Lemma 17 shows that the Brownian bridge solves the stochastic differential equation

(5) |

for a Brownian motion *W*. By the Lipschitz condition, this SDE always has a unique solution for any Brownian motion *W*, at least over , and provides our final characterization of Brownian bridges.

Lemma 18A continuous processis a Brownian bridge if and only if(almost surely) and it solves the SDE (5) for a standard Brownian motion.

*Proof:* If *B* is a Brownian bridge, then lemma 17 states that it satisfies an SDE of the form (5). Conversely, suppose that (5) is satisfied for some Brownian motion *W* and that . If we set then integration by parts gives . Since the integrand is deterministic, this shows that is independent of for any , and normal with zero mean and variance

Hence, conditional on , is normal with mean and variance , so lemma 13 shows that *B* is a Brownian bridge. ⬜

“There are other constructions beyond these, such as in terms of limits of random walks, although I will not cover those in this post.”

Could you provide a reference for construction of a Brownian bridge via random walks? I assume it would be by conditioning a random walk to end up near zero.