TheoremBase

Proof of Affine Transformations of Gaussian Random Vectors are Gaussian

lemmalem:gaussian-affine-transformation-2026b
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Cascade of the def:gaussian-random-vector-2026b correction: proof rebased onto lem:gaussian-affine-transformation-2026b; argument unchanged.

Proof

Fix a Gaussian representation (m,(ΞΌk),(akj),(Zj))\bigl(m,(\mu_k),(a_{kj}),(Z_j)\bigr) of (X1,…,Xd)(X_1,\dots,X_d), so that the events Ek={Xk=ΞΌk+βˆ‘j=1makjZj}E_k=\bigl\{X_k=\mu_k+\sum_{j=1}^{m}a_{kj}Z_j\bigr\} satisfy P(Ek)=1P(E_k)=1 for 1≀k≀d1\le k\le d; when m=0m=0 all sums over jj below are empty and equal to 00, in accordance with Gaussian Random Vectors and Jointly Gaussian Random Variables. Each YiY_i is a random variable by the closure of random variables under sums and scalar multiples recorded in the preliminaries of Square-Integrable Random Variables and the Mean-Square Inner Product.

Step 1: A representation for (Y1,…,Yp)(Y_1,\dots,Y_p). Let Ξ©0=β‹‚k=1dEk\Omega_0=\bigcap_{k=1}^{d}E_k. Its complement is the finite union of the complements Ξ©βˆ–Ek\Omega\setminus E_k, each of probability 00, so by the monotonicity and countable additivity of the probability measure PP (finite subadditivity being the special case with cofinitely many empty sets), P(Ξ©βˆ–Ξ©0)=0P(\Omega\setminus\Omega_0)=0, i.e., P(Ξ©0)=1P(\Omega_0)=1. For every Ο‰βˆˆΞ©0\omega\in\Omega_0 and 1≀i≀p1\le i\le p, substituting and rearranging the finite sums,

Yi(Ο‰)=ci+βˆ‘k=1dMik(ΞΌk+βˆ‘j=1makjZj(Ο‰))=Ξ½i+βˆ‘j=1mbijZj(Ο‰),Y_i(\omega)=c_i+\sum_{k=1}^{d}M_{ik}\Bigl(\mu_k+\sum_{j=1}^{m}a_{kj}Z_j(\omega)\Bigr)=\nu_i+\sum_{j=1}^{m}b_{ij}Z_j(\omega),

where

Ξ½i=ci+βˆ‘k=1dMik μk,bij=βˆ‘k=1dMik akj.\nu_i=c_i+\sum_{k=1}^{d}M_{ik}\,\mu_k,\qquad b_{ij}=\sum_{k=1}^{d}M_{ik}\,a_{kj}.

Hence P(Yi=Ξ½i+βˆ‘jbijZj)β‰₯P(Ξ©0)=1P\bigl(Y_i=\nu_i+\sum_{j}b_{ij}Z_j\bigr)\ge P(\Omega_0)=1 for each ii, so (m,(Ξ½i),(bij),(Zj))\bigl(m,(\nu_i),(b_{ij}),(Z_j)\bigr) is a Gaussian representation of (Y1,…,Yp)(Y_1,\dots,Y_p), and (Y1,…,Yp)(Y_1,\dots,Y_p) is a Gaussian random vector.

Step 2: Mean vector and covariances. Apply Claim 2 of Square-Integrability, Moments, and Covariance Matrix of a Gaussian Random Vector twice: to the representation of Step 1, giving E[Yi]=Ξ½i\mathbb{E}[Y_i]=\nu_i and Cov⁑(Yi,Yl)=βˆ‘jbijblj\operatorname{Cov}(Y_i,Y_l)=\sum_{j}b_{ij}b_{lj}, and to the original representation, giving E[Xk]=ΞΌk\mathbb{E}[X_k]=\mu_k and Cov⁑(Xk,Xkβ€²)=βˆ‘jakjakβ€²j\operatorname{Cov}(X_k,X_{k'})=\sum_{j}a_{kj}a_{k'j}. Then

E[Yi]=Ξ½i=ci+βˆ‘k=1dMik E[Xk],\mathbb{E}[Y_i]=\nu_i=c_i+\sum_{k=1}^{d}M_{ik}\,\mathbb{E}[X_k],

and, exchanging the order of the finite sums,

Cov⁑(Yi,Yl)=βˆ‘j=1mbij blj=βˆ‘j=1m(βˆ‘k=1dMikakj)(βˆ‘kβ€²=1dMlkβ€²akβ€²j)=βˆ‘k=1dβˆ‘kβ€²=1dMik Mlkβ€²βˆ‘j=1makj akβ€²j=βˆ‘k=1dβˆ‘kβ€²=1dMik Mlkβ€²Cov⁑(Xk,Xkβ€²).\operatorname{Cov}(Y_i,Y_l)=\sum_{j=1}^{m}b_{ij}\,b_{lj}=\sum_{j=1}^{m}\Bigl(\sum_{k=1}^{d}M_{ik}a_{kj}\Bigr)\Bigl(\sum_{k'=1}^{d}M_{lk'}a_{k'j}\Bigr)=\sum_{k=1}^{d}\sum_{k'=1}^{d}M_{ik}\,M_{lk'}\sum_{j=1}^{m}a_{kj}\,a_{k'j}=\sum_{k=1}^{d}\sum_{k'=1}^{d}M_{ik}\,M_{lk'}\operatorname{Cov}(X_k,X_{k'}).

Step 3: Particular cases. The linear-combination claim is the case p=1p=1 with c1=cc_1=c and M1k=ckM_{1k}=c_k. The subfamily claim is the case ci=0c_i=0 and Mik=1M_{ik}=1 if k=iik=i_i and Mik=0M_{ik}=0 otherwise, where i1<β‹―<ipi_1<\dots<i_p are the selected indices, so that Yi=XiiY_i=X_{i_i} everywhere on Ξ©\Omega. Sums and differences are the case p=1p=1 with coefficients in {1,βˆ’1}\{1,-1\} and c=0c=0. β– \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…