Article · Wikipedia archive · Last revised Jul 5, 2026

Martingale (probability theory)

In probability theory, a martingale is a stochastic process in which the expected value of the next observation, given all prior observations, is equal to the most recent value. In other words, the conditional expectation of the next value, given the past, is equal to the present value. Martingales are used to model fair games, where future expected winnings are equal to the current amount regardless of past outcomes.

Last revised
Jul 5, 2026
Read time
≈ 18 min
Length
4,121 w
Citations
4
Source

In probability theory, a martingale is a stochastic process in which the expected value of the next observation, given all prior observations, is equal to the most recent value. In other words, the conditional expectation of the next value, given the past, is equal to the present value. Martingales are used to model fair games, where future expected winnings are equal to the current amount regardless of past outcomes.

Stopped Brownian motion is an example of a martingale. It can model an even coin-toss betting game with the possibility of bankruptcy. source ↗

History

Originally, martingale referred to a class of betting strategies that was popular in 18th-century France.12

The historical development of the concept can be summarized as follows:

  • The simplest of these strategies was designed for a game in which the gambler wins their stake if a coin comes up heads and loses it if the coin comes up tails.
  • The strategy had the gambler double their bet after every loss so that the first win would recover all previous losses plus win a profit equal to the original stake.
  • As the gambler's wealth and available time jointly approach infinity, their probability of eventually flipping heads approaches 1, which makes the martingale betting strategy seem like a sure thing.
  • However, the exponential growth of the bets eventually bankrupts its users due to finite bankrolls. Stopped Brownian motion, which is a martingale process, can be used to model the trajectory of such games.
  • The concept of the martingale in probability theory was introduced by Paul Lévy in 1934, though he did not formally name it.
  • The term "martingale" was introduced later by Ville (1939), who also extended the definition to continuous martingales.
  • Much of the original development of the theory was done by Joseph Leo Doob among others. Part of the motivation for that early work was to mathematically prove the impossibility of successful betting strategies in games of chance.

Definitions

A basic definition of a discrete-time martingale is a discrete-time stochastic process (i.e., a sequence of random variables) X 1 , X 2 , X 3 , {\displaystyle X_{1},X_{2},X_{3},\dots } that satisfies for any time n {\displaystyle n} :

E [ | X n | ] < {\displaystyle \mathbf {E} [\vert X_{n}\vert ]<\infty }
E [ X n + 1 X 1 , , X n ] = X n . {\displaystyle \mathbf {E} [X_{n+1}\mid X_{1},\ldots ,X_{n}]=X_{n}.}

That is, the conditional expected value of the next observation, given all the past observations, is equal to the most recent observation.

Martingale sequences with respect to another sequence

More generally, a sequence Y 1 , Y 2 , Y 3 , {\displaystyle Y_{1},Y_{2},Y_{3},\dots } is said to be a martingale with respect to another sequence X 1 , X 2 , X 3 , {\displaystyle X_{1},X_{2},X_{3},\dots } if for all n {\displaystyle n} :

E [ | Y n | ] < {\displaystyle \mathbf {E} [\vert Y_{n}\vert ]<\infty }
E [ Y n + 1 X 1 , , X n ] = Y n . {\displaystyle \mathbf {E} [Y_{n+1}\mid X_{1},\ldots ,X_{n}]=Y_{n}.}

Similarly, a continuous-time martingale with respect to the stochastic process X t {\displaystyle X_{t}} is a stochastic process Y t {\displaystyle Y_{t}} such that for all t {\displaystyle t} :

E [ | Y t | ] < {\displaystyle \mathbf {E} [\vert Y_{t}\vert ]<\infty }
E [ Y t { X τ , τ s } ] = Y s s t . {\displaystyle \mathbf {E} [Y_{t}\mid \{X_{\tau },\tau \leq s\}]=Y_{s}\quad \forall s\leq t.}

This expresses the property that the conditional expectation of an observation at time t {\displaystyle t} , given all the observations up to time s {\displaystyle s} , is equal to the observation at time s {\displaystyle s} (provided that s t {\displaystyle s\leq t} ). The second property implies that Y n {\displaystyle Y_{n}} is measurable with respect to X 1 , , X n {\displaystyle X_{1},\dots ,X_{n}} .

