Math 2.0

definition

Convergence in mean

Definition

Let r≥1r \ge 1 be real. Let X,X1,X2,…X, X_1, X_2, \dots be real random variables on one probability space with E[∣X∣r]<∞E[|X|^r] < \infty and E[∣Xn∣r]<∞E[|X_n|^r] < \infty for each nn. The sequence (Xn)(X_n) converges in rr-th mean, or in LrL^r, to XX if lim⁡n→∞E[∣Xn−X∣r]=0.\lim_{n \to \infty} E\left[|X_n - X|^r\right] = 0. For r=1r = 1 one says convergence in mean, and for r=2r = 2 convergence in mean square.

Remarks

By Markov's inequality, P(∣Xn−X∣>ε)≤E[∣Xn−X∣r]/εrP(|X_n - X| > \varepsilon) \le E[|X_n - X|^r] / \varepsilon^r. So convergence in rr-th mean implies convergence in probability. For s≥r≥1s \ge r \ge 1, convergence in ss-th mean implies convergence in rr-th mean. Convergence in mean does not imply almost sure convergence, and almost sure convergence does not imply convergence in mean. Example: on [0,1][0, 1] with the uniform measure, Xn=n 1[0,1/n]X_n = n \, 1_{[0, 1/n]} converges to 00 almost surely but E[Xn]=1E[X_n] = 1 for all nn.

Explanations

L1 human

Convergence in mean asks that the average size of the error ∣Xn−X∣r|X_n - X|^r goes to 00. Mean square convergence, with r=2r = 2, is common in statistics, where it says that the mean squared error of an estimator goes to 00.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Convergence_of_random_variables, Convergence in mean