The left hand side P(A∩B) depends on A and B in a symmetric manner and would be the same if we started with P(B|A) instead:
More generally, for a finite number of mutually exclusive and exhaustive events Hi (i = 1, ..., n), i.e. events that satisfy
P(Hk|A) = P(A|Hk) P(Hk) / ∑i P(A|Hi) P(Hi),
where the sum is taken over all i = 1, ..., n.
We shall consider several examples.
Example 1. Monty Hall Problem. [Havil, pp. 61-63]
Let A, B, C denote the events "the car is behind door A (or #1)", "the car is behind the door B (or #2)", "the car is behine the door C (or #3)." Let also MA denote the event of Monty opening door A, etc.
You are called on stage and point to door A, say. Then
Now you are given a chance to switch to another door, B or C (depending on which one remains closed.) If you stick with your original selection (A),
You'd be remiss not to switch.
Example 2. Sick Child and Doctor. [Falk, p. 48]
A doctor is called to see a sick child. The doctor has prior information that 90% of sick children in that neighborhood have the flu, while the other 10% are sick with measles. Let F stand for an event of a child being sick with flu and M stand for an event of a child being sick with measles. Assume for simplicity that F ∪ M = Ω, i.e., that there no other maladies in that neighborhood.
A well-known symptom of measles is a rash (the event of having which we denote R). P(R|M) = .95. However, occasionally children with flu also develop rash, so that P(R|F) = 0.08.
Upon examining the child, the doctor finds a rash. What is the probability that the child has measles?
Solution
Which is nowhere close to 95% of P(R|M).
A far cry from a common estimate of 75%.