Setup
Why measure theory?
Classical probability assigns a number in to each "event." On a finite sample space — six faces of a die, for instance — this is straightforward: you can attach a probability to every subset. The trouble starts when the sample space is uncountable, like the real line or the set of continuous asset price paths.
It turns out to be impossible to assign a translation-invariant, countably additive measure extending length to every subset of . The Vitali construction (which uses the Axiom of Choice) produces a set to which no consistent measure can be assigned. The resolution is not to measure every subset, but to choose a σ-algebra — a designated collection of admissible subsets of . The elements of are then called measurable sets. For Lebesgue measure, is the Lebesgue σ-algebra, which contains all Borel sets and many more, but not every subset of .
A σ-algebra is not itself "measurable." It is the structure that determines which subsets are measurable. A set is measurable only relative to a specific σ-algebra on a specific sample space . The four objects to keep distinct:
- — the sample space: the set of all possible outcomes (e.g., , path space, a finite set of scenarios).
- — the σ-algebra on : a collection of subsets satisfying the three axioms below. Its role is to decide which subsets can be assigned a probability.
- — the probability measure: a function satisfying σ-additivity. It assigns numbers to events; it does not exist independently of .
- — a measurable set (event): a subset of that belongs to the σ-algebra and can therefore be assigned a probability .
The triple is a probability space.
Why this matters on a derivatives desk. The filtration — the mathematical object representing "what the market knows at time " — is built from σ-algebras. Feynman-Kac, Girsanov, and the martingale representation theorem all require the underlying probability space to be properly defined. When a research paper writes , this is the structure they are invoking.
Conventions used throughout
- denotes a non-empty set (the sample space — the collection of all possible outcomes).
- denotes the complement of in .
- "Countable" means finite or countably infinite.
- Indices for countable unions and intersections run over unless otherwise stated.
Theory
1. σ-Algebras
Definition 1.1 (σ-Algebra). Let be a non-empty set. A collection of subsets of is a σ-algebra on if the following three axioms hold:
- .
- If , then . (Closed under complementation.)
- If , then . (Closed under countable unions.)
The pair is called a measurable space.
The three axioms are not arbitrary. Axiom 1 ensures the certain event is trackable. Axiom 2 ensures "event does not occur" is trackable whenever "event occurs" is. Axiom 3 — requiring countable rather than merely finite closure — is the key restriction: it is strong enough to support Lebesgue measure on , but weak enough to exclude the pathological subsets.
Consequences of the axioms. Let be a σ-algebra on . Then:
- : since , take its complement.
- is closed under countable intersections: , which is in by Axioms 2 and 3.
- is closed under set differences: .
These are not additional axioms — they are derivable. Many students list "" as an axiom; it is not.
Two canonical examples
The trivial σ-algebra is the coarsest possible: it carries no information about which outcome actually occurred. The power set (all subsets) is the finest: every event is trackable. For uncountable — such as — the power set is too large to support a consistent measure, which is precisely why we need something in between.
Example 1.2. Let represent three possible outcomes of a single trading day.
The collection is a σ-algebra: it tracks only whether the day was "up" or "not up."
The collection is not a σ-algebra: .
Generated σ-algebras
Given any collection of subsets of , the σ-algebra generated by is the smallest σ-algebra containing every set in :
This is well-defined because the power set always works as a bounding σ-algebra, so the intersection is over a non-empty family.
Definition 1.3 (Borel σ-Algebra). The Borel σ-algebra on is
Equivalently — and these are all the same σ-algebra — it is generated by any of:
The generating family is particularly important: it connects directly to the cumulative distribution function, since is the preimage of a Borel generator.
Why the Borel σ-algebra is the right choice. Every open set, closed set, compact set, interval, countable set, and any set obtained from these by countably many set operations is Borel. In practical terms: if you can describe a subset of without invoking the Axiom of Choice, it is almost certainly Borel. Non-Borel sets exist (e.g., Vitali sets) but are constructed pathologically and never arise in finance.
2. Probability Measures
Definition 2.1 (Probability Measure). Let be a measurable space. A function is a probability measure if:
- .
- σ-additivity: for every countable sequence of pairwise disjoint sets ,
The triple is a probability space.
σ-additivity (countable, not just finite additivity) implies that is continuous: if then . This continuity is what enables all standard limit theorems used in pricing.
Standard consequences. From Definition 2.1 alone:
- .
- .
- Monotonicity: .
- Inclusion-exclusion: .
- Continuity from below: .
3. Random Variables
Definition 3.1 (Random Variable). Let be a probability space. A function is an -measurable random variable if for every Borel set :
Equivalently: is measurable if and only if for all .
Measurability says: for every Borel region on the real line, the event "the outcome lands in the preimage of " is trackable in our σ-algebra. A non-measurable would mean some regions of have preimages outside — we could not assign them probabilities.
Definition 3.2 (Generated σ-Algebra). For a measurable , the σ-algebra generated by is
It is the smallest σ-algebra on making measurable.
The Doob-Dynkin interpretation. A function is -measurable if and only if for some Borel function . Financially: " is -measurable" means the payoff depends only on the terminal spot — it is a European-style claim. Path-dependent payoffs (Asian, barrier) require , the σ-algebra generated by the full price path.
4. Geometric intuition
Think of as a large bag containing all possible "states of the world." A σ-algebra is the list of questions you are permitted to ask about which state actually occurred.
- The trivial σ-algebra allows only: "did something happen?" — it carries zero information.
- The power set allows every conceivable question — but on uncountable , assigning consistent probabilities to all answers is impossible.
- sits in between: fine enough to encompass all intervals, open sets, and their countable combinations — coarse enough to remain consistent.
Imagine shading regions on a real line. The Borel σ-algebra is every region you can produce through interval operations and countable limits. Non-Borel sets require an uncountable number of individual choices to construct — they are artefacts of abstract set theory with no physical or financial interpretation.
A random variable maps states to numbers on the real line. Measurability ensures that for every interval , the preimage — the collection of states mapping into — is one of the "allowed questions" in our σ-algebra.
Validation
The theoretical properties above can be checked computationally on finite sample spaces. The companion notebook verifies:
- σ-algebra axioms — automated checks for complement closure and countable-union closure on .
- Generated σ-algebra — confirming when is injective, and has exactly elements when takes distinct values.
- σ-additivity — verifying for disjoint using exact rational arithmetic.
- Borel generator equivalence — illustrating that on a discretised real line.
Before opening the notebook, try the following by hand:
Let and with , . What is ? How many elements does it have? What is if instead is injective (all four values distinct)?
Limitations
Non-measurable sets exist — they are just unpriceable. The Vitali set is constructed using the Axiom of Choice. If were Lebesgue-measurable with measure : the unit interval decomposes as a countable union of translates of , so . If the sum is ; if the sum diverges. Contradiction in either case. Non-Borel sets play no role in practical finance but explain why "all subsets of " cannot serve as the event class.
The σ-algebra choice is a modelling commitment. Once you declare , all subsequent pricing is relative to this structure. Enlarging (e.g., with insider information) creates new admissible strategies and changes derivative prices — it is a fundamental modelling change, not a numerical parameter.
Finite spaces hide the real constraint. On a finite , the power set is always a valid σ-algebra and every function is measurable. The restriction to a proper sub-σ-algebra becomes binding only on uncountable spaces — in particular, on the path space of Brownian motion.
Path spaces require the Kolmogorov extension theorem. A Brownian motion path lives in . The σ-algebra on this space is generated by cylinder sets . Its existence is guaranteed by the Kolmogorov extension theorem — but this is non-trivial and is the technical machinery underlying the construction of Brownian motion.
"Almost sure" ≠ "sure." for any fixed , yet Brownian motion paths are real-valued and continuous. Probability zero does not mean impossible. The σ-algebra structure allows these distinctions to be precise through null sets and "almost surely" (-a.s.) qualifications.