TheoremBase

Proof of Almost Sure Modifications of Gaussian Random Vectors are Gaussian

lemmalem:gaussian-almost-sure-modification-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Proof of lem:gaussian-almost-sure-modification-2026a: null-event bookkeeping from the measure axioms and transfer of the Gaussian representation. Approved by Aaron.

Proof

Step 1: finite unions of null events are null. Let M1,M2∈FM_1,M_2\in\mathcal{F} with P(M1)=P(M2)=0P(M_1)=P(M_2)=0. By the Οƒ\sigma-algebra operations, M2βˆ–M1M_2\setminus M_1, M2∩M1M_2\cap M_1, and M1βˆͺM2M_1\cup M_2 are events. Since M2=(M2βˆ–M1)βˆͺ(M2∩M1)M_2=(M_2\setminus M_1)\cup(M_2\cap M_1) is a disjoint union, additivity and nonnegativity of the measure PP give P(M2βˆ–M1)≀P(M2)=0P(M_2\setminus M_1)\le P(M_2)=0. Since M1βˆͺM2=M1βˆͺ(M2βˆ–M1)M_1\cup M_2=M_1\cup(M_2\setminus M_1) is a disjoint union, additivity gives P(M1βˆͺM2)=P(M1)+P(M2βˆ–M1)=0P(M_1\cup M_2)=P(M_1)+P(M_2\setminus M_1)=0. Iterating, any union of finitely many events of probability 00 has probability 00. Also, for any event AA, the disjoint union Aβˆͺ(Ξ©βˆ–A)=Ξ©A\cup(\Omega\setminus A)=\Omega and P(Ξ©)=1P(\Omega)=1 give P(Ξ©βˆ–A)=1βˆ’P(A)P(\Omega\setminus A)=1-P(A); in particular an event has probability 11 exactly when its complement has probability 00, and an event containing the complement of an event of probability 00 has probability 11, by the monotonicity argument above.

Step 2: transfer of a representation. Let (m,(ΞΌi),(aij),(Zj))\bigl(m,(\mu_i),(a_{ij}),(Z_j)\bigr) be any Gaussian representation of (Y1,…,Yd)(Y_1,\dots,Y_d), so that the events

Ai={Yi=ΞΌi+βˆ‘j=1maijZj}(1≀i≀d)A_i=\Bigl\{Y_i=\mu_i+\sum_{j=1}^{m}a_{ij}Z_j\Bigr\}\qquad(1\le i\le d)

satisfy P(Ai)=1P(A_i)=1 (these are events for the same reason as the sets {Xi=Yi}\{X_i=Y_i\}: differences of random variables are random variables, as noted in Stochastic Process, Independent Increments, and Inhomogeneous Poisson Process, sums and scalar multiples of random variables being random variables in the same way, and {0}\{0\} is a Borel set). Put Bi={Xi=Yi}B_i=\{X_i=Y_i\}, with P(Bi)=1P(B_i)=1 by hypothesis, and let

N=⋃i=1d((Ξ©βˆ–Ai)βˆͺ(Ξ©βˆ–Bi)).N=\bigcup_{i=1}^{d}\bigl((\Omega\setminus A_i)\cup(\Omega\setminus B_i)\bigr).

By Step 1, P(N)=0P(N)=0. For every Ο‰βˆˆΞ©βˆ–N\omega\in\Omega\setminus N and every ii,

Xi(Ο‰)=Yi(Ο‰)=ΞΌi+βˆ‘j=1maijZj(Ο‰),X_i(\omega)=Y_i(\omega)=\mu_i+\sum_{j=1}^{m}a_{ij}Z_j(\omega),

so the event {Xi=ΞΌi+βˆ‘j=1maijZj}\bigl\{X_i=\mu_i+\sum_{j=1}^{m}a_{ij}Z_j\bigr\} contains Ξ©βˆ–N\Omega\setminus N and therefore has probability 11 by Step 1. Since Z1,…,ZmZ_1,\dots,Z_m are unchanged, (m,(ΞΌi),(aij),(Zj))\bigl(m,(\mu_i),(a_{ij}),(Z_j)\bigr) is a Gaussian representation of (X1,…,Xd)(X_1,\dots,X_d), and (X1,…,Xd)(X_1,\dots,X_d) is a Gaussian random vector.

Step 3: moments. By claim 2 of Square-Integrability, Moments, and Covariance Matrix of a Gaussian Random Vector applied to the shared representation,

E[Xi]=ΞΌi=E[Yi],Cov⁑(Xi,Xk)=βˆ‘j=1maij akj=Cov⁑(Yi,Yk)(1≀i,k≀d).\mathbb{E}[X_i]=\mu_i=\mathbb{E}[Y_i],\qquad \operatorname{Cov}(X_i,X_k)=\sum_{j=1}^{m}a_{ij}\,a_{kj}=\operatorname{Cov}(Y_i,Y_k)\qquad(1\le i,k\le d).

By claim 3 of the same lemma these quantities do not depend on the choice of representation, so the mean vectors and covariance matrices of the two tuples coincide. β– \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…