Law of total expectation

From testwiki
Jump to navigation Jump to search

Template:Short description The proposition in probability theory known as the law of total expectation,[1] the law of iterated expectations[2] (LIE), Adam's law,[3] the tower rule,[4] and the smoothing property of conditional expectation,[5] among other names, states that if X is a random variable whose expected value E⁡[X] is defined, and Y is any random variable on the same probability space, then

E⁡[X]=E⁡[E⁡[X∣Y]],

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

The conditional expected value E⁡[X∣Y], with Y a random variable, is not a simple number; it is a random variable whose value depends on the value of Y. That is, the conditional expected value of X given the event Y=y is a number and it is a function of y. If we write g(y) for the value of E⁡[X∣Y=y] then the random variable E⁡[X∣Y] is g(Y).

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

E⁡[X]=∑iE⁡[X∣Ai]Pr⁡(Ai).

Example

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

Applying the law of total expectation, we have:

E⁡[L]=E⁡[L∣X]Pr⁡(X)+E⁡[L∣Y]Pr⁡(Y)=5000(0.6)+4000(0.4)=4600

where

  • E⁡[L] is the expected life of the bulb;
  • Pr⁡(X)=610 is the probability that the purchased bulb was manufactured by factory X;
  • Pr⁡(Y)=410 is the probability that the purchased bulb was manufactured by factory Y;
  • E⁡[L∣X]=5000 is the expected lifetime of a bulb manufactured by X;
  • E⁡[L∣Y]=4000 is the expected lifetime of a bulb manufactured by Y.

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

Informal proof

When a joint probability density function is well defined and the expectations are integrable, we write for the general case E⁡[X]=∫xPr⁡[X=x]dxE⁡[X∣Y=y]=∫xPr⁡[X=x∣Y=y]dxE⁡[E⁡[X∣Y]]=∫(∫xPr⁡[X=x∣Y=y]dx)Pr⁡[Y=y]dy=∬xPr⁡[X=x,Y=y]dxdy=∫x(∫Pr⁡[X=x,Y=y]dy)dx=∫xPr⁡[X=x]dx=E⁡[X]. A similar derivation works for discrete distributions using summation instead of integration. For the specific case of a partition, give each cell of the partition a unique label and let the random variable Y be the function of the sample space that assigns a cell's label to each point in that cell.

Proof in the general case

Let (Ω,ℱ,Pr⁡) be a probability space on which two sub σ-algebras 𝒢1⊆𝒢2⊆ℱ are defined. For a random variable X on such a space, the smoothing law states that if E⁡[X] is defined, i.e. min⁡(E⁡[X+],E⁡[X−])<∞, then

E⁡[E⁡[X∣𝒢2]∣𝒢1]=E⁡[X∣𝒢1](a.s.).

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

  • E⁡[E⁡[X∣𝒢2]∣𝒢1] is 𝒢1-measurable
  • ∫G1E⁡[E⁡[X∣𝒢2]∣𝒢1]dP⁡=∫G1XdP⁡, for all G1∈𝒢1.

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

min⁡(∫G1X+dP⁡,∫G1X−dP)≤min⁡(∫ΩX+dP⁡,∫ΩX−dP)=min⁡(E⁡[X+],E⁡[X−])<∞,

so the integral ∫G1XdP is defined (not equal ∞−∞).

The second property thus holds since G1∈𝒢1⊆𝒢2 implies ∫G1E⁡[E⁡[X∣𝒢2]∣𝒢1]dP⁡=∫G1E⁡[X∣𝒢2]dP⁡=∫G1XdP⁡.

Corollary. In the special case when 𝒢1={∅,Ω} and 𝒢2=σ(Y), the smoothing law reduces to E⁡[E⁡[X∣Y]]=E⁡[X].

Alternative proof for E⁡[E⁡[X∣Y]]=E⁡[X].

This is a simple consequence of the measure-theoretic definition of conditional expectation. By definition, E⁡[X∣Y]:=E⁡[X∣σ(Y)] is a σ(Y)-measurable random variable that satisfies ∫AE⁡[X∣Y]dP⁡=∫AXdP⁡, for every measurable set A∈σ(Y). Taking A=Ω proves the claim.

See also

References

Template:Reflist

Further reading

Template:Refbegin

Template:Refend