Alphabeta Math
Pipeline-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.

✓ 4 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Tau Leaping and Reaction Diffusion Model Error

1 · Prerequisites

2 · Summary

Explicit Poisson tau leaping freezes each channel propensity over a step and draws independent Poisson counts. The local moment and one-step weak-defect results lead to a bounded finite-state weak-order-one theorem with the probability of leaving the physical state set stated separately. The theorem does not cover unbounded rates or erase the invalid-state warning.

For adjacent time levels, a shared-minimum Poisson count with independent rate-difference residuals gives the stated marginal laws. Under bounded propensities on the integer lattice, the proof propagates the coupled state discrepancy and obtains an order-one correction variance. T16's exact event-time reaction-path coupling is a distinct procedure; the fixed-step count coupling is proved locally here.

The density-scaled model uses jump size ν/V at rate Va(x). A stopped finite-state Dynkin identity and a third-order generator expansion give an O(V−2) jump-versus-CLE weak term under a separate smooth backward-solution assumption. Exit probabilities are an additional term, so this is model error rather than time-discretization error.

The critical-reaction SSA/binomial method has a finite step budget and explicit infeasible or inconclusive statuses. Its binomial count protects the sequential state update, changes the Poisson variance, and receives no Poisson weak-order or MLMC guarantee.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Shared-minimum coupling of two Poisson counts

Statement

Let h≥0 and let λ1,λ2≥0. Let C,R1,R2 be independent counts with laws C∼Pois⁡(hmin⁡(λ1,λ2)),R1∼Pois⁡(h(λ1−λ2)+),R2∼Pois⁡(h(λ2−λ1)+), and set K1=C+R1, K2=C+R2. Then Ki∼Pois⁡(hλi), E(K1−K2)=h(λ1−λ2),Var⁡(K1−K2)=h∣λ1−λ2∣, and Cov⁡(K1,K2)=hmin⁡(λ1,λ2).

Facts & Assumptions

Given: h≥0, nonnegative rates λ1,λ2, and the independent Poisson counts in the Statement.

[F1]

The scalar Poisson count law: for finite θ≥0, Pois⁡(θ) has masses e−θθk/k! for k∈N0, with the zero-parameter law concentrated at 0.

[F2]

Normalization, moments, and generating function of the Poisson count law: a Poisson count with parameter θ has mean and variance θ.

Proof

Given: The independent counts and facts [F1]–[F2].

1.1F1algebra

If A∼Pois⁡(α) and B∼Pois⁡(β) are independent, then for α,β>0 and n∈N0 their convolution is P(A+B=n)=e−(α+β)∑k=0nαkβn−kk!(n−k)!=e−(α+β)(α+β)nn!, by the binomial theorem. If either parameter is zero, the corresponding count is identically zero by [F1], and the same conclusion follows. Thus an independent sum has Poisson law with the sum of its parameters.

2.1step 1.1algebra

Apply step 1.1 to C+R1 and C+R2. Their parameters are respectively hmin⁡(λ1,λ2)+h(λ1−λ2)+=hλ1 and hmin⁡(λ1,λ2)+h(λ2−λ1)+=hλ2. This proves the marginal laws.

3.1F2algebra∎

The shared count cancels in K1−K2=R1−R2. Independence and [F2] give its mean as h(λ1−λ2)+−h(λ2−λ1)+=h(λ1−λ2) and its variance as h(λ1−λ2)++h(λ2−λ1)+=h∣λ1−λ2∣. Also, since R1,R2 are independent of C and of each other, Cov⁡(K1,K2)=Var⁡(C)=hmin⁡(λ1,λ2) by [F2]. This proves all identities.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableprecheck pendingjudge pass (gpt-6-luna)Open item page →

Explicit Poisson tau-leaping with an invalid-state status

Definition

Inputs. A finite-channel reaction propensity system Finite-channel reaction propensity systems and their generator, an initial state x0∈E, a deterministic grid 0=t0<t1<⋯<tN=T with finite N, and a draw budget B∈N∪{∞}. Write hn=tn+1−tn. At each step the count vector has the product law whose jth marginal is Pois⁡(aj(xn)hn), as defined in The scalar Poisson count law. The budget counts scalar Poisson draws.

Output. The recorded grid endpoint pairs, with piecewise-constant interpolation, and a status in {horizon, absorbed, invalid-state, budget-exhausted}. The budget-exhausted output is an incomplete prefix and is not a terminal sample at T.

