An integrable adapted process is a martingale when .
A nonnegative martingale takes nonnegative values almost surely at each time. In discrete time its expectations are constant, so it is bounded in and the Martingale convergence theorem gives a finite integrable almost sure limit. Its expectations need not converge to the expectation of that limit; uniform integrability is needed for convergence in L1.
Expose independent coordinates successively and take the conditional mean of a function after each exposure. These conditional means form a martingale from to . A coordinate oscillation bound gives a conditional interval of length for the corresponding increment, by coupling the unexposed coordinates. Applying the Hoeffding lemma to these conditional ranges proves the McDiarmid inequality.
A martingale can diverge to almost surely when its increments are finite but not uniformly bounded. For independent Bernoulli random variables with ,
has centered integrable increments. The First Borel-Cantelli lemma makes the rare negative jumps occur only finitely often, after which every increment equals one. The expectation remains zero at every finite time despite this pathwise divergence.
An integrable adapted process is a martingale if all its values at bounded stopping times are integrable with the same expectation as . For the converse, compare deterministic with , where and . The resulting identity is precisely the defining test for conditional expectation. In the forward direction, use the optional stopping theorem for a càdlàg martingale under the usual conditions for a filtration.
If a martingale has increments with almost surely for deterministic , then each one-sided deviation of magnitude from has probability at most . If all vanish, the martingale is constant. The inequality gives concentration from bounded increments without requiring independent increments.
If a real sequence converges finitely, its successive increments tend to zero. A martingale whose increments stay bounded away from zero on every sample path cannot have a finite almost-sure limit, regardless of its zero conditional mean increments.
Once a nonnegative martingale hits zero, it stays zero almost surely. Conditional expectation on gives ; nonnegativity forces the next value to vanish there. A countable intersection makes these assertions simultaneous for all times, proving absorption at the first zero.
Let a nonnegative martingale start at one, let be its first zero, and let be its first hit of . Suppose and on finite hits, for thresholds . Then is a submartingale. The bounded stopped values have mean one, so their second moment is at most . Consequently . For this implies the weaker bound . The threshold restriction prevents an impossible overshoot requirement below the starting value.
Under the conditional-variance and overshoot assumptions of the absorption-time bound from conditional variance and overshoot, . Bound the probability by and optimize . If the resulting bound is below one, its minimizing threshold is greater than one; otherwise the probability bound is trivial.
A martingale difference sequence is an adapted sequence of integrable random variables , , with . Its partial sums are a martingale, and martingale increments give such sequences. If the differences are square-integrable, they are uncorrelated random variables: for , conditioning on gives .
A time-indexed increment with is a martingale difference relative to its history. Square-integrable differences at different indices are orthogonal, allowing their conditional variances to accumulate. They need not be independent.
If a martingale has increments bounded by a single deterministic constant, then almost surely. Its increments form a uniformly -bounded martingale difference sequence; apply the strong law for uniformly L2-bounded uncorrelated random variables to their partial sums and note . No square-integrability of the initial value is needed beyond the usual martingale integrability.
For a real continuous function on , let be its secant slope on each length- dyadic cell. Regard as a probability space and use the filtration of half-open dyadic cells with the endpoint as a separate null cell. The mean of the two child slopes equals the parent slope, so is a martingale. Its integral gives the linear interpolation of on that grid. If is Lipschitz continuous, these slopes are bounded by its Lipschitz constant; the Lp martingale convergence theorem then supplies a bounded integral density for .
For fair independent and identically distributed random variables with the Bernoulli distribution, is a nonnegative martingale. It has almost sure convergence to zero but , so it lacks convergence in L1.
If is a square-integrable martingale, then its increments are orthogonal in : for ,
More generally, multiplying the later increment by any square-integrable quantity measurable before it still gives expectation zero whenever the product is integrable.
An integrable adapted process is a submartingale when
If is a nonnegative submartingale, then for every ,
Stop at the first crossing of and use the submartingale property on that event.
For a centered square-integrable martingale with and , apply the Doob maximal inequality for a nonnegative submartingale to for . Conditional Jensen inequality gives the submartingale property, and crossing forces its square above . The bound is minimized by . This extends the Cantelli inequality from one random variable to a martingale maximum, without requiring independent increments.
For a nonnegative martingale, satisfies . Stop at and use nonnegativity before passing to the increasing event. A limit of thresholds from below also gives the bound for even when the supremum is not attained.
For independent centered random variables and ,
Apply the Doob maximal inequality for a nonnegative submartingale to and optimize at .
For independent centered square-integrable variables, if and , then
is a martingale.
If additionally , then
Stop the square martingale for independent centered sums at the first exit from or at time .
For an integrable random variable and an increasing filtration , the process is a martingale. The tower property of conditional expectation gives the martingale identity.
Expose the independent edge indicators of a binomial random graph in a fixed order, and set for an integrable statistic . This is a martingale from to . If changing one edge changes by at most , coupling the unexposed indicators gives , permitting the Azuma-Hoeffding inequality.
If are independent integrable random variables with , then
is a martingale for , because independence gives .
An adapted integrable process is a continuous-time martingale when for every .
A martingale whose values over its whole time interval form a uniformly integrable family has an integrable terminal limit and is closed by that limit. Conversely, conditional expectations of an integrable terminal variable form a uniformly integrable martingale, by uniform integrability of conditional expectations. For continuous martingales, one may equivalently use uniform integrability of the family stopped at finite stopping times.
A càdlàg martingale is a continuous-time martingale represented by a càdlàg process: its paths are right-continuous and have finite left limits at positive times, on one common probability-one event. This path regularity permits approximation of stopping times from above.
A continuous martingale is a continuous-time martingale whose paths are continuous outside one null event. Continuity does not remove the integrability or conditional-expectation requirements in the martingale definition.
A continuous martingale is L2-bounded when . The L2 martingale convergence theorem gives a terminal value with convergence in and almost sure convergence. The resulting conditional expectation identity is . Boundedness on each separate finite horizon is a weaker condition. The subspace with is commonly denoted .
For a L2-bounded continuous martingale, the terminal and maximal norms satisfy
The first inequality follows from almost sure convergence. Apply the Doob L2 maximal inequality on and then the monotone convergence theorem as for the second. These are equivalent norms on the space modulo indistinguishability of stochastic processes; neither inequality needs a zero initial value.
An adapted process is a local martingale when there are stopping times almost surely such that each stopped process is a martingale. Every martingale is local, while a positive local martingale is a supermartingale.
A uniformly bounded local martingale is a true uniformly integrable martingale: a localizing sequence gives uniformly dominated stopped values, so their conditional identities pass to the limit. A deterministic bound on each compact time interval gives a true martingale on each such interval, even when the bound grows with time.
An integrable discrete-time local martingale is a true martingale. Its stopped increments have the form , and the dominated convergence theorem removes a localizing sequence from the conditional increment identity.
The Fatou lemma makes every time value of a nonnegative discrete-time local martingale integrable, assuming the usual integrable initial value. The integrable discrete-time result then makes it a true martingale.
A strict local martingale is a local martingale that is not a true martingale. The reciprocal of a three-dimensional Bessel process is an example: it is a nonnegative continuous local martingale whose expectation decreases strictly.
A localizing sequence for a local martingale is an increasing sequence of stopping times almost surely such that every stopped process is a true martingale. One can often choose the times so that the stopped processes are bounded.
A continuous local martingale is a local martingale whose sample paths are continuous almost surely. Its quadratic variation determines much of its pathwise behaviour.
Suppose are continuous, start at zero, and is increasing. If and are local martingales, their logarithms first recover adaptation of and the semimartingale property of . In the decomposition , the two Itô drift measures give and . Thus and . All real exponential parameters may be assumed, but these two suffice.
A process has conditionally symmetric increments if, for all deterministic and bounded measurable ,
Equivalently, the conditional characteristic function of every increment is invariant under changing the sign of its argument. This property is stronger than unconditional symmetry and is different from independent increments. It supplies identities between positive and negative exponential terminal martingales.
Suppose is a continuous local martingale starting at zero, with conditionally symmetric increments, and terminal conditional expectations have continuous martingale versions. Then
To prove this, set . Symmetry makes a martingale, and the Itô product rule gives . Consequently is a bounded local martingale, hence a martingale. Evaluating at the endpoints proves the formula. If also for all , the values of the bracket Laplace transform at and force almost surely. Continuity and the Lévy characterization of Brownian motion then identify as Brownian motion.
A continuous local martingale converges to a finite limit on the event that its terminal bracket is finite. Stopping at each integer bracket level gives an L2-bounded martingale and its almost sure limit. On the finite-bracket event, some such stopped process coincides with the original process forever. This supplies terminal values for a finite DDS lifetime.
The polynomial has zero Itô drift. Finite fourth maximal and second bracket moments make it a true martingale. If and , then . Equality at every time forces a deterministic clock and hence Brownian motion by the Lévy characterization of Brownian motion.
If a local martingale has an integrable running absolute supremum on each fixed finite horizon, localization and conditional dominated convergence make it a true martingale. This upgrades polynomial Itô local martingales when maximal moments and bracket moments control all terms.
A continuous local martingale with and deterministically bounded quadratic variation on every finite horizon is a square-integrable martingale, with . Localization, the Doob L2 maximal inequality, and the resulting integrable bound on the squared supremum justify removing the localizing sequence.
A continuous local martingale with finite variation is almost surely constant. After localization, its quadratic variation is both zero, because it has finite variation, and the quantity controlling its increments, because it is a martingale.
Let be a continuous local martingale with and . For
the process is Brownian motion and
When , one can enlarge the probability space and continue independently beyond that time.
A continuous local martingale bounded above pathwise throughout a stochastic time interval cannot have infinite quadratic variation at that interval's endpoint. The Dambis-Dubins-Schwarz theorem represents it as Brownian motion at its quadratic-variation clock; an infinite clock would force unbounded oscillations. Its clock therefore has a finite limit, and so does the martingale. A bound below gives the same conclusion by changing sign. The bound may be random; it must hold over the entire interval.
Strict increase of a bracket does not force an infinite terminal value. Up to , the inverse-clock martingale continues at a finite lifetime by its terminal limit, with bracket . On an independent product extension, add . Its bracket fills and its cross variation with the original part vanishes. The result is Brownian for all clock times and still represents .
For a continuous strictly increasing unbounded bracket , the inverse times satisfy and . Optional sampling of the original martingale stopped at bounded bracket levels makes a continuous local martingale in . Time-changing the square-minus-bracket martingale gives its bracket ; the Lévy characterization of Brownian motion identifies it as Brownian.
If a continuous local martingale satisfies
for a nonnegative predictable process , then, after enlarging the probability space if necessary, there is a Brownian motion such that
An independent Brownian motion supplies noise on the set where .
The Brownian motion in is generally constructed from , so it need not be independent of the quadratic variation . For example, has clock , and their dependence can be detected by a nonzero mixed moment.
For every there are constants such that a continuous local martingale with satisfies
for every stopping time for which the quantities are finite.
For and a continuous local martingale starting at zero, the Itô formula for , the Doob Lp maximal inequality and Hölder's inequality yield . One possible constant is . Stop at increasing absolute-value levels to remove an initial boundedness assumption. This proves the upper half of the Burkholder-Davis-Gundy inequalities in this range.
Every nonnegative local martingale is a supermartingale. In particular, one that starts from zero is identically zero: its nonnegative value at every time has expectation at most zero.
For and , stop at the infimum of strict crossings above . Continuity bounds the stopped process by and makes its value at a finite crossing time exactly . Its expectation remains one, and bounded convergence at infinity yields . The maximum has density on , with no endpoint atom.
A nonnegative local martingale is a supermartingale. If its integrable terminal limit has the same expectation as its initial value, conditional Fatou lemma gives , and equality of expectations makes this an equality. It is therefore a uniformly integrable martingale.
For a square-integrable martingale starting at zero,
For a continuous local martingale stopped so that its quadratic variation is integrable, the Itô isometry makes the right-hand side .
For and a martingale ,
A martingale bounded in converges almost surely and in to a square-integrable limit. Orthogonality of its increments makes their squared norms summable.
If every increment of a discrete martingale takes values in , then
Iterated conditioning shows that the increments are independent symmetric signs, so is a simple symmetric random walk.
If is a martingale and counts its completed upcrossings of by time , then
Equivalent conventions may add an initial endpoint term.
An upcrossing of an interval consists of an observation at or below followed by a later observation at or above . Successive completed upcrossings use disjoint buy-sell pairs.
The upcrossing count counts completed upcrossings by time , allowing the first purchase at time zero. For a martingale, the Doob upcrossing inequality bounds its expected value by .
A discrete-time martingale with converges almost surely to an integrable random variable. If the martingale is uniformly integrable, convergence also holds in .
An -bounded real martingale has a square-integrable terminal value, converges to it almost surely and in , and satisfies . The Cauchy property follows from orthogonality of increments and monotonicity of . This terminal representation permits optional sampling at finite unbounded stopping times and uniform-integrability control of stopped squares by conditional Jensen.
For independent fair Bernoulli variables, this nonnegative martingale starts at one, doubles on every success, and becomes zero permanently on the first failure. Its expectation is always one, but it tends to zero almost surely because the probability of success forever is zero. Thus it satisfies the Martingale convergence theorem while failing convergence in L1. This illustrates how rare large values obstruct uniform integrability.
A submartingale with converges almost surely to a finite integrable random variable. The positive-part bound also bounds negative parts because . The result specializes to an -bounded martingale, and hence to every nonnegative martingale. It does not by itself give convergence in L1; uniform integrability supplies that stronger conclusion.
A martingale satisfying , for , has almost sure convergence and convergence in Lp to a limit . Also . The Doob Lp maximal inequality makes integrable to the power ; the Martingale convergence theorem gives the almost-sure limit, and the dominated convergence theorem gives convergence in the Lp norm. Boundedness in alone does not imply convergence in L1.
Stopping a uniformly integrable discrete-time martingale at any stopping time preserves uniform integrability, including when the stopping time can be infinite. For , the optional stopping theorem and the Markov inequality give
Choose first, then , to make this uniformly small.
For a decreasing sequence of sigma-algebras and an integrable random variable ,
almost surely and in .
A nonnegative supermartingale, or more generally a supermartingale whose negative parts have uniformly bounded expectations, converges almost surely to a finite integrable random variable.
If and is bounded, then
almost surely and in . Testing the almost-sure martingale limit on the algebra identifies it with the terminal conditional expectation.
If bounded random variables converge almost surely to , then
almost surely and in . For , the variables form a nonnegative supermartingale with expectations tending to zero.
A right-continuous continuous-time martingale with has an almost-sure finite limit as .
An integrable adapted process is a supermartingale when .
A local supermartingale becomes a supermartingale after stopping along an increasing sequence of stopping times tending to infinity. Localization allows an Itô formula comparison before global integrability is established. Additional lower bounds or uniform integrability are needed to pass from the local comparison to an unrestricted expectation inequality.
For a positive stock satisfying , the Itô formula gives . Localization and the conditional Fatou lemma make this nonnegative local supermartingale a true supermartingale.
For a right-continuous nonnegative supermartingale and , the first level-hit time and the optional stopping theorem give . Let and first use levels , then , to include a supremum not attained. For a continuous nonnegative local martingale on a stochastic interval, apply the argument on increasing localized compact subintervals, then pass to their limit. Letting shows that its running supremum is finite almost surely.
If a nonnegative supermartingale reaches zero at a discrete stopping time, its later nonnegative values have conditional expectation at most zero and must also be zero almost surely.
A discrete-time supermartingale is a martingale exactly when for every . If expectations are constant, the nonnegative variable
has expectation zero and therefore vanishes almost surely.
If a supermartingale dominates an adapted reward process , optional sampling gives for every bounded stopping time .
A random time is a stopping time when for every .
For independent trials of success probability , let be the first index completing two consecutive successes. If are the mean remaining times with no trailing success and with one trailing success, conditioning gives and . Solving yields , so fair trials have mean waiting time six. Disjoint pairs give a geometric tail bound and justify finiteness before solving the equations. Overlapping pairs are not independent trials.
The stopped stochastic process follows until the stopping time and thereafter keeps the value when is finite. For a pathwise right-continuous adapted process, the stopped process is adapted, by progressive measurability and measurable evaluation at . When is a martingale, further stopping and integrability conditions determine whether its stopped process is a martingale.
Let be integrable independent and identically distributed random variables, and let be a stopping time for their natural filtration, with . Since is measurable before is observed, independence and the Tonelli theorem give . The event need not be independent of , so the selected increment can be biased.
The information available at a stopping time is the sigma-algebra
In discrete time, for . A bounded stopping time permits conditional forms of the optional stopping theorem with respect to this sigma-algebra.
If are stopping times and , then is a stopping time. The key identity is
This uses the ordering : without it, need not be known when occurs. Such pastings test the martingale identity through expectations at bounded stopping times.
An announcing sequence consists of stopping times increasing to almost surely, strictly smaller than on . Such a lifetime can be approached through stopped intervals on which a locally defined stochastic process is an ordinary adapted process. For the usual maximal local solution of a stochastic differential equation, the exit times from a nested compact exhaustion of the open domain, capped as , supply this sequence. The existence of such a sequence is an extra lifetime convention; arbitrary stopping times need not admit one.
A bounded stopping time is a stopping time bounded almost surely by a deterministic finite constant. In discrete time, a bound makes integrable whenever are integrable random variables, and the optional stopping theorem applies to a martingale without additional limiting hypotheses. Almost-sure finiteness alone is weaker than boundedness.
Suppose a nonnegative stopping time and constants , satisfy on . Take to be a positive integer in discrete time. Then
On the surviving event, conditional survival is at most . The tower property of conditional expectation therefore gives
Induction proves the geometric bound. Partitioning the tail integral into intervals of length then gives ; in discrete time, group the tail sum into successive integer indices instead. This proves finite expected hitting times when every surviving state has a uniform positive chance of escaping within a fixed time. It works in discrete or continuous time without assuming independence of successive survival events.
For a random walk with independent and identically distributed increments and an exit time from , suppose for some integer . A block of such positive increments forces an exit. Conditional on survival, every successive block has success probability at least , so and . This is an instance of the geometric tail bound from a uniform escape probability; centering of the increments is not required.
Let a fixed word be sampled from an alphabet of symbols by independent uniform draws, and let count draws through its first occurrence. If is the set of lengths of the borders of a word, including the full length, then
Shorter borders contribute because a failed or completed match can retain a suffix that is already a prefix of the next match.
The Skorokhod embedding theorem represents a centered probability distribution on the real numbers with finite variance as for a stopping time of Brownian motion. One may choose so that the stopped process is uniformly integrable and .
If a random walk has independent identically distributed centered steps of variance , there are increasing Brownian stopping times such that
and the increments are independent and identically distributed with mean . Apply the one-step embedding repeatedly using the strong Markov property.
The law of large numbers gives . Brownian maximal estimates then show
in probability. Since , the embedded random walk satisfies the central limit theorem.
For a discrete martingale and stopping time ,
The indicator is measurable at time , so the stopped process is a martingale. If it is uniformly bounded and almost surely, bounded convergence gives directly.
For an almost surely finite stopping time , if and , then with convergence in L1. Thus L1 convergence implies uniform integrability makes the stopped martingale uniformly integrable.
Let an integrable process be adapted to . It is a martingale if and only if for every and every stopping time . For the reverse implication, fix and take on and on . Comparing its stopped expectation at with the expectation obtained from the deterministic stopping time gives . Since this holds for every , it is exactly .
Articles were limited to the first 100 out of 132 total.

Ancestors (5)

  1. Probability theory
  2. Probability and statistics
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.