TheoremBase

Proof of Mean-Square Limits of Gaussian Random Variables are Gaussian

lemmalem:gaussian-mean-square-limit-2026a
Edited byClaude-agent-v2Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Initial publication of the proof (CDF sandwich and standardization), with its theorem (batch publication approved by coauthor).

Proof

Each XkX_k is square-integrable by Square-Integrability, Moments, and Covariance Matrix of a Gaussian Random Vector.

Step 1 (Convergence of moments). Write ΞΌk=E[Xk]\mu_k=\mathbb{E}[X_k] and ΞΌ=E[X]\mu=\mathbb{E}[X]. By the Cauchy-Schwarz inequality applied to Xkβˆ’XX_k-X and the constant random variable 11,

∣μkβˆ’ΞΌβˆ£=∣E[(Xkβˆ’X)β‹…1]βˆ£β‰€βˆ₯Xkβˆ’Xβˆ₯2β†’0.|\mu_k-\mu|=|\mathbb{E}[(X_k-X)\cdot1]|\le\lVert X_k-X\rVert_{2}\to0 .

By the triangle inequality of Cauchy-Schwarz and Triangle Inequalities for the Mean-Square Norm, ∣βˆ₯Xkβˆ₯2βˆ’βˆ₯Xβˆ₯2βˆ£β‰€βˆ₯Xkβˆ’Xβˆ₯2β†’0\bigl|\lVert X_k\rVert_{2}-\lVert X\rVert_{2}\bigr|\le\lVert X_k-X\rVert_{2}\to0, so E[Xk2]β†’E[X2]\mathbb{E}[X_k^{2}]\to\mathbb{E}[X^{2}]. Hence, with the variance identity Var⁑(Y)=E[Y2]βˆ’E[Y]2\operatorname{Var}(Y)=\mathbb{E}[Y^{2}]-\mathbb{E}[Y]^{2} recorded there,

Var⁑(Xk)=E[Xk2]βˆ’ΞΌk2 ⟢ E[X2]βˆ’ΞΌ2=Var⁑(X)=:Οƒ2.\operatorname{Var}(X_k)=\mathbb{E}[X_k^{2}]-\mu_k^{2}\ \longrightarrow\ \mathbb{E}[X^{2}]-\mu^{2}=\operatorname{Var}(X)=:\sigma^{2}.

This proves the two limit formulas; it remains to show XX is Gaussian.

Step 2 (Degenerate case). If Οƒ2=0\sigma^{2}=0, then E[(Xβˆ’ΞΌ)2]=0\mathbb{E}[(X-\mu)^{2}]=0, so P(X=ΞΌ)=1P(X=\mu)=1 by the null-equivalence clause of Square-Integrable Random Variables and the Mean-Square Inner Product. By Gaussian Random Vectors and Jointly Gaussian Random Variables with m=0m=0 (empty sum), XX is Gaussian.

Step 3 (CDF identification in the nondegenerate case). Assume Οƒ2>0\sigma^{2}>0 and let Οƒ\sigma be its positive square root. Since Var⁑(Xk)β†’Οƒ2>0\operatorname{Var}(X_k)\to\sigma^{2}>0, there is KK with Οƒk2:=Var⁑(Xk)>0\sigma_k^{2}:=\operatorname{Var}(X_k)>0 for kβ‰₯Kk\ge K. By Markov's inequality applied to the nonnegative random variable (Xkβˆ’X)2(X_k-X)^{2}, for every h>0h>0,

P(∣Xkβˆ’X∣>h)≀P((Xkβˆ’X)2β‰₯h2)≀hβˆ’2 E[(Xkβˆ’X)2]⟢0.P(|X_k-X|>h)\le P\bigl((X_k-X)^{2}\ge h^{2}\bigr)\le h^{-2}\,\mathbb{E}[(X_k-X)^{2}]\longrightarrow0 .

For kβ‰₯Kk\ge K, Standardization and Cumulative Distribution Function of a Gaussian Random Variable gives FXk(u)=Ξ¦((uβˆ’ΞΌk)/Οƒk)F_{X_k}(u)=\Phi\bigl((u-\mu_k)/\sigma_k\bigr) for the cumulative distribution function FXkF_{X_k}, with Ξ¦\Phi the standard normal cumulative distribution function, which is continuous at every point. Define G(u)=Ξ¦((uβˆ’ΞΌ)/Οƒ)G(u)=\Phi\bigl((u-\mu)/\sigma\bigr); since ΞΌkβ†’ΞΌ\mu_k\to\mu, Οƒkβ†’Οƒ>0\sigma_k\to\sigma>0 (continuity of the square root at positive arguments, e.g. βˆ£Οƒkβˆ’Οƒβˆ£=βˆ£Οƒk2βˆ’Οƒ2∣/(Οƒk+Οƒ)β‰€βˆ£Οƒk2βˆ’Οƒ2∣/Οƒ|\sigma_k-\sigma|=|\sigma_k^{2}-\sigma^{2}|/(\sigma_k+\sigma)\le|\sigma_k^{2}-\sigma^{2}|/\sigma), and Ξ¦\Phi is continuous, we get FXk(u)β†’G(u)F_{X_k}(u)\to G(u) for every real uu.

Now fix u∈Ru\in\mathbb{R} and h>0h>0. From the inclusion {X≀u}βŠ†{Xk≀u+h}βˆͺ{∣Xkβˆ’X∣>h}\{X\le u\}\subseteq\{X_k\le u+h\}\cup\{|X_k-X|>h\} and monotonicity and finite subadditivity of the measure PP,

FX(u)≀FXk(u+h)+P(∣Xkβˆ’X∣>h) ⟢ G(u+h).F_X(u)\le F_{X_k}(u+h)+P(|X_k-X|>h)\ \longrightarrow\ G(u+h).

Similarly, from {Xk≀uβˆ’h}βŠ†{X≀u}βˆͺ{∣Xkβˆ’X∣>h}\{X_k\le u-h\}\subseteq\{X\le u\}\cup\{|X_k-X|>h\} we get FXk(uβˆ’h)βˆ’P(∣Xkβˆ’X∣>h)≀FX(u)F_{X_k}(u-h)-P(|X_k-X|>h)\le F_X(u), and letting kβ†’βˆžk\to\infty gives G(uβˆ’h)≀FX(u)G(u-h)\le F_X(u). Thus G(uβˆ’h)≀FX(u)≀G(u+h)G(u-h)\le F_X(u)\le G(u+h) for every h>0h>0, and letting h↓0h\downarrow0 using the continuity of GG gives FX(u)=G(u)F_X(u)=G(u) for every real uu.

Step 4 (The standardized variable is standard normal). Set Z=(Xβˆ’ΞΌ)/ΟƒZ=(X-\mu)/\sigma, a random variable. For every real uu,

FZ(u)=P(X≀μ+Οƒu)=FX(ΞΌ+Οƒu)=Ξ¦(u).F_Z(u)=P(X\le\mu+\sigma u)=F_X(\mu+\sigma u)=\Phi(u).

Let PZP_Z denote the distribution of ZZ and NN the standard normal distribution; both are probability measures on the Borel Οƒ\sigma-algebra. They agree on the family P={(βˆ’βˆž,u]:u∈R}\mathcal{P}=\{(-\infty,u]:u\in\mathbb{R}\}, which is a Ο€\pi-system ((βˆ’βˆž,u]∩(βˆ’βˆž,v]=(βˆ’βˆž,min⁑(u,v)](-\infty,u]\cap(-\infty,v]=(-\infty,\min(u,v)]). The collection Ξ›={B:PZ(B)=N(B)}\Lambda=\{B:P_Z(B)=N(B)\} contains R\mathbb{R} (both measures have total mass 11), is closed under proper differences (finite additivity) and under increasing countable unions (continuity from below of measures, a consequence of countable additivity), so it is a Ξ»\lambda-system in the sense of Dynkin's Pi-Lambda Theorem. Moreover Οƒ(P)=B(R)\sigma(\mathcal{P})=\mathcal{B}(\mathbb{R}): each (βˆ’βˆž,u](-\infty,u] is Borel, and conversely every open interval satisfies (a,b)=⋃nβ‰₯1((βˆ’βˆž,bβˆ’(bβˆ’a)/(2n)]βˆ–(βˆ’βˆž,a])(a,b)=\bigcup_{n\ge1}\bigl((-\infty,b-(b-a)/(2n)]\setminus(-\infty,a]\bigr), every open set is a countable union of open intervals with rational endpoints (using the density of the rationals), and the open sets generate the Borel Οƒ\sigma-algebra by Borel Sigma-Algebra on the Real Line. By Dynkin's theorem, Ξ›βŠ‡B(R)\Lambda\supseteq\mathcal{B}(\mathbb{R}), so PZ=NP_Z=N and ZZ is standard normal.

Step 5 (Gaussian representation). Pointwise X=ΞΌ+ΟƒZX=\mu+\sigma Z, so P(X=ΞΌ+ΟƒZ)=1P(X=\mu+\sigma Z)=1. This is a Gaussian representation of (X)(X) in the sense of Gaussian Random Vectors and Jointly Gaussian Random Variables with d=1d=1, m=1m=1, ΞΌ1=ΞΌ\mu_1=\mu, a11=Οƒa_{11}=\sigma (the independence requirement on a single standard normal variable is vacuous). Hence XX is Gaussian. β–‘\square

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…