Procedure. Set x=x0, grid index n=0, Poisson-draw counter d=0, recorded path P=[(0,x0)], and status horizon.

  1. If n=N, return P with status horizon. If x∉E, set status invalid-state and hold x fixed to T. If P does not end at (tn,x), append that pair; if tn<T, append (T,x); then return. If λ(x)=0, hold x fixed to T, append (T,x) to P if needed, and return P with status absorbed.
  2. If B<∞ and B−d<R, return the path prefix with status budget-exhausted; it does not define a terminal sample at T.
  3. Draw conditionally independent Kj,n∼Pois⁡(aj(x)hn), 1≤j≤R, and set y=x+∑j=1RKj,nνj. Increase d←d+R.
  4. Advance time to tn+1 and append (tn+1,y) to P. If y∉E, set x=y, set status invalid-state, and keep y fixed through all remaining grid times; append (T,y) to P if tn+1<T, then return. If y∈E, set x←y, increment n←n+1, and continue.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Density-scaled reaction jump and chemical Langevin generators

Definition

Fix finitely many stoichiometric vectors ν1,…,νR∈Zd, an open set U⊆Rd, nonnegative propensity functions aj:U→[0,∞), and a volume parameter V≥1. At a density state x∈U for which every positive-rate destination x+νj/V lies in U, the density-scaled jump model has jump νj/V at rate Vaj(x). For a twice differentiable test function ϕ defined at those destinations, its generator is LVϕ(x)=V∑j:aj(x)>0aj(x)(ϕ(x+νj/V)−ϕ(x)).

Put b(x)=∑jνjaj(x) and C(x)=∑jaj(x)νjνjT. The associated chemical Langevin diffusion generator is GVϕ(x)=b(x)⋅∇ϕ(x)+12V∑j=1Raj(x) νjTD2ϕ(x)νj. A Markov diffusion with this generator is called the chemical Langevin model here. The definition does not assert existence, uniqueness, positivity, or approximation accuracy for either process. In an SDE representation the drift is b and the covariance matrix per unit time is C/V.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Dynkin identity for a bounded-rate finite stopped reaction chain

Statement

Assume Countable Choice and Dependent Choice. Let D and F be disjoint finite sets of states, and let a finite-channel reaction chain move from a state x∈D by channel j to x+νj∈D∪F at rate aj(x). Assume its total rate is at most A<∞ on D, and make every state in F absorbing. Let v:[0,T]×(D∪F)→R have a continuously differentiable time section for each state, with ∂tv continuous in time. Define Qf(x)=∑jaj(x)(f(x+νj)−f(x))(x∈D),Qf(x)=0(x∈F). Then, for the stopped chain X and 0≤t≤T, E[v(t,Xt)]=E[v(0,X0)]+E∫0t(∂sv(s,Xs)+Qv(s,⋅)(Xs)) ds. In particular, D may be the finite set of lattice states inside a compact stopping region, and F the finite set of one-jump exit destinations.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, finite D,F, a finite-channel reaction chain with bounded total rate on D, absorbing states on F, and a time-differentiable v.

[F1]

Finite-channel reaction propensity systems and their generator: a channel at state x makes the marked transition x↦x+νj at rate aj(x); its generator sums aj(x)(f(x+νj)−f(x)) over channels.

[F2]

Competing exponential clocks give the reaction event law: at a fixed state with total rate λ, the waiting time has survival e−λt and channel j has event-time density aje−λt; if λ=0, no event occurs.

[F3]

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 [0,T] is at most ΛT for Λ=max⁡xλ(x). In particular, it has finitely many events on every finite horizon almost surely.

[A1]

Countable Choice is assumed in [F2] for the exponential probability law. The Axiom of Countable Choice (ACω)

[A2]

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 N-indexed chain

Proof

Given: The finite stopped chain, Countable Choice, Dependent Choice, and facts [F1]–[F3].

1.1F1F2A1algebra

Uniformly over x∈D∪F, the no-event probability in a time interval of length δ is e−λ(x)δ, where λ(x)=0 on F and λ(x)≤A on D. Its difference from 1−λ(x)δ is at most A2δ2/2. For a channel j from x∈D, the probability that it fires once at time r∈(0,δ) and no later event occurs is ∫0δaj(x)e−λ(x)re−λ(x+νj)(δ−r) dr. Both rates in the exponent are at most A, so its difference from aj(x)δ is at most aj(x)Aδ2. Summing over channels gives at most λ(x)Aδ2≤A2δ2. After the first event, the conditional probability of another before δ is at most A(δ−r); integrating against the first-event rate, at most A, shows that the probability of at least two events is at most A2δ2/2. These estimates are uniform on the finite state set.

2.1F1step 1.1givenalgebra