General definition

In full generality, a stochastic process Y : T × Ω S {\displaystyle Y:T\times \Omega \to S} taking values in a Banach space S {\displaystyle S} with norm S {\displaystyle \lVert \cdot \rVert _{S}} is a martingale with respect to a filtration Σ {\displaystyle \Sigma _{*}} and probability measure P {\displaystyle \mathbb {P} } if:

  • Σ {\displaystyle \Sigma _{*}} is a filtration of the underlying probability space ( Ω , Σ , P ) {\displaystyle (\Omega ,\Sigma ,\mathbb {P} )} ;
  • Y {\displaystyle Y} is adapted to the filtration Σ {\displaystyle \Sigma _{*}} , i.e., for each t {\displaystyle t} in the index set T {\displaystyle T} , the random variable Y t {\displaystyle Y_{t}} is a Σ t {\displaystyle \Sigma _{t}} -measurable function;
  • for each t {\displaystyle t} , Y t {\displaystyle Y_{t}} lies in the Lp space L 1 ( Ω , Σ t , P ; S ) {\displaystyle L^{1}(\Omega ,\Sigma _{t},\mathbb {P} ;S)} , i.e.,
E P [ Y t S ] < + ; {\displaystyle \mathbf {E} _{\mathbb {P} }[\lVert Y_{t}\rVert _{S}]<+\infty ;}
  • for all s {\displaystyle s} and t {\displaystyle t} with s < t {\displaystyle s<t} and all F Σ s {\displaystyle F\in \Sigma _{s}} ,
E P [ ( Y t Y s ) χ F ] = 0 , {\displaystyle \mathbf {E} _{\mathbb {P} }\left[(Y_{t}-Y_{s})\chi _{F}\right]=0,}
where χ F {\displaystyle \chi _{F}} denotes the indicator function of the event F {\displaystyle F} . In Grimmett and Stirzaker's Probability and Random Processes, this last condition is denoted as:
Y s = E P [ Y t Σ s ] , {\displaystyle Y_{s}=\mathbf {E} _{\mathbb {P} }[Y_{t}\mid \Sigma _{s}],}
which is a general form of conditional expectation.3 This is also called the martingale property.

The property of being a martingale involves both the filtration and the probability measure (with respect to which the expectations are taken). It is possible that Y {\displaystyle Y} could be a martingale with respect to one measure but not another one; the Girsanov theorem offers a way to find a measure with respect to which an Itō process is a martingale.

In the Banach space setting the conditional expectation is also denoted in operator notation as E Σ s Y t {\displaystyle \mathbf {E} ^{\Sigma _{s}}Y_{t}} .4

Examples of martingales

  • An unbiased random walk, in any number of dimensions, is an example of a martingale. For example, consider a 1-dimensional random walk where at each time step a move to the right or left is equally likely.
  • A gambler's fortune (capital) is a martingale if all the betting games which the gambler plays are fair. Suppose X n {\displaystyle X_{n}} is the gambler's fortune after n {\displaystyle n} tosses of a fair coin, such that the gambler wins $1 if the coin toss outcome is heads and loses $1 if the outcome is tails. The gambler's conditional expected fortune after the next game, given the history, is equal to his present fortune.
  • Let Y n = X n 2 n {\displaystyle Y_{n}=X_{n}^{2}-n} where X n {\displaystyle X_{n}} is the gambler's fortune from the prior example. Then the sequence { Y n : n = 1 , 2 , 3 , } {\displaystyle \{Y_{n}:n=1,2,3,\dots \}} is a martingale. This can be used to show that the gambler's total gain or loss varies roughly between plus or minus the square root of the number of games played.
  • de Moivre's martingale: Suppose the coin toss outcomes are unfair (biased), with probability p {\displaystyle p} of coming up heads and probability q = 1 p {\displaystyle q=1-p} of tails. Let
