Probability Mass Functions (PMF)
You'll learn: How a PMF assigns probabilities to discrete random variable outcomes and the rules it must follow.
What is a PMF?
A Probability Mass Function (PMF) is a function that tells you the probability of each possible value for a discrete random variable. Think of it like a lookup table: for every outcome a random variable can take, the PMF gives you the exact probability of that outcome occurring.
If X is a discrete random variable, we write its PMF as P(X = x) or sometimes p(x), which means "the probability that X equals the specific value x."
PMF Properties
Every valid PMF must satisfy two fundamental properties:
1. Non-negativity: Probabilities cannot be negative.
- For every possible value
x:P(X = x) ≥ 0 - Just like you can't have -30% chance of rain!
2. Sum to One: All probabilities must add up to 1.
Σ P(X = x) = 1(sum over all possible values of x)- This represents certainty that something will happen.
Computing Probabilities
Suppose you roll a fair six-sided die. Let X be the outcome.
- P(X = 1) = 1/6
- P(X = 2) = 1/6
- ...
- P(X = 6) = 1/6
Check the properties:
- ✓ Non-negative: Each probability (1/6) ≥ 0
- ✓ Sum to one: 6 × (1/6) = 1
For an unfair die, the probabilities might differ, but they must still be non-negative and sum to 1.
Key Takeaway: A PMF assigns probabilities to each discrete value a random variable can take, and must satisfy non-negativity (all probabilities ≥ 0) and normalization (probabilities sum to 1).