Since D∪F is finite and ∂tv is continuous, uniformly in s and x, v(s+δ,x)=v(s,x)+δ∂sv(s,x)+o(δ). The zero-event probability is 1−λ(x)δ+O(δ2); the single-channel probabilities are aj(x)δ+O(δ2) by step 1.1; and the multiple-event probability is O(δ2). In the zero-event case, the contribution is v(s,x)+δ(∂sv(s,x)−λ(x)v(s,x))+o(δ). The one-event channel contributions are δ∑jaj(x)v(s,x+νj)+o(δ), because the time change in v(s+δ,x+νj) is multiplied by an O(δ) event probability. The multiple-event contribution is O(δ2). Adding the cases, the order-δ terms are δ∂sv(s,x)+δ∑jaj(x)(v(s,x+νj)−v(s,x)), with a uniform o(δ) remainder. This is δ(∂sv(s,x)+Qv(s,⋅)(x))+o(δ); for x∈F the chain is fixed and Q=0. Multiple-event payoffs contribute O(δ2) because v is bounded on the finite set.

3.1F3A1A2step 2.1algebra∎

Sum the conditional identity in step 2.1 over a deterministic partition of [0,t] and take expectations. The uniform o(δ) remainders sum to o(1). By [F3] the chain has finitely many jumps almost surely on [0,t]; therefore s↦∂sv(s,Xs)+Qv(s,⋅)(Xs) 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 E[v(t,Xt)]−E[v(0,X0)], proving the identity.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Conditional moments of one Poisson tau-leap increment

Statement

Fix a state x∈E and step h≥0 in Explicit Poisson tau-leaping with an invalid-state status. Let ΔY=∑j=1RνjKj, where conditionally independent Kj∼Pois⁡(aj(x)h). Then E[ΔY∣x]=h∑j=1Raj(x)νj, Cov⁡(ΔY∣x)=h∑j=1Raj(x)νjνjT, and E[∥ΔY∥2∣x]=h∑j=1Raj(x)∥νj∥2+h2∥∑j=1Raj(x)νj∥2.

Facts & Assumptions

Given: A state x∈E, a step h≥0, the product count law in Explicit Poisson tau-leaping with an invalid-state status, and the Poisson count laws below.

[F1]

The scalar Poisson count law: for λ≥0, a Pois⁡(λ) count has masses e−λλk/k! (with a point mass at zero when λ=0).

[F2]

Normalization, moments, and generating function of the Poisson count law: if K∼Pois⁡(λ), then EK=λ and Var⁡(K)=λ.

[F3]

Explicit Poisson tau-leaping with an invalid-state status: the channel counts are conditionally independent and the state increment is ΔY=∑jνjKj.

Proof

Given: The inputs above.

1.1givenF1F2F3algebra

Each parameter aj(x)h is finite, so [F1] defines the corresponding Poisson law and [F2] gives E[Kj∣x]=aj(x)h. By [F3], conditional expectation is linear, hence E[ΔY∣x]=∑jνjaj(x)h.

1.2F2F3algebra

Conditional independence in [F3] makes cross-channel covariances zero. The covariance of νjKj is νjνjTVar⁡(Kj∣x)=haj(x)νjνjT by [F2]. Summing proves the covariance formula.

2.1step 1.1step 1.2algebra∎

For a square-integrable vector, E∥ΔY∥2=tr⁡Cov⁡(ΔY)+∥EΔY∥2. Substitution of steps 1.1 and 1.2 gives the asserted identity.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

One-step weak defect of finite-state Poisson tau-leaping

Statement

Assume Countable Choice and Dependent Choice. Let E be finite, let A=max⁡({0}∪{∑jaj(x):x∈E}), and assume aj(x)=0 whenever x+νj∉E. Extend every state outside E as absorbing, as in Explicit Poisson tau-leaping with an invalid-state status. For h≥0, let Qh be the exact reaction-chain transition kernel and Kh the Poisson tau-leap transition kernel. If g:Zd→R is bounded, then ∣(Khg)(x)−g(x)−h(Qg)(x)∣≤2A2h2∥g∥∞, ∣(Qhg)(x)−g(x)−h(Qg)(x)∣≤2A2h2∥g∥∞, and hence ∥Khg−Qhg∥∞≤4A2h2∥g∥∞. The bounds include the multi-reaction leap probability that can trigger the invalid-state branch.

Facts & Assumptions

Given: Finite reaction data Finite-channel reaction propensity systems and their generator, the exact reaction chain law specified there, the tau-leap kernel Explicit Poisson tau-leaping with an invalid-state status, and a bounded g.

[F1]

Finite-channel reaction propensity systems and their generator: a single channel-j event from x has destination x+νj and rate aj(x); forbidden one-event transitions have zero propensity.

[F2]

Competing exponential clocks give the reaction event law: at state x, the next-event survival is e−λ(x)t and the channel-j event density is aj(x)e−λ(x)t.

[F3]

Explicit Poisson tau-leaping with an invalid-state status: conditional channel counts are independent Poisson variables of means aj(x)h and any out-of-E leap is absorbing.

[F4]

