Alphabeta Math
Pipeline-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.

Temporal intensity and likelihood

1 · Prerequisites

2 · Summary

Overview

This page treats simple, locally finite event sequences on a finite observation window when a conditional waiting-time law and its predictable hazard are supplied, together with the separate counting-process compensator-martingale contract. It derives the next-event survivor and density, including the terminal mass when cumulative hazard is finite, then derives the event-pattern likelihood relative to a supplied unit-rate Poisson reference. The likelihood retains the final no-event interval and adds conditional mark-density factors only when a mark law is supplied. Writing an intensity does not establish that a process exists, is non-explosive, or is stationary.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Temporal point-process models and conditional intensity

Definition

Assume the Axiom of Choice as in Simple counting-process intensity and compensator contract. Fix a finite horizon T>0, a probability space with an increasing filtration (Ft) in the all-pairs convention of Continuous-time filtrations and all-pairs martingales, and an adapted càdlàg (right-continuous with left limits), nondecreasing, integer-valued process N with N0=0, NT<∞ almost surely, and jumps ΔNt∈{0,1} outside one null event. Such a process is simple: its event times are strictly ordered, 0<T1<⋯<TNT≤T. It is locally finite when it has finitely many events on every finite interval.

For conditional-law calculations, the model supplies a measurable history space (H,G), an adapted measurable history random element Ht recording the initial information and events observed through time t, and a measurable update map h↦h⊕u that appends an event at time u. Write Ht:=σ(Ht) and let Ht− record only events strictly before t. Relevant exogenous covariates are included in the supplied history. Measurability has the meaning of A measurable function between measurable spaces. Predictability is measurability for the predictable sigma-algebra generated by (s,u]×A with A∈Fs and the time-zero generators, as in Progressively measurable and predictable processes.

The model supplies a probability kernel Kt,h on (t,∞] for the next event time given history h at time t (Measure kernel and probability kernel, Conditional law given a random element); its finite-time density versions are jointly measurable in (t,h,u). The value +∞ means that no later event occurs. If the finite-time measure is absolutely continuous with respect to Lebesgue measure (Absolute continuity of a signed or complex measure with respect to a positive measure, Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, Assuming countable choice, every Borel subset of Rn is Lebesgue measurable), let ft,h be its supplied nonnegative Radon--Nikodym density (The Radon-Nikodym derivative as an almost-everywhere equivalence class). Write St,h(u):=Kt,h((u,∞]) for its survivor and define its no-event conditional hazard by λt,h∗(u):=ft,h(u)St,h(u)where St,h(u)>0. Assume these hazards are locally integrable on every finite interval. The model also supplies a nonnegative predictable effective-intensity process λ∗ compatible with these waiting-time hazards: for each history h at time t, on its supplied measurable no-event continuation up to u>t, the pre-event intensity λ∗(u∣hu−) agrees with λt,h∗(u) for Lebesgue-almost every u. The jointly measurable hazard representatives used in the event-density factors are these same versions on their proper domains u>t. Compatibility with the predictable process is a model requirement, not an evaluation of a waiting-time density at its excluded left endpoint. This pre-event convention means the event at u does not change its own intensity.

The temporal conditional-intensity model requires both this hazard-compatible conditional law and the separate counting-process compensator contract of Simple counting-process intensity and compensator contract: if an at-risk indicator Y and intensity density λ are separately specified, the effective intensity is λ∗=Yλ; without an at-risk indicator, it is λ∗. Then At=∫0tλ∗(u) du is finite pathwise, continuous, adapted and predictable, E[AT]<∞, and N−A is a square-integrable martingale in the all-pairs convention of Continuous-time adapted processes and martingales. At-risk exposure, if present, is part of the effective intensity. The compensator clause is a model assumption: a displayed hazard formula alone proves neither that a process with this law exists nor that the martingale contract holds. No stationarity or non-explosion claim follows from writing an intensity specification.

Source notes

Rasmussen defines conditional intensity through the conditional waiting-time hazard and makes the terminating-process case explicit. Kass, Eden, and Brown use the pre-event history convention and distinguish an intensity formula from the assumptions needed for a point-process law. The local compensator contract is inherited exactly from the counting-process page.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Inter-event survival and density from a conditional intensity

