The multiplication rule and tree diagrams · Mathematics… | StemPy Lab
Course 16.1·Lesson 2 of 3
The multiplication rule and tree diagrams
Rearrange the conditional probability formula and you get the multiplication rule, P(A∩B)=P(A)P(B∣A)
Lesson 2 of 3Show all lessonsHide
Try the code and the simulations beside the lesson.
What you will be able to do
use P(A∩B)=P(A)P(B∣A) to find the chance that two things both happen;
draw a tree diagram, multiply along the branches and add the paths that make an event;
find "at least one" with the complement.
Two cards from a pack
Two cards are taken from a pack of 52, one after the other, and the first is not put back. What is the chance that both are aces?
The first card is an ace with probability 524. Now 3 aces are left among 51 cards. So the second card is an ace, given that the first was, with probability 513. Both happen with probability
524×513=2211.
We multiplied a first-stage probability by a second-stage probability that already knew what happened first. That is the multiplication rule.
The multiplication rule
Start from the definition P(B∣A)=P(A)P(A∩B) and multiply both sides by P(A):
P(A∩B)=P(A)P(B∣A).
By symmetry P(A∩B)=P(B)P(A∣B) too. Indian books call this the multiplication theorem. For three events the rule goes on:
P(A∩B∩C)=P(A)P(B∣A)P(C∣A∩B).
Each factor is conditional on everything that came before it.
Tree diagrams
A tree diagram shows an experiment stage by stage. Each stage is a set of branches. Write on each branch the probability of that step, given the path so far.
The branches leaving one point add up to 1, because exactly one of them must happen.
Multiply along a path to get the probability of that whole outcome.
Add the paths that belong to an event.
The tree below is for a bag with 4 red and 3 blue balls, drawn twice without replacement. After a red first draw, the bag has 3 red and 3 blue balls, so the second-stage branches are 63 and 63.
A tree diagram for two draws without replacement from a bag of 4 red and 3 blue balls. The first draw has branches R with probability 4 over 7 and B with 3 over 7. After R, the second draw has R with 1 over 2 and B with 1 over 2. After B, it has R with 2 over 3 and B with 1 over 3. The four ends show RR 2 over 7, RB 2 over 7, BR 2 over 7 and BB 1 over 7.
With and without replacement
If the first ball is put back, the bag is the same for the second draw, and the second-stage branches repeat the first. Then P(RR)=74×74=4916. Without replacement, P(RR)=74×63=72=4914. The branches of a tree change only when the first stage changes the second.
A worked example with three stages
A box holds 6 good bulbs and 4 faulty bulbs. Three bulbs are tested one by one without replacement.
All good.106×95×84=61.
At least one faulty. Use the complement: 1−61=65.
Exactly one faulty. There are three paths: FGG, GFG and GGF. The path FGG has probability 104×96×85=61. The other two paths have the same three numerators in another order, so they are 61 each. The sum is 21.
The shortcut in step 2 is worth remembering: P(at least one)=1−P(none). It replaces many paths with one.
Practise with new numbers
Try it in Python
The program walks through the tree of the bag with 4 red and 3 blue balls. It multiplies along each path and adds the paths that give exactly one red.
Common mistakes
Keeping the first-stage probability for the second stage. Without replacement the numbers in the bag have changed.
Adding along a path. On a path you multiply. You add only across different paths.
Missing a path. For "exactly one red" there are two paths, red then blue and blue then red. Count the orders.
Forgetting the complement. For "at least one" it is faster to find "none" and subtract from 1.
Remember these
P(A∩B)=P(A)P(B∣A), and for three events P(A∩B∩C)=P(A)P(B∣A)P(C∣A∩B).
In a tree, multiply along a path and add across paths.
The branches from one point add up to 1.
P(at least one)=1−P(none).
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Two cards are drawn from a pack of 52 without replacement. Find the probability that both are kings.
A bag holds 5 red and 3 blue balls. Two balls are drawn with replacement. Find the probability that both are red, and the probability that the two colours differ.
The same bag of 5 red and 3 blue balls is used, but now the first ball is not put back. Find the probability that exactly one ball is red.
A fair die is thrown 4 times. Find the probability of at least one six.
Why must the branches leaving one point of a tree add up to 1?
References
OpenStax, Introductory Statistics, Chapter 3, section on tree and Venn diagrams.
NCERT, Mathematics Part II for Class XII, Chapter 13, section on the multiplication theorem on probability.
Enroll free in Conditional Probability and Independent Events
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.
. A tree diagram lays out the stages of an experiment: multiply along a path and add across paths. This lesson covers draws with and without replacement, chains of three events and the shortcut for "at least one".
about 25 min1 simulation1 practice question1 Python program5 questions to check yourself
This lesson is free to read. Enroll free to keep your place and take the tests.