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 finite-window Poisson process that terminates at time one
Example
Let be a supplied Poisson point process on with Lebesgue intensity, and extend it by zero after time . Its counting process is . The effective conditional intensity is and its compensator is . This is a non-explosive process that has ended by time one, yet from the empty history the next-event law puts probability on no event ever.
Facts & Assumptions
Given: A Poisson process on with Lebesgue intensity, extended by no points after . Use the event-history filtration .
Counts on disjoint Borel sets are independent Poisson variables with means given by the intensity measure. (Poisson and Cox point processes)
The finite-window Poisson process exists, is simple, and has finite total count; for rate one its ordered event-time density and empty-pattern probability are given by the local construction. (Finite-window homogeneous Poisson construction and ordered event-time density)
A Poisson count of finite mean has mean , second moment , and zero-count mass . (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)
A deterministic Borel function of time is predictable for the predictable sigma-algebra convention. (Progressively measurable and predictable processes)
Independence verified on generating pi-systems extends to the sigma-algebras they generate. (Independent pi-systems generate independent sigma-algebras)
The finite-horizon model contract requires a continuous predictable compensator with finite expectation and a square-integrable martingale . (Simple counting-process intensity and compensator contract)
The conditional next-event survivor is the exponential of minus the integrated no-event hazard. (Inter-event survival and density from a conditional intensity)
The temporal model also supplies a measurable history space and history random element, a measurable event-append update, and a probability kernel for the next event time on with jointly measurable finite-time density, compatible with the effective pre-event intensity. (Temporal point-process models and conditional intensity)
The compensator martingale and conditional-expectation interface uses the Axiom of Choice. (The Axiom of Choice)
Countable Choice is used by the finite-window Poisson construction. (The Axiom of Countable Choice ())
Verification
The extension by zero has unit jumps only at the simple event times of , and is finite because is Poisson with mean . The effective intensity is deterministic Borel and hence predictable by [F4]. Direct integration gives , so is continuous, nondecreasing, and bounded by .
Let be the space of finite counting measures on with the sigma-algebra generated by its Borel-set evaluation maps. Define the history random element by for every Borel . It is a finite counting measure, and it is measurable because each evaluation is a measurable count of the supplied point process; its generated sigma-algebra is the event-history filtration in the Given clause. For finite , define . For every Borel , , so the update is jointly measurable in and appends exactly one event.
For , the increment is the count on , a Poisson variable of mean . Refine a finite family of past Borel sets into the disjoint atoms of the finite Boolean algebra they generate. Every atom lies in , so [F1] gives independence of its count vector from the future increment. These count cylinders generate the natural-history sigma-algebra, and [F5] extends independence to that sigma-algebra. Therefore . Thus is a martingale. Since has finite second moment by [F3] and , this martingale is square-integrable and meets [F6]; .
For and , supply the next-event kernel, viewed on and supported on , by for Borel , where . Its finite-time mass is , so each is a probability measure. For fixed , the finite-time term is , a Borel function of because the tail integral is monotone on and zero for ; the atom mass is also Borel. The finite-time density is jointly measurable in . By independent future increments, this is the conditional next-event law given : its survivor for is , since the event of no point in has probability . Thus on and after , agreeing almost everywhere with ; this also agrees with [F7]. In particular, and for .
Taking in step 3.1 gives , also the zero-count probability by [F3]. No events occur after time , and is finite almost surely, so the process terminates and is non-explosive.
Source notes
Rasmussen's Example 2.5 exhibits a unit-rate Poisson process on a finite interval and identifies its positive terminal no-event mass. The local verification also checks the compensator martingale contract and the finite-count/non-explosion boundary.
Depends on
- Temporal point-process models and conditional intensity
- Inter-event survival and density from a conditional intensity
- Finite-window homogeneous Poisson construction and ordered event-time density
- Poisson and Cox point processes
- The scalar Poisson count law
- Normalization, moments, and generating function of the Poisson count law
- Progressively measurable and predictable processes
- Simple counting-process intensity and compensator contract
- Independent pi-systems generate independent sigma-algebras
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
61 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
- Joseph G. Rasmussen, Lecture Notes: Temporal Point Processes and the Conditional Intensity Function (standard reference, not scraped)
- Robert E. Kass, Uri T. Eden, and Emery N. Brown, Analysis of Neural Data, Chapter 19: Point Processes (standard reference, not scraped)