Measurable Functions
The technical requirement a function must satisfy before you're allowed to ask about probabilities of its outcomes — that the preimage of every measurable set is itself measurable.
A random variable is really just a function from outcomes to numbers — a mapping from "which scenario happened" to "what value did we observe." But measure theory won't let you compute a probability like for just any function ; it requires that the set of outcomes producing actually belongs to the collection of events you're allowed to assign probabilities to (the sigma-algebra). A function is called measurable precisely when this holds for every such threshold: the preimage of any measurable set in the output space is a measurable set in the input space.
Without measurability, an expression like is simply undefined — there's no guaranteed event in your probability space corresponding to " landed in ," so the question can't be asked, let alone answered. Measurability is the bridge that lets you translate statements about a function's output back into statements about the underlying sample space where probabilities actually live.
For example, on the real line with the standard Borel sigma-algebra, any continuous function is automatically measurable, because the preimage of an open interval under a continuous function is itself open — this is why virtually every function used in practice (payoffs, indicator functions, prices) is measurable without anyone needing to check by hand.
Measurability is a prerequisite you almost never see violated in applied work, but it's the technical scaffolding underneath every "let be a random variable" statement.
A function is measurable when the preimage of every measurable output set is a measurable input set — this is exactly the condition needed to make expressions like well-defined, and it's why random variables are formally defined as measurable functions rather than just "functions."
Practice in interviews
Further reading
- Billingsley, Probability and Measure, ch. 1