Lably
Skip to content

Law of total probability

Concept in probability theory

  • 2 min read
  • 4 chapters
  • 1 lab on Lably

Learn it on Lably

Statement

The law of total probability is a theorem that states, in its discrete case, if {Bn:n=1,2,3,…} is a finite or countably infinite set of mutually exclusive and collectively exhaustive events, then for any event A

P(A)=∑nP(A∩Bn)

or, alternatively,

P(A)=∑nP(A∣Bn)P(Bn),

where, for any n, if P(Bn)=0, then these terms are simply omitted from the summation since P(A∣Bn) is finite.

The summation can be interpreted as a weighted average, and consequently the marginal probability, P(A), is sometimes called "average probability"; "overall probability" is sometimes used in less formal writings.

The law of total probability can also be stated for conditional probabilities:

P(A∣C)=P(A,C)P(C)=∑nP(A,Bn,C)P(C)=∑nP(A∣Bn,C)P(Bn∣C)P(C)P(C)=∑nP(A∣Bn,C)P(Bn∣C)

Taking the Bn as above, and assuming C is an event independent of any of the Bn:

P(A∣C)=∑nP(A∣C,Bn)P(Bn)

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Mathematics