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.
Brackets of a compensated simple counting process
Statement
Under the finite-horizon contract of Simple counting-process intensity and compensator contract, the optional quadratic variation of is , its continuous predictable bracket is , its self-cross predictable bracket is , and is a martingale on .
Facts & Assumptions
Given: A simple unit-jump counting process , a continuous predictable increasing compensator with and , and the model contract that is a square-integrable martingale.
The finite-horizon objects, unit jumps, integrability and martingale contract are exactly those of the counting-process model. (Simple counting-process intensity and compensator contract)
Optional brackets are jump-square sums. A scalar predictable bracket candidate is a continuous predictable increasing process with , , and a martingale; a cross-bracket candidate is continuous predictable of finite variation, starts at zero, has integrable total variation, and makes a martingale. (Optional and predictable brackets for counting-process martingales) Candidates are unique up to indistinguishability in these classes by Uniqueness of continuous predictable brackets.
A bounded predictable step integral against a square-integrable martingale is a square-integrable martingale. (Elementary predictable counting-process integrals are martingales)
For a finite-variation càdlàg path, squared partition increments converge to its jump-square sum, and the finite-partition square identity holds. (Finite-variation integration by parts for counting-process martingales)
Bounded stopping preserves a càdlàg square-integrable martingale. (Bounded stopping preserves càdlàg square-integrable martingales)
The sampled discrete-time martingale satisfies Doob's maximal inequality. (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 conditional expectation and the sampled Doob inequality. (The Axiom of Choice)
Proof
Since is continuous, ; each jump of is zero or one, so the jump-square definition gives , using .
Let and for integers . The adapted nondecreasing càdlàg process satisfies for , so is bounded stopping; at the first crossing, continuity of and unit jumps of give , hence . By [F5], is a square-integrable martingale.
The variables and are integrable, so is integrable; since is a martingale starting at zero, . The pathwise total variation of is at most , hence is integrable.
Choose nested deterministic partitions with mesh tending to zero. The coefficients are -measurable and bounded by , so [F3] makes the step integral against a martingale. The partition identity [F4] gives . The stopped process has the same unit jumps as , so the squared-increment sum converges to by [F4] and step 1.1. Also , so the terms are bounded by a deterministic constant depending only on ; dominated convergence in the martingale event identities proves is a martingale.
Since a.s., eventually on each path. On nested deterministic grids, [F6] gives ; right continuity identifies the increasing grid limit with , and [F8] gives . Thus is integrable and dominates every stopped value . For , [F7] and the event identities from step 2.2 let , proving is a martingale.
Since is a martingale, is a martingale by step 3.1 and linearity, so [F2] and [F1] make a scalar bracket candidate; uniqueness gives . Also , so is a martingale, making a cross-bracket candidate too; uniqueness gives .
Source notes
Tian states and for a continuous compensator, but omits the bracket proof. Bass supplies the jump-square and product-formula framework; Andersen–Borgan–Gill–Keiding define the counting-process compensator under an explicit filtration. The stopped-grid and finite-variation arguments above complete the local proof without assuming a general compensator-existence theorem.
Depends on
- Simple counting-process intensity and compensator contract
- Optional and predictable brackets for counting-process martingales
- Uniqueness of continuous predictable brackets
- Elementary predictable counting-process integrals are martingales
- Finite-variation integration by parts for counting-process martingales
- Bounded stopping preserves càdlàg square-integrable martingales
- Doob Lp maximal inequality
- Taking out what is known
- Continuous-time stopping times and stopped sigma-algebras
- Dominated convergence
- Monotone convergence for the integral
- The Axiom of Choice
Used by
- A tied jump produces a nonzero cross bracket Example
- One exponential event: compensator and isometry Example
- Consistency of the weighted logrank variance estimate Lemma
- Cox score martingale representation and random-risk-mean replacement Lemma
- Isometry for elementary predictable counting-process integrals Lemma
- Uniform Cox partial-likelihood Hessian convergence Lemma
- Weighted logrank score expansion under a common-hazard model Lemma
- Compensators, brackets, and jump-integral isometry for reaction counts Theorem
- Pointwise influence limit and Greenwood variance consistency Theorem
Cited to discharge well-definedness by Optional and predictable brackets for counting-process martingales.
Dependency tree · two levels
49 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
- Lu Tian, STAT331 Unit 9: Some Key Results for Counting Process Martingales, PDF pp. 10–12 (standard reference, not scraped)
- Richard F. Bass, SDEs with Jumps, Sections 2.4–2.6, PDF pp. 5–7 (standard reference, not scraped)
- P. K. Andersen, Ø. Borgan, R. D. Gill, N. Keiding, Censoring, Truncation and Filtering in Statistical Models Based on Counting Processes, §2, PDF pp. 3–8 (standard reference, not scraped)