Math 2.0

statement theorem

Strong law of large numbers

Statement

Let X1,X2,…X_1, X_2, \dots be i.i.d. real random variables with E[∣X1∣]<∞E[|X_1|] < \infty and μ=E[X1]\mu = E[X_1]. Let Xˉn=(X1+⋯+Xn)/n\bar{X}_n = (X_1 + \dots + X_n)/n. Then Xˉn→μ\bar{X}_n \to \mu almost surely: P(lim⁡n→∞Xˉn=μ)=1.P\left(\lim_{n \to \infty} \bar{X}_n = \mu\right) = 1.

Remarks

The strong law implies the weak law, because almost sure convergence implies convergence in probability. A short proof exists if E[X14]<∞E[X_1^4] < \infty: then E[(Xˉn−μ)4]≤C/n2E[(\bar{X}_n - \mu)^4] \le C/n^2, and the first Borel–Cantelli lemma applies. Etemadi proved that the result holds when the XiX_i are only pairwise independent and identically distributed. Conversely, if E[∣X1∣]=∞E[|X_1|] = \infty, then almost surely Xˉn\bar{X}_n does not converge to a finite limit.

Explanations

L1 human

The strong law says more than the weak law. Almost every infinite sequence of trials has sample means that converge to the true mean. So, with probability 11, the fraction of heads in an infinite sequence of fair coin tosses tends to 1/21/2.

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

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Law_of_large_numbers, Strong law