Math 2.0

statement theorem

Law of the unconscious statistician

Statement

Let XX be a random variable on (Ω,F,P)(\Omega, \mathcal{F}, P) with values in (E,E)(E, \mathcal{E}) and with law μX\mu_X. Let g ⁣:E→Rg \colon E \to \mathbb{R} be measurable. Then g(X)g(X) is integrable if and only if ∫E∣g∣ dμX<∞\int_E |g| \, d\mu_X < \infty. In that case, E[g(X)]=∫Eg(x) μX(dx).E[g(X)] = \int_E g(x) \, \mu_X(dx). In particular, if XX is discrete with mass function pp, then E[g(X)]=∑xg(x) p(x)E[g(X)] = \sum_x g(x) \, p(x). If XX is real with density ff, then E[g(X)]=∫−∞∞g(x)f(x) dxE[g(X)] = \int_{-\infty}^{\infty} g(x) f(x) \, dx.

Remarks

The formula also holds for g≥0g \ge 0 without any integrability condition, with both sides in [0,∞][0, \infty]. The proof checks the formula first for indicator functions g=1Bg = 1_B, where it says P(X∈B)=μX(B)P(X \in B) = \mu_X(B). Then it extends to simple, nonnegative and integrable gg. The point is that one does not need the law of g(X)g(X) to compute E[g(X)]E[g(X)].

History

The name refers to statisticians who use the formula as the definition of E[g(X)]E[g(X)]. They are "unconscious" that it is a theorem that needs a proof.

Explanations

L1 human

To find the average of g(X)g(X), you can average g(x)g(x) over the values xx of XX with their probabilities. For a fair die, E[X2]=(1+4+9+16+25+36)/6=91/6E[X^2] = (1 + 4 + 9 + 16 + 25 + 36)/6 = 91/6.

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

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

Sources

  1. Web https://en.wikipedia.org/wiki/Law_of_the_unconscious_statistician, Measure-theoretic formulation