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.

Tau Leaping and Reaction Diffusion Model Error — Examples

1 · Prerequisites

2 · Summary

The examples show a pure-death Poisson leap with a positive probability of a negative population, a finite-capacity binomial guard with altered noise, and a reversible system whose explicit leap has an unstable mean amplification factor for large steps. A one-channel shared-minimum count example compares coupled and independent correction variances. The immigration marginal example separates nonnegative Poisson support from Gaussian CLE support near an empty population; its unbounded cubic payoff calculation is explicitly outside the general bounded-payoff theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A minimum-intensity coupling reduces a Poisson count correction

Example

For one channel with jump ν=1, compare a fine-step propensity 13.1 and a coarse-step propensity 13 over a half interval of length h>0. Couple the counts by a shared Pois⁡(13h) variable and an independent fine-only residual Pois⁡(0.1h) variable.

Facts & Assumptions

Given: Two Poisson marginal counts with parameters 13.1h and 13h, coupled by Shared-minimum coupling of two Poisson counts.

[F1]

The scalar Poisson count law: a Poisson count of parameter θ≥0 has mass e−θθk/k!.

[F3]

Shared-minimum coupling of two Poisson counts: shared Poisson counts plus independent rate-difference residuals have the required Poisson marginals and correction variance.

Verification

Given: The rates and step length in the Example.

1.1F1F3algebra

By [F3], the fine count is Pc+Pf and the coarse count is Pc, where the three count components have the independent laws in the Example. Their marginals have parameters 13.1h and 13h because independent Poisson counts add; this also follows by convolving the masses in [F1].

2.1F2step 1.1algebra∎

The coupled difference is exactly Pf, so its variance is 0.1h by [F2]. If the two counts were independent, their difference would have variance 13.1h+13h=26.1h. Thus the shared minimum reduces the correction variance by a factor of 261 in this one-step example.

Notes

This is a one-step count coupling example. It does not identify the fixed-step construction with T16's continuous-time reaction-path coupling.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A Poisson leap can make a pure-death population negative

Example

Take one species with physical states E={0,1} and one death reaction ν=−1, a(1)=c>0, a(0)=0. Start at x0=1 and take one Poisson leap of length h>0 with draw budget B=1. The exact reaction chain stays in E.

Facts & Assumptions

Given: The pure-death propensity system above and the leap Explicit Poisson tau-leaping with an invalid-state status.

[F1]

Finite-channel reaction propensity systems and their generator: one firing at state 1 changes the state by −1, and the rate at state 0 is zero.

[F2]

Explicit Poisson tau-leaping with an invalid-state status: the number K of firings in one step from state 1 has law Pois⁡(ch) and the proposed state is 1−K.

[F3]

The scalar Poisson count law: the Poisson mass at k is e−ch(ch)k/k!.

Verification

Given: c>0 and h>0.

1.1F2F3algebra

The leap state is negative exactly when 1−K<0, equivalently K≥2. Using the masses in [F3], P(K≥2)=1−P(K=0)−P(K=1)=1−e−ch(1+ch)>0. The strict inequality follows from ech>1+ch for ch>0.

2.1F1step 1.1algebra∎

For small h, Taylor expansion of e−ch(1+ch) gives P(K≥2)=12c2h2+O(h3). The exact chain cannot become negative because its only positive-rate event sends 1 to 0, after which the rate is zero by [F1]. Thus the invalid tau-leap event is a distinct numerical exit from the physical state set.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A CLE can assign negative density near an empty population

Example

Assume the Axiom of Choice. Consider constant immigration ∅→A with density jump 1/V and rate Vλ, where V≥1, λ>0, and the time horizon T>0. Let NT be the count of a homogeneous Poisson point process on (0,T] with intensity Vλ times Lebesgue measure, and set XT=NT/V. For the associated constant-coefficient CLE, let B be a standard Brownian motion and set Zt=λt+λ/V Bt. Its generator is GVf(x)=λf′(x)+λ2Vf′′(x), and, with μ=λT, its terminal marginal is ZT=μ+μ/V G,G∼N(0,1). Then XT≥0 almost surely, while the CLE marginal can be negative.

Facts & Assumptions

Given: AC, V≥1, λ,T>0, the exact jump-count construction, the Brownian motion used to define Z, and the count and density-scaled model laws.

[F1]

Finite-intensity Poisson-process existence and mixed-binomial law: a Poisson point process on a finite-intensity time interval exists, and its total count is Poisson with parameter equal to the intensity of that interval.

