CONTENTS

Filtrations and Information

Motivation: why this matters in quant finance

A pricing model is not only about what can happen; it is about when information becomes available. At time tt, a trader knows the history up to tt and does not know the future. A trading rule that depends on STS_T before time TT is not a clever strategy; it is a model violation.

A filtration records this time structure. It is the object that makes phrases like "adapted process", "future Brownian increment", "stopping time", and "self-financing strategy" mathematically precise. Without it, the formula

EQ[HFt]\mathbb{E}^{\mathbb{Q}}[H\mid\mathcal{F}_t]

has no clear meaning because Ft\mathcal{F}_t has not been specified.

Bertsekas does not develop filtrations as a separate topic, but the ingredients come from Ch. 1's event collections and Ch. 4's conditional expectation as a forecast given information. This note assembles those ingredients into the dynamic framework used in stochastic finance.

The informal idea

A filtration is a growing list of questions the market can answer. At time 00, only initial data are known. At time tt, all events determined by the observed history up to tt are known. At time TT, more events are known.

The key word is growing. Information can be added but not erased:
FsFt(st).\mathcal{F}_s\subseteq\mathcal{F}_t\qquad(s\le t).
Smaller sigma-algebras mean coarser information. Larger sigma-algebras mean finer information. This is why filtrations belong naturally after sigma-algebras and conditional expectation.

Formal definitions

Filtration

On a probability space (Ω,F,P)(\Omega,\mathcal{F},\mathbb{P}), a filtration is a family (Ft)t0(\mathcal{F}_t)_{t\ge0} of sub-sigma-algebras satisfying
FsFtFwhenever st.\mathcal{F}_s\subseteq\mathcal{F}_t\subseteq\mathcal{F}\qquad\text{whenever }s\le t.
The quadruple (Ω,F,(Ft)t0,P)(\Omega,\mathcal{F},(\mathcal{F}_t)_{t\ge0},\mathbb{P}) is a filtered probability space.

Natural filtration

For a process (Xt)t0(X_t)_{t\ge0}, the natural filtration is
FtX=σ(Xs:0st).\mathcal{F}_t^X=\sigma(X_s:0\le s\le t).

It is the smallest filtration making the entire observed path up to time tt measurable.

Adapted process

A process (Xt)(X_t) is adapted to (Ft)(\mathcal{F}_t) if
Xt is Ft-measurable for every t.X_t\text{ is }\mathcal{F}_t\text{-measurable for every }t.

The value at time tt can be determined from information available at time tt.

Stopping time

A random time τ\tau is a stopping time if
{τt}Ftfor every t.\{\tau\le t\}\in\mathcal{F}_t\qquad\text{for every }t.

At time tt, one can tell whether the time has already occurred.

Key properties

Information monotonicity

The defining inclusion FsFt\mathcal{F}_s\subseteq\mathcal{F}_t says that every event knowable at ss remains knowable at tt. This is the mathematical version of remembering the past.

Adaptedness rules out clairvoyance

If a trading strategy Δt\Delta_t is adapted, then it cannot depend on SuS_u for u>tu>t. This is the no-look-ahead condition underlying self-financing trading and Itô integration.

Future increments can be independent of current information

For Brownian motion, WtWsW_t-W_s is independent of Fs\mathcal{F}_s for s<ts<t. This is stronger than saying it is uncorrelated with WsW_s; it says the whole past sigma-algebra carries no information about the future increment.

Conditional expectation depends on the filtration

A process can be a martingale under one filtration and not under another. The statement

E[MtFs]=Ms\mathbb{E}[M_t\mid\mathcal{F}_s]=M_s

is incomplete unless the filtration is specified.

Stopping times are non-anticipative random times

First hitting times are usually stopping times. Last hitting times before a terminal date usually are not, because deciding that a time is the last occurrence requires future information.

Worked examples

Example 1: two coin tosses

Let Ω={HH,HT,TH,TT}\Omega=\{HH,HT,TH,TT\}. Define

F0={,Ω},\mathcal{F}_0=\{\emptyset,\Omega\}, F1={,{HH,HT},{TH,TT},Ω},\mathcal{F}_1=\{\emptyset,\{HH,HT\},\{TH,TT\},\Omega\},

and F2=2Ω\mathcal{F}_2=2^{\Omega}. At time 11 you know the first toss but not the second. At time 22 you know the full outcome. This is the simplest filtration that shows information becoming finer over time.

Example 2: a price process and adapted trading

If StS_t is the observed stock price, the natural market filtration is often modelled as FtS=σ(Su:ut)\mathcal{F}_t^S=\sigma(S_u:u\le t). A delta hedge Δt=Δ(t,St)\Delta_t=\Delta(t,S_t) is adapted because it uses current time and current price. A rule Δt=Δ(t,ST)\Delta_t=\Delta(t,S_T) is not adapted for t<Tt<T and is excluded.

Example 3: barrier option exercise information

The first hitting time

τ=inf{t:StB}\tau=\inf\{t:S_t\ge B\}

is a stopping time: by time tt, the observed path tells you whether the barrier has been hit. The last time before TT that StBS_t\ge B is not a stopping time, because at time tt you do not know whether the path will cross again later.

Example 4: Brownian filtration

For Brownian motion WW, the natural filtration FtW\mathcal{F}_t^W contains every event determined by the path up to tt. The event {sup0utWu>B}\{\sup_{0\le u\le t}W_u>B\} belongs to FtW\mathcal{F}_t^W. The event {Wt+1>B}\{W_{t+1}>B\} generally does not.

Common confusions and pitfalls

"The filtration is the realised history." The realised history is one path. The filtration is the collection of all events whose truth can be decided from histories up to each time.
"Adapted means deterministic." Adapted variables are known at the time in question, not known from the start.
"The natural filtration is always the market filtration." It is a common modelling choice, but not a law. In incomplete-information models, the market may observe less than the full state process.
"Every random time is a stopping time." A random time may depend on future information. Stopping times are precisely the random times that can be recognised without looking ahead.
"Changing the filtration is harmless." It can change martingale properties, admissible trading strategies, and no-arbitrage statements.

Where this goes next

References

  • Bertsekas, D. P., & Tsitsiklis, J. N. (2008). Introduction to Probability (2nd ed.). Athena Scientific. Ch. 1 §1.1-1.2 (events and probability laws), Ch. 4 §4.3 (conditional expectation as information-based forecasting). Bertsekas does not develop filtrations explicitly; this note extends those ingredients into the standard stochastic-finance framework.