Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Elementary predictable integral against a counting-process martingale

Definition

Let M be a square-integrable martingale on a finite horizon [0,T] in the all-pairs convention of Continuous-time adapted processes and martingales (in particular, it may be the compensated counting-process martingale of Simple counting-process intensity and compensator contract). Let 0=t0<t1<⋯<tm=T be a deterministic partition, and let each bounded random variable Hj be Ftj-measurable. The associated bounded predictable step integrand is H0=0 at time 0 and Hs=Hj on (tj,tj+1]. For this chosen step representation define, for 0≤t≤T, It(H):=∑j=0m−1Hj(Mt∧tj+1−Mt∧tj). This is a finite sum of square-integrable random variables. At this stage the representation is part of the input; representation independence and the isometry are established in Isometry for elementary predictable counting-process integrals ↗. The Axiom of Choice is inherited from the all-pairs martingale and conditional-expectation interface; the finite-sum definition makes no additional choice.

Source notes

The displayed finite-sum convention agrees with Tian's bounded predictable step-integral construction and Bass's construction for jump martingales. The local martingale and isometry properties are proved separately below.

Depends on

Used by

Dependency tree · two levels

12 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