Statement

Fix a supplied event history h at time t in the model of Temporal point-process models and conditional intensity. Let λh∗(u) be its nonnegative no-event conditional hazard, supplied as a locally integrable version on every finite interval, and put Λh(u):=∫tuλh∗(s) ds. For each finite U>t, on t≤u≤U the conditional survivor and finite- time density of the next event are Sh(u)=exp⁡(−Λh(u)),fh(u)=λh∗(u)exp⁡(−Λh(u))for almost every u. If Λh(u)→Λh(∞)<∞ as u→∞, then Kh({∞})=exp⁡(−Λh(∞)). If Λh(u)→∞, this terminal mass is zero. These conclusions concern one next-event law and do not prove non-explosion of an entire process.

Facts & Assumptions

Given: A history h at time t, a supplied probability kernel for the next waiting time on (t,∞], its finite-time density fh, survivor Sh, and a nonnegative locally integrable hazard λh∗.

[F1]

The conditional law is a probability kernel on (t,∞] with finite-time density fh relative to Lebesgue measure, survivor Sh(u)=Kh((u,∞]), and hazard λh∗(u)=fh(u)/Sh(u) wherever Sh(u)>0. (Temporal point-process models and conditional intensity, Lebesgue measurable sets, the family L(Rn), and the restricted set function λn)

[F2]

The indefinite integral of an L1 function is absolutely continuous and has derivative equal to its integrand almost everywhere; the L1 fundamental theorem uses Countable Choice. (The indefinite integral of an L1 function is absolutely continuous, The indefinite integral of an L1 function is differentiable almost everywhere)

[F4]

An absolutely continuous function with derivative zero almost everywhere is constant; this result uses Dependent Choice. (An absolutely continuous function with zero derivative almost everywhere is constant)

[F6]

A finite measure is continuous from above on a decreasing sequence of measurable sets. (Continuity from above when one set has finite measure)

[A1]

Full AC is inherited from the temporal model. Countable Choice and Dependent Choice are declared for [F2] and [F4]. (The Axiom of Choice, The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

Proof

1.1A1F1F2given

Since Kh((t,∞])=1, [F1] gives Sh(u)=1−∫tufh(s) ds. By [F2], Sh and Λh are absolutely continuous and Sh′=−fh=−λh∗Sh almost everywhere where Sh>0, while Λh′=λh∗ almost everywhere.

2.1A1F3F4F5step 1.1

Fix a compact interval on which Sh>0. The cumulative hazard is bounded there, say 0≤Λh≤M. By [F5], there is L>0 such that ∣exp⁡(x)−exp⁡(y)∣≤L∣x−y∣ for x,y∈[0,M]. Since Λh is absolutely continuous by step 1.1, for every ε>0 its absolute-continuity condition supplies δ>0 such that every permitted finite family of subintervals with total length below δ satisfies ∑j∣Λh(vj)−Λh(uj)∣<ε/L. Therefore ∑j∣exp⁡(Λh(vj))−exp⁡(Λh(uj))∣≤L∑j∣Λh(vj)−Λh(uj)∣<ε, so Gh:=exp⁡(Λh) is absolutely continuous. By [F3], GhSh is absolutely continuous and (GhSh)′=Gh(λh∗Sh+Sh′)=0 almost everywhere. By [F4], GhSh is constant. Its value at t is 1, so Sh(u)=exp⁡(−Λh(u)) wherever Sh is positive.

3.1F1F6step 2.1algebra∎

Fix finite U>t and suppose Sh first reaches zero at some τ≤U. On [t,τ), step 2.1 gives Sh(u)=e−Λh(u)≥e−Λh(U)>0. Continuity of Sh then gives Sh(τ)>0, a contradiction. Thus the formula holds on all of [t,U]; substituting it into [F1] gives the density formula almost everywhere. Also Sh(u)=Kh((u,∞]) decreases to Kh({∞}) along integer u→∞ by [F6]. Taking the limit in the survivor formula gives the two stated terminal-mass cases.

Source notes

Rasmussen proves the hazard-to-survival relation by integrating the logarithmic derivative of the survivor, then differentiates to obtain the density. Kass, Eden, and Brown give the same conditional hazard identity and derive the waiting-time density in their full Section 19.4. The proof above keeps the finite-cumulative-hazard case, including its possible mass at +∞, separate from process existence and non-explosion.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite-window homogeneous Poisson construction and ordered event-time density

Statement

Let T>0, θ>0, and let S=(0,T] carry its subspace topology and Borel sigma-algebra. This space is Hausdorff as a subspace of R; rational intervals give a countable base; and each x∈S has a compact neighborhood [x−δ,x+δ]∩S for some 0<δ<x. Let ℓ be Lebesgue measure restricted to S. There exists a Poisson point process on S with intensity measure νθ(B)=θℓ(B). Its total count is finite almost surely, its event times have no ties almost surely, and for every integer m≥0 the joint density of the ordered event times 0<t1<⋯<tm≤T,N(S)=m, with respect to m-dimensional Lebesgue measure on the ordered simplex is e−θTθm. For m>0, conditional on N(S)=m, the ordered event times have density m!/Tm. For m=0 the empty-pattern probability is e−θT.

Facts & Assumptions

Given: Countable Choice, T>0, θ>0, and the Borel time interval S=(0,T] with its usual topology.

[F1]

For finite λ>0, the scalar Poisson law has masses e−λλk/k!, these masses sum to one, and its mean is λ; at λ=0 it is concentrated at zero. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[F3]

Finite products of probability measures exist, satisfy the rectangle product formula, and are unique among measures with that formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F4]

