Events as Sets
Events are subsets of the sample space. Set operations translate naturally into probability operations.
Union
The union E∪F is the event that E or F (or both) occurs.
P(E∪F)=P(E)+P(F)−P(E∩F)
The inclusion-exclusion formula corrects for double-counting outcomes in both events.
Multiple Unions
For n events:
P(⋃i=1nEi)≤∑i=1nP(Ei)
This upper bound is the union bound (Boole’s inequality): the probability of at least one occurring is at most the sum of individual probabilities.
Intersection
The intersection E∩F (or EF) is the event that both E and F occur.
For mutually exclusive events: P(E∩F)=0.
Complement
The complement Ec is the event that E does not occur.
P(Ec)=1−P(E)
This is useful when computing the probability of “at least one” by considering “none”:
P(at least one)=1−P(none)
Example: Matching Problem
Three letters are randomly placed into three addressed envelopes. What is the probability at least one letter is in the correct envelope?
Direct approach: Inclusion-exclusion over three events.
Complement approach: Compute P(none correct)=P(derangement). There are 2 derangements out of 3!=6 permutations. So P(none)=2/6=1/3.
P(at least one)=1−31=32
Difference
The set difference E−F=E∖F is the event that E occurs but F does not.
P(E−F)=P(E)−P(E∩F)
Proof: E=(E−F)∪(E∩F) where these are disjoint. By additivity: P(E)=P(E−F)+P(E∩F), so P(E−F)=P(E)−P(E∩F).
Symmetric Difference
The symmetric difference E△F=(E−F)∪(F−E) is the event that exactly one of E, F occurs.
P(E△F)=P(E)+P(F)−2P(E∩F)
De Morgan’s Laws
First Law
(E∪F)c=Ec∩Fc
Probability interpretation: The event that neither E nor F occurs is the event that E does not occur AND F does not occur.
Second Law
(E∩F)c=Ec∪Fc
Probability interpretation: The event that not both E and F occur is the event that E does not occur OR F does not occur.
Example
Roll a die. Let E = “roll even” {2,4,6} and F = “roll at least 5” {5,6}.
- E∪F={2,4,5,6}, so (E∪F)c={1,3}
- Ec={1,3,5}, Fc={1,2,3,4}
- Ec∩Fc={1,3} (matches first law)
Distributive Laws
E∩(F∪G)=(E∩F)∪(E∩G)
E∪(F∩G)=(E∪F)∩(E∪G)
These allow us to expand or simplify probability expressions.
Associative and Commutative Laws
Union and intersection are associative and commutative:
E∪F=F∪E,E∩F=F∩E
E∪(F∪G)=(E∪F)∪G,E∩(F∩G)=(E∩F)∩G
This means we can rearrange events in unions and intersections without changing the result.
Summary Table
| Operation | Set Notation | Probability Formula |
|---|
| Union | E∪F | P(E)+P(F)−P(E∩F) |
| Intersection | E∩F | P(E∩F) |
| Complement | Ec | 1−P(E) |
| Difference | E−F | P(E)−P(E∩F) |
| De Morgan 1 | (E∪F)c | Ec∩Fc |
| De Morgan 2 | (E∩F)c | Ec∪Fc |