The scalar Poisson count law: the count mass is e−λλk/k! for finite λ.

[F5]

Normalization, moments, and generating function of the Poisson count law: a Poisson count of mean λ has mean λ and factorial second moment λ2.

[F6]

Finite-state Gillespie and next-reaction methods have the specified CTMC law: under Countable Choice and Dependent Choice, the finite-state reaction system has its specified exact path law and has finitely many events on finite horizons.

[A1]

Countable Choice is assumed by [F2] for the exponential probability law. The Axiom of Countable Choice (ACω)

Proof

Given: Countable Choice, Dependent Choice, a step h≥0, A as in the Statement, and G=∥g∥∞.

If E=∅, then A=0 and both kernels are the identity on Zd, so every asserted bound is zero. Otherwise fix x∈E.

1.1F1F3F4F5algebra

For the Poisson leap, the probability of zero total counts is e−λ(x)h. The probability that exactly channel j fires once is aj(x)he−λ(x)h, so its difference from aj(x)h is at most aj(x)λ(x)h2. Summing these errors over j gives at most λ(x)2h2≤A2h2. If N=∑jKj, independence and [F5] give E[N(N−1)∣x]=∑j(aj(x)h)2+2∑i<jai(x)aj(x)h2=(λ(x)h)2, hence P(N≥2∣x)≤(λ(x)h)2/2≤A2h2/2. The zero-count probability differs from 1−λ(x)h by at most A2h2/2. A single allowed channel event remains in E by [F1], so only the N≥2 part can trigger the invalid-state branch. The zero-count, total single-count, and multiple-count contributions are bounded respectively by GA2h2/2, GA2h2, and GA2h2/2. Thus ∣(Khg)(x)−g(x)−h(Qg)(x)∣≤2GA2h2.

1.2F1F2F6A1A2algebra

For the exact chain, the no-event probability is e−λ(x)h, which differs from 1−λ(x)h by at most A2h2/2. The probability of one channel-j event and no later event is ∫0haj(x)e−λ(x)se−λ(x+νj)(h−s) ds. Its difference from aj(x)h is at most aj(x)Ah2, since all total rates on E are at most A; summing over j gives at most λ(x)Ah2≤A2h2. The probability of two or more events is at most A2h2/2: conditional on a first event at time s, a later event has probability at most A(h−s), and integration against the first-event rate bounded by A gives the bound. The no-event, total single-event, and multiple-event contributions are bounded respectively by GA2h2/2, GA2h2, and GA2h2/2. Therefore ∣(Qhg)(x)−g(x)−h(Qg)(x)∣≤2GA2h2.

2.1step 1.1step 1.2algebra∎

Subtract the two first-order expansions from steps 1.1 and 1.2 and use the triangle inequality. This gives ∣(Khg)(x)−(Qhg)(x)∣≤4GA2h2 for every x∈E. Outside E both kernels hold the state fixed, so the same bound holds there. Taking the supremum proves the final inequality.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Stopped density-scaled jump versus chemical Langevin weak model error

Statement

Assume Countable Choice and Dependent Choice. Use the density-scaled generators in Density-scaled reaction jump and chemical Langevin generators. Let K⊂U be compact and the closure of a bounded open stopping region with nonempty interior, let x0∈int⁡K, and let LV=x0+1VZd be a containing lattice. For fixed V, the set D=int⁡K∩LV is finite: boundedness of K bounds each integer coordinate index in the lattice. Let XV be the jump process stopped at τX=inf⁡{t≥0:XtV∉int⁡K} and let ZV be a chemical Langevin diffusion stopped at τZ=inf⁡{t≥0:ZtV∉int⁡K}. Assume both stopped processes exist with X0V=Z0V=x0, and write Xˉt=Xt∧τXV and Zˉt=Zt∧τZV.

Assume aj∈C3(U), 0≤aj≤Aj on K, and every segment [x,x+νj/V] for x∈D with aj(x)>0 lies in U. For a bounded payoff g with ∣g∣≤G, suppose the stopped CLE backward solution u(s,x)=Ex[g(Z(T−s)∧τZV)] has an extension to an open neighborhood of K and all these jump segments that is C3 in space and C1 in time, with u(T,y)=g(y) on all states reached by the stopped jump chain and u(s,y)=g(y) on every exit state (including diffusion boundary points), and ∂su+GVu=0on [0,T]×int⁡K,∥D3u(s,y)∥≤M, and ∂su is continuous in time on the stated neighborhood. The third-derivative bound holds along every jump segment. The derivatives are spatial Fréchet derivatives with operator norm. Then ∣Eg(XˉT)−Eg(ZˉT)∣≤TM6V2∑j=1RAj∥νj∥3. If the original local jump and diffusion models are defined through T and are coupled to agree with their stopped versions up to their respective exits, then ∣Eg(XTV)−Eg(ZTV)∣≤TM6V2∑j=1RAj∥νj∥3+2G(P(τX≤T)+P(τZ≤T)). The V−2 term is density-model error from the generator expansion; the exit term is separate. Neither term is time-discretization error. The existence and regularity of the CLE backward solution are assumptions, not consequences of this estimate.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, the density-scaled generators, the compact stopping region, bounded propensities on K, and the stopped CLE backward solution with the stated boundary and derivative conditions, with X0V=Z0V=x0.

