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
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Central Limit Theorems
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Counting-process compensators, integrals, brackets
- Density Separability and Convolution in Lᵖ
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Poisson and Cox point processes
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Ito Integral with Respect to Brownian Motion
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
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 , a probability space with an increasing filtration 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 with , almost surely, and jumps outside one null event. Such a process is simple: its event times are strictly ordered, . 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 , an adapted measurable history random element recording the initial information and events observed through time , and a measurable update map that appends an event at time . Write and let record only events strictly before . 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 with and the time-zero generators, as in Progressively measurable and predictable processes.
The model supplies a probability kernel on for the next event time given history at time (Measure kernel and probability kernel, Conditional law given a random element); its finite-time density versions are jointly measurable in . 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 , and the restricted set function , Assuming countable choice, every Borel subset of is Lebesgue measurable), let be its supplied nonnegative Radon--Nikodym density (The Radon-Nikodym derivative as an almost-everywhere equivalence class). Write for its survivor and define its no-event conditional hazard by 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 at time , on its supplied measurable no-event continuation up to , the pre-event intensity agrees with for Lebesgue-almost every . The jointly measurable hazard representatives used in the event-density factors are these same versions on their proper domains . 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 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 and intensity density are separately specified, the effective intensity is ; without an at-risk indicator, it is . Then is finite pathwise, continuous, adapted and predictable, , and 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.
Inter-event survival and density from a conditional intensity
Statement
Fix a supplied event history at time in the model of Temporal point-process models and conditional intensity. Let be its nonnegative no-event conditional hazard, supplied as a locally integrable version on every finite interval, and put For each finite , on the conditional survivor and finite- time density of the next event are If as , then . If , 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 at time , a supplied probability kernel for the next waiting time on , its finite-time density , survivor , and a nonnegative locally integrable hazard .
The conditional law is a probability kernel on with finite-time density relative to Lebesgue measure, survivor , and hazard wherever . (Temporal point-process models and conditional intensity, Lebesgue measurable sets, the family , and the restricted set function )
The indefinite integral of an function is absolutely continuous and has derivative equal to its integrand almost everywhere; the fundamental theorem uses Countable Choice. (The indefinite integral of an function is absolutely continuous, The indefinite integral of an function is differentiable almost everywhere)
Absolutely continuous functions obey the product and chain rules where the derivatives exist, , and products of absolutely continuous functions are absolutely continuous. (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when , The exponential function is smooth and , The product of two absolutely continuous functions is absolutely continuous)
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)
The mean value theorem applies to the exponential on compact intervals, so it is Lipschitz on every bounded interval. (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with , The exponential function is smooth and )
A finite measure is continuous from above on a decreasing sequence of measurable sets. (Continuity from above when one set has finite measure)
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 (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
Proof
Since , [F1] gives . By [F2], and are absolutely continuous and almost everywhere where , while almost everywhere.
Fix a compact interval on which . The cumulative hazard is bounded there, say . By [F5], there is such that for . Since is absolutely continuous by step 1.1, for every its absolute-continuity condition supplies such that every permitted finite family of subintervals with total length below satisfies . Therefore so is absolutely continuous. By [F3], is absolutely continuous and almost everywhere. By [F4], is constant. Its value at is , so wherever is positive.
Fix finite and suppose first reaches zero at some . On , step 2.1 gives . Continuity of then gives , a contradiction. Thus the formula holds on all of ; substituting it into [F1] gives the density formula almost everywhere. Also decreases to along integer 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.
Finite-window homogeneous Poisson construction and ordered event-time density
Statement
Let , , and let carry its subspace topology and Borel sigma-algebra. This space is Hausdorff as a subspace of ; rational intervals give a countable base; and each has a compact neighborhood for some . Let be Lebesgue measure restricted to . There exists a Poisson point process on with intensity measure . Its total count is finite almost surely, its event times have no ties almost surely, and for every integer the joint density of the ordered event times with respect to -dimensional Lebesgue measure on the ordered simplex is For , conditional on , the ordered event times have density . For the empty-pattern probability is .
Facts & Assumptions
Given: Countable Choice, , , and the Borel time interval with its usual topology.
Under Countable Choice, Borel sets are Lebesgue measurable; Lebesgue measure is complete and equals length on intervals and boxes. (The Axiom of Countable Choice (), Assuming countable choice, every Borel subset of is Lebesgue measurable, Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
For finite , the scalar Poisson law has masses , these masses sum to one, and its mean is ; at it is concentrated at zero. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)
Lebesgue measure of an interval is its length; every singleton has measure zero. (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
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)
A countable nonnegative weighted sum of measures is a measure. (Nonnegative scalar multiples and countable weighted sums of measures are measures)
A point process is Poisson with intensity when every finite pairwise-disjoint Borel family has independent Poisson counts with means . (Poisson and Cox point processes)
Each is a probability measure. (The Dirac set function at a point, A Dirac set function is a probability measure)
For a nonnegative product-measurable function, Tonelli permits iterated integration. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)
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
Put and let , a probability measure on by [A1] and [F2]. For each , use the finite product probability on ; for , is the singleton empty tuple with unit mass. Form the countable disjoint union with the sigma-algebra whose sections in each component are product-measurable. Put and define . [F1] gives ; [F4] makes a probability measure. On component , set . Every evaluation is measurable, and each realization has at most atoms, so it is locally finite. The space is locally compact, second countable, and Hausdorff by the displayed neighborhood and base checks; hence [F8] makes a point process.
Let be disjoint Borel subsets of , put , and set . Conditional on component , a count vector with sum occurs for coordinate assignments; each assignment has probability by [F3]. Multiplying by and summing over gives, for fixed , Here for zero-mass cells, and . The exponential series evaluates the sum, and . Thus the joint count mass factors into the independent Poisson masses with means ; [F5] makes a Poisson point process of intensity .
Conditional on component , the coordinate vector has density on . For each pair , the diagonal is Borel; its section in coordinate 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 ordering regions have equal measure and partition the cube outside the diagonals. More precisely, for every Borel , the preimage of under the Borel sorting map, off the diagonals, is the disjoint union of the coordinate permutations of . Each has product-uniform probability , so sorting gives conditional density on the ordered simplex. Multiplying by gives joint density . The endpoint set where any coordinate equals has product measure zero because by [F2] and [F3]; thus the same density applies to the stated simplex with . For , the construction gives empty-pattern mass . 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.
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 and a common specified initial history. Let be a supplied family of laws for actual simple, non-explosive temporal point-process models on satisfying Temporal point-process models and conditional intensity, with jointly measurable conditional history-update and waiting-time kernels. Let be the supplied unit-rate Poisson reference on the finite-pattern space equipped with the disjoint-union Borel sigma-algebra. For a pattern , let be the initial history updated by . On each simplex, the laws are dominated by and the following chosen density representative gives the Radon–Nikodym derivative -almost everywhere: Here is the history immediately before . Thus the likelihood as a function of is proportional to the product of pre-event intensities times the terminal integrated-hazard factor; 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 , the event product is the empty product and the terminal no-event factor remains.
For marked patterns, let marks lie in a supplied measurable space with a common mark probability measure . Here 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 relative to , and the reference uses independent marks with law , evaluate the displayed intensity factors on these marked histories and multiply the ratio by . The ground intensity does not determine a mark law.
Facts & Assumptions
Given: A supplied family of non-explosive simple process laws on , conditioned on one common initial history, with measurable history updates and conditional waiting-time kernels satisfying the temporal model.
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 almost surely. (Temporal point-process models and conditional intensity)
Given a history at time , the next-event survivor and density are and . (Inter-event survival and density from a conditional intensity)
On each -event ordered simplex, the unit-rate Poisson reference has strictly positive density , and its empty-pattern mass is . (Finite-window homogeneous Poisson construction and ordered event-time density)
A likelihood ratio is the Radon–Nikodym derivative of the absolutely continuous component; when , it is a full density. (Likelihood ratio as a Radon–Nikodym derivative)
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 (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
Proof
For , recursively define the density of the first event times by and on the ordered prefix simplex. At this is the supplied conditional density. If the first times have density , conditioning on that prefix and integrating its supplied probability kernel for the next waiting time multiplies the density by ; iterated kernel integration proves the formula for . The measurable update and kernel assumptions in [F1] make each factor measurable. For exactly events by , the final history must have no event in , whose conditional probability is . Thus the pattern density is ; for it is the initial no-event probability. The simplices exhaust the pattern space because the event count is finite almost surely.
By [F2], each event-time density is its pre-event intensity times , where , and the terminal survivor is . Multiplying these terms adds the integrals over the adjacent intervals , so on the pattern density is . For there are no event factors and the same expression uses the empty product.
By [F3], the reference density equals on each and its empty-pattern mass is positive. If a measurable set in has -measure zero, its section in every is Lebesgue-null and it excludes the empty pattern. Step 2.1 gives a Lebesgue density for on every simplex, so each section has -measure zero; countable additivity over the disjoint union gives . By [F4], the Radon–Nikodym derivative is the ratio of the two pattern densities, namely , -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 gives the stated likelihood form.
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 . 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 , whose density is , 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.