X n + 1 = X n ± 1 {\displaystyle X_{n+1}=X_{n}\pm 1}
with "+" in case of "heads" and "−" in case of "tails". Let
Y n = ( q / p ) X n {\displaystyle Y_{n}=(q/p)^{X_{n}}}
Then { Y n : n = 1 , 2 , 3 , } {\displaystyle \{Y_{n}:n=1,2,3,\dots \}} is a martingale with respect to { X n : n = 1 , 2 , 3 , } {\displaystyle \{X_{n}:n=1,2,3,\dots \}} . To show this:
E [ Y n + 1 X 1 , , X n ] = p ( q / p ) X n + 1 + q ( q / p ) X n 1 = p ( q / p ) ( q / p ) X n + q ( p / q ) ( q / p ) X n = q ( q / p ) X n + p ( q / p ) X n = ( q / p ) X n = Y n . {\displaystyle {\begin{aligned}\mathbf {E} [Y_{n+1}\mid X_{1},\dots ,X_{n}]&=p(q/p)^{X_{n}+1}+q(q/p)^{X_{n}-1}\\[6pt]&=p(q/p)(q/p)^{X_{n}}+q(p/q)(q/p)^{X_{n}}\\[6pt]&=q(q/p)^{X_{n}}+p(q/p)^{X_{n}}=(q/p)^{X_{n}}=Y_{n}.\end{aligned}}}
  • Pólya's urn contains a number of different-coloured marbles; at each iteration a marble is randomly selected from the urn and replaced with several more of that same colour. For any given colour, the fraction of marbles in the urn with that colour is a martingale.
  • Likelihood-ratio testing in statistics: A random variable X {\displaystyle X} is thought to be distributed according either to probability density f {\displaystyle f} or to a different probability density g {\displaystyle g} . A random sample X 1 , , X n {\displaystyle X_{1},\dots ,X_{n}} is taken. Let Y n {\displaystyle Y_{n}} be the "likelihood ratio":
Y n = i = 1 n g ( X i ) f ( X i ) {\displaystyle Y_{n}=\prod _{i=1}^{n}{\frac {g(X_{i})}{f(X_{i})}}}
If X {\displaystyle X} is actually distributed according to the density f {\displaystyle f} rather than g {\displaystyle g} , then { Y n } {\displaystyle \{Y_{n}\}} is a martingale with respect to { X n } {\displaystyle \{X_{n}\}} .
  • Doob martingale: Let Y {\displaystyle Y} be any random variable with a finite expected value, and let { F n } {\displaystyle \{{\mathcal {F}}_{n}\}} be a filtration. The sequence defined by X n = E [ Y F n ] {\displaystyle X_{n}=\mathbf {E} [Y\mid {\mathcal {F}}_{n}]} is a martingale. This represents the sequentially updated best estimate of Y {\displaystyle Y} as more information becomes available.
Software-created martingale series source ↗
  • In an ecological community, the number of individuals of any particular species of fixed size is a function of time, and may be viewed as a sequence of random variables. This sequence is a martingale under the unified neutral theory of biodiversity and biogeography.
  • In population genetics, the frequency of an allele in a population of fixed size evolving under genetic drift (with no mutation or selection) follows a martingale. This is a defining feature of the Wright–Fisher model.
  • If { N t : t 0 } {\displaystyle \{N_{t}:t\geq 0\}} is a Poisson process with intensity λ {\displaystyle \lambda } , then the compensated Poisson process { N t λ t : t 0 } {\displaystyle \{N_{t}-\lambda t:t\geq 0\}} is a continuous-time martingale with right-continuous/left-limit sample paths.
  • Exponential martingale: If W t {\displaystyle W_{t}} is a standard one-dimensional Brownian motion, then the process Z t = exp ( θ W t 1 2 θ 2 t ) {\displaystyle Z_{t}=\exp \left(\theta W_{t}-{\frac {1}{2}}\theta ^{2}t\right)} is a continuous-time martingale for any real parameter θ {\displaystyle \theta } . This process plays a critical role in stochastic calculus and the Girsanov theorem for changing probability measures.
  • Wald's martingale: If X 1 , X 2 , {\displaystyle X_{1},X_{2},\dots } are independent and identically distributed random variables with moment-generating function M ( θ ) = E [ exp ( θ X 1 ) ] {\displaystyle M(\theta )=\mathbf {E} [\exp(\theta X_{1})]} , and their partial sums are denoted by S n = X 1 + + X n {\displaystyle S_{n}=X_{1}+\dots +X_{n}} , then the sequence W n = exp ( θ S n ) / M ( θ ) n {\displaystyle W_{n}=\exp(\theta S_{n})/M(\theta )^{n}} is a martingale.
  • Asset pricing in mathematical finance: By the fundamental theorem of asset pricing, in an arbitrage-free market, the discounted price of any tradable asset is a martingale under the risk-neutral measure. For example, if S t {\displaystyle S_{t}} is a stock price and r {\displaystyle r} is the risk-free interest rate, then e r t S t {\displaystyle e^{-rt}S_{t}} is a martingale under the equivalent martingale measure.
  • A d {\displaystyle d} -dimensional process M = ( M ( 1 ) , , M ( d ) ) {\displaystyle M=(M^{(1)},\dots ,M^{(d)})} in some space S d {\displaystyle S^{d}} is a martingale if each component T i ( M ) = M ( i ) {\displaystyle T_{i}(M)=M^{(i)}} is a one-dimensional martingale in S {\displaystyle S} .

