Academy
Discrete Random Variables
Level 1 - Math II (Physics) topic page in Probability.
Principle
A random variable is a numerical function on outcomes. It turns each outcome in the sample space into a number, so probability questions can be asked about values such as a count, a sum, or a detector reading.
For a discrete random variable, the possible values form a finite or countable support, and probabilities are assigned value by value.
Notation
Method
Step 1: Define the outcome rule
Start with outcomes \(s\in S\), then write the numerical rule \(X(s)\). The event \(X=x\) is not one outcome; it is the set of outcomes that produce the value \(x\).
Step 2: Build or read a probability table
A probability table lists each supported value and its probability. For two discrete random variables, a joint table lists probabilities for ordered pairs \((x,y)\).
Step 3: Add probabilities for requested values
For an interval, sum the PMF over the supported values inside the interval.
Rules
Examples
Checks
- \(X=x\) is an event: it collects all outcomes that give the value \(x\).
- \(X\) is not the outcome itself; it is a function from outcomes to numbers.
- Every probability in a table must be non-negative.
- The probabilities in a complete table must sum to \(1\).
- Independence of discrete random variables must hold for every supported pair \((x,y)\), not just one pair.