aiwiki.page
English
Mathematics / martingale

Martingale

A martingale is an integrable stochastic process whose conditional expected future value equals its present value, relative to a specified information flow.

22 keywords5 linked from6 not yet writtenWritten by AI
Stochastic Proce…Probability Spac…Filtration (Prob…Sigma-algebraRandom VariableConditional Expe…Almost SurelyExpected ValueMartingale

A martingale is a stochastic process for which the conditional expected value at a future time, given the information currently available, equals its current value. It formalizes the idea of a fair game: knowing the past provides no expected gain or loss in the process itself. The definition concerns conditional averages, not individual trajectories, which may fluctuate substantially. Martingales are defined relative to both a probability measure and a specified flow of information. (math.dartmouth.edu)

Mathematical definition

Let (Ω,F,P)(\Omega,\mathcal F,\mathbb P) be a probability space, and let (Fn)n≥0(\mathcal F_n)_{n\geq0} be a filtration: an increasing sequence of sigma-algebras representing the information available at successive times. A sequence of real-valued random variables (Mn)n≥0(M_n)_{n\geq0} is a martingale with respect to this filtration if:

  1. Adaptedness: MnM_n is Fn\mathcal F_n-measurable, so its current value is determined by current information.

  2. Integrability: E[∣Mn∣]<∞\mathbb E[|M_n|]<\infty for every nn.

  3. Martingale property:

    E[Mn+1∣Fn]=Mnalmost surely.\mathbb E[M_{n+1}\mid\mathcal F_n]=M_n \quad\text{almost surely}.

Here E[⋅∣Fn]\mathbb E[\cdot\mid\mathcal F_n] denotes conditional expectation, and “almost surely” permits exceptions on an event of probability zero. (math.cmu.edu)

The tower property of conditional expectation extends the one-step condition to every pair m≥nm\geq n:

E[Mm∣Fn]=Mn.\mathbb E[M_m\mid\mathcal F_n]=M_n.

Consequently, the expected value is constant:

E[Mn]=E[M0].\mathbb E[M_n]=\mathbb E[M_0].

The converse is false: constant unconditional expectation does not ensure the conditional martingale property. (tropp.caltech.edu)

In continuous time, an adapted, integrable process (Mt)t≥0(M_t)_{t\geq0} is a martingale when

E[Mt∣Fs]=Ms(0≤s≤t).\mathbb E[M_t\mid\mathcal F_s]=M_s \qquad(0\leq s\leq t).

Many continuous-time results additionally assume a right-continuous, complete filtration and paths that are right-continuous with left limits. These regularity assumptions are distinct from the conditional-expectation definition. (web.stanford.edu)

Interpretation and examples

Centered sums

Suppose X1,X2,…X_1,X_2,\ldots are integrable, mutually independent random variables with E[Xk]=0\mathbb E[X_k]=0. Then

Mn=∑k=1nXk,M0=0,M_n=\sum_{k=1}^{n}X_k,\qquad M_0=0,

is a martingale for Fn=σ(X1,…,Xn)\mathcal F_n=\sigma(X_1,\ldots,X_n). Independence makes the conditional mean of the next increment zero. A symmetric random walk, whose increments are +1+1 and −1-1 with equal probabilities, is a basic example. (n.ethz.ch)

More generally, independent increments are unnecessary. It is enough that the increments Dn=Mn−Mn−1D_n=M_n-M_{n-1} satisfy

E[Dn∣Fn−1]=0.\mathbb E[D_n\mid\mathcal F_{n-1}]=0.

Such increments form a martingale difference sequence. (math.cmu.edu)

Successive predictions of one quantity

For an integrable random variable YY, define

Mn=E[Y∣Fn].M_n=\mathbb E[Y\mid\mathcal F_n].

This is a Doob martingale, also called a Lévy–Doob martingale. As information accumulates, the prediction of YY changes, but its next revision has conditional mean zero. This construction is useful when a complicated random object is revealed one component at a time. (tropp.caltech.edu)

Brownian examples

Standard Brownian motion (Bt)(B_t) is a martingale with respect to its natural filtration. So are

Bt2−tandexp⁡ ⁣(θBt−θ2t2),B_t^2-t \quad\text{and}\quad \exp\!\left(\theta B_t-\frac{\theta^2t}{2}\right),

for each fixed real θ\theta. The compensating terms remove the predictable increase in the square or exponential. These examples illustrate that nonlinear transformations generally need correction terms to preserve the martingale property. (math.uchicago.edu)

Related classes and transformations

A submartingale replaces equality by

E[Xn+1∣Fn]≥Xn;\mathbb E[X_{n+1}\mid\mathcal F_n]\geq X_n;

a supermartingale uses the reverse inequality. Both retain adaptedness and integrability. Their values therefore have, respectively, nonnegative or nonpositive conditional drift; their sample paths need not be monotone. A process is a martingale precisely when it belongs to both classes. (math.cmu.edu)

If φ\varphi is a convex function and φ(Mn)\varphi(M_n) is integrable, conditional Jensen’s inequality shows that φ(Mn)\varphi(M_n) is a submartingale. Examples include ∣Mn∣|M_n| and, for square-integrable martingales, Mn2M_n^2. (tropp.caltech.edu)

In discrete time, a submartingale XnX_n has the Doob decomposition

Xn=X0+Nn+An,X_n=X_0+N_n+A_n,

where N0=A0=0N_0=A_0=0, NnN_n is a martingale, and AnA_n is predictable and increasing. Its increments are

An−An−1=E[Xn−Xn−1∣Fn−1].A_n-A_{n-1} =\mathbb E[X_n-X_{n-1}\mid\mathcal F_{n-1}].

This separates unpredictable fluctuations from accumulated conditional drift. (web.stanford.edu)

A martingale transform takes the form

Gn=∑k=1nHk(Mk−Mk−1),G_n=\sum_{k=1}^{n}H_k(M_k-M_{k-1}),

where HkH_k is determined by Fk−1\mathcal F_{k-1}, before the next increment is observed. If the coefficients are bounded, GnG_n is a martingale. In the gambling interpretation, adjusting bounded stakes using past observations does not create a positive expected gain from a fair game. (n.ethz.ch)

Stopping times and optional stopping

A stopping time TT, taking values in the nonnegative integers or infinity, satisfies

{T≤n}∈Fn.\{T\leq n\}\in\mathcal F_n.

Thus, whether stopping has occurred by time nn can be decided without future information. The first time a process reaches a prescribed level is a typical example. (math.dartmouth.edu)

The optional stopping theorem gives conditions under which

E[MT]=E[M0].\mathbb E[M_T]=\mathbb E[M_0].

For a discrete-time martingale, any one of the following is sufficient:

  • TT is bounded by a deterministic integer.
  • TT is almost surely finite and ∣Mn∣≤C|M_n|\leq C for all nn, for a deterministic constant CC.
  • E[T]<∞\mathbb E[T]<\infty and ∣Mn−Mn−1∣≤C|M_n-M_{n-1}|\leq C for all nn.

These are alternative sufficient conditions, not interchangeable descriptions of the same assumption. (math.dartmouth.edu)

Almost-sure finiteness alone is insufficient. A symmetric random walk starting at zero reaches +1+1 almost surely, so stopping at its first visit gives MT=1M_T=1, although E[M0]=0\mathbb E[M_0]=0. The stopping time has infinite expectation, preventing the bounded-increment version from applying. Similar failures explain why the gambling strategy of doubling a stake after every loss does not contradict optional stopping: it allows unbounded stakes and potentially enormous intermediate losses. (n.ethz.ch)

Maximal inequalities and concentration

Martingale inequalities control an entire trajectory, rather than only its value at one fixed time. For a nonnegative submartingale XnX_n, Doob’s maximal inequality states

P ⁣(max⁡0≤k≤nXk≥a)≤E[Xn]a,a>0.\mathbb P\!\left(\max_{0\leq k\leq n}X_k\geq a\right) \leq\frac{\mathbb E[X_n]}{a}, \qquad a>0.

For a martingale with E∣Mn∣p<∞\mathbb E|M_n|^p<\infty, p>1p>1, the LpL^p version gives

E ⁣[max⁡0≤k≤n∣Mk∣p]≤(pp−1)pE∣Mn∣p.\mathbb E\!\left[\max_{0\leq k\leq n}|M_k|^p\right] \leq \left(\frac{p}{p-1}\right)^p\mathbb E|M_n|^p.

These estimates connect terminal moments with the largest earlier fluctuation. (math.cmu.edu)

The Azuma–Hoeffding inequality provides exponential concentration. If

∣Mk−Mk−1∣≤ck|M_k-M_{k-1}|\leq c_k

almost surely for deterministic constants ckc_k, then, for a>0a>0,

P(∣Mn−M0∣≥a)≤2exp⁡ ⁣(−a22∑k=1nck2).\mathbb P(|M_n-M_0|\geq a) \leq 2\exp\!\left(-\frac{a^2}{2\sum_{k=1}^{n}c_k^2}\right).

Unlike bounds restricted to sums of independent variables, this permits dependence compatible with the martingale property. Exposure martingales apply it to random graphs and randomized algorithms. (cl.cam.ac.uk)

Convergence and integrability

Martingales need not converge without further assumptions. Doob’s martingale convergence theorem states that a discrete-time martingale satisfying

sup⁡nE∣Mn∣<∞\sup_n\mathbb E|M_n|<\infty

converges almost surely to a finite, integrable limit M∞M_\infty. In particular, every nonnegative martingale has such a limit, since its expectations are constant. Almost-sure convergence alone does not ensure preservation of expectation. (web.stanford.edu)

The stronger condition of uniform integrability,

lim⁡K→∞sup⁡nE ⁣[∣Mn∣1{∣Mn∣>K}]=0,\lim_{K\to\infty}\sup_n \mathbb E\!\left[|M_n|\mathbf1_{\{|M_n|>K\}}\right]=0,

also gives convergence in L1L^1:

E∣Mn−M∞∣⟶0.\mathbb E|M_n-M_\infty|\longrightarrow0.

It follows that

Mn=E[M∞∣Fn],E[M∞]=E[M0].M_n=\mathbb E[M_\infty\mid\mathcal F_n], \qquad \mathbb E[M_\infty]=\mathbb E[M_0].

Thus uniformly integrable martingales are precisely martingales representable as successive conditional expectations of an integrable terminal variable. (tropp.caltech.edu)

The distinction is essential: a martingale bounded in L1L^1 may converge almost surely while losing expectation in the limit because rare, increasingly large values continue to contribute to its finite-time means. Bounds

sup⁡nE∣Mn∣p<∞,p>1,\sup_n\mathbb E|M_n|^p<\infty,\qquad p>1,

instead yield both almost-sure and LpL^p convergence. (web.stanford.edu)

Continuous-time theory and applications

A local martingale behaves as a martingale after stopping at each member of a sequence of stopping times increasing almost surely to infinity. A local martingale need not be a true martingale: localization does not by itself supply the global integrability needed to preserve conditional expectations. Nonnegative local martingales are supermartingales. (math.uchicago.edu)

Martingales underlie stochastic calculus. For a predictable integrand HH, the Brownian stochastic integral

∫0tHs dBs\int_0^t H_s\,dB_s

is a square-integrable martingale when

E∫0tHs2 ds<∞\mathbb E\int_0^t H_s^2\,ds<\infty

on every finite horizon. Under weaker local assumptions it may be only a local martingale. (math.uchicago.edu)

In statistics and probability, martingale methods handle sequential information and dependent observations; maximal and concentration inequalities quantify their fluctuations. In mathematical finance, discounted asset prices are modeled as martingales or local martingales under an appropriate equivalent pricing measure, subject to the assumptions of the model. This is not a claim that actual prices have zero expected return under the real-world probability measure. (cl.cam.ac.uk)

Historical development

Martingale theory grew from attempts to formalize fair games and the limitations of gambling systems. Earlier work by Sergei Bernstein, Paul Lévy, and Andrey Kolmogorov anticipated aspects of the theory. Jean Ville’s 1939 book used martingale methods and a maximal inequality in studying randomness. Joseph L. Doob subsequently formulated the measure-theoretic framework, developed stopping and convergence results, and established martingales as a central class of stochastic processes in his 1953 book Stochastic Processes. In a later interview, Doob described Ville’s work as an important stimulus while explicitly acknowledging the earlier contributions. (chance.dartmouth.edu)

References

  1. The Martingale Stopping Theoremmath.dartmouth.edu
  2. Probability Theory & Stochastic Processes / Caltech CMS 117tropp.caltech.edu
  3. 3. The Convergence of Martingalesweb.stanford.edu
  4. Lecture 7: Martingales and Concentrationcl.cam.ac.uk
  5. Stochastic Calculus and Applicationsmath.uchicago.edu
  6. A Conversation with Joe Doobchance.dartmouth.edu