[F1]

Density-scaled reaction jump and chemical Langevin generators: for a state x before exit, LVϕ(x)=V∑j:aj(x)>0aj(x)(ϕ(x+νj/V)−ϕ(x)), GVϕ(x)=∑jaj(x)νj⋅∇ϕ(x)+12V∑jaj(x)νjTD2ϕ(x)νj.

[F2]

Dynkin identity for a bounded-rate finite stopped reaction chain: a finite-state reaction chain stopped on its finite exit set obeys the time-dependent Dynkin identity. For this fixed V, the lattice states in int⁡K form a finite set, and each has at most R one-jump destinations, so their exit set is finite. The total reaction rate before exit is bounded by V∑jAj. Relabeling a density state by y=V(x−x0)∈Zd transports the channel increments to νj and the rates to Vaj(x0+y/V), so the supplier applies to this chain.

[A1]

Countable Choice is assumed for the exponential event law in [F2]. The Axiom of Countable Choice (ACω)

[A3]

The stopped CLE and its stated backward solution exist; the backward equation, boundary values, and third-derivative bound hold. They are not inferred from Taylor expansion of the jump generator.

[A4]

For the unstopped comparison, each original process agrees with its stopped version up to its first exit, and ∣g∣≤G globally.

Proof

Given: Countable Choice, Dependent Choice, the stopped processes starting at x0, the derivative and propensity bounds, the backward equation, and the finite stopped-chain Dynkin identity.

1.1F1givenalgebra

Fix an interior lattice state x and a time s. For channel j, apply one-variable Taylor's theorem to r↦u(s,x+rνj/V) on [0,1]. Its third-order remainder has absolute value at most M∥νj∥3/(6V3). Multiplying by Vaj(x) and summing over channels gives LVu(s,x)=∑jaj(x)νj⋅∇u(s,x)+12V∑jaj(x)νjTD2u(s,x)νj+RV(s,x), where ∣RV(s,x)∣≤M6V2∑jAj∥νj∥3. The first two terms are exactly GVu(s,x) by [F1].

1.2F2A1A2A3given

Set ΨV(x)=V(x−x0), DV=ΨV(D), and let FV be the images under ΨV of the one-jump exit destinations from D. These are disjoint finite subsets of Zd. The transported stopped chain X~=ΨV(Xˉ) moves from y∈DV by channel increment νj at rate Vaj(x0+y/V) and is fixed on FV. For u~(s,y)=u(s,x0+y/V), its time derivative is unchanged and its reaction generator on DV equals LVu(s,x0+y/V). Apply [F2] to this integer-lattice chain and u~. Before τX, the integrand is ∂su+LVu=(LV−GV)u by the backward equation [A3]. After exit, Xˉ is fixed at an exit destination where u(s,Xˉs)=g(Xˉs) is independent of s, so both its time derivative and stopped generator vanish. At time T, u(T,XˉT)=g(XˉT), and the common initial condition gives Xˉ0=Zˉ0=x0 and u(0,x0)=Eg(ZˉT). Therefore Eg(XˉT)−Eg(ZˉT)=E∫0T∧τX(LV−GV)u(s,XsV) ds.

2.1step 1.1step 1.2A4algebra∎

Bound the integrand in step 1.2 by step 1.1 and use T∧τX≤T. This proves the stopped-process estimate. Under [A4], the stopped and original terminal payoffs agree unless their respective process exits by time T; on that event their difference is at most 2G. The triangle inequality for the two expectations adds at most 2GP(τX≤T)+2GP(τZ≤T), which proves the unstopped bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Order-one correction variance for coupled Poisson tau-leap levels

Statement

Assume the finite-state reaction system of Finite-channel reaction propensity systems and their generator has propensities bounded on E and extended by zero to states outside E. Let T>0, hℓ=T2−ℓ for ℓ≥0, and let both levels start at the same fixed state x0∈E. For each ℓ≥1, couple a fine step h=hℓ to a coarse step 2h=hℓ−1 as follows. On each of the two half intervals, with fine state x and coarse state z, use for channel j a shared Pois⁡(hmin⁡(aj(x),aj(z))) count and independent residual counts of means h(aj(x)−aj(z))+ and h(aj(z)−aj(x))+ for the fine and coarse paths, as in Shared-minimum coupling of two Poisson counts. Use independent copies across channels and fresh copies on the two half intervals. Update the fine state after each half interval. Accumulate the two coarse count vectors into one coarse leap, evaluating both at the coarse state at the start of the full interval. Then, for every bounded g:Zd→R, Var⁡ ⁣(g(Yhℓ(T))−g(Yhℓ−1(T)))≤Chℓ, where C depends on T, the finite network, and ∥g∥∞, but not on ℓ. This is a variance bound for the stated coupled Poisson leap; independent levels are not covered.