Submartingales, supermartingales, and relationship to harmonic functions

There are two generalizations of a martingale that include cases when the current observation X n {\displaystyle X_{n}} is not necessarily equal to the future conditional expectation, but instead acts as an upper or lower bound on the conditional expectation.

These generalizations reflect the relationship between martingale theory and potential theory (the study of harmonic functions):

  • Just as a continuous-time martingale satisfies E [ X t { X τ : τ s } ] X s = 0 {\displaystyle \mathbf {E} [X_{t}\mid \{X_{\tau }:\tau \leq s\}]-X_{s}=0} for all s t {\displaystyle s\leq t} , a harmonic function f {\displaystyle f} satisfies the partial differential equation Δ f = 0 {\displaystyle \Delta f=0} where Δ {\displaystyle \Delta } is the Laplacian operator.
  • Given a Brownian motion process W t {\displaystyle W_{t}} and a harmonic function f {\displaystyle f} , the resulting process f ( W t ) {\displaystyle f(W_{t})} is also a martingale.

Submartingales:

  • A discrete-time submartingale is a sequence X 1 , X 2 , X 3 , {\displaystyle X_{1},X_{2},X_{3},\dots } of integrable random variables satisfying:
E [ X n + 1 X 1 , , X n ] X n . {\displaystyle \mathbf {E} [X_{n+1}\mid X_{1},\ldots ,X_{n}]\geq X_{n}.}
  • Likewise, a continuous-time submartingale satisfies:
E [ X t { X τ : τ s } ] X s s t . {\displaystyle \mathbf {E} [X_{t}\mid \{X_{\tau }:\tau \leq s\}]\geq X_{s}\quad \forall s\leq t.}
  • In potential theory, a subharmonic function f {\displaystyle f} satisfies Δ f 0 {\displaystyle \Delta f\geq 0} . Any subharmonic function bounded above by a harmonic function for all points on the boundary of a ball is bounded above by the harmonic function inside the ball.
  • Similarly, if a submartingale and a martingale have equivalent expectations for a given time, the history of the submartingale tends to be bounded above by the history of the martingale. Roughly speaking, the prefix "sub-" is consistent because the current observation X n {\displaystyle X_{n}} is less than (or equal to) the conditional expectation. Consequently, the process tends to increase in future time.

Supermartingales:

  • Analogously, a discrete-time supermartingale satisfies:
E [ X n + 1 X 1 , , X n ] X n . {\displaystyle \mathbf {E} [X_{n+1}\mid X_{1},\ldots ,X_{n}]\leq X_{n}.}
  • Likewise, a continuous-time supermartingale satisfies:
E [ X t { X τ : τ s } ] X s s t . {\displaystyle \mathbf {E} [X_{t}\mid \{X_{\tau }:\tau \leq s\}]\leq X_{s}\quad \forall s\leq t.}
  • In potential theory, a superharmonic function f {\displaystyle f} satisfies Δ f 0 {\displaystyle \Delta f\leq 0} .
  • Roughly speaking, the prefix "super-" is consistent because the current observation X n {\displaystyle X_{n}} is greater than (or equal to) the conditional expectation. Consequently, the process tends to decrease in future time.

