Theorem
Probability • Addition and Multiplication Theorems
Formula
For any two events, , with equality exactly when .
How to use it
- 1Why it works: no probability is more than . In the addition theorem the union is subtracted, so the largest the union can be, , gives the smallest the intersection can be.
- 2Use it when two probabilities add up to more than : the events must overlap by at least the excess.
- 3Divide by , when it is positive, to get a least value for .
Worked example
and . What is the least possible value of ?
Step-by-step
- 1
Why: Addition theorem.
- 2, so
Why: The intersection is least when the union is as large as it can be.
Answer
Watch out
The sign is , not : the bound is reached when is certain. When the bound is or negative and says nothing new.
Builds on
Also known as
lower bound of intersection, Bonferroni inequality for two events, minimum overlap of two events