Brownian Bridge™

Setup

Why measure theory?

Classical probability assigns a number in $[0,1]$ 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 consistently assign a translation-invariant measure to every subset of $\mathbb{R}$ . The Vitali construction (which uses the Axiom of Choice) produces a set to which no measure can be assigned without contradiction. The resolution is elegant: restrict attention to a distinguished collection of measurable subsets, and ignore the pathological remainder. This collection is called a σ-algebra.

INSIGHT

Why this matters on a derivatives desk. The filtration $(\mathcal{F}_t)_{t \ge 0}$ — the mathematical object representing "what the market knows at time $t$ " — 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 $(\Omega, \mathcal{F}, \mathbb{P})$ , this is the structure they are invoking.

Conventions used throughout

$\Omega$ denotes a non-empty set (the sample space — the collection of all possible outcomes).
$A^c = \Omega \setminus A$ denotes the complement of $A$ in $\Omega$ .
"Countable" means finite or countably infinite.
Indices for countable unions and intersections run over $\mathbb{N} = \{1, 2, 3, \ldots\}$ unless otherwise stated.

Theory

1. σ-Algebras

DEFINITION

Definition 1.1 (σ-Algebra). Let $\Omega$ be a non-empty set. A collection $\mathcal{F}$ of subsets of $\Omega$ is a σ-algebra on $\Omega$ if the following three axioms hold:

$\Omega \in \mathcal{F}$ .
If $A \in \mathcal{F}$ , then $A^c \in \mathcal{F}$ . (Closed under complementation.)
If $A_1, A_2, A_3, \ldots \in \mathcal{F}$ , then $\displaystyle\bigcup_{n=1}^{\infty} A_n \in \mathcal{F}$ . (Closed under countable unions.)

The pair $(\Omega, \mathcal{F})$ 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 $\mathbb{R}$ , but weak enough to exclude the pathological subsets.

THEOREM

Consequences of the axioms. Let $\mathcal{F}$ be a σ-algebra on $\Omega$ . Then:

$\emptyset \in \mathcal{F}$ : since $\Omega \in \mathcal{F}$ , take its complement.
$\mathcal{F}$ is closed under countable intersections: $\bigcap_{n} A_n = \bigl(\bigcup_{n} A_n^c\bigr)^c$ , which is in $\mathcal{F}$ by Axioms 2 and 3.
$\mathcal{F}$ is closed under set differences: $A \setminus B = A \cap B^c \in \mathcal{F}$ .

These are not additional axioms — they are derivable. Many students list " $\emptyset \in \mathcal{F}$ " as an axiom; it is not.

Two canonical examples

The trivial σ-algebra $\{\emptyset, \Omega\}$ is the coarsest possible: it carries no information about which outcome actually occurred. The power set $2^\Omega$ (all subsets) is the finest: every event is trackable. For uncountable $\Omega$ — such as $\mathbb{R}$ — the power set is too large to support a consistent measure, which is precisely why we need something in between.

EXAMPLE

Example 1.2. Let $\Omega = \{\text{up}, \text{flat}, \text{down}\}$ represent three possible outcomes of a single trading day.

The collection $\mathcal{F}_1 = \bigl\{\emptyset,\, \{\text{up}\},\, \{\text{flat}, \text{down}\},\, \Omega\bigr\}$ is a σ-algebra: it tracks only whether the day was "up" or "not up."

The collection $\mathcal{F}_{\text{bad}} = \bigl\{\emptyset,\, \{\text{up}\},\, \{\text{flat}\},\, \Omega\bigr\}$ is not a σ-algebra: $\{\text{up}\}^c = \{\text{flat}, \text{down}\} \notin \mathcal{F}_{\text{bad}}$ .

Generated σ-algebras

Given any collection $\mathcal{C}$ of subsets of $\Omega$ , the σ-algebra generated by $\mathcal{C}$ is the smallest σ-algebra containing every set in $\mathcal{C}$ :

\sigma(\mathcal{C}) := \bigcap \bigl\{ \mathcal{G} : \mathcal{G} \text{ is a σ-algebra on } \Omega,\; \mathcal{C} \subseteq \mathcal{G} \bigr\}.

This is well-defined because the power set $2^\Omega$ always works as a bounding σ-algebra, so the intersection is over a non-empty family.

DEFINITION

Definition 1.3 (Borel σ-Algebra). The Borel σ-algebra on $\mathbb{R}$ is

$\mathcal{B}(\mathbb{R}) := \sigma\bigl(\{ U \subseteq \mathbb{R} : U \text{ is open}\}\bigr).$

Equivalently — and these are all the same σ-algebra — it is generated by any of:

$\bigl\{(a,b) : a < b\bigr\}, \qquad \bigl\{(-\infty, x] : x \in \mathbb{R}\bigr\}, \qquad \bigl\{[a,b] : a \le b\bigr\}.$