Facts & Assumptions

Given: The finite reaction network, common initial state, bounded propensities, the Poisson tau-leap rule, and the half-step coupling just specified.

[F1]

Finite-channel reaction propensity systems and their generator: the states and reaction increments are integer vectors, there are finitely many channels, and a positive-rate firing has destination in E.

[F2]

Conditional moments of one Poisson tau-leap increment: for a one-step increment R=∑jνjKj at state x, E[R∣x]=h∑jaj(x)νj,E[∥R∥2∣x]=h∑jaj(x)∥νj∥2+h2∥∑jaj(x)νj∥2.

[F3]

Explicit Poisson tau-leaping with an invalid-state status: each marginal leap uses conditionally independent channel counts with means haj(x) at its frozen state and freezes after an invalid state.

[F4]

Normalization, moments, and generating function of the Poisson count law: a Pois⁡(θ) count has mean and variance θ.

[F5]

Shared-minimum coupling of two Poisson counts: per channel, the coupled counts have the prescribed Poisson marginals, their difference has mean h(aj(x)−aj(z)), and its variance is h∣aj(x)−aj(z)∣.

[A1]

Count constructions are independent across channels conditional on their starting states, and the fresh second-half random inputs are independent of the complete first-half history.

Proof

Given: The common initial state x0 and facts [F1]–[F5], with G=∥g∥∞.

For a level with h>1, the variance bound follows directly from Var⁡(⋅)≤4G2≤4G2h. It remains to prove the recurrence below for 0<h≤1.

1.1F1F5A1givenalgebra

For lattice states x,z, write e=x−z and δj=aj(x)−aj(z). Bounded rates and the integer lattice's minimum nonzero distance one imply ∣δj∣≤L∥e∥ for a constant L; this also holds when one state is outside E, where the extended rate is zero. In one half interval, shared counts cancel from the increment difference η. The independent residual Poisson counts and [F5] give m:=E[η∣x,z]=h∑jνjδj,E[∥η−m∥2∣x,z]=h∑j∣δj∣∥νj∥2. Thus ∥m∥≤Ch∥e∥ and the centered second moment is at most Ch∥e∥. If e=0, then η=0. Otherwise ∥e∥≥1, so h∥e∥≤h∥e∥2. For h≤1 this proves E[∥η∥2∣x,z]≤Ch∥e∥2.

1.2F2F3F4algebra

If x∉E, the invalid-state convention freezes the fine path, so its increment R is zero and the estimates below are immediate. Suppose x∈E, and let R be its fine-path increment on the first half interval. By [F3], [F4], and the triangle inequality, E∥R∥≤∑j∥νj∥ haj(x)≤Ch. By [F2] and bounded propensities, E∥R∥2≤Ch for h≤1. If x′=x+R, then E∥x′−z∥≤∥e∥+Ch,E∥x′−z∥2≤C(∥e∥2+h). For the second inequality, expand ∥e+R∥2 and use ∥ER∥≤Ch and E∥R∥2≤Ch; the cross term is bounded by Ch∥e∥≤Ch∥e∥2 when e≠0, and is zero when e=0.

2.1F3F4A1step 1.1step 1.2algebra

Write the two half-interval differences as ηi=mi+ξi, where mi is the conditional mean and ξi is centered given the starting states of that half interval. Step 1.1 gives ∥m1∥≤Ch∥e∥,E∥ξ1∥2≤Ch∥e∥2. The second half starts at x′ and z, so ∥m2∥≤Ch∥x′−z∥. Steps 1.1 and 1.2 therefore give E∥m2∥2≤Ch2(∥e∥2+h),E∥ξ2∥2≤Ch(∥e∥+h)≤Ch∥e∥2+Ch2. For the latter inequality, use E∥x′−z∥≤∥e∥+Ch and ∥e∥≤∥e∥2 when e≠0. Let H1 be the complete first-half history. The fresh second-half copies are independent of that history, so E[ξ2∣H1]=0 and E[ξ1⋅ξ2]=0.

3.1step 2.1algebra

