In probability theory, a martingale is a sequence of random variables (i.e., a stochastic process) for which, at a particular time, the conditional expectation of the next value in the sequence is equal to the present value, regardless of all prior values.
Originally, martingale referred to a class of betting strategies that was popular in 18th-century France.[1] [2] 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 martingale in probability theory was introduced by Paul Lévy in 1934, though he did not name it. The term "martingale" was introduced later by, 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 work was to show the impossibility of successful betting strategies in games of chance.
A basic definition of a discrete-time martingale is a discrete-time stochastic process (i.e., a sequence of random variables) X1, X2, X3, ... that satisfies for any time n,
E(\vertXn\vert)<infty
E(Xn+1\midX1,\ldots,Xn)=Xn.
That is, the conditional expected value of the next observation, given all the past observations, is equal to the most recent observation.
More generally, a sequence Y1, Y2, Y3 ... is said to be a martingale with respect to another sequence X1, X2, X3 ... if for all n
E(\vertYn\vert)<infty
E(Yn+1\midX1,\ldots,Xn)=Yn.
Similarly, a continuous-time martingale with respect to the stochastic process Xt is a stochastic process Yt such that for all t
E(\vertYt\vert)<infty
E(Yt\mid\{X\tau,\tau\leqs\})=Ys \foralls\let.
This expresses the property that the conditional expectation of an observation at time t, given all the observations up to time
s
Yn
X1...Xn
Y:T x \Omega\toS
S
\lVert ⋅ \rVertS
\Sigma*
P
P
P
EP(\lVertYt\rVertS)<+infty;
EP\left([Yt-Ys]\chiF\right)=0,
where χF denotes the indicator function of the event F. In Grimmett and Stirzaker's Probability and Random Processes, this last condition is denoted as
Ys=EP(Yt\mid\Sigmas),
which is a general form of conditional expectation.[3]
It is important to note that 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 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
\Sigmas | |
E |
Yt
Xn+1=Xn\pm1
with "+" in case of "heads" and "−" in case of "tails". Let
Xn | |
Y | |
n=(q/p) |
Then is a martingale with respect to . To show this
\begin{align} E[Yn+1\midX1,...,Xn]&=p
Xn+1 | |
(q/p) |
+q
Xn-1 | |
(q/p) |
\\[6pt] &=p(q/p)
Xn | |
(q/p) |
+q(p/q)
Xn | |
(q/p) |
\\[6pt] &=q
Xn | |
(q/p) |
+p
Xn | |
(q/p) |
=
Xn | |
(q/p) |
=Yn. \end{align}
Yn=\prod
| ||||
i=1 |
If X is actually distributed according to the density f rather than according to g, then is a martingale with respect to
d
M=(M(1),...,M(d))
Sd
Sd
(i) | |
T | |
i(M)=M |
S
There are two generalizations of a martingale that also include cases when the current observation Xn is not necessarily equal to the future conditional expectation E[''X''<sub>''n''+1</sub> | ''X''<sub>1</sub>,...,''X<sub>n</sub>''] but instead an upper or lower bound on the conditional expectation. These generalizations reflect the relationship between martingale theory and potential theory, that is, the study of harmonic functions. Just as a continuous-time martingale satisfies E[''X''<sub>''t''</sub> | {''X''<sub>''τ''</sub> : ''τ'' ≤ ''s''}] − Xs = 0 ∀s ≤ t, a harmonic function f satisfies the partial differential equation Δf = 0 where Δ is the Laplacian operator. Given a Brownian motion process Wt and a harmonic function f, the resulting process f(Wt) is also a martingale.
X1,X2,X3,\ldots
\operatornameE[Xn+1\midX1,\ldots,Xn]\geXn.
Likewise, a continuous-time submartingale satisfies
\operatornameE[Xt\mid\{X\tau:\tau\les\}]\geXs \foralls\let.
In potential theory, a subharmonic function f satisfies Δf ≥ 0. Any subharmonic function that is bounded above by a harmonic function for all points on the boundary of a ball is bounded above by the harmonic function for all points 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 Xn is less than (or equal to) the conditional expectation E[''X<sub>n</sub>''<sub>+1</sub> | ''X''<sub>1</sub>,...,''X<sub>n</sub>'']. Consequently, the current observation provides support from below the future conditional expectation, and the process tends to increase in future time.
\operatornameE[Xn+1\midX1,\ldots,Xn]\leXn.
Likewise, a continuous-time supermartingale satisfies
\operatornameE[Xt\mid\{X\tau:\tau\les\}]\leXs \foralls\let.
In potential theory, a superharmonic function f satisfies Δf ≤ 0. Any superharmonic function that is bounded below by a harmonic function for all points on the boundary of a ball is bounded below by the harmonic function for all points inside the ball. Similarly, if a supermartingale and a martingale have equivalent expectations for a given time, the history of the supermartingale tends to be bounded below by the history of the martingale. Roughly speaking, the prefix "super-" is consistent because the current observation Xn is greater than (or equal to) the conditional expectation E[''X<sub>n</sub>''<sub>+1</sub> | ''X''<sub>1</sub>,...,''X<sub>n</sub>'']. Consequently, the current observation provides support from above the future conditional expectation, and the process tends to decrease in future time.
See main article: Stopping time.
A stopping time with respect to a sequence of random variables X1, X2, X3, ... is a random variable τ with the property that for each t, the occurrence or non-occurrence of the event τ = t depends only on the values of X1, X2, X3, ..., Xt. The intuition behind the definition is that at any particular time t, you can look at the sequence so far and tell if it is time to stop. An example in real life might be the time at which a gambler leaves the gambling table, which might be a function of their previous winnings (for example, he might leave only when he goes broke), but he can't choose to go or stay based on the outcome of 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 is probabilistically independent of Xt + 1, Xt + 2, ... but not that it is completely determined by the history of the process up to time t. That is a weaker condition than the one appearing in the paragraph above, but is strong enough to serve in some of the proofs in which stopping times are used.
One of the basic properties of martingales is that, if
(Xt)t>0
\tau
\tau) | |
(X | |
t>0 |
\tau:=X | |
X | |
min\{\tau,t\ |
The concept of a stopped martingale leads to a series of important theorems, including, for example, 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.