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.
Dynkin identity for a bounded-rate finite stopped reaction chain
Statement
Assume Countable Choice and Dependent Choice. Let and be disjoint finite sets of states, and let a finite-channel reaction chain move from a state by channel to at rate . Assume its total rate is at most on , and make every state in absorbing. Let have a continuously differentiable time section for each state, with continuous in time. Define Then, for the stopped chain and , In particular, may be the finite set of lattice states inside a compact stopping region, and the finite set of one-jump exit destinations.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, finite , a finite-channel reaction chain with bounded total rate on , absorbing states on , and a time-differentiable .
Finite-channel reaction propensity systems and their generator: a channel at state makes the marked transition at rate ; its generator sums over channels.
Competing exponential clocks give the reaction event law: at a fixed state with total rate , the waiting time has survival and channel has event-time density ; if , no event occurs.
Finite-state Gillespie and next-reaction methods have the specified CTMC law: under Countable Choice and Dependent Choice, a finite reaction system has the specified exact CTMC path law, and its expected number of events on is at most for . In particular, it has finitely many events on every finite horizon almost surely.
Countable Choice is assumed in [F2] for the exponential probability law. The Axiom of Countable Choice ()
Dependent Choice is assumed in [F3] for the countable product of independent event inputs. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
Given: The finite stopped chain, Countable Choice, Dependent Choice, and facts [F1]–[F3].
Uniformly over , the no-event probability in a time interval of length is , where on and on . Its difference from is at most . For a channel from , the probability that it fires once at time and no later event occurs is Both rates in the exponent are at most , so its difference from is at most . Summing over channels gives at most . After the first event, the conditional probability of another before is at most ; integrating against the first-event rate, at most , shows that the probability of at least two events is at most . These estimates are uniform on the finite state set.
Since is finite and is continuous, uniformly in and , The zero-event probability is ; the single-channel probabilities are by step 1.1; and the multiple-event probability is . In the zero-event case, the contribution is . The one-event channel contributions are , because the time change in is multiplied by an event probability. The multiple-event contribution is . Adding the cases, the order- terms are with a uniform remainder. This is ; for the chain is fixed and . Multiple-event payoffs contribute because is bounded on the finite set.
Sum the conditional identity in step 2.1 over a deterministic partition of and take expectations. The uniform remainders sum to . By [F3] the chain has finitely many jumps almost surely on ; therefore is bounded and piecewise continuous, so its Riemann sums converge pathwise. Boundedness and dominated convergence let expectations pass to the integral. The left side telescopes to , proving the identity.
Depends on
- Finite-channel reaction propensity systems and their generator
- Competing exponential clocks give the reaction event law
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Assuming countable and dependent choice, countable products of arbitrary probability spaces
- Finite-state Gillespie and next-reaction methods have the specified CTMC law
Used by
Dependency tree · two levels
40 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
- Tiejun Li, Analysis of explicit tau-leaping schemes for simulating chemically reacting systems (standard reference, not scraped)
- David F. Anderson and Thomas G. Kurtz, Continuous Time Markov Chain Models for Chemical Reaction Networks (standard reference, not scraped)