Fix the starting pair (x,z) during this expansion; the estimates are uniform in the pair and depend on it only through e=x−z. The endpoint error is e′=e+m1+ξ1+m2+ξ2. First, E∥e+η1∥2=∥e+m1∥2+E∥ξ1∥2≤(1+Ch)∥e∥2. The vector e+m1+ξ1+m2 is H1-measurable, so E[ξ2∣H1]=0 makes its expected inner product with ξ2 zero. The remaining cross terms satisfy 2∣E(ξ1⋅m2)∣≤2(E∥ξ1∥2)1/2(E∥m2∥2)1/2≤Ch3/2∥e∥∥e∥2+h≤Ch∥e∥2, with value zero if e=0, and 2∣E((e+m1)⋅m2)∣≤h∥e+m1∥2+h−1E∥m2∥2≤Ch∥e∥2+Ch2. The additional terms satisfy E∥m2∥2≤Ch∥e∥2+Ch2 and E∥ξ2∥2≤Ch∥e∥2+Ch2 by step 2.1. Combining these expansion terms proves the recurrence conditional on (x,z); averaging over starting pairs with difference e gives E[∥e′∥2∣e]≤(1+Ch)∥e∥2+Ch2.

4.1step 3.1algebra

Let un=E∥en∥2 at coarse endpoints. Since u0=0, step 3.1 gives un+1≤(1+Ch)un+Ch2. There are N=T/(2h) coarse intervals, so iteration yields uN≤Ch2∑r=0N−1(1+Ch)r≤Ch2NeChN≤CTh.

5.1step 4.1algebra∎

If eN≠0, its integer coordinates imply ∥eN∥2≥1, hence P(eN≠0)≤E∥eN∥2≤CTh. The payoff difference is zero when eN=0 and is at most 2G in absolute value otherwise. Its variance is at most its second moment, hence at most 4G2P(eN≠0)≤Ch. For h>1 the same conclusion follows directly from Var⁡≤4G2≤4G2h.

Notes

The T16 Minimum-intensity coupling of reaction networks is an exact event-time coupling built by dominating Poisson thinning. The present theorem uses the separately proved frozen-rate count coupling Shared-minimum coupling of two Poisson counts on each tau-leap half-step; it does not identify the two path procedures.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableprecheck pendingOpen item page →

Critical-reaction binomial guarded tau-leaping

Definition

Inputs. A finite state reaction system Finite-channel reaction propensity systems and their generator with nonzero jump vectors, initial state x0∈E, horizon T>0, maximum leap τmax⁡>0, critical threshold nc∈N, finite step budget B that is a nonnegative integer, and independent ideal random inputs for the procedure. Use a fresh independent direct-method stream on every critical SSA call. Also use mutually independent unit-uniform streams Uq,j,r∼Unif⁡[0,1], independent of all SSA streams, for leap indices q, channels j, and positive trial indices r=1,2,…. A binomial draw with parameters (mj,pj) is the number of the first mj entries in its stream that are less than pj. The countable product of these input laws exists under Countable Choice and Dependent Choice by Assuming countable and dependent choice, countable products of arbitrary probability spaces. The first-event law of the critical SSA subroutine is the one in Finite-state Gillespie and next-reaction methods have the specified CTMC law. For a state x and channel j, define its admissible firing capacity N0:={0,1,2,…},mj(x):=max⁡{m∈N0:x+rνj∈E for every integer r∈{0,…,m}}. Finiteness of E and νj≠0 make this maximum finite. Let C(x)={j:mj(x)≤nc} be the critical set. When C(x)≠∅, hold C(x) fixed and form the finite reaction system on E using only those channels, with their original propensities. If C(x)=∅, do not form a restricted system and define the critical result to be no event. In the nonempty case, the critical SSA subroutine runs the direct Gillespie method on this restricted system with event budget one and horizon τ; it returns its first event (s,j∗) if it occurs strictly before τ, where 0<s<τ, and otherwise returns no event.

Output. The recorded states at accepted leap endpoints, with piecewise-constant interpolation, and a status in {completed, absorbed, invalid-state, inconclusive, step-size-infeasible, critical-interface-required}. A noncompleted step-size, interface, or budget failure returns the current path prefix. Absorption and invalid-state handling record the held state through T.

