The Summation Axiom: For any valid discrete probability distribution, the sum of all individual probabilities must equal exactly 1. This is expressed mathematically as .
Probability Bounds: Every individual probability must satisfy the condition . A negative probability or a probability greater than 1 indicates an invalid model.
Discrete Uniform Distribution: A specific case where a random variable has a finite number of outcomes (), and every outcome is equally likely. In this scenario, the probability for each outcome is exactly .
Cumulative Distribution Function (CDF): Denoted as , this represents the probability that the random variable is less than or equal to a specific value . It is calculated by summing all probabilities up to that point: .
Summation Method: To find , you identify all possible outcomes that are less than or equal to and add their individual probabilities together.
Complementary Events: For 'greater than' probabilities, it is often easier to use the identity . This is particularly useful when the number of outcomes greater than is large.
| Phrase | Inequality | Includes ? |
|---|---|---|
| At most | Yes | |
| Fewer than | No | |
| At least | Yes | |
| More than | No |
The 'Sum to 1' Check: Always perform a sanity check by adding up your calculated probabilities; if they do not sum to 1, there is an error in your constant or your arithmetic.
Inequality Precision: Pay extremely close attention to whether an inequality is strict () or inclusive (). In discrete distributions, is equal to , not .
Table Construction: When given a PMF as a formula, your first step should almost always be to draw a probability table. This makes calculating cumulative probabilities and checking the total sum much more intuitive.
Range Validation: Ensure that any value you calculate for a probability falls strictly between 0 and 1. If you get a value like or , re-evaluate your algebraic steps immediately.