Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 E⊆Z≥0d be finite, let A=max⁡x∈E∑jaj(x)<∞ for the system Finite-channel reaction propensity systems and their generator, and assume aj(x)=0 whenever x+νj∉E. Extend the exact chain by making every state outside E absorbing, and let Kh be the tau-leap kernel in Explicit Poisson tau-leaping with an invalid-state status with the same absorbing-invalid-state convention. For T=Nh with h>0 and N∈N, an initial state x0∈E, and a bounded payoff g:Zd→R, run the leap on the uniform grid with draw budget B≥NR (or B=∞), so it supplies a terminal state YN. Then the leap satisfies ∣Ex0g(YN)−Ex0g(XT)∣≤4A2Th ∥g∥∞. Its probability of ever entering an invalid state by T is at most 12A2Th. 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 h with T=Nh, draw budget B≥NR or B=∞, and bounded g.

[F1]

Finite-channel reaction propensity systems and their generator: channel j has rate aj(x) and update x+νj; if the update is outside E, its propensity is zero.

[F2]

Explicit Poisson tau-leaping with an invalid-state status: with the stated sufficient budget, the tau-leap kernel uses conditionally independent Pois⁡(aj(x)h) counts and freezes the first invalid endpoint.

[F3]

One-step weak defect of finite-state Poisson tau-leaping: the one-step kernels obey ∥Khg−Qhg∥∞≤4A2h2∥g∥∞.

[F4]

Normalization, moments, and generating function of the Poisson count law: for a Poisson count with parameter θ, E[K(K−1)]=θ2.

[F5]

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.

[A1]

Countable Choice is assumed by [F3] for the exact reaction-chain event law. The Axiom of Countable Choice (ACω)

Proof

Given: The inputs above, with exact transition kernel Qh and tau-leap kernel Kh on the common countable state space.

1.1givenF1F2F5A1A2

At most NR scalar Poisson draws are needed for N steps, so the stated budget never exhausts; absorption or an invalid endpoint instead holds the state through T. The terminal leap law is therefore KhN. Both Kh and Qh are Markov kernels: they preserve nonnegative functions and constants, so each is a contraction in the supremum norm. Outside E, both hold the state fixed by the stated extension.

2.1F3A1A2step 1.1algebra

The finite algebraic identity KhN−QhN=∑r=0N−1KhN−1−r(Kh−Qh)Qhr follows by cancellation of consecutive terms. Apply it to g, use the contraction from step 1.1 and the one-step bound [F3] to obtain ∥(KhN−QhN)g∥∞≤N 4A2h2∥g∥∞=4A2Th∥g∥∞. Evaluating at x0 proves the weak-order bound.

3.1F1F2F4algebra∎

While the leap state is in E, any single channel count produces a state in E by [F1]. Therefore an invalid endpoint requires at least two total channel firings in that step. If Mn=∑jKj,n, independence [F2] and the factorial moment [F4] give E[Mn(Mn−1)∣Yn]=∑j(aj(Yn)h)2+2∑i<jai(Yn)aj(Yn)h2=(λ(Yn)h)2≤(Ah)2. Since 1{Mn≥2}≤Mn(Mn−1)/2, the conditional invalid-step probability is at most A2h2/2. A union bound over N=T/h steps gives P(invalid by T)≤A2Th/2.

Depends on

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