Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite-state continuous-time Markov jump processes with bounded rates

Definition

Fix a finite nonempty set of states E, equipped with the discrete sigma-algebra P(E) consisting of all subsets of E, and a finite time horizon T≥0. A finite-state continuous-time Markov jump process on [0,T] is a family of measurable maps Xt:(Ω,F)→(E,P(E)) on a probability space (Ω,F,P). Thus each Xt is a random element of this measurable state space. Its paths are constant between successive jump times and take the new state at a jump time (right-continuity); path events use the sigma-algebra generated by the coordinate maps Xt. The Markov property here means that, conditional on the history through time s, the law of the future path depends on that history only through (s,Xs). For each pair of distinct states x,y∈E, its transition rate κxy:[0,T]→[0,∞) is a bounded continuous function. Write

λx(t):=∑y∈E, y≠xκxy(t).

All time integrals without a displayed measure below are oriented Riemann integrals. When a continuous integrand is used as a Lebesgue density, its Lebesgue and Riemann integrals agree by the bounded Riemann-integral comparison theorem. The first-jump rate convention is the following. Conditional on the process history through time s and state Xs=x, the survival probability of no jump before time t, s≤t≤T, is

Hx(s,t):=exp⁡(−∫stλx(u) du).

For each y≠x, the conditional density that the next jump occurs at time t and goes to y is Hx(s,t)κxy(t) with respect to one-dimensional Lebesgue measure; the remaining probability Hx(s,T) is that no jump occurs by time T. These are normalized conditional probabilities: for s<T, by the chain rule and the first fundamental theorem of calculus, Hx(s,s)=1 and Hx′(s,t)=−λx(t)Hx(s,t); the density integrands are continuous, so the second fundamental theorem of calculus gives

Hx(s,T)+∑y≠x∫sTHx(s,t)κxy(t) dt=Hx(s,T)+∫sTλx(t)Hx(s,t) dt=1.

After each jump the same conditional rule restarts from the new state and jump time. For s=T, the next-jump law has unit mass on no further jump. The row generator is the matrix Q(t) with Qxy(t)=κxy(t) for x≠y and Qxx(t)=−λx(t). A time-homogeneous process is the special case in which every κxy(t) is constant. When rates carry physical time units, κxy has units of inverse time; this definition is mathematical and asserts no physical realization. The process is called nonexplosive on [0,T] when its path has finitely many jumps there almost surely.

Definition references

Depends on

Dependency tree · 2 levels

Sources