The generating family $\{(-\infty, x]\}$ is particularly important: it connects $\mathcal{B}(\mathbb{R})$ directly to the cumulative distribution function, since $F_X(x) = \mathbb{P}(X \le x) = \mathbb{P}(X^{-1}((-\infty, x]))$ is the preimage of a Borel generator.

REMARK

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 $\mathbb{R}$ 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

Definition 2.1 (Probability Measure). Let $(\Omega, \mathcal{F})$ be a measurable space. A function $\mathbb{P} : \mathcal{F} \to [0,1]$ is a probability measure if:

$\mathbb{P}(\Omega) = 1$ .
σ-additivity: for every countable sequence of pairwise disjoint sets $A_1, A_2, \ldots \in \mathcal{F}$ ,

$\mathbb{P}\!\left(\bigcup_{n=1}^{\infty} A_n\right) = \sum_{n=1}^{\infty} \mathbb{P}(A_n).$

The triple $(\Omega, \mathcal{F}, \mathbb{P})$ is a probability space.

σ-additivity (countable, not just finite additivity) implies that $\mathbb{P}$ is continuous: if $A_n \nearrow A$ then $\mathbb{P}(A_n) \nearrow \mathbb{P}(A)$ . This continuity is what enables all standard limit theorems used in pricing.

THEOREM

Standard consequences. From Definition 2.1 alone:

$\mathbb{P}(\emptyset) = 0$ .
$\mathbb{P}(A^c) = 1 - \mathbb{P}(A)$ .
Monotonicity: $A \subseteq B \Rightarrow \mathbb{P}(A) \le \mathbb{P}(B)$ .
Inclusion-exclusion: $\mathbb{P}(A \cup B) = \mathbb{P}(A) + \mathbb{P}(B) - \mathbb{P}(A \cap B)$ .
Continuity from below: $A_n \nearrow A \Rightarrow \mathbb{P}(A_n) \nearrow \mathbb{P}(A)$ .

3. Random Variables

DEFINITION

Definition 3.1 (Random Variable). Let $(\Omega, \mathcal{F}, \mathbb{P})$ be a probability space. A function $X : \Omega \to \mathbb{R}$ is an $\mathcal{F}$ -measurable random variable if for every Borel set $B \in \mathcal{B}(\mathbb{R})$ :

$X^{-1}(B) := \{ \omega \in \Omega : X(\omega) \in B \} \in \mathcal{F}.$

Equivalently: $X$ is measurable if and only if $\{X \le x\} \in \mathcal{F}$ for all $x \in \mathbb{R}$ .

Measurability says: for every Borel region $B$ on the real line, the event "the outcome lands in the preimage of $B$ " is trackable in our σ-algebra. A non-measurable $X$ would mean some regions of $\mathbb{R}$ have preimages outside $\mathcal{F}$ — we could not assign them probabilities.

DEFINITION

Definition 3.2 (Generated σ-Algebra). For a measurable $X : \Omega \to \mathbb{R}$ , the σ-algebra generated by $X$ is

$\sigma(X) := \bigl\{ X^{-1}(B) : B \in \mathcal{B}(\mathbb{R}) \bigr\}.$

It is the smallest σ-algebra on $\Omega$ making $X$ measurable.

INSIGHT

The Doob-Dynkin interpretation. A function $Y$ is $\sigma(X)$ -measurable if and only if $Y = f(X)$ for some Borel function $f$ . Financially: " $Y$ is $\sigma(S_T)$ -measurable" means the payoff depends only on the terminal spot — it is a European-style claim. Path-dependent payoffs (Asian, barrier) require $\sigma(S_t, t \le T)$ , the σ-algebra generated by the full price path.

4. Geometric intuition

Think of $\Omega$ 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 $\{\emptyset, \Omega\}$ allows only: "did something happen?" — it carries zero information.
The power set $2^\Omega$ allows every conceivable question — but on uncountable $\Omega$ , assigning consistent probabilities to all answers is impossible.
$\mathcal{B}(\mathbb{R})$ 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 $\omega \in \Omega$ to numbers on the real line. Measurability ensures that for every interval $[a, b]$ , the preimage — the collection of states mapping into $[a, b]$ — 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 $\Omega = \{\text{up}, \text{flat}, \text{down}\}$ .
Generated σ-algebra — confirming $\sigma(X) = 2^\Omega$ when $X$ is injective, and $\sigma(X)$ has exactly $2^k$ elements when $X$ takes $k$ distinct values.
σ-additivity — verifying $\mathbb{P}(A \cup B) = \mathbb{P}(A) + \mathbb{P}(B)$ for disjoint $A, B$ using exact rational arithmetic.
Borel generator equivalence — illustrating that $\sigma(\{(-\infty, x]\}) = \mathcal{B}(\mathbb{R})$ on a discretised real line.

PRACTICE

Before opening the notebook, try the following by hand:

Let $\Omega = \{1, 2, 3, 4\}$ and $X : \Omega \to \mathbb{R}$ with $X(1) = X(2) = 0$ , $X(3) = X(4) = 1$ . What is $\sigma(X)$ ? How many elements does it have? What is $\sigma(X)$ if instead $X$ is injective (all four values distinct)?

