Math 2.0

statement theorem

Almost sure convergence implies convergence in probability

Statement

Let X,X1,X2,…X, X_1, X_2, \dots be real random variables on one probability space. If Xn→XX_n \to X almost surely, then Xn→XX_n \to X in probability.

Remarks

Proof: fix ε>0\varepsilon > 0 and let An=⋃m≥n{∣Xm−X∣>ε}A_n = \bigcup_{m \ge n} \{|X_m - X| > \varepsilon\}. The events AnA_n decrease, and their intersection has probability 00 by almost sure convergence. By the continuity of probability, P(An)→0P(A_n) \to 0. Since {∣Xn−X∣>ε}⊆An\{|X_n - X| > \varepsilon\} \subseteq A_n, the claim follows. The converse is false. Let XnX_n be independent with P(Xn=1)=1/nP(X_n = 1) = 1/n and P(Xn=0)=1−1/nP(X_n = 0) = 1 - 1/n. Then Xn→0X_n \to 0 in probability. But by the second Borel–Cantelli lemma, Xn=1X_n = 1 for infinitely many nn almost surely, so XnX_n does not converge to 00 almost surely.

Explanations

L1 human

If almost every run of the experiment gives a sequence that settles down at XX, then for large nn a large deviation becomes unlikely.

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.

Sources

  1. Web https://en.wikipedia.org/wiki/Convergence_of_random_variables, Properties