Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generated
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 (0,1] with Lebesgue intensity, and extend it by zero after time 1. Its counting process is Nt=η((0,t∧1]). The effective conditional intensity is λ∗(t)=1(0,1](t) and its compensator is At=t∧1. This is a non-explosive process that has ended by time one, yet from the empty history the next-event law puts probability e−1 on no event ever.

Facts & Assumptions

Given: A Poisson process η on (0,1] with Lebesgue intensity, extended by no points after 1. Use the event-history filtration Hs=σ(η(B):B⊆(0,s∧1] Borel).

[F1]

Counts on disjoint Borel sets are independent Poisson variables with means given by the intensity measure. (Poisson and Cox point processes)

[F2]

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)

[F3]

A Poisson count of finite mean λ has mean λ, second moment λ2+λ, and zero-count mass e−λ. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[F4]

A deterministic Borel function of time is predictable for the predictable sigma-algebra convention. (Progressively measurable and predictable processes)

[F5]

Independence verified on generating pi-systems extends to the sigma-algebras they generate. (Independent pi-systems generate independent sigma-algebras)

[F6]

The finite-horizon model contract requires a continuous predictable compensator with finite expectation and a square-integrable martingale N−A. (Simple counting-process intensity and compensator contract)

[F7]

The conditional next-event survivor is the exponential of minus the integrated no-event hazard. (Inter-event survival and density from a conditional intensity)

[F8]

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 (s,∞] with jointly measurable finite-time density, compatible with the effective pre-event intensity. (Temporal point-process models and conditional intensity)

[A1]

The compensator martingale and conditional-expectation interface uses the Axiom of Choice. (The Axiom of Choice)

[A2]

Countable Choice is used by the finite-window Poisson construction. (The Axiom of Countable Choice (ACω))

Verification

1.1F2F4construct

The extension by zero has unit jumps only at the simple event times of η, and Nt is finite because N1 is Poisson with mean 1. The effective intensity λ∗(t)=1(0,1](t) is deterministic Borel and hence predictable by [F4]. Direct integration gives At=∫0tλ∗(u) du=t∧1, so A is continuous, nondecreasing, and bounded by 1.

1.2F1F2F8construct

Let H be the space of finite counting measures on (0,∞) with the sigma-algebra generated by its Borel-set evaluation maps. Define the history random element by Hs(B):=η(B∩(0,s∧1]) for every Borel B⊆(0,∞). 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 u>0, define h⊕u:=h+δu. For every Borel B, (h⊕u)(B)=h(B)+1B(u), so the update is jointly measurable in h,u and appends exactly one event.

2.1A1A2F1F3F5F6step 1.1

For 0≤s≤t, the increment Nt−Ns is the count on (s,t]∩(0,1], a Poisson variable of mean min⁡(t,1)−min⁡(s,1). Refine a finite family of past Borel sets into the disjoint atoms of the finite Boolean algebra they generate. Every atom lies in (0,s], 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 E[Nt−Ns∣Hs]=min⁡(t,1)−min⁡(s,1)=At−As. Thus N−A is a martingale. Since Nt has finite second moment by [F3] and At≤1, this martingale is square-integrable and meets [F6]; E[AT]≤1.

3.1F1F7F8step 2.1algebra

For s≥0 and h∈H, supply the next-event kernel, viewed on [0,∞] and supported on (s,∞], by Ks,h(C):=∫C∩(s,1]e−(u−s) du+e−(1−s)+1{∞∈C} for Borel C⊆[0,∞], where x+:=max⁡(x,0). Its finite-time mass is 1−e−(1−s)+, so each Ks,h is a probability measure. For fixed C, the finite-time term is es∫C∩(s,1]e−u du, a Borel function of s because the tail integral is monotone on [0,1] and zero for s≥1; the atom mass is also Borel. The finite-time density fs,h(u)=1{s<u≤1}e−(u−s) is jointly measurable in (s,h,u). By independent future increments, this is the conditional next-event law given Hs: its survivor for u>s is Ss,h(u)=e−((u∧1)−s)+, since the event of no point in (s,u]∩(0,1] has probability e−((u∧1)−s)+. Thus fs,h/Ss,h=1 on (s,1] and 0 after 1, agreeing almost everywhere with λ∗(u∣hu−)=1(0,1](u); this also agrees with [F7]. In particular, K0,h({∞})=e−1 and Ks,h({∞})=1 for s≥1.

4.1F2F3step 3.1∎

Taking u→∞ in step 3.1 gives Pr⁡(T1=∞)=e−1, also the zero-count probability Pr⁡(N1=0) by [F3]. No events occur after time 1, and N1 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

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