Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

40 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