The law of total expectation makes averaging in stages reliable, provided the outer stage uses the actual probabilities of the groups. For an integrable random variable and a sub-sigma-algebra ,Replacing each outcome by its group's conditional mean preserves the overall expected value. In the definition of conditional expectation, take the event to obtain this identity.[ref]
For a complete finite example, choose a group with probability and with probability . Within group , is or with equal conditional probabilities; within group , it is or with equal conditional probabilities. Thus the joint probability distribution puts probabilities on . The conditional means are two and eight. Consequently,Direct averaging of the four values gives the same . Taking the unweighted average of the two group means instead gives five, which describes a different choice of group probabilities. This is why the outer weighting matters.
The formula is useful when conditioning on a first choice makes the remaining experiment simple. It can replace a large outcome enumeration by smaller calculations within groups. In a mixture distribution, it combines component means using mixture weights; in a random sum of independent claims, it separates the number of summands from their individual expected values under the stated independence assumptions. The same averaging step appears in the law of total variance.
For integrable random variable and nested sub-sigma-algebras , the tower property saysThe finer-information conditional mean can be averaged within each coarser group, recovering the coarser-information conditional mean. Conversely, conditioning an already -measurable conditional mean on leaves it unchanged. Both orders therefore recover when the information is nested.[ref]
For the finite example in law of total expectation, exact knowledge of gives the finer mean itself. Averaging within the groups recovers two and eight. Forgetting the group then gives . The nesting condition is essential; iterated conditional expectation over nonnested sigma-algebras describes why arbitrary successive conditioning cannot simply be replaced by conditioning on an intersection.
Articles by others on the same topic
There are currently no matching articles.