A countable nonnegative weighted sum of measures is a measure. (Nonnegative scalar multiples and countable weighted sums of measures are measures)

[F5]

A point process is Poisson with intensity ν when every finite pairwise-disjoint Borel family has independent Poisson counts with means ν(B). (Poisson and Cox point processes)

[F7]

For a nonnegative product-measurable function, Tonelli permits iterated integration. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

[F8]

A point process on a locally compact, second-countable Hausdorff Borel space is a measurable random locally finite counting measure, with measurability tested by its evaluation maps. (Random measures and locally finite point processes)

Proof

1.1A1F1F2F3F4F6F8givenconstruct

Put λ=θT and let Q=ℓ/T, a probability measure on S by [A1] and [F2]. For each n≥0, use the finite product probability Q⊗n on Sn; for n=0, S0 is the singleton empty tuple with unit mass. Form the countable disjoint union Ω=∐n≥0({n}×Sn) with the sigma-algebra whose sections in each component are product-measurable. Put pn=e−λλn/n! and define P(E)=∑n≥0pnQ⊗n(En). [F1] gives ∑npn=1; [F4] makes P a probability measure. On component n, set η=∑i=1nδxi. Every evaluation η(B)=∑i=1n1B(xi) is measurable, and each realization has at most n atoms, so it is locally finite. The space S is locally compact, second countable, and Hausdorff by the displayed neighborhood and base checks; hence [F8] makes η a point process.

1.2F1F2F3F5algebra

Let B1,…,Br be disjoint Borel subsets of S, put B0=S∖⋃j=1rBj, and set qj=Q(Bj). Conditional on component n, a count vector (k0,…,kr) with sum n occurs for n!/∏j=0rkj! coordinate assignments; each assignment has probability ∏j=0rqjkj by [F3]. Multiplying by pn and summing over k0≥0 gives, for fixed k1,…,kr∈N0, P{η(Bj)=kj, 1≤j≤r}=∑k0=0∞e−λ(λq0)k0k0!∏j=1r(λqj)kjkj!=e−λ∏j=1r(λqj)kjkj!∑k0=0∞(λq0)k0k0!=∏j=1r[e−λqj(λqj)kjkj!]. Here 00=1 for zero-mass cells, and q0=1−∑j=1rqj. The exponential series evaluates the sum, and λqj=θℓ(Bj). Thus the joint count mass factors into the independent Poisson masses with means νθ(Bj); [F5] makes η a Poisson point process of intensity νθ.