Examples of submartingales and supermartingales

  • Every martingale is also a submartingale and a supermartingale. Conversely, any stochastic process that is both a submartingale and a supermartingale is a martingale.
  • Consider again the gambler who wins $1 when a coin comes up heads and loses $1 when it comes up tails. Suppose now that the coin may be biased, coming up heads with probability p {\displaystyle p} .
    • If p = 1 / 2 {\displaystyle p=1/2} , the gambler on average neither wins nor loses money, and the fortune over time is a martingale.
    • If p < 1 / 2 {\displaystyle p<1/2} , the gambler loses money on average, and the fortune over time is a supermartingale.
    • If p > 1 / 2 {\displaystyle p>1/2} , the gambler wins money on average, and the fortune over time is a submartingale.
  • A convex function of a martingale is a submartingale, by Jensen's inequality. For example, the square of the gambler's fortune in the fair coin game is a submartingale (which also follows from the fact that X n 2 n {\displaystyle X_{n}^{2}-n} is a martingale). Similarly, a concave function of a martingale is a supermartingale.

Martingales and stopping times

A stopping time with respect to a sequence of random variables X 1 , X 2 , X 3 , {\displaystyle X_{1},X_{2},X_{3},\dots } is a random variable τ {\displaystyle \tau } with the property that for each t {\displaystyle t} , the occurrence or non-occurrence of the event τ = t {\displaystyle \tau =t} depends only on the values of X 1 , X 2 , , X t {\displaystyle X_{1},X_{2},\dots ,X_{t}} . The intuition behind the definition is that at any particular time t {\displaystyle t} , you can look at the sequence so far and tell if it is time to stop. An example might be the time at which a gambler leaves the gambling table, which might depend on previous winnings, but not on games that haven't been played yet.

In some contexts the concept of stopping time is defined by requiring only that the occurrence or non-occurrence of the event τ = t {\displaystyle \tau =t} is probabilistically independent of X t + 1 , X t + 2 , {\displaystyle X_{t+1},X_{t+2},\dots } but not completely determined by the history up to time t {\displaystyle t} .

One of the basic properties of martingales is that, if ( X t ) t > 0 {\displaystyle (X_{t})_{t>0}} is a (sub-/super-) martingale and τ {\displaystyle \tau } is a stopping time, then the corresponding stopped process ( X t τ ) t > 0 {\displaystyle (X_{t}^{\tau })_{t>0}} defined by X t τ := X min { τ , t } {\displaystyle X_{t}^{\tau }:=X_{\min\{\tau ,t\}}} is also a (sub-/super-) martingale.

The concept of a stopped martingale leads to a series of important theorems, including the optional stopping theorem which states that, under certain conditions, the expected value of a martingale at a stopping time is equal to its initial value.

Martingale problem

The martingale problem is a framework in stochastic analysis for characterizing solutions to stochastic differential equations (SDEs) through martingale conditions.

General Martingale Problem (A, μ)

Let E {\displaystyle E} be a Polish space with Borel σ {\displaystyle \sigma } -algebra E {\displaystyle {\mathcal {E}}} , and let P ( E ) {\displaystyle {\mathcal {P}}(E)} be the set of probability measures on E {\displaystyle E} . Suppose A : D ( A ) C ( E ) {\displaystyle A:{\mathcal {D}}(A)\to C(E)} is a Markov pregenerator, where D ( A ) {\displaystyle {\mathcal {D}}(A)} is a dense subspace of C ( E ) {\displaystyle C(E)} . A probability measure P {\displaystyle \mathbb {P} } on the Skorokhod space D E [ 0 , ) {\displaystyle D_{E}[0,\infty )} solves the martingale problem ( A , μ ) {\displaystyle (A,\mu )} for μ P ( E ) {\displaystyle \mu \in {\mathcal {P}}(E)} if:

  • For every Γ E {\displaystyle \Gamma \in {\mathcal {E}}} , P ( ζ 0 Γ ) = μ ( Γ ) . {\displaystyle \mathbb {P} (\zeta _{0}\in \Gamma )=\mu (\Gamma ).}
  • For every f D ( A ) {\displaystyle f\in {\mathcal {D}}(A)} , the process f ( ζ t ) 0 t A f ( ζ s ) d s {\displaystyle f(\zeta _{t})-\int _{0}^{t}Af(\zeta _{s})\,ds} is a local martingale under P {\displaystyle \mathbb {P} } with respect to its natural filtration.

