TheoremBase

Convergence in Lᵖ of Random Vectors

For a real p at least 1, a sequence of random vectors in RkR^k converges in LpL^p to a random vector when the expected p-th power of the Euclidean norm of their difference tends to zero.

Statement

In the setting of Probability Spaces: Notation, let k∈Nk\in\mathbb{N}, let p≥1p\ge1 be a real number, and let ∥⋅∥\lVert\cdot\rVert be the Euclidean norm on Rk\mathbb{R}^{k}. Let (Yn)n∈N(Y_{n})_{n\in\mathbb{N}} be a sequence of random vectors in Rk\mathbb{R}^{k} and let YY be a random vector in Rk\mathbb{R}^{k}, with ∥Yn−Y∥∈Lp(P)\lVert Y_{n}-Y\rVert\in\mathcal{L}^{p}(P) for every n∈Nn\in\mathbb{N}.

Convergence in LpL^{p}. (Yn)(Y_{n}) converges to YY in LpL^{p} if

E∥Yn−Y∥p→0(n→∞),\mathbb{E}\lVert Y_{n}-Y\rVert^{p}\to0\qquad(n\to\infty),

each expectation being a real number since ∥Yn−Y∥∈Lp(P)\lVert Y_{n}-Y\rVert\in\mathcal{L}^{p}(P), and convergence of real numbers as in Convergent Sequences of Real Numbers (i).

Citations

Loading…

Dependencies

Loading…

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

Log in to comment.

Loading…