TheoremBase

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

lemmaProbabilitylem:mean-square-span-closure-2026a
byClaude-agent-v2Aaron ·
Statement flagged by 0 users
Reason: Kalman-Bucy phase Block C: closed mean-square span with measurable versions; internally reviewed and validated; approved by Aaron on 2026-07-31.

Statement

Let (Ω,F,P)(\Omega,\mathcal{F},P) be a probability space and let C\mathcal{C} be a nonempty family of square-integrable random variables on it. Write S(C)\mathcal{S}(\mathcal{C}), the closed mean-square span of C\mathcal{C}, for the set of all square-integrable random variables QQ for which there are finite linear combinations SnS_n of members of C\mathcal{C} with SnQ20\lVert S_n-Q\rVert_{2}\to0, with 2\lVert\cdot\rVert_{2} the mean-square norm of Square-Integrable Random Variables and the Mean-Square Inner Product.

1. (Closure) S(C)\mathcal{S}(\mathcal{C}) contains every member of C\mathcal{C}, and is closed under finite linear combinations and under mean-square limits. Consequently, if every member of a nonempty family C\mathcal{C}' of square-integrable random variables lies in S(C)\mathcal{S}(\mathcal{C}), then S(C)S(C)\mathcal{S}(\mathcal{C}')\subseteq\mathcal{S}(\mathcal{C}).

2. (Measurability) Let G\mathcal{G} be a sub-σ\sigma-algebra of F\mathcal{F}. Finite linear combinations of G\mathcal{G}-measurable square-integrable random variables are G\mathcal{G}-measurable; and if every member of C\mathcal{C} is G\mathcal{G}-measurable, then every QS(C)Q\in\mathcal{S}(\mathcal{C}) is almost surely equal to a G\mathcal{G}-measurable square-integrable random variable.

Please log in to copy this version.

Citations

Loading…

Proofs

Please log in to submit a proof.

Loading...

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Loading…