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.

Bounded stopping preserves càdlàg square-integrable martingales

Statement

Let M=(Mt)0≤t≤T be a square-integrable all-pairs martingale with right-continuous paths with left limits for every ω, and let τ≤T be a stopping time. Then the stopped process Mtτ:=Mt∧τ is a square-integrable martingale on [0,T].

Facts & Assumptions

Given: A finite horizon, a square-integrable all-pairs martingale with pathwise càdlàg paths, and a bounded stopping time τ.

[F1]

On [0,T], use the adaptedness, all-pairs conditional-expectation identity and pointwise L2 conditions of Continuous-time adapted processes and martingales with times restricted to this interval. This agrees with its [0,∞) convention: extend M and the filtration by M~t=Mt∧T and F~t=Ft∧T. For s≤T<t the extended martingale identity is E[MT∣Fs]=Ms; for T≤s≤t it is the known-variable identity, and for s≤t≤T it is the given identity. Thus this extension is a square-integrable martingale, without any filtration augmentation.

[F2]

A map τ is a stopping time when {τ≤t}∈Ft. (Continuous-time stopping times and stopped sigma-algebras)

[F3]

The absolute value of a martingale is a nonnegative submartingale, and the finite discrete-time Doob L2 inequality bounds its grid maximum by twice the terminal L2 norm. (Absolute value and powers of a martingale are submartingales Doob Lp maximal inequality)

[F4]

Dominated convergence passes limits through event integrals. (Dominated convergence)

[F5]

Increasing nonnegative integrals converge to the integral of the limit. (Monotone convergence for the integral)

[A1]

AC is inherited through the conditional-expectation interface in [F1]. (The Axiom of Choice)

Proof

1.1A1F1F3F5given

Let πn be nested finite partitions of [0,T] containing any fixed s,t with mesh tending to zero. For each πn, the values of ∣M∣ on its grid form a discrete-time nonnegative submartingale by [F1, F3]. The Doob bound gives Emax⁡u∈πn∣Mu∣2≤4E∣MT∣2. Càdlàg paths and the nested dense grids imply sup⁡u≤T∣Mu∣=sup⁡u∈∪nπn∣Mu∣; [F5] then gives Esup⁡u≤T∣Mu∣2<∞.

1.2A1F1F2givenalgebra

For a finite partition πn={r0<⋯<rm}, round τ up to the first grid point τn≥τ. This is a finite-valued stopping time because {τn≤rj}={τ≤rj}∈Frj. At adjacent grid points, Mrk∧τn−Mrk−1∧τn=1{τn>rk−1}(Mrk−Mrk−1); the indicator is Frk−1-measurable. Conditioning each increment on its left endpoint proves the stopped grid values have the martingale identity at grid times, in particular at s,t.

2.1A1F1F4step 1.1step 1.2∎

Refine the partitions while keeping s,t as grid points. Then τn↓τ, and pathwise right continuity gives Ms∧τn→Ms∧τ and Mt∧τn→Mt∧τ. For u=s or u=t, the events {τn=rj} with grid value rj<u lie in Frj⊆Fu, and their complement {τn≥u} is also in Fu; expressing Mu∧τn over these finitely many events proves Fu-measurability. The pointwise limits are then measurable there without completing the filtration. Both are dominated by sup⁡u≤T∣Mu∣, integrable by step 1.1. For each B∈Fs, apply [F4] to the event-integral martingale identity from step 1.2; it yields E[1B(Mt∧τ−Ms∧τ)]=0, hence the stopped process satisfies the all-pairs martingale identity. Also ∣Mt∧τ∣≤sup⁡u≤T∣Mu∣ gives square integrability.

Source notes

Bass discusses martingale jump decompositions and stopped martingales. The finite-grid approximation above gives the bounded-stopping argument under this library's uncompleted filtration convention without assuming the usual conditions on the filtration.

Depends on

Used by

Dependency tree · two levels

43 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