Mathematics
Probability Spaces and Random Variables
Quick fact
A random variable is not a variable in the usual sense—it is a function that maps each outcome in a probability space to a real number. This allows us to compute probabilities like P(X ≤ x) for any value x, which is the basis for all distribution functions.
Why this is interesting
Roll a die, guess a probability, or predict the stock market—probability is everywhere. But what does it mean to formally assign a probability to an event, and how do we turn a random outcome into a number we can analyze?
Read the full explanation
Understanding Probability Spaces and Random Variables
Think of a probability space as the complete description of a random experiment. First, we list every possible outcome—that's the sample space (like {1,2,3,4,5,6} for a die). Next, we decide which subsets of outcomes we care about, called events (like "rolling an even number"). Finally, we assign to each event a number between 0 and 1, its probability, following a few natural rules: the probability of the whole space is 1, and the probability of a union of mutually exclusive events is the sum of their probabilities. Now, a random variable is a way to label each outcome with a number: for example, if you roll a die, X could be the value showing. More formally, X is a function from the sample space to the real numbers. Once we have X, we can ask questions like "What is the probability that X equals 3?" or "What is the probability that X is at least 4?"
A deeper explanation
The precise structure of a probability space is (Ω, F, P). Ω is the sample space, the set of all possible outcomes. F is a collection of events (subsets of Ω) that must form a sigma-algebra: it contains the empty set and Ω, is closed under complements, and is closed under countable unions. This guarantees that we can consistently talk about combinations of events. P is a probability measure, a function from F to [0,1] satisfying: P(Ω)=1, and for any countable disjoint collection of events A1, A2, …, P(∪Ai) = ΣP(Ai). This is called countable additivity. A random variable is a function X: Ω → ℝ such that for every real number x, the set {ω : X(ω) ≤ x} is an event in F (i.e., measurable). This measurability condition ensures that we can assign probabilities to events like {X ≤ x}. The probability that X is less than or equal to x is the cumulative distribution function F(x) = P({ω: X(ω) ≤ x}). The expected value of X, when it exists, is the weighted average of its values, where weights are given by the probability measure. This framework extends Bernoulli's simple examples into a rigorous calculus of uncertainty, enabling everything from insurance pricing to particle physics.