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.
Weak order one for finite-state Poisson tau-leaping with an exit bound
Statement
Assume Countable Choice and Dependent Choice. Let be finite, let for the system Finite-channel reaction propensity systems and their generator, and assume whenever . Extend the exact chain by making every state outside absorbing, and let be the tau-leap kernel in Explicit Poisson tau-leaping with an invalid-state status with the same absorbing-invalid-state convention. For with and , an initial state , and a bounded payoff , run the leap on the uniform grid with draw budget (or ), so it supplies a terminal state . Then the leap satisfies Its probability of ever entering an invalid state by is at most . This separately bounds the absorbing invalid-state branch; the result makes no claim for unbounded rates.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, the finite-state reaction system and admissibility condition in the Statement, a nonexplosive exact chain with that channel law, a uniform positive step with , draw budget or , and bounded .
Finite-channel reaction propensity systems and their generator: channel has rate and update ; if the update is outside , its propensity is zero.
Explicit Poisson tau-leaping with an invalid-state status: with the stated sufficient budget, the tau-leap kernel uses conditionally independent counts and freezes the first invalid endpoint.
One-step weak defect of finite-state Poisson tau-leaping: the one-step kernels obey .
Normalization, moments, and generating function of the Poisson count law: for a Poisson count with parameter , .
Finite-state Gillespie and next-reaction methods have the specified CTMC law: under Countable Choice and Dependent Choice, the finite system has its specified exact path law and finitely many events on finite horizons.
Countable Choice is assumed by [F3] for the exact reaction-chain event law. The Axiom of Countable Choice ()
Dependent Choice is assumed by [F5] for the countable input streams. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
Given: The inputs above, with exact transition kernel and tau-leap kernel on the common countable state space.
At most scalar Poisson draws are needed for steps, so the stated budget never exhausts; absorption or an invalid endpoint instead holds the state through . The terminal leap law is therefore . Both and are Markov kernels: they preserve nonnegative functions and constants, so each is a contraction in the supremum norm. Outside , both hold the state fixed by the stated extension.
The finite algebraic identity follows by cancellation of consecutive terms. Apply it to , use the contraction from step 1.1 and the one-step bound [F3] to obtain Evaluating at proves the weak-order bound.
While the leap state is in , any single channel count produces a state in by [F1]. Therefore an invalid endpoint requires at least two total channel firings in that step. If , independence [F2] and the factorial moment [F4] give Since , the conditional invalid-step probability is at most . A union bound over steps gives .
Depends on
- Finite-channel reaction propensity systems and their generator
- Explicit Poisson tau-leaping with an invalid-state status
- One-step weak defect of finite-state Poisson tau-leaping
- Normalization, moments, and generating function of the Poisson count 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
45 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)
- Tiejun Li, Lecture 21: Application in chemical reaction kinetics, Applied Stochastic Analysis course notes (standard reference, not scraped)