Math Lab
Home/Class XII/Ch 13/Conditional probability

Conditional probability

When new information arrives, our estimate of probability changes. Conditional probability is the formal tool for updating: P(A∣B)P(A \mid B) is the probability that event AA occurs given that event BB has occurred.

Definition

For events AA and BB in a sample space, with P(B)>0P(B) > 0: P(A∣B)=P(A∩B)P(B).P(A \mid B) = \frac{P(A \cap B)}{P(B)}.

The condition "BB has occurred" effectively shrinks the sample space to BB. Within this reduced space, the proportion of outcomes that are also in AA is P(A∩B)/P(B)P(A \cap B)/P(B).

If P(B)=0P(B) = 0, the conditional P(A∣B)P(A \mid B) is undefined (or arbitrary).

Key properties

For fixed BB with P(B)>0P(B) > 0, the function A↦P(A∣B)A \mapsto P(A \mid B) is a probability , it satisfies all axioms of probability:

  • 0≤P(A∣B)≤10 \le P(A \mid B) \le 1.
  • P(B∣B)=1P(B \mid B) = 1.
  • P(∅∣B)=0P(\emptyset \mid B) = 0.
  • P(A1∪A2∣B)=P(A1∣B)+P(A2∣B)P(A_1 \cup A_2 \mid B) = P(A_1 \mid B) + P(A_2 \mid B) if A1,A2A_1, A_2 disjoint.
  • P(Ac∣B)=1−P(A∣B)P(A^c \mid B) = 1 - P(A \mid B).

But note: P(A∣Bc)P(A \mid B^c) is not generally 1−P(A∣B)1 - P(A \mid B). The complement of BB is a different conditioning event.

Multiplication theorem

Rearranging the definition: P(A∩B)=P(A∣B) P(B)=P(B∣A) P(A).P(A \cap B) = P(A \mid B)\,P(B) = P(B \mid A)\,P(A).

This is the multiplication rule: the joint probability is the product of the conditional and the marginal. It is the key to computing probabilities by sequential reasoning.

For three events: P(A∩B∩C)=P(A)⋅P(B∣A)⋅P(C∣A∩B).P(A \cap B \cap C) = P(A) \cdot P(B \mid A) \cdot P(C \mid A \cap B).

This generalises: peel off one event at a time, conditioning on what's accumulated.

Tree diagrams

When probabilities depend on sequential outcomes, tree diagrams help. At each node, branches represent possible next outcomes; the probability of each branch is conditional on the path so far. The probability of any path is the product of conditional probabilities along it.

Worked examples

Example 1. A fair die is rolled. Let AA = the result is odd, BB = the result is at least 44. Find P(A∣B)P(A \mid B).

B={4,5,6}B = \{4, 5, 6\}, ∣B∣=3|B| = 3. A∩B={5}A \cap B = \{5\}, ∣A∩B∣=1|A \cap B| = 1. P(A∣B)=1/3P(A \mid B) = 1/3.

Example 2. A card is drawn from a standard deck. Find P(spade∣black)P(\text{spade} \mid \text{black}).

P(black)=26/52=1/2P(\text{black}) = 26/52 = 1/2. P(spade∩black)=P(spade)=13/52=1/4P(\text{spade} \cap \text{black}) = P(\text{spade}) = 13/52 = 1/4. So P(spade∣black)=(1/4)/(1/2)=1/2P(\text{spade} \mid \text{black}) = (1/4)/(1/2) = 1/2.

Example 3. A bag has 4 red and 6 blue balls. Two balls are drawn without replacement. Find the probability that both are red.

P(first red)=4/10=2/5P(\text{first red}) = 4/10 = 2/5. After removing one red: P(second red∣first red)=3/9=1/3P(\text{second red} \mid \text{first red}) = 3/9 = 1/3. Joint: (2/5)(1/3)=2/15(2/5)(1/3) = 2/15.

Example 4. Three cards are drawn from a deck (without replacement). Find PP(all kings).