Limitations

Non-measurable sets exist — they are just unpriceable. The Vitali set $V \subset [0,1]$ is constructed using the Axiom of Choice. If $V$ were Lebesgue-measurable with measure $\lambda(V)$ : the unit interval decomposes as a countable union of translates of $V$ , so $\lambda([0,1]) = \sum \lambda(V)$ . If $\lambda(V) = 0$ the sum is $0 \ne 1$ ; if $\lambda(V) > 0$ the sum diverges. Contradiction in either case. Non-Borel sets play no role in practical finance but explain why "all subsets of $\mathbb{R}$ " cannot serve as the event class.

The σ-algebra choice is a modelling commitment. Once you declare $(\Omega, \mathcal{F}, \mathbb{P})$ , all subsequent pricing is relative to this structure. Enlarging $\mathcal{F}$ (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 $\Omega$ , 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 $\omega \mapsto (B_t(\omega))_{t \in [0,T]}$ lives in $C([0,T])$ . The σ-algebra on this space is generated by cylinder sets $\{B_{t_1} \in A_1, \ldots, B_{t_n} \in A_n\}$ . 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.

WARNING

"Almost sure" ≠ "sure." $\mathbb{P}(\{B_t = x\}) = 0$ for any fixed $x \in \mathbb{R}$ , 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" ( $\mathbb{P}$ -a.s.) qualifications.

Interview Angle

L1 — Junior quant / quant developer

Expected depth: Define a σ-algebra from axioms, give two examples, state why the Borel σ-algebra is necessary on $\mathbb{R}$ , connect measurability to "probability is well-defined."

PRACTICE

Q1. "What is a σ-algebra? Give the three axioms and two examples."

Expected: state axioms (Ω ∈ F, complement-closed, countably-union-closed). Examples: trivial $\{\emptyset, \Omega\}$ and power set. Distinguish from an algebra (which requires only finite unions). Weak answer: listing " $\emptyset \in \mathcal{F}$ " as a separate axiom rather than deriving it.

Q2. "Why can't we define a probability on every subset of $[0,1]$ ?"

Expected: Vitali construction, Axiom of Choice, contradicts translation-invariance + σ-additivity.

Q3. " $X$ is $\mathcal{F}$ -measurable. In plain English, what does that mean?"

Expected: for every Borel region $B$ , the event $\{X \in B\}$ is in $\mathcal{F}$ — we can assign it a probability.

L2 — Senior quant

Expected depth: Derive consequences, state Doob-Dynkin and its financial interpretation, explain why σ-algebra generators are equivalent.

PRACTICE

Q1. "Prove that a σ-algebra is closed under countable intersections."

Expected: $\bigcap_n A_n = (\bigcup_n A_n^c)^c$ — De Morgan. Right-hand side is in $\mathcal{F}$ by Axioms 2 and 3.

Q2. " $\mathcal{B}(\mathbb{R})$ can be generated by open sets or by $(-\infty, x]$ for $x \in \mathbb{R}$ . Are these really the same?"

Expected: each $(-\infty, x] = \bigcap_n (-\infty, x+\tfrac{1}{n})$ (countable intersection of opens, hence Borel); conversely, every open set in $\mathbb{R}$ is a countable union of rational intervals, each constructible from half-lines. Same σ-algebra.

Q3. "A payoff $Y$ is $\sigma(S_T)$ -measurable. What does that tell you about the derivative?"

Expected: Doob-Dynkin — $Y = f(S_T)$ for some Borel $f$ . European-style, path-independent. Barrier and Asian options lie outside $\sigma(S_T)$ ; they require the full path filtration.

L3 — Quant researcher

Expected depth: Complete probability spaces, right-continuous filtrations, effect of filtration enlargement on pricing.

PRACTICE

Q1. "What does it mean for a probability space to be complete, and why do we need it?"

Expected: every subset of a $\mathbb{P}$ -null set is in $\mathcal{F}$ . Required so that modifications of stochastic processes (changing values on a null set) are still measurable — otherwise different versions of the same process cannot be interchanged, breaking regularity theory.

Q2. "Why is the augmented filtration $\mathcal{F}_t^+ = \bigcap_{s > t} \mathcal{F}_s$ used rather than the raw $\mathcal{F}_t = \sigma(W_s, s \le t)$ ?"

Expected: right-continuity, required by Doob's regularisation theorem and for hitting times of open sets to be stopping times. "Usual conditions" = complete + right-continuous.

Q3. "An insider knows $S_T$ at time $0$ . How does enlarging the filtration affect option prices?"

Expected: Jacod's criterion — if $S_T$ is independent of $\mathcal{F}_\infty$ under $\mathbb{P}$ , the enlarged filtration $\mathcal{H}_t = \mathcal{F}_t \vee \sigma(S_T)$ supports an equivalent local martingale measure and the insider can price all claims. But the insider's replicating strategies are not admissible in the original market — they exploit the extra information, generating a strictly larger set of reachable payoffs.