Skip to content
Part IA Easter Term

Set Operations and Probability

Events as Sets

Events are subsets of the sample space. Set operations translate naturally into probability operations.

Union

The union EFE \cup F is the event that EE or FF (or both) occurs.

P(EF)=P(E)+P(F)P(EF)P(E \cup F) = P(E) + P(F) - P(E \cap F)

The inclusion-exclusion formula corrects for double-counting outcomes in both events.

Multiple Unions

For nn events:

P(i=1nEi)i=1nP(Ei)P\left(\bigcup_{i=1}^{n} E_i\right) \leq \sum_{i=1}^{n} P(E_i)

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 EFE \cap F (or EFEF) is the event that both EE and FF occur.

For mutually exclusive events: P(EF)=0P(E \cap F) = 0.

Complement

The complement EcE^c is the event that EE does not occur.

P(Ec)=1P(E)P(E^c) = 1 - P(E)

This is useful when computing the probability of “at least one” by considering “none”:

P(at least one)=1P(none)P(\text{at least one}) = 1 - P(\text{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)P(\text{none correct}) = P(\text{derangement}). There are 2 derangements out of 3!=63! = 6 permutations. So P(none)=2/6=1/3P(\text{none}) = 2/6 = 1/3.

P(at least one)=113=23P(\text{at least one}) = 1 - \frac{1}{3} = \frac{2}{3}

Difference

The set difference EF=EFE - F = E \setminus F is the event that EE occurs but FF does not.

P(EF)=P(E)P(EF)P(E - F) = P(E) - P(E \cap F)

Proof: E=(EF)(EF)E = (E - F) \cup (E \cap F) where these are disjoint. By additivity: P(E)=P(EF)+P(EF)P(E) = P(E - F) + P(E \cap F), so P(EF)=P(E)P(EF)P(E - F) = P(E) - P(E \cap F).

Symmetric Difference

The symmetric difference EF=(EF)(FE)E \triangle F = (E - F) \cup (F - E) is the event that exactly one of EE, FF occurs.

P(EF)=P(E)+P(F)2P(EF)P(E \triangle F) = P(E) + P(F) - 2P(E \cap F)

De Morgan’s Laws

First Law

(EF)c=EcFc(E \cup F)^c = E^c \cap F^c

Probability interpretation: The event that neither EE nor FF occurs is the event that EE does not occur AND FF does not occur.

Second Law

(EF)c=EcFc(E \cap F)^c = E^c \cup F^c

Probability interpretation: The event that not both EE and FF occur is the event that EE does not occur OR FF does not occur.

Example

Roll a die. Let EE = “roll even” {2,4,6}\{2,4,6\} and FF = “roll at least 5” {5,6}\{5,6\}.

  • EF={2,4,5,6}E \cup F = \{2,4,5,6\}, so (EF)c={1,3}(E \cup F)^c = \{1,3\}
  • Ec={1,3,5}E^c = \{1,3,5\}, Fc={1,2,3,4}F^c = \{1,2,3,4\}
  • EcFc={1,3}E^c \cap F^c = \{1,3\} (matches first law)

Distributive Laws

E(FG)=(EF)(EG)E \cap (F \cup G) = (E \cap F) \cup (E \cap G) E(FG)=(EF)(EG)E \cup (F \cap G) = (E \cup F) \cap (E \cup G)

These allow us to expand or simplify probability expressions.

Associative and Commutative Laws

Union and intersection are associative and commutative:

EF=FE,EF=FEE \cup F = F \cup E, \quad E \cap F = F \cap E E(FG)=(EF)G,E(FG)=(EF)GE \cup (F \cup G) = (E \cup F) \cup G, \quad E \cap (F \cap G) = (E \cap F) \cap G

This means we can rearrange events in unions and intersections without changing the result.

Summary Table

OperationSet NotationProbability Formula
UnionEFE \cup FP(E)+P(F)P(EF)P(E) + P(F) - P(E \cap F)
IntersectionEFE \cap FP(EF)P(E \cap F)
ComplementEcE^c1P(E)1 - P(E)
DifferenceEFE - FP(E)P(EF)P(E) - P(E \cap F)
De Morgan 1(EF)c(E \cup F)^cEcFcE^c \cap F^c
De Morgan 2(EF)c(E \cap F)^cEcFcE^c \cup F^c