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.

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.

Depends on

Used by

Dependency tree · two levels

15 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