Law of total expectation

The proposition in probability theory known as the law of total expectation,[1] the law of iterated expectations, the tower rule, the smoothing theorem, and Adam's Law among other names, states that if is an integrable random variable (i.e. and is any random variable, not necessarily integrable, on the same probability space, then

i.e., the expected value of the conditional expected value of given is the same as the expected value of .

One special case states that if is a finite or countable partition of the sample space, then

Example

Suppose that two factories supply light bulbs to the market. Factory 's bulbs work for an average of 5000 hours, whereas factory 's bulbs work for an average of 4000 hours. It is known that factory supplies 60% of the total bulbs available. What is the expected length of time that a purchased bulb will work for?

Applying the law of total expectation, we have:

where

Thus each purchased light bulb has an expected lifetime of 4600 hours.

Proof in the finite and countable cases

If both summations are finite, then we can switch them around, and the previous expression will become

so we are done.

If at least one of the two summations is infinite, we still can switch their order without changing the sum if the series converges absolutely. We prove absolute convergence by observing that

as required. (The last calculation once again uses the fact that the members of an absolutely converging series can be transposed arbitrarily without altering the sum).

Proof in the general case

Let be a probability space on which two sub σ-algebras are defined. For a random variable on such a space, where , the smoothing law states that

Proof. Since a conditional expectation is a Radon–Nikodym derivative, verifying the following two properties establishes the smoothing law:

The first of these properties holds by the definition of the conditional expectation. To prove the second one, note that

so the integral on the right-hand side exists for every . The second property thus holds since implies

Corollary. In the special case when and , the smoothing law reduces to

Proof of partition formula

where is the indicator function of the set .

If the partition is finite, then, by linearity, the previous expression becomes

and we are done.

If, however, the partition is infinite, then we use the dominated convergence theorem to show that

Indeed, for every ,

Since every element of the set falls into a specific partition , it is straightforward to verify that the sequence pointwise-converges to . By initial assumption, . Applying the dominated convergence theorem yields the desired.

See also

References

  1. Weiss, Neil A. (2005). A Course in Probability. Boston: Addison–Wesley. pp. 380–383. ISBN 0-321-18954-X.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.