Procedure. Set t=0, x=x0, step counter q=0, recorded path P=[(0,x0)], and status completed.

  1. If t=T, return P with status completed. If x∉E, append (t,x) to P if needed, append (T,x) if t<T, and return P with status invalid-state. If q=B before T, return the current path prefix with status inconclusive. If λ(x)=0, hold x fixed through T, append (T,x) to P if needed, and return P with status absorbed.
  2. Compute C(x) and τ=min⁡ ⁣(T−t,τmax⁡,min⁡j∉C(x)aj(x)>0mj(x)aj(x)), where the inner minimum over an empty set is +∞. If τ≤0, return step-size-infeasible with the current path prefix. If C(x)=∅, record that there is no critical event and skip the critical SSA call. If C(x)≠∅, call critical SSA for horizon τ; it returns either no critical event before τ, or a pair (s,j∗) with 0<s<τ and j∗∈C(x). Set δ to s in the event case and to τ otherwise.
  3. Starting from x~=x, process the noncritical channels in increasing index order. Recompute mj(x~). If aj(x~)>0 and mj(x~)=0, return critical-interface-required with the current path prefix. Otherwise set Kj=0 when mj(x~)=0=aj(x~). When mj(x~)>0, set pj=aj(x~)δ/mj(x~); if pj>1, return step-size-infeasible with the current path prefix and without rejecting and resampling. Set Kj=∑r=1mj(x~)1{Uq,j,r<pj},x~←x~+Kjνj.
  4. If critical SSA returned (s,j∗), return inconclusive with the current path prefix when x~+νj∗∉E; otherwise apply that critical reaction to x~. If the call returned no event, leave x~ unchanged. Set x←x~, set t←t+δ, append (t,x) to P, set q←q+1, and repeat.
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck pendingOpen item page →

MLMC work bound for bounded finite-state Poisson tau-leaping

Statement

Assume Countable Choice and Dependent Choice, and the finite-state hypotheses of Weak order one for finite-state Poisson tau-leaping with an exit bound and Order-one correction variance for coupled Poisson tau-leap levels, with bounded payoff g. Use levels hℓ=T2−ℓ and couple adjacent Poisson tau-leap paths by the shared-minimum construction. Under the work convention that each channel Poisson draw, propensity evaluation, and stoichiometric update has unit cost, for each ℓ≥1 one correction sample costs at most Chℓ−1: there are T/hℓ fine half intervals, each using at most 3R shared and residual Poisson draws and O(R) propensity and update work. The base-level sample uses one path and costs O(R), which is O(h0−1) for fixed T. The level bias is O(hL) and the correction variance is O(hℓ). Therefore, for all sufficiently small ϵ>0, deterministic sample counts in the generic multilevel estimator can achieve mean square error at most ϵ2 with work O ⁣(ϵ−2(log⁡ϵ−1)2). This conclusion applies only to the explicit Poisson leap and the bounded finite-state hypotheses above. It is not a correctness or error guarantee for the guarded binomial algorithm Critical-reaction binomial guarded tau-leaping.

Facts & Assumptions

Given: The geometric hierarchy, adjacent-level coupling, finite-state error hypotheses, and unit-cost convention in the Statement.

[F1]

Weak order one for finite-state Poisson tau-leaping with an exit bound: the payoff bias at level ℓ is at most Cbhℓ.

[F2]

Order-one correction variance for coupled Poisson tau-leap levels: the adjacent-level correction variance is at most Cvhℓ.

[F3]

Geometric MLMC hierarchy and coupled corrections and Expectation, variance, and MSE of a finite MLMC estimator: the finite multilevel estimator telescopes in expectation and has variance equal to the sum of level correction variances divided by their sample counts.

[F4]

MLMC cost complexity under bias, variance, and work rates: if bias is O(hα), correction variance is O(hβ), and level cost is O(h−1), the stated MLMC work upper bounds apply.

[A1]

Countable Choice is assumed through the exact finite-state chain used in [F1]. The Axiom of Countable Choice (ACω)

[A2]

Dependent Choice is assumed through the countable random input stream used to define that chain. The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

Proof

Given: Countable Choice, Dependent Choice, and the assumptions above.

1.1givenalgebra

For ℓ≥1, the fine and coarse paths use T/hℓ and T/hℓ−1 steps, respectively; both ratios are integers on the dyadic hierarchy. On each fine half interval, each channel uses one shared and two residual Poisson counts, hence at most 3R scalar draws and O(R) propensity and update work; the two coarse count vectors are accumulated over each coarse interval. Thus the correction cost is O(TR/hℓ)=O(hℓ−1) for fixed T. At level zero, a single path takes one step and uses O(R) work; since h0=T>0 is fixed, this is also O(h0−1) after changing the constant.

2.1F1F2F3F4A1A2step 1.1∎

By [F1] the bias exponent in [F4] is α=1. By [F2], every adjacent-level variance for ℓ≥1 is O(hℓ). At level zero, Δ0=g(YT), so Var⁡(Δ0)≤E[g(YT)2]≤∥g∥∞2; since h0=T>0, increasing the variance constant gives the required O(h0) bound there as well. Thus the variance exponent for all levels is β=1. Apply [F4] with refinement factor 2 and these exponents. Its β=1 case gives O(ϵ−2(log⁡ϵ−1)2) work while controlling the MSE by [F3].

5 · Examples, counterexamples and false statements

None yet.

Sources