P(1st K)=4/52P(\text{1st K}) = 4/52. P(2nd K∣1st K)=3/51P(\text{2nd K} \mid \text{1st K}) = 3/51. P(3rd K∣1st 2 K)=2/50P(\text{3rd K} \mid \text{1st 2 K}) = 2/50. Product: 4⋅3⋅252⋅51⋅50=24132600=15525\dfrac{4 \cdot 3 \cdot 2}{52 \cdot 51 \cdot 50} = \dfrac{24}{132600} = \dfrac{1}{5525}.

Example 5. Two fair coins are flipped. Given that at least one shows heads, find the probability that both show heads.

P(both H)=1/4P(\text{both H}) = 1/4. P(at least one H)=3/4P(\text{at least one H}) = 3/4. P(both H∣at least one H)=(1/4)/(3/4)=1/3P(\text{both H} \mid \text{at least one H}) = (1/4)/(3/4) = 1/3.

Example 6. A box contains 3 defective and 7 good bulbs. Two bulbs are drawn at random one after the other (without replacement). Find the probability that both are good.

P(1st good)=7/10P(\text{1st good}) = 7/10. P(2nd good∣1st good)=6/9=2/3P(\text{2nd good} \mid \text{1st good}) = 6/9 = 2/3. Joint: 7/10⋅2/3=14/30=7/157/10 \cdot 2/3 = 14/30 = 7/15.

Try it yourself

  1. Roll two dice. Given the sum is 77, find P(both odd)P(\text{both odd}).
  2. A card is drawn. Find P(queen∣face card)P(\text{queen} \mid \text{face card}).
  3. Toss three coins. Given at least one tails, find P(exactly one tails)P(\text{exactly one tails}).
  4. From a deck, two cards are drawn without replacement. Find P(both aces)P(\text{both aces}).
  5. A family has two children. Given at least one is a girl, find P(both girls)P(\text{both girls}). (Assume equally likely outcomes.)
  6. Roll a die twice. Find P(2nd is 6∣1st is even)P(\text{2nd is 6} \mid \text{1st is even}).
  7. From 5 boys and 4 girls, two are chosen. Find P(2nd is girl∣1st is boy)P(\text{2nd is girl} \mid \text{1st is boy}).
  8. A jar has 5 white and 4 red balls. Three balls are drawn. Find P(all red)P(\text{all red}).
  9. Given P(A)=0.6,P(B)=0.4,P(A∩B)=0.2P(A) = 0.6, P(B) = 0.4, P(A \cap B) = 0.2, find P(A∣B)P(A \mid B) and P(B∣A)P(B \mid A).
  10. If P(A∣B)=0.5,P(B)=0.4P(A \mid B) = 0.5, P(B) = 0.4, find P(A∩B)P(A \cap B).
  11. Two events: P(A)=0.3,P(B)=0.5,P(A∪B)=0.6P(A) = 0.3, P(B) = 0.5, P(A \cup B) = 0.6. Find P(B∣A)P(B \mid A).
  12. Bag of 6 W, 4 B balls; draw without replacement. Find P(1st W, 2nd B)P(\text{1st W, 2nd B}).
  13. Two cards from a deck: P(both spades)P(\text{both spades}).
  14. Two coins: one is biased with P(H)=0.7P(H) = 0.7, other fair. Choose one at random and flip. Given heads, find P(biased)P(\text{biased}).

Pitfalls and tricks

  • Conditional probability requires P(B)>0P(B) > 0.
  • The reduced sample space view is often easier: when computing P(A∣B)P(A \mid B), just count outcomes in BB and ask what fraction are also in AA.
  • Tree diagrams are great for two- or three-step problems.
  • Multiplication rule gives the joint as a product of conditional and marginal. Memorise both directions: P(A∩B)=P(A∣B)P(B)=P(B∣A)P(A)P(A \cap B) = P(A|B)P(B) = P(B|A)P(A).
  • Conditional probability is not "given that BB might occur" , it's "given that BB has occurred." Always update accordingly.

Test Your Knowledge

Quick MCQ check on this chapter

Start Quiz →

AI Summary

Summarize this page in your favorite LLM