Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Continuous-time adapted processes and martingales

Definition

Assume the Axiom of Choice The Axiom of Choice. Fix a probability space (Ω,F,P) with a continuous-time filtration (Ft)t0 in the sense of Continuous-time filtrations and all-pairs martingales. All processes in this definition are real-valued and indexed by [0,); the filtration is neither assumed complete nor right-continuous. The Axiom of Choice is declared because the conditional-expectation classes used in clause 3 are supplied by the Radon--Nikodym interface of Conditional expectation as an ae class, which assumes it; the countable-choice obligations inherited from that interface are declared as dependencies of this item.

  1. Adapted. X=(Xt)t0 is adapted to (Ft) when Xt is Ft-measurable for every t0. This is exactly the notion of Continuous-time filtrations and all-pairs martingales.

  2. Stopped process. For a stopping time τ for (Ft) Continuous-time stopping times and stopped sigma-algebras the stopped process is Xtτ(ω):=Xtτ(ω)(ω),t0, with the convention t:=t, so no value X is ever required and X0τ=X0 identically. This formula defines a pathwise family; adaptedness of X alone does not assert measurability or adaptedness of its stopped values. If in addition τc for a deterministic constant c, then Xtτ=Xtτ, and only the values of X on [0,c] enter. Stopping at a stopping time is not the same as replacing a process by a modification; it is a pathwise operation.

  3. Martingale. M=(Mt)t0 is a martingale (an all-pairs continuous-time martingale) relative to (Ft) when it is adapted, EMt< for every t0, and for all 0st E[MtFs]=Msalmost surely. The equality is an equality of the almost-everywhere classes of Conditional expectation as an ae class; equivalently, every version of the conditional expectation on the left equals Ms off one null set. At s=t the identity reduces to the known-variable case. The word "continuous-time" refers to the index set only and does not assert path continuity.

  4. Local martingale. X=(Xt)t0 is a local martingale relative to (Ft) when it is adapted, EX0<, and there exist stopping times (τn)n0 with τ0τ1 and τn almost surely such that for every n0 the stopped process XτnX0=(XtτnX0)t0 is a martingale in the sense of clause 3. The sequence (τn) is called a localizing sequence. Equivalently, every Xτn is a martingale: adaptedness makes the integrable variable X0 measurable with respect to every Ft, so the constant process with value X0 is a martingale and may be added to, or subtracted from, each stopped process. The centering merely makes every localized process start at 0; apart from the required integrability of X0, no claim is made that X is integrable at a positive deterministic time, and no claim is made that X has continuous paths.

  5. Path and integrability attributes. A process has continuous paths when tXt(ω) is continuous on [0,) for every ω in an event of probability one; the usual almost-sure path conventions of Process law, modification, and indistinguishability apply. A martingale M is square-integrable when EMt2< for every t0, and L2-bounded when supt0EMt2<. These are properties of the single process under consideration, not of its versions: a modification of a martingale need not be adapted, so every later statement names the adapted versions it uses.

The following remarks specify what follows directly from this vocabulary.

  1. A martingale is a local martingale. If M is a martingale, the constant sequence τn:=n, n0, localizes it: the stopped process MnM0 is again a martingale by the martingale identity applied at the deterministic times sntn. The converse fails; a local martingale need not be a martingale, and no such implication is used in this development.
  2. Localization after a separately justified stopping operation. Suppose (τn) localizes X, σ is a stopping time, Xσ is adapted, and each (XτnX0)σ is a martingale. Then (τn) localizes Xσ. Indeed it still increases to infinity, (Xσ)0=X0, and the pathwise identity (Xσ)τn(Xσ)0=XστnX0=(XτnX0)σ verifies exactly clause 4. The stopped-piece martingale assertion and adaptedness are hypotheses here, not consequences of the unrestricted all-pairs definition. They must be established in each application. The sequence (στn) is not a substitute for (τn): its almost-sure limit is σ, which need not be infinity.

No path continuity, no right continuity of the filtration, and no completeness of the underlying probability space is imposed by this definition. Choice enters only through the conditional-expectation interface named above, whose countable-choice obligations are declared as dependencies of this item.

Depends on

Used by

Dependency tree · two levels

20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources