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.
For an adapted process with right-continuous paths and a stopping time , is adapted. At fixed , round upward on finite partitions of . Every approximating value is -measurable, and right continuity gives the limit. Completeness handles a null exceptional set if right continuity holds only almost surely. A martingale assumption and boundedness of are unnecessary.
Almost sure submartingale convergence theorem Created 2026-10-06 Updated 2026-10-07
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.
Suppose and . The breadth-first exploration of a binomial random graph has deterministic drift up to steps. Its weighted martingale has variance . For , the Doob L2 maximal inequality makes its maximum smaller than with high probability. Then throughout , giving a graph component of order .
For the upper expectation bound, let . The dominating binomial branching process has branching survival probability by the binomial branching survival correction. Its branching process conditioned on extinction has mean and total-progeny expected value . Therefore . Since and , this yields the matching upper bound. Controlling rare large components is necessary to conclude an expected value asymptotic from a typical-size statement.
For a zero-start continuous local martingale with deterministically, its stochastic exponential is a uniformly integrable martingale. For each , . Its terminal value is strictly positive, so it defines an equivalent infinite-horizon change of measure by the Girsanov theorem.
Every bounded harmonic function on a graph is constant if the connected locally finite graph is recurrent. Along its random walk on a graph, the harmonic values form a bounded martingale and converge almost surely. Recurrence visits each vertex infinitely often, making every vertex value a subsequential limit of the same convergent sequence. Thus every value agrees.
If is a bounded harmonic function on a domain , continuous on its closure, and the Brownian exit time is almost surely finite from , then . The Itô formula and compact localization make a bounded martingale. bounded convergence theorem at the exit time proves the representation even if the domain is unbounded. Removing boundedness of can invalidate this conclusion through loss of uniform integrability.
A discrete-time martingale with a common deterministic bound on all increments either converges finitely or has and , almost surely. Stopping on first crossing below gives a lower bound on the overshoot. Adding produces a nonnegative martingale, so the Martingale convergence theorem forces finite convergence on the event of never crossing. Apply the same argument to .
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.
Bounded stopping time 2026-10-05
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.
During Breadth-first search of let count unseen vertices, active vertices, and explored vertices. When start a new unseen root, recorded by ; otherwise . The newly discovered count is conditionally . Subtract its conditional mean to obtain a martingale difference . With , and , iteration gives
The last sum is a martingale. Positive over an interval means that the graph component under exploration does not finish there. Independently adding phantom children couples each component exploration below a binomial branching process with offspring law .
Càdlàg martingale 2026-10-06
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.
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.
Characterization of a martingale by stopped expectations Created 2026-09-29 Updated 2026-10-05
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 .
Conditional-expectation martingale Created 2026-09-28 Updated 2026-10-03
For an integrable random variable and an increasing filtration , the process is a martingale. The tower property of conditional expectation gives the martingale identity.
Continuous local martingale with bounded quadratic variation Created 2026-10-05 Updated 2026-10-06
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.
Continuous martingale 2026-10-06
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.