Key Concepts and Formulas
-
Conditional Probability: The probability of event X occurring given event Y has occurred is defined as:
P(X∣Y)=P(Y)P(X∩Y),provided P(Y)>0
-
De Morgan's Laws for Events: For any two events A and B:
A∩B=A∪B
-
Pairwise Independence: Three events A, B, and C are pairwise independent if the probability of their intersection in pairs equals the product of their individual probabilities:
P(A∩B)=P(A)P(B)
P(A∩C)=P(A)P(C)
P(B∩C)=P(B)P(C)
Step-by-Step Solution
Step 1: Apply the Definition of Conditional Probability
We need to calculate P[(A∩B)∣C]. Using the definition P(X∣Y)=P(Y)P(X∩Y), with X=(A∩B) and Y=C:
P[(A∩B)∣C]=P(C)P((A∩B)∩C)
We are given P(C)>0, so the denominator is valid.
Step 2: Simplify the Numerator using De Morgan's Law
The term (A∩B) in the numerator can be simplified using De Morgan's Law, which states A∩B=A∪B.
Substituting this into the numerator:
P((A∩B)∩C)=P(A∪B∩C)
This expression represents the probability that event C occurs AND the event (A∪B) does NOT occur.
Step 3: Express the Numerator as a Probability of Set Difference
The expression P(A∪B∩C) is of the form P(Y∩X), which is equivalent to P(X∩Y). We know that P(X∩Y)=P(X)−P(X∩Y).
Applying this with X=C and Y=(A∪B):
P(A∪B∩C)=P(C∩A∪B)=P(C)−P(C∩(A∪B))
Step 4: Expand P(C∩(A∪B)) using the Principle of Inclusion-Exclusion
We can distribute C over the union: C∩(A∪B)=(C∩A)∪(C∩B).
Now, we apply the Principle of Inclusion-Exclusion for two events, (C∩A) and (C∩B):
P((C∩A)∪(C∩B))=P(C∩A)+P(C∩B)−P((C∩A)∩(C∩B))
The intersection (C∩A)∩(C∩B) simplifies to C∩A∩B.
So,
P(C∩(A∪B))=P(A∩C)+P(B∩C)−P(A∩B∩C)
Step 5: Substitute Back and Use the Given Condition P(A∩B∩C)=0
Substitute the expanded form of P(C∩(A∪B)) back into the numerator expression from Step 3:
P(A∪B∩C)=P(C)−[P(A∩C)+P(B∩C)−P(A∩B∩C)]
P(A∪B∩C)=P(C)−P(A∩C)−P(B∩C)+P(A∩B∩C)
We are given that P(A∩B∩C)=0. Substituting this value:
P(A∪B∩C)=P(C)−P(A∩C)−P(B∩C)
Now, our original conditional probability expression from Step 1 becomes:
P[(A∩B)∣C]=P(C)P(C)−P(A∩C)−P(B∩C)
Step 6: Utilize the Pairwise Independence Condition
The problem states that A, B, and C are pairwise independent. This means:
- P(A∩C)=P(A)P(C)
- P(B∩C)=P(B)P(C)
Substitute these into the numerator:
P[(A∩B)∣C]=P(C)P(C)−P(A)P(C)−P(B)P(C)
Step 7: Simplify the Expression to Reach the Final Answer
Since P(C)>0, we can divide each term in the numerator by P(C):
P[(A∩B)∣C]=P(C)P(C)−P(C)P(A)P(C)−P(C)P(B)P(C)
P[(A∩B)∣C]=1−P(A)−P(B)
To match the given options, we use the property P(A)=1−P(A):
P[(A∩B)∣C]=P(A)−P(B)
Common Mistakes & Tips
- Distinguish Pairwise vs. Mutual Independence: Pairwise independence (P(E∩F)=P(E)P(F) for all pairs) is a weaker condition than mutual independence (P(A∩B∩C)=P(A)P(B)P(C) in addition to pairwise independence). Do not assume mutual independence unless explicitly stated.
- Interpreting P(A∩B∩C)=0: This condition is simply a given fact. Under pairwise independence, it does not imply that any individual event probability is zero. If it were mutual independence, then P(A)P(B)P(C)=0 would imply at least one of P(A),P(B),P(C) is zero, which is a much stronger conclusion.
- Correct Application of Set Identities: Be meticulous with De Morgan's laws and the distribution property of intersection over union. A small error can lead to a completely different result.
Summary
This problem effectively tests your foundational knowledge of probability, particularly conditional probability, De Morgan's Laws, the Principle of Inclusion-Exclusion, and the precise application of pairwise independence. The solution involved systematically breaking down the conditional probability expression, simplifying it using set identities and given conditions (P(A∩B∩C)=0 and pairwise independence), and then performing algebraic simplification to arrive at the final form.
The final answer is P(A)−P(B), which corresponds to option (A).