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.
Given countable nonexplosive pure-jump chain with finite rates
Definition
Let be a nonempty at most countable state space, and let be a finite transition rate for each pair with . For a nonnegative family indexed by an at most countable set, its sum is the supremum of its finite subsums, including the empty subsum ; if these subsums are unbounded, the sum is . Require the total exit rate
to be finite for every . The associated column rate matrix convention is for and ; thus the source state indexes the column. No finite-dimensional matrix is asserted for an infinite .
A given time-homogeneous pure-jump Markov chain with rates is a process with values in whose conditional future law given its history depends only on its present state and elapsed time, and whose paths are constant between successive jumps. Its transition kernels depend only on elapsed time, satisfy , and obey using the composition of Composition of probability kernels. At state with , its holding time has survival and its next state is with probability , independently of that holding time; at it stays at . It is nonexplosive when almost surely it has only finitely many state changes on every bounded time interval.
The chain and nonexplosion are input hypotheses in this item and in the projection results below. This definition does not construct a chain from an arbitrary countable rate matrix and proves no general nonexplosion claim.
Depends on
Used by
Dependency tree · two levels
23 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
- Ward Whitt, Continuous-Time Markov Chains, full lecture notes (2006) (standard reference, not scraped)
- Brian Munsky and Mustafa Khammash, The Finite State Projection Algorithm for the Solution of the Chemical Master Equation (standard reference, not scraped)