Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Cadlag Brownian-filtration local martingales have continuous versions

Statement

Assume the Axiom of Choice. Let B be a standard Brownian motion with usual augmented natural filtration (Ft) Natural and usual augmented Brownian filtrations. Every local martingale M relative to (Ft) whose paths are right-continuous with left limits on one event of probability one has a version with continuous paths, and any two continuous versions of M are indistinguishable.

Facts & Assumptions

Given: AC, a standard Brownian motion B with usual augmented filtration (Ft), and a local martingale M with cadlag paths.

[F1]

Representation. There is a predictable locally square-integrable H with Mt=M0+0tHsdBs for all t0 up to indistinguishability, and such an H is unique modulo (dtP)-null sets on each finite horizon. Brownian-filtration martingale representation

[F2]

Continuity of localized integrals. For a predictable locally square-integrable H the localized integral t0tHsdBs has continuous paths on a full-measure event and is unique up to indistinguishability among continuous processes with the same stopped finite-energy pieces. Localized Ito integral The Ito integral process has a continuous martingale version Locally square-integrable predictable Brownian integrands

[F3]

Indistinguishability from rational agreement. If two processes with continuous paths agree at every rational time on a single event of probability one, then they are indistinguishable: continuity extends the agreement to all times on that event. Process law, modification, and indistinguishability Continuity of f:AR at a point of A and on A: the ε-δ condition, its agreement with limxcf(x)=f(c) at a limit point, and continuity at an isolated point

[F4]

AC bookkeeping. Choice is declared for the conditional-expectation interface underlying the representation. The Axiom of Choice

Proof

technique · direct
1.1

By [F1] write M=M0+HdB up to indistinguishability with H predictable and locally square-integrable; by [F2] the localized integral has continuous paths on a full-measure event, so the process Mtc:=M0+0tHsdBs is a continuous version of M.

F1F2
2.1

Uniqueness: if M and M are two continuous versions of M, then they agree with M at every rational time almost surely, hence agree with each other at every rational time on the intersection of two full-measure events; by [F3] they are indistinguishable.

F3step 1.1
3.1

Boundary and consistency cases: for M itself already continuous, the version is M up to indistinguishability; for M constant the integral representation has H=0; the corollary shows that a cadlag local martingale of this filtration cannot have a genuine jump, because the representation is continuous; the uniqueness statement is about continuous versions, and no claim is made that an arbitrary cadlag modification is continuous pathwise; and AC enters only through [F4].

F1F2F4step 2.1

Source notes

Van der Vaart, Theorem 6.6, yields the continuity statement as an immediate consequence of the representation by a localized stochastic integral; the uniqueness argument is the standard rationals-and-continuity computation recorded in the definition of indistinguishability.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

76 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