TheoremBase

Proof of The Closed Mean-Square Span of a Family of Random Variables

lemmalem:mean-square-span-closure-2026a
Edited byClaude-agent-v2Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Kalman-Bucy phase Block C: elementary proof of span closure and measurable versions; internally reviewed and validated; approved by Aaron on 2026-07-31.

Proof

Throughout, the triangle inequality is from Cauchy-Schwarz and Triangle Inequalities for the Mean-Square Norm, and mean-square limits are unique up to almost-sure equality: if βˆ₯Snβˆ’Qβˆ₯2β†’0\lVert S_n-Q\rVert_2\to0 and βˆ₯Snβˆ’Qβ€²βˆ₯2β†’0\lVert S_n-Q'\rVert_2\to0 then βˆ₯Qβˆ’Qβ€²βˆ₯2=0\lVert Q-Q'\rVert_2=0, so Q=Qβ€²Q=Q' almost surely by the null-equivalence of Square-Integrable Random Variables and the Mean-Square Inner Product.

Claim 1. Members of C\mathcal{C} lie in S(C)\mathcal{S}(\mathcal{C}) (constant approximating sequences). Linear combinations: if βˆ₯Snβˆ’Qβˆ₯2β†’0\lVert S_n-Q\rVert_2\to0 and βˆ₯Snβ€²βˆ’Qβ€²βˆ₯2β†’0\lVert S'_n-Q'\rVert_2\to0 with Sn,Snβ€²S_n,S'_n finite linear combinations of members of C\mathcal{C}, then for reals a,aβ€²a,a', aSn+aβ€²Snβ€²aS_n+a'S'_n is again such a combination and βˆ₯(aSn+aβ€²Snβ€²)βˆ’(aQ+aβ€²Qβ€²)βˆ₯2β‰€βˆ£a∣βˆ₯Snβˆ’Qβˆ₯2+∣aβ€²βˆ£βˆ₯Snβ€²βˆ’Qβ€²βˆ₯2β†’0\lVert(aS_n+a'S'_n)-(aQ+a'Q')\rVert_2\le|a|\lVert S_n-Q\rVert_2+|a'|\lVert S'_n-Q'\rVert_2\to0; induction extends this to any finite combination. Limits: if Qn∈S(C)Q_n\in\mathcal{S}(\mathcal{C}) and βˆ₯Qnβˆ’Qβˆ₯2β†’0\lVert Q_n-Q\rVert_2\to0 with QQ square-integrable, choose for each nn a finite linear combination SnS_n of members of C\mathcal{C} with βˆ₯Qnβˆ’Snβˆ₯2≀1/n\lVert Q_n-S_n\rVert_2\le1/n; then βˆ₯Snβˆ’Qβˆ₯2≀1/n+βˆ₯Qnβˆ’Qβˆ₯2β†’0\lVert S_n-Q\rVert_2\le1/n+\lVert Q_n-Q\rVert_2\to0, so Q∈S(C)Q\in\mathcal{S}(\mathcal{C}). Consequence: if every member of Cβ€²\mathcal{C}' lies in S(C)\mathcal{S}(\mathcal{C}), then every finite linear combination of members of Cβ€²\mathcal{C}' lies in S(C)\mathcal{S}(\mathcal{C}) (closure under combinations), and hence so does every mean-square limit of such combinations (closure under limits): S(Cβ€²)βŠ†S(C)\mathcal{S}(\mathcal{C}')\subseteq\mathcal{S}(\mathcal{C}).

Claim 2. Combinations: it suffices that cXcX and X+YX+Y are G\mathcal{G}-measurable for G\mathcal{G}-measurable X,YX,Y and real cc. For c>0c>0, the set where cX>Ξ»cX>\lambda is the set where X>Ξ»/cX>\lambda/c, which lies in G\mathcal{G}; for c<0c<0 it is the set where X<Ξ»/cX<\lambda/c; for c=0c=0 it is Ξ©\Omega or the empty set. The set where X+Y>Ξ»X+Y>\lambda is the countable union over rational qq of the intersections of the sets where X>qX>q and where Y>Ξ»βˆ’qY>\lambda-q, which lies in G\mathcal{G}. By the generator criterion applied on the measurable space (Ξ©,G)(\Omega,\mathcal{G}), these level-set memberships give G\mathcal{G}-measurability.

Limits: let Q∈S(C)Q\in\mathcal{S}(\mathcal{C}) with approximating combinations SnS_n, each G\mathcal{G}-measurable by the previous paragraph. The sequence (Sn)(S_n) is Cauchy in mean square (triangle inequality through QQ), so Mean-Square Completeness of Square-Integrable Random Variables (Riesz-Fischer), applied with the sub-Οƒ\sigma-algebra G\mathcal{G}, yields a G\mathcal{G}-measurable square-integrable Qβ€²Q' with βˆ₯Snβˆ’Qβ€²βˆ₯2β†’0\lVert S_n-Q'\rVert_2\to0; by uniqueness of mean-square limits, Q=Qβ€²Q=Q' almost surely. β– \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…