Discrete Probability Space
A discrete probability space consists of:
- a sample space of countable elementary outcomes
- a probability assignment for every
with
An event is any subset , and its probability is
The complement of is .
Basic Properties
For events :
If , then
If are pairwise disjoint, then (Addition Principle)
Union Bound
For arbitrary events :
This is Boole’s inequality, also called the union bound.
Inclusion-Exclusion
To compute the union exactly, use Inclusion–exclusion principle:
Idea: first sum all events, then correct the overcounting by subtracting intersections, then add back intersections that were subtracted too often, and so on.
Laplace Space
A Laplace space is a finite probability space in which all elementary outcomes are equally likely.
If , then every outcome has probability
So for any event :
This is the standard
rule.
NOTE
Choosing the Right Sample Space: The key modeling lesson is: choose the sample space so that the elementary outcomes are truly equally likely.
Example: Two Dice
If we only look at the possible sums , this is not a Laplace space, because sums do not occur equally often.
The correct Laplace space is
where each ordered pair has probability .
Then:
- sum has probability
- sum has probability
- sum has probability