If μ = δ η {\displaystyle \mu =\delta _{\eta }} (the Dirac measure at η {\displaystyle \eta } ), then P {\displaystyle \mathbb {P} } is said to solve the martingale problem for A {\displaystyle A} with initial point η {\displaystyle \eta } .

Martingale Problem for Diffusions M(a, b)

A process X = ( X t ) t 0 {\displaystyle X=(X_{t})_{t\geq 0}} on a filtered probability space ( Ω , F , ( F t ) , P ) {\displaystyle (\Omega ,{\mathcal {F}},({\mathcal {F}}_{t}),\mathbb {P} )} solves the martingale problem M ( a , b ) {\displaystyle M(a,b)} for measurable functions a : R d S + d {\displaystyle a:\mathbb {R} ^{d}\to \mathbb {S} _{+}^{d}} and b : R d R d {\displaystyle b:\mathbb {R} ^{d}\to \mathbb {R} ^{d}} if:

  • For each 1 i d {\displaystyle 1\leq i\leq d} , M t i = X t i 0 t b i ( X s ) d s {\displaystyle M_{t}^{i}=X_{t}^{i}-\int _{0}^{t}b_{i}(X_{s})\,ds} is a local martingale.
  • For each 1 i , j d {\displaystyle 1\leq i,j\leq d} , M t i M t j 0 t a i j ( X s ) d s {\displaystyle M_{t}^{i}M_{t}^{j}-\int _{0}^{t}a_{ij}(X_{s})\,ds} is a local martingale.

Connection to Stochastic Differential Equations

Solutions to M ( a , b ) {\displaystyle M(a,b)} correspond (in a weak sense) to solutions of the SDE d X t = b ( X t ) d t + σ ( X t ) d B t {\displaystyle dX_{t}=b(X_{t})\,dt+\sigma (X_{t})\,dB_{t}} , where σ σ = a {\displaystyle \sigma \sigma ^{\top }=a} . One sees this by applying the generator A {\displaystyle A} to simple functions such as x i {\displaystyle x_{i}} or x i x j {\displaystyle x_{i}x_{j}} , thereby recovering the drift b {\displaystyle b} and the diffusion matrix a {\displaystyle a} .

Applications in Mathematical Finance

Martingales form the foundational mathematics behind modern quantitative finance and asset pricing theory.

  • The Fundamental Theorem of Asset Pricing: This theorem states that a financial market is free of arbitrage if and only if there exists a risk-neutral probability measure (also known as an equivalent martingale measure).
  • Risk-Neutral Pricing: Under this equivalent martingale measure, the discounted price process of any tradable asset is a martingale. This implies that the current price of an asset is exactly equal to the expected value of its future discounted payoffs.
  • Derivatives Pricing: Models such as the Black–Scholes model rely heavily on martingale representations. By finding the correct martingale measure via the Girsanov theorem, complex financial derivatives and options can be priced accurately without needing to predict the actual real-world direction of the stock market.
See also

See also

Notes

Notes

  1. Balsara, N. J. (1992). Money Management Strategies for Futures Traders. Wiley Finance. p. 122. ISBN 978-0-471-52215-7. martingale.
  2. Mansuy, Roger (June 2009). "The origins of the Word "Martingale"" (PDF). Electronic Journal for History of Probability and Statistics. 5 (1). Archived (PDF) from the original on 2012-01-31. Retrieved 2011-10-22.
  3. Grimmett, G.; Stirzaker, D. (2001). Probability and Random Processes (3rd ed.). Oxford University Press. ISBN 978-0-19-857223-7.
  4. Bogachev, Vladimir (1998). Gaussian Measures. American Mathematical Society. pp. 372–373. ISBN 978-1470418694.
References

References