[F2]

Poisson and Cox point processes: counts on disjoint Borel sets of a Poisson point process are independent and have Poisson laws with their respective intensity parameters.

[F3]

The scalar Poisson count law and Normalization, moments, and generating function of the Poisson count law: a count with law Pois⁡(m) has masses e−mmk/k!, mean m, and E[N(N−1)]=m2.

[F4]

Density-scaled reaction jump and chemical Langevin generators: a jump of size ν/V at rate Va(x) has generator Va(x)(f(x+ν/V)−f(x)); its CLE coefficients are the drift νa(x) and covariance rate a(x)ννT/V.

[F5]

Standard normal and normal laws: the law N(0,1) has density φ(u)=e−u2/2/2π on R.

[F6]

Under AC, a standard continuous Brownian motion exists, and its increments over finite increasing time grids are independent normal variables with variance equal to the time increments. Brownian motion Existence of continuous Brownian motion

[F7]

With the usual augmented natural filtration, the conditional law of the Brownian future depends on the past only through the current Brownian state. Future-path Markov property

[A1]

The normal-law and Brownian constructions use AC, recorded as The Axiom of Choice.

Verification

Given: The inputs above, with m=Vμ.

1.1F1F2F3F4algebra

By [F1], NT∼Pois⁡(m), so XT=NT/V≥0 almost surely. The point-process counts on disjoint intervals are independent by [F2]. On an interval of length h, put r=Vλh. By [F3], P(K=0)=e−r=1−r+O(r2) and P(K=1)=re−r=r+O(r2); also P(K≥2)≤E[K(K−1)]/2=r2/2. For bounded f, the multiple-count contribution to its expected increment is therefore O(h2)∥f∥∞. Dividing the zero/single-count expansion by h gives the density-count generator Vλ(f(x+1/V)−f(x)), as in [F4].

1.2F5F6F7A1algebra

Let B be the Brownian motion in [F6] and define Zt=λt+λ/V Bt. By [F7] and the independent increments in [F6], Z is a continuous Markov process. For any f with three bounded continuous derivatives, put Δh=λh+λ/V(Bt+h−Bt). The Brownian increment is independent of the past and has variance h. The density in [F5] has finite third absolute moment by substituting v=u2/2, so E[Δh]=λh,E[Δh2]=λhV+λ2h2,E∣Δh∣3=O(h3/2). Taylor's formula therefore gives lim⁡h↓0E[f(x+Δh)]−f(x)h=λf′(x)+λ2Vf′′(x), the generator in the Example. Also BT∼N(0,T) by [F6], so G=BT/T∼N(0,1) and ZT=μ+μ/V G.

2.1F5A1step 1.2algebra

The density φ in [F5] is even. The moments of orders one and three are absolutely integrable, as follows by substituting v=u2/2 in the tail integrals, so symmetry gives EG=EG3=0. Since φ′(u)=−uφ(u) and uφ(u)→0 at both infinities, integration by parts gives E[G2]=∫Ru2φ(u) du=∫Rφ(u) du=1. Expanding the Gaussian marginal in step 1.2 now gives E[ZT3]=μ3+3μ2/V.

2.2F3step 1.1algebra

Reindexing the nonnegative Poisson mass series gives E[NT(NT−1)(NT−2)]=e−m∑k=3∞k(k−1)(k−2)mkk!=m3e−m∑r=0∞mrr!=m3. Using [F3] and N3=N(N−1)(N−2)+3N(N−1)+N yields E[XT3]=μ3+3μ2V+μV2.

3.1step 2.2step 2.1algebra

Subtracting the two moments in steps 2.2 and 2.1 gives E[XT3]−E[ZT3]=μ/V2>0. Thus this exact marginal comparison has a weak discrepancy of order V−2 for the cubic payoff.

4.1A1F5step 1.1step 1.2algebra∎

The CLE value is negative exactly when G<−Vμ. The normal density is strictly positive on every nonempty interval, so this event has positive probability. As Vμ↓0, continuity of the normal distribution and symmetry give P(ZT<0)=P(G<−Vμ)⟶12. The jump marginal remains nonnegative by step 1.1.

Notes

The cubic payoff is unbounded, so its exact discrepancy is not an application of Stopped density-scaled jump versus chemical Langevin weak model error, whose general estimate requires a bounded payoff and a smooth stopped backward solution. This example separates a solvable marginal calculation from that theorem's hypotheses.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A stiff reversible system exposes explicit tau-leap mean instability

Example