2.1F1F2F3F7step 1.1step 1.2algebra∎

Conditional on component n, the coordinate vector has density T−n on Sn. For each pair i<j, the diagonal {xi=xj} is Borel; its section in coordinate xj is a singleton and has Lebesgue measure zero by [F2], so [F7] gives product measure zero. The finite union of pairwise diagonals is null. Coordinate permutations preserve the product-uniform law: they preserve the rectangle formula in [F3], and uniqueness there extends that equality from rectangles to the product sigma-algebra. Thus the n! ordering regions have equal measure and partition the cube outside the diagonals. More precisely, for every Borel C⊆Δn, the preimage of C under the Borel sorting map, off the diagonals, is the disjoint union of the n! coordinate permutations of C. Each has product-uniform probability T−nℓn(C), so sorting gives conditional density n!/Tn on the ordered simplex. Multiplying by pn=e−θT(θT)n/n! gives joint density e−θTθn. The endpoint set where any coordinate equals T has product measure zero because Q({T})=0 by [F2] and [F3]; thus the same density applies to the stated simplex with tn≤T. For n=0, the construction gives empty-pattern mass p0=e−θT. Each component has tie probability zero, and their countable mixture also has tie probability zero. This proves the event-time density and simplicity claims.

Source notes

Rasmussen derives the homogeneous Poisson event-time likelihood as a special case of the conditional-intensity formula. Kass, Eden, and Brown derive the ordered event-time density from independent Poisson increments. The local construction and diagonal-null argument provide a finite-window existence and simplicity proof.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Conditional-intensity inter-event law and point-pattern likelihood

Statement

Assume AC, Countable Choice and Dependent Choice for the cited likelihood and hazard-calculus interfaces. Fix T>0 and a common specified initial history. Let (Pθ) be a supplied family of laws for actual simple, non-explosive temporal point-process models on (0,T] satisfying Temporal point-process models and conditional intensity, with jointly measurable conditional history-update and waiting-time kernels. Let P0 be the supplied unit-rate Poisson reference on the finite-pattern space XT=⨆m≥0Δm,Δ0={∅},Δm={(t1,…,tm):0<t1<⋯<tm≤T}, equipped with the disjoint-union Borel sigma-algebra. For a pattern 0<t1<⋯<tm≤T, let hi−1 be the initial history updated by t1,…,ti−1. On each simplex, the laws are dominated by P0 and the following chosen density representative gives the Radon–Nikodym derivative P0-almost everywhere: dPθdP0(t1,…,tm)=eT(∏i=1mλθ∗(ti∣hi−1))exp⁡ ⁣(−∫0Tλθ∗(u∣hu−) du). Here hu− is the history immediately before u. Thus the likelihood as a function of θ is proportional to the product of pre-event intensities times the terminal integrated-hazard factor; eT is parameter-independent. If an observed event has zero intensity, the density is zero; a finite log-likelihood requires positive intensity at each observed event. For m=0, the event product is the empty product 1 and the terminal no-event factor remains.

For marked patterns, let marks lie in a supplied measurable space with a common mark probability measure Q. Here hi records all past event times and marks, and the marked-history update is supplied and measurable. Require that the supplied waiting-time kernels, conditioned on this full marked history, satisfy the same temporal model; an unmarked marginal waiting-time law alone is not this hypothesis. If each event also has a supplied jointly measurable conditional mark density qθ(ki∣ti,hi−1) relative to Q, and the reference uses independent marks with law Q, evaluate the displayed intensity factors on these marked histories and multiply the ratio by ∏iqθ(ki∣ti,hi−1). The ground intensity does not determine a mark law.

Facts & Assumptions

Given: A supplied family of non-explosive simple process laws on (0,T], conditioned on one common initial history, with measurable history updates and conditional waiting-time kernels satisfying the temporal model.

[F1]

The temporal model supplies jointly measurable history updates and conditional waiting-time kernels with finite-time densities and hazards; the process has finite event count on (0,T] almost surely. (Temporal point-process models and conditional intensity)

[F2]

