Bayes’ theorem
In a minute
turns a conditional probability round. You know how likely the evidence is for each cause, and it tells you how likely each cause is once you have seen the evidence. It works for two or three first-stage outcomes, and it shows at once when two events are independent.
You'll be able to
- Find from , and with .
- Use Bayes' theorem when the first stage has three outcomes that form a .
- Combine Bayes' theorem with binomial probabilities from your calculator on Paper 2.
- Spot when the evidence changes nothing, and use Bayes' theorem to decide whether two events are .
Before you start3 quick questions on what this builds on
Revise first: 4.11 Conditional probability
Bayes' theorem for two events
In 4.11 you turned a round. You knew how the second stage ended, and you found the chance of a first-stage branch. is that method written as one formula.
Questions often give the chance of the evidence for each cause. You want the reverse: the chance of the cause, given the evidence. The two can be very different.
Take a factory scanner that checks bolts for cracks. Only of bolts are cracked. It sounds an alarm for of cracked bolts, and also for of good ones. If the alarm sounds, how likely is a crack?
Picture bolts. Of these, are cracked, and the alarm sounds for of them. The other are good, and the alarm sounds for of those, which is .
So bolts set off the alarm, and only of them are cracked. Given an alarm, the chance of a crack is . Most alarms are false, because good bolts far outnumber cracked ones.
Now use probabilities. Let be the first-stage event (cracked) and the evidence (alarm). The top is the path through to . The bottom adds every path that ends in , which gives .
It's in the formula booklet, so you don't need to memorise it. Your job is to name the events: is the first-stage event you want, and is the one you are told happened.
Check it on the bolts: . That matches the count.
Try it first, then reveal one step at a time.
- Name the events. Let be "the email is spam" and be "the email is flagged". You want .
- You know , so . Also and .
- Substitute into Bayes' theorem: .
- Multiply top and bottom by to clear the decimals: .
- Sense check: , far above . A flag is strong evidence of spam.
Try it first, then reveal one step at a time.
- Let be "the first serve lands in" and be "Mia wins the point". So and .
- The question is about losing, so use complements: and .
- (a) Add the two paths that end in : , as required.
- (b) Bayes' theorem, with the answer to (a) on the bottom: .
- A wrong (a) used correctly here can still earn follow-through marks in (b).
Three first-stage outcomes
Sometimes the first stage has three outcomes, such as three couriers or three machines. The idea is the same: one path on top, every path to the evidence on the bottom.
and are a partition with two pieces, so the two-event version is a special case. With three pieces, the bottom of the formula gains a third path.
This is for three events, and it is in the booklet too. Here is , or , for the event you want. The bottom adds all three paths to give , whichever you want.
Try it first, then reveal one step at a time.
- Let be "the parcel is late". Each parcel goes with exactly one courier, and , so , , form a partition.
- (a) Add the three paths that end in : .
- (b) Bayes' theorem with : .
- Sense check: carries of parcels but half the late ones, as its late rate is highest. Also and , and the three add up to .
On Paper 2, the second-stage probabilities may come from a distribution. Find each one with your calculator, then put them into Bayes' theorem exactly as before.
Try it first, then reveal one step at a time.
- Let be "exactly reds in spins". The first stage is the type: , and .
- Given the type, the number of reds is binomial: , or . So each is .
- Binomial pdf values: , , .
- Bayes' theorem with : .
- Evaluate, rounding only at the end: .
- Sense check: gives reds most often, but there is only one in the box. So is still more likely, with
When the evidence changes nothing
Look at when the evidence is equally likely on both branches, so . Call this common value .
The bottom becomes , because . So .
If the evidence is just as likely whatever the cause, seeing it tells you nothing. The reversed probability equals the one you started with. That is what means, as in 4.6 and 4.11.
This product rule from the formula booklet is the same idea. The same holds with three branches: if is equal for all three, then every .
Try it first, then reveal one step at a time.
- Bayes' theorem: .
- The answer is again. A personal best is equally likely with or without music, so it tells you nothing about the music. and are independent.
Try it first, then reveal one step at a time.
- (a) . Bayes' theorem: .
- Work out the paths: .
- Simplify: .
- (b) Compare with the starting probability: .
- Knowing happened lowers the chance of . So and are not independent. You could also see this from .
Common mistakes
- Giving the conditional the question gave you. If you know and want , the is not the answer: turn it round with Bayes' theorem.
- Stopping at the top line. A path product is the chance of both events. Divide it by the total of every path that ends in the given event.
- Leaving a path out of the bottom. Three first-stage outcomes give three products; check their probabilities add up to .
- Writing . The complement rule changes the event before the bar, never the condition.
- Rounding calculator values before dividing. Store them and round only the final answer.
- Calling events independent with no comparison. Give both values, write or , and conclude in words.
Exam tips
- "Find" a reversed probability: name your events, then write Bayes' theorem with your letters before any numbers. That line earns the method mark.
- On Paper 1, keep answers exact. Clear decimals by multiplying top and bottom by a power of : .
- When part (b) divides by the probability from part (a), a wrong (a) used correctly can still earn follow-through marks.
Key takeaways
Practise this
6 past-paper questions on 4.13 in the AA HL bank, each with a mark scheme and a worked explanation.