Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

A continuous finite-variation martingale is constant

Statement

Let D=(Dt)0≤t≤T be a continuous martingale relative to a filtration (Ft), with D0=0. Suppose each path has finite total variation VT(D) and EVT(D)<∞. Then D is indistinguishably zero on [0,T].

Facts & Assumptions

Given: A finite horizon T, a filtered probability space, and a continuous adapted martingale D with D0=0 and integrable pathwise total variation.

[F1]

The all-pairs martingale identity holds at every s≤t, and the continuous-path hypothesis supplies a measurable probability-one event on which each path of D is continuous. (Continuous-time adapted processes and martingales)

[F2]

A bounded Fs-measurable factor can be taken outside conditional expectation given Fs. (Taking out what is known)

[F3]

Dominated convergence passes limits through integrals under an integrable majorant. (Dominated convergence)

[F4]

Total variation bounds every partition sum of absolute increments. (Bounded variation and total variation on an interval)

[F5]

Every finite closed interval [0,T] is compact. (Heine-Borel by bisection: every closed bounded interval [a,b] is compact)

[F6]

A continuous real function on a compact subset of R is uniformly continuous. (Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous)

[F7]

A nonnegative random variable with expectation zero vanishes almost surely. (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere)

[F8]

Indistinguishability means equality for every time outside one measurable probability-one event. (Process law, modification, and indistinguishability)

[A1]

AC is inherited from the conditional-expectation interface used by the continuous-time martingale definition. (The Axiom of Choice)

Proof

1.1constructalgebra

Fix R>0 and define ϕR(x)=max⁡(−R,min⁡(x,R)) and GR(x)={x2/2,∣x∣≤R,R∣x∣−R2/2,∣x∣≥R. The explicit piecewise formula gives GR′=ϕR; ϕR is bounded by R and is 1-Lipschitz, while GR≥0 and GR(x)=0 exactly when x=0. Splitting an interval at −R and R if needed and using the Lipschitz bound gives, for all x,y∈R, ∣GR(y)−GR(x)−ϕR(x)(y−x)∣≤12∣y−x∣2.

2.1A1F1F2F3F4F5F6F7givenconstruct

Fix t∈(0,T] and deterministic partitions 0=t0m<⋯<tqmm=t with mesh tending to zero. Put Sm=∑j=0qm−1ϕR(Dtjm)(Dtj+1m−Dtjm). Each coefficient is bounded and Ftjm-measurable. The martingale identity and [F2] give ESm=0. The estimate of step 1.1 and the total-variation bound [F4] imply ∣Sm−GR(Dt)+GR(D0)∣≤12∑j∣Dtj+1m−Dtjm∣2≤12max⁡j∣Dtj+1m−Dtjm∣ VT(D). On the probability-one continuity event in [F1], compactness [F5] and Heine--Cantor [F6] make the maximum increment tend to zero. Thus Sm→GR(Dt) almost surely, since D0=0. Also ∣Sm∣≤RVT(D), an integrable bound by the hypothesis. Dominated convergence [F3] yields EGR(Dt)=0. Since GR is nonnegative and vanishes only at zero, [F7] gives Dt=0 almost surely.

3.1F1F8step 2.1givenconstruct∎

The conclusion also holds at t=0 because D0=0. For every rational r∈[0,T], step 2.1 gives a measurable probability-one event on which Dr=0. Intersect these countably many events with the probability-one continuity event from [F1]. On the resulting measurable probability-one event, continuity and density of the rationals give Dt=0 for every t∈[0,T]. By [F8], D is indistinguishably zero.

Source notes

Bass's Section 2.3 discusses càdlàg martingale decompositions and the jump-bracket framework. The bounded-integrand partition argument above supplies the finite-horizon finite-variation martingale proof used here.

Depends on

Used by

Dependency tree · two levels

68 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