Given a history h at time s, the next-event survivor and density are exp⁡(−∫suλh∗(v) dv) and λh∗(u)exp⁡(−∫suλh∗(v) dv). (Inter-event survival and density from a conditional intensity)

[F3]

On each m-event ordered simplex, the unit-rate Poisson reference has strictly positive density e−T, and its empty-pattern mass is e−T. (Finite-window homogeneous Poisson construction and ordered event-time density)

[F4]

A likelihood ratio is the Radon–Nikodym derivative of the absolutely continuous component; when Pθ≪P0, it is a full density. (Likelihood ratio as a Radon–Nikodym derivative)

[A1]

AC is required by the temporal model and likelihood-ratio interfaces; Countable Choice and Dependent Choice are the declared axioms for [F2]'s calculus proof. (The Axiom of Choice, The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

Proof

1.1F1givenconstruct

For m≥1, recursively define the density of the first i event times by g0=1 and gi(t1,…,ti)=gi−1(t1,…,ti−1)fθ(ti∣hi−1) on the ordered prefix simplex. At i=1 this is the supplied conditional density. If the first i−1 times have density gi−1, conditioning on that prefix and integrating its supplied probability kernel for the next waiting time multiplies the density by fθ(ti∣hi−1); iterated kernel integration proves the formula for i. The measurable update and kernel assumptions in [F1] make each factor measurable. For exactly m events by T, the final history must have no event in (tm,T], whose conditional probability is Sθ(T∣hm). Thus the pattern density is ∏i=1mfθ(ti∣hi−1)Sθ(T∣hm); for m=0 it is the initial no-event probability. The simplices exhaust the pattern space because the event count is finite almost surely.

2.1F2step 1.1algebra

By [F2], each event-time density is its pre-event intensity times exp⁡ ⁣(−∫ti−1tiλθ∗(u∣hu−) du), where t0=0, and the terminal survivor is exp⁡(−∫tmTλθ∗(u∣hu−) du). Multiplying these terms adds the integrals over the adjacent intervals (0,t1],…,(tm,T], so on Δm the pattern density is pθ(t1,…,tm)=(∏i=1mλθ∗(ti∣hi−1))exp⁡ ⁣(−∫0Tλθ∗(u∣hu−) du). For m=0 there are no event factors and the same expression uses the empty product.

3.1A1F3F4step 2.1algebra

By [F3], the reference density equals e−T>0 on each Δm and its empty-pattern mass is positive. If a measurable set in XT has P0-measure zero, its section in every Δm is Lebesgue-null and it excludes the empty pattern. Step 2.1 gives a Lebesgue density for Pθ on every simplex, so each section has Pθ-measure zero; countable additivity over the disjoint union gives Pθ≪P0. By [F4], the Radon–Nikodym derivative is the ratio of the two pattern densities, namely pθ/e−T=eTpθ, P0-almost everywhere. If any factor at an observed event is zero, this representative is zero; when all are positive, taking logarithms and discarding the parameter-free term T gives the stated likelihood form.

4.1F1step 1.1step 2.1step 3.1algebra∎

In the marked case, condition successively on the full past marked history: the next event time has its supplied waiting-time kernel under that history, and then the new mark has its supplied conditional density qθ(ki∣ti,hi−1). Update the history by both time and mark before taking the next waiting-time kernel. The measurable updates and density hypotheses allow the same iterated integration as in step 1.1, so the joint pattern measure acquires one mark-density factor per event in addition to the waiting-time and terminal-survivor factors evaluated on marked histories. Relative to the reference product mark measure Q⊗m, whose density is 1, these factors multiply the unmarked density ratio from step 3.1. This uses the supplied mark law and introduces no mark distribution assumption from the ground intensity.

Source notes

Rasmussen's Proposition 3.1 gives the finite-window likelihood and derives it by multiplying inter-event densities with the terminal no-event probability; its marked case includes conditional mark-density factors. Kass, Eden, and Brown independently derive the same factorization in Section 19.4. This theorem is conditional on supplied process laws and makes no existence or stationarity claim from an intensity formula.

5 · Examples, counterexamples and false statements

None yet.

Sources