Brownian bridges were described in a previous post, along with various different methods by which they can be constructed. Since a Brownian bridge on an interval is continuous and equal to zero at both endpoints, we can consider extending to the entire real line by partitioning the real numbers into intervals of length *T* and replicating the path of the process across each of these. This will result in continuous and periodic sample paths, suggesting another method of representing Brownian bridges. That is, by Fourier expansion. As we will see, the Fourier coefficients turn out to be independent normal random variables, giving a useful alternative method of constructing a Brownian bridge.

There are actually a couple of distinct Fourier expansions that can be used, which depends on precisely how we consider extending the sample paths to the real line. A particularly simple result is given by the sine series, which I describe first. This is shown for an example Brownian bridge sample path in figure 1 above, which plots the sequence of approximations formed by truncating the series after a small number of terms. This tends uniformly to the sample path, although it is quite slow to converge as should be expected when approximating such a rough path by smooth functions. Also plotted, is the series after the first 100 terms, by which time the approximation is quite close to the target. For simplicity, I only consider *standard* Brownian bridges, which are defined on the unit interval . This does not reduce the generality, since bridges on an interval can be expressed as scaled versions of standard Brownian bridges.

Theorem 1A standard Brownian bridgeBcan be decomposed as

(1)

over, whereis an IID sequence of standard normals. This series converges uniformly int, both with probability one and in thenorm for all.