Assume Countable Choice and Dependent Choice. Consider A⇄B with fixed total population M≥1, state x=#A∈{0,…,M}, rates a1(x)=c1x and a2(x)=c2(M−x), and jumps −1,+1. Let λ=c1+c2.

Facts & Assumptions

Given: M∈N with M≥1, c1,c2>0, the exact chain with these rates, and the one-step Poisson leap Explicit Poisson tau-leaping with an invalid-state status.

[F1]

Finite-channel reaction propensity systems and their generator: the generator on the state coordinate is Qf(x)=c1x(f(x−1)−f(x))+c2(M−x)(f(x+1)−f(x)), with forbidden boundary rates zero.

[F2]

Dynkin identity for a bounded-rate finite stopped reaction chain: for this finite-state chain, expectations of v(t,Xt) satisfy the generator identity.

[A1]

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

[A2]

Verification

Given: Countable Choice, Dependent Choice, x0∈{0,…,M}, and a one-step duration h>0.

1.1F1F2A1A2givenalgebra

Apply [F2] to v(t,x)=x and use [F1]. The exact mean m(t)=EXt satisfies m(t)=x0+∫0t(c2M−λm(s)) ds. This makes m absolutely continuous; differentiating almost everywhere shows that the derivative of eλt(m(t)−c2M/λ) is zero almost everywhere. This product is absolutely continuous, so it is constant; its value at t=0 is x0−c2M/λ. Rearranging gives m(t)=c2Mλ+(x0−c2Mλ)e−λt.

2.1F3step 1.1algebra∎

By [F3], one Poisson leap has EY1=(1−λh)x0+c2Mh. Its linear mean amplification factor is 1−λh, whose absolute value exceeds 1 when h>2/λ. For the symmetric case c1=c2=r and initial state x0=0, the choice h=3/(2r) gives EY1=3M/2, outside the physical upper bound M, whereas the exact expectation from step 1.1 is M2(1−e−3)<M/2. This is a one-step comparison; it does not assume that invalid Poisson leaps remain in the physical state set.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A binomial guard prevents overdraw but changes Poisson noise

Example

For a pure-death reaction A→∅ on E={0,1,…,n} with n molecules and propensity a(k)=ck, choose a critical threshold 0≤nc<n, maximum leap τmax⁡=h, horizon T=h, and step budget B≥1, where h=1/(2c). The death channel is noncritical at the initial state, its capacity is m=n, and the guarded rule uses p=a(n)h/m=1/2 on its first step.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, integers n≥1 and 0≤nc<n, c>0, h=1/(2c), the Poisson leap Explicit Poisson tau-leaping with an invalid-state status, the binomial guard Critical-reaction binomial guarded tau-leaping, and the binomial definition below.

[F1]

Explicit Poisson tau-leaping with an invalid-state status: the unguarded firing count is KP∼Pois⁡(a(n)h).

[F2]

Critical-reaction binomial guarded tau-leaping: for capacity n and p=a(n)h/n, the guarded count is Binomial⁡(n,p) and cannot exceed n.

[F3]

Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials: a Binomial⁡(n,p) count is a sum of n independent Bernoulli⁡(p) trials.

[F4]

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

[A1]

The critical-reaction algorithm assumes Countable Choice and Dependent Choice for its direct-SSA subroutine. Here its critical set is empty, so the algorithm skips that subroutine and defines the critical result to be no event. Critical-reaction binomial guarded tau-leaping, The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

Verification

Given: The input conditions in the Example.

1.1A1F2F3algebra

Since n>nc, the death channel is noncritical, and τ=min⁡(T,τmax⁡,m/a(n))=h. The critical set is empty, so the algorithm skips the critical SSA call, records no critical event, and sets δ=h. Thus p=1/2. The guarded count KB is a sum of n Bernoulli variables, each in {0,1} by [F3], so 0≤KB≤n and the updated population n−KB is nonnegative. Its mean is np=n/2.

2.1F1F3F4step 1.1algebra

Independence of the Bernoulli trials gives Var⁡(KB)=∑i=1np(1−p)=n/4. In contrast, the Poisson count has mean a(n)h=n/2 and variance n/2 by [F1, F4]. Thus the binomial guard retains the mean but halves the count variance in this finite model; it is not the same Poisson leap law.

3.1F1step 2.1algebra∎

The unguarded Poisson count has P(KP>n)>0, since every mass at k>n is positive when its parameter n/2 is positive. Therefore its leap can overdraw the available molecules, while the guarded count cannot.

Sources