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 be a square-integrable all-pairs martingale with right-continuous paths with left limits for every , and let be a stopping time. Then the stopped process is a square-integrable martingale on .
Facts & Assumptions
Given: A finite horizon, a square-integrable all-pairs martingale with pathwise càdlàg paths, and a bounded stopping time .
On , use the adaptedness, all-pairs conditional-expectation identity and pointwise conditions of Continuous-time adapted processes and martingales with times restricted to this interval. This agrees with its convention: extend and the filtration by and . For the extended martingale identity is ; for it is the known-variable identity, and for it is the given identity. Thus this extension is a square-integrable martingale, without any filtration augmentation.
A map is a stopping time when . (Continuous-time stopping times and stopped sigma-algebras)
The absolute value of a martingale is a nonnegative submartingale, and the finite discrete-time Doob inequality bounds its grid maximum by twice the terminal norm. (Absolute value and powers of a martingale are submartingales Doob Lp maximal inequality)
Dominated convergence passes limits through event integrals. (Dominated convergence)
Increasing nonnegative integrals converge to the integral of the limit. (Monotone convergence for the integral)
AC is inherited through the conditional-expectation interface in [F1]. (The Axiom of Choice)
Proof
Let be nested finite partitions of containing any fixed with mesh tending to zero. For each , the values of on its grid form a discrete-time nonnegative submartingale by [F1, F3]. The Doob bound gives . Càdlàg paths and the nested dense grids imply ; [F5] then gives .
For a finite partition , round up to the first grid point . This is a finite-valued stopping time because . At adjacent grid points, ; the indicator is -measurable. Conditioning each increment on its left endpoint proves the stopped grid values have the martingale identity at grid times, in particular at .
Refine the partitions while keeping as grid points. Then , and pathwise right continuity gives and . For or , the events with grid value lie in , and their complement is also in ; expressing over these finitely many events proves -measurability. The pointwise limits are then measurable there without completing the filtration. Both are dominated by , integrable by step 1.1. For each , apply [F4] to the event-integral martingale identity from step 1.2; it yields , hence the stopped process satisfies the all-pairs martingale identity. Also 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
- Continuous-time adapted processes and martingales
- Continuous-time filtrations and all-pairs martingales
- Continuous-time stopping times and stopped sigma-algebras
- Conditional expectation as an ae class
- Absolute value and powers of a martingale are submartingales
- Doob Lp maximal inequality
- Monotone convergence for the integral
- Dominated convergence
- The Axiom of Choice
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
- Richard F. Bass, SDEs with Jumps, Section 2.3, PDF pp. 3–4 (standard reference, not scraped)