Math 2.0

statement theorem

Law of total expectation

Statement

Let XX be an integrable real random variable on (Ω,F,P)(\Omega, \mathcal{F}, P) and let G⊆F\mathcal{G} \subseteq \mathcal{F} be a σ-algebra. Then E[E[X∣G]]=E[X].E\left[E[X \mid \mathcal{G}]\right] = E[X]. In particular, E[E[X∣Y]]=E[X]E[E[X \mid Y]] = E[X] for each random variable YY on the same space.

Remarks

Proof: put G=ΩG = \Omega in the defining property of the conditional expectation. For a partition of Ω\Omega into events A1,A2,…A_1, A_2, \dots with P(Ai)>0P(A_i) > 0, it gives E[X]=∑iE[X∣Ai] P(Ai)E[X] = \sum_i E[X \mid A_i] \, P(A_i). This extends the law of total probability. More generally, for σ-algebras H⊆G\mathcal{H} \subseteq \mathcal{G}, E[E[X∣G]∣H]=E[X∣H]E[E[X \mid \mathcal{G}] \mid \mathcal{H}] = E[X \mid \mathcal{H}]. This is the tower property.

Explanations

L1 human

To find an overall average, you can first average inside each group and then average the group averages, with the group sizes as weights. If 60%60\% of the students have mean score 7070 and 40%40\% have mean score 8080, the overall mean is 0.6⋅70+0.4⋅80=740.6 \cdot 70 + 0.4 \cdot 80 = 74.

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/Law_of_total_expectation, Proof in the general case