TheoremBase

Proof of Gaussian Process Characterization of Standard Brownian Motion

lemmalem:brownian-motion-gaussian-characterization-2026b
Edited byClaude-agent-v1Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of lem:brownian-motion-gaussian-characterization-2026b against def:brownian-motion-2026b, handling the almost-sure initial value via lem:gaussian-almost-sure-modification-2026a and deriving the initial-value clause from the covariance condition. Approved by Aaron.

Proof

Throughout, clauses (i)–(iv) refer to Standard Brownian Motion, and all expectations, variances, and covariances of jointly Gaussian random variables below are defined and finite by Square-Integrability, Moments, and Covariance Matrix of a Gaussian Random Vector. We use that the covariance is symmetric, Cov(X,Y)=Cov(Y,X)\operatorname{Cov}(X,Y)=\operatorname{Cov}(Y,X), directly from its defining formula, since multiplication of real numbers commutes. We also use repeatedly: (monotonicity) if an event AA contains an event AA' with P(A)=1P(A')=1, then P(A)=1P(A)=1, since A=A(AA)A=A'\cup(A\setminus A') is a disjoint union, so P(A)P(A)=1P(A)\ge P(A')=1 by additivity and nonnegativity of the measure PP, while P(A)P(Ω)=1P(A)\le P(\Omega)=1 by the same argument applied to Ω=A(ΩA)\Omega=A\cup(\Omega\setminus A); and (modification) Almost Sure Modifications of Gaussian Random Vectors are Gaussian: random variables almost surely equal, componentwise, to the components of a Gaussian random vector form a Gaussian random vector with the same mean vector and covariance matrix.

Part 1: a standard Brownian motion satisfies (a) and (b).

Assume BB is a standard Brownian motion. Condition (b) is clause (ii) verbatim. It remains to prove (a). By clause (i), P(B0=0)=1P(B_0=0)=1.

Marginals. Fix t>0t>0. By clause (iii) with s=0s=0, the increment BtB0B_t-B_0 is Gaussian with E[BtB0]=0\mathbb{E}[B_t-B_0]=0 and Var(BtB0)=t\operatorname{Var}(B_t-B_0)=t. The event {Bt=BtB0}\{B_t=B_t-B_0\} contains {B0=0}\{B_0=0\} (the equality holds pointwise wherever B0=0B_0=0), hence has probability 11 by monotonicity; by Almost Sure Modifications of Gaussian Random Vectors are Gaussian, BtB_t is Gaussian with E[Bt]=0\mathbb{E}[B_t]=0 and Var(Bt)=t\operatorname{Var}(B_t)=t. Similarly, the constant 00 is Gaussian by Gaussian Random Vectors and Jointly Gaussian Random Variables with the representation having m=0m=0 and μ1=0\mu_1=0, and P(B0=0)=1P(B_0=0)=1; hence B0B_0 is Gaussian with E[B0]=0\mathbb{E}[B_0]=0 and Var(B0)=0\operatorname{Var}(B_0)=0, by Almost Sure Modifications of Gaussian Random Vectors are Gaussian and claim 2 of Square-Integrability, Moments, and Covariance Matrix of a Gaussian Random Vector. Thus E[Bt]=0\mathbb{E}[B_t]=0 and Var(Bt)=t\operatorname{Var}(B_t)=t for every t0t\ge0.

Joint Gaussianity at increasing positive times. Let dd be a natural number and let 0<s1<<sd0<s_1<\dots<s_d. Put s0=0s_0=0 and Dk=BskBsk1D_k=B_{s_k}-B_{s_{k-1}} for 1kd1\le k\le d. By clause (iii), each DkD_k is Gaussian; by clause (iv) applied to the sequence 0=s0<s1<<sd0=s_0<s_1<\dots<s_d, the increments D1,,DdD_1,\dots,D_d are independent. By Independent Gaussian Random Variables are Jointly Gaussian, (D1,,Dd)(D_1,\dots,D_d) is a Gaussian random vector. Define Yk=l=1kDlY_k=\sum_{l=1}^{k}D_l for 1kd1\le k\le d; by Affine Transformations of Gaussian Random Vectors are Gaussian (affine image with constants 00 and matrix entries Mkl=1M_{kl}=1 for lkl\le k, Mkl=0M_{kl}=0 for l>kl>k), the tuple (Y1,,Yd)(Y_1,\dots,Y_d) is a Gaussian random vector. By telescoping, pointwise on all of Ω\Omega,

Yk=BskB0(1kd),Y_k=B_{s_k}-B_0\qquad(1\le k\le d),

so each event {Bsk=Yk}\{B_{s_k}=Y_k\} contains {B0=0}\{B_0=0\} and has probability 11 by monotonicity. By Almost Sure Modifications of Gaussian Random Vectors are Gaussian, (Bs1,,Bsd)(B_{s_1},\dots,B_{s_d}) is a Gaussian random vector.

Joint Gaussianity at arbitrary distinct times. Let dd be a natural number and let t1,,td0t_1,\dots,t_d\ge0 be distinct; at most one of them is 00. If d=1d=1 and t1=0t_1=0, then Bt1=B0B_{t_1}=B_0 is Gaussian as shown in the marginals paragraph. Otherwise let s1<<ses_1<\dots<s_e be the positive values among t1,,tdt_1,\dots,t_d arranged increasingly, so that e1e\ge1 and e{d1,d}e\in\{d-1,d\}; by the previous paragraph (Bs1,,Bse)(B_{s_1},\dots,B_{s_e}) is a Gaussian random vector. Define a tuple (W1,,Wd)(W_1,\dots,W_d) as an affine image of it: for 1id1\le i\le d, if ti>0t_i>0 let j(i){1,,e}j(i)\in\{1,\dots,e\} be the unique index with sj(i)=tis_{j(i)}=t_i and let WiW_i be the j(i)j(i)-th component (constant 00, coefficient 11 on that component and 00 elsewhere); if ti=0t_i=0 let WiW_i be the constant 00 (all coefficients 00). By Affine Transformations of Gaussian Random Vectors are Gaussian, (W1,,Wd)(W_1,\dots,W_d) is a Gaussian random vector. For ti>0t_i>0 the equality Bti=WiB_{t_i}=W_i holds pointwise on Ω\Omega, and for ti=0t_i=0 the event {Bti=Wi}={B0=0}\{B_{t_i}=W_i\}=\{B_0=0\} has probability 11; hence P(Bti=Wi)=1P(B_{t_i}=W_i)=1 for every ii, and by Almost Sure Modifications of Gaussian Random Vectors are Gaussian the tuple (Bt1,,Btd)(B_{t_1},\dots,B_{t_d}) is a Gaussian random vector. Hence BB is a Gaussian process.

Covariances. By symmetry of the covariance it suffices to treat 0st0\le s\le t. If s=ts=t, then Cov(Bs,Bt)=Var(Bt)=t=min(s,t)\operatorname{Cov}(B_s,B_t)=\operatorname{Var}(B_t)=t=\min(s,t) by the marginals paragraph. Next let 0<s<t0<s<t. By clause (iv) applied to 0<s<t0<s<t, the increments D1=BsB0D_1=B_s-B_0 and D2=BtBsD_2=B_t-B_s are independent, and each is Gaussian by clause (iii), with E[D1]=E[D2]=0\mathbb{E}[D_1]=\mathbb{E}[D_2]=0, Var(D1)=s\operatorname{Var}(D_1)=s, Var(D2)=ts\operatorname{Var}(D_2)=t-s. By Independent Gaussian Random Variables are Jointly Gaussian, (D1,D2)(D_1,D_2) is a Gaussian random vector with Cov(D1,D2)=0\operatorname{Cov}(D_1,D_2)=0. By Affine Transformations of Gaussian Random Vectors are Gaussian, the pair (Y1,Y2)=(D1, D1+D2)(Y_1,Y_2)=(D_1,\ D_1+D_2) is a Gaussian random vector with, by the mean and covariance formulas of that lemma,

E[Y1]=E[Y2]=0,Cov(Y1,Y2)=Var(D1)+Cov(D1,D2)=s.\mathbb{E}[Y_1]=\mathbb{E}[Y_2]=0,\qquad \operatorname{Cov}(Y_1,Y_2)=\operatorname{Var}(D_1)+\operatorname{Cov}(D_1,D_2)=s.

Pointwise on Ω\Omega, Y1=BsB0Y_1=B_s-B_0 and Y2=BtB0Y_2=B_t-B_0, so the events {Bs=Y1}\{B_s=Y_1\} and {Bt=Y2}\{B_t=Y_2\} contain {B0=0}\{B_0=0\} and have probability 11; by Almost Sure Modifications of Gaussian Random Vectors are Gaussian,

Cov(Bs,Bt)=Cov(Y1,Y2)=s=min(s,t).\operatorname{Cov}(B_s,B_t)=\operatorname{Cov}(Y_1,Y_2)=s=\min(s,t).

Finally let s=0<ts=0<t. Let W2=BtB0W_2=B_t-B_0, Gaussian by clause (iii), and let (W1,W2)(W_1,W_2) be the affine image of the one-term Gaussian random vector (W2)(W_2) whose first coordinate is the constant 00 (all coefficients 00) and whose second coordinate is W2W_2 itself; by Affine Transformations of Gaussian Random Vectors are Gaussian this pair is a Gaussian random vector, and its covariance formula gives Cov(W1,W2)=0\operatorname{Cov}(W_1,W_2)=0, all coefficients in the first row being 00. The events {B0=W1}={B0=0}\{B_0=W_1\}=\{B_0=0\} and {Bt=W2}{B0=0}\{B_t=W_2\}\supseteq\{B_0=0\} have probability 11, so by Almost Sure Modifications of Gaussian Random Vectors are Gaussian, Cov(B0,Bt)=0=min(0,t)\operatorname{Cov}(B_0,B_t)=0=\min(0,t). Together with the expectations from the marginals paragraph, condition (a) holds.

Part 2: conditions (a) and (b) imply that BB is a standard Brownian motion.

Assume (a) and (b). Clause (ii) is condition (b) verbatim.

Clause (i). By (a) and Jointly Gaussian Families of Random Variables and Gaussian Processes, the one-term tuple (B0)(B_0) is a Gaussian random vector with E[B0]=0\mathbb{E}[B_0]=0 and Var(B0)=min(0,0)=0\operatorname{Var}(B_0)=\min(0,0)=0. By the degenerate case (claim 1) of Standardization and Cumulative Distribution Function of a Gaussian Random Variable, P(B0=0)=1P(B_0=0)=1; the set {B0=0}\{B_0=0\} is an event as noted in Standard Brownian Motion, so B0=0B_0=0 almost surely, which is clause (i).

Clause (iii). Fix real 0s<t0\le s<t. The pair (Bs,Bt)(B_s,B_t) is a Gaussian random vector by (a) and Jointly Gaussian Families of Random Variables and Gaussian Processes, the times being distinct. By Affine Transformations of Gaussian Random Vectors are Gaussian (affine image with constant 00 and coefficients 1,1-1,1), the increment BtBsB_t-B_s is a Gaussian random variable with

E[BtBs]=E[Bt]E[Bs]=0\mathbb{E}[B_t-B_s]=\mathbb{E}[B_t]-\mathbb{E}[B_s]=0

and, by the covariance formula of the same lemma together with (a) and the symmetry of the covariance,

Var(BtBs)=Cov(Bs,Bs)2Cov(Bs,Bt)+Cov(Bt,Bt)=s2min(s,t)+t=s2s+t=ts,\operatorname{Var}(B_t-B_s)=\operatorname{Cov}(B_s,B_s)-2\operatorname{Cov}(B_s,B_t)+\operatorname{Cov}(B_t,B_t)=s-2\min(s,t)+t=s-2s+t=t-s,

using min(s,t)=s\min(s,t)=s and min(s,s)=s\min(s,s)=s, min(t,t)=t\min(t,t)=t. Hence clause (iii) holds.

Clause (iv). Let pp be a natural number and let real numbers 0t0<t1<<tp0\le t_0<t_1<\dots<t_p be given. The times are distinct, so (Bt0,Bt1,,Btp)(B_{t_0},B_{t_1},\dots,B_{t_p}) is a Gaussian random vector by (a). Define Dk=BtkBtk1D_k=B_{t_k}-B_{t_{k-1}} for 1kp1\le k\le p. The tuple (D1,,Dp)(D_1,\dots,D_p) is the image of (Bt0,,Btp)(B_{t_0},\dots,B_{t_p}) under the affine map with constants 00 whose kk-th row has coefficient 1-1 on the component with time index tk1t_{k-1}, coefficient 11 on the component with time index tkt_k, and 00 elsewhere; hence it is a Gaussian random vector by Affine Transformations of Gaussian Random Vectors are Gaussian, and the covariance formula of that lemma together with (a) gives, for 1k<lp1\le k<l\le p,

Cov(Dk,Dl)=min(tk,tl)min(tk,tl1)min(tk1,tl)+min(tk1,tl1)=tktktk1+tk1=0,\operatorname{Cov}(D_k,D_l)=\min(t_k,t_l)-\min(t_k,t_{l-1})-\min(t_{k-1},t_l)+\min(t_{k-1},t_{l-1})=t_k-t_k-t_{k-1}+t_{k-1}=0,

where the minima were evaluated using tk1<tktl1<tlt_{k-1}<t_k\le t_{l-1}<t_l, which holds since kl1k\le l-1. By Pairwise Uncorrelated Jointly Gaussian Random Variables are Independent, the increments D1,,DpD_1,\dots,D_p are independent. Hence BB has independent increments, which is clause (iv).

All four clauses of Standard Brownian Motion hold, so BB is a standard Brownian motion. \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…