Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Finite-channel reaction propensity systems and their generator

Definition

Fix positive integers d and R. A reaction propensity system consists of a state set E⊆Zd that is finite or countable, increments νj∈Zd for 1≤j≤R, and propensities aj:E→[0,∞). Here “countable” means finite or countably infinite, as in Finite, countably infinite, countable, uncountable. The total propensity λ(x):=∑j=1Raj(x) is finite for every x∈E, and aj(x)>0 implies x+νj∈E. Here N and Z have the meanings in The natural numbers N (von Neumann) and The integers as equivalence classes of pairs of naturals, and addition in Zd is coordinatewise.

A reaction event of channel j at state x records the marked transition x↦x+νj. The counting process Nj(t) records the number of channel-j events by time t. A zero increment νj=0 is allowed: it records a reaction event without changing the state.

For a time-homogeneous system, the reaction generator operator on bounded functions f:E→R is (Qf)(x):=∑j:aj(x)>0aj(x)(f(x+νj)−f(x)). When E is finite, set Λ:=max⁡({0}∪{λ(x):x∈E})<∞; thus Λ=0 for E=∅ and Λ=max⁡x∈Eλ(x) otherwise. If no active reaction has zero increment, the corresponding matrix has off-diagonal entries qxy=∑j:x+νj=yaj(x) and diagonal qxx=−λ(x). With zero-increment events, the operator formula remains valid and the matrix diagonal is instead minus the sum of state-changing rates; the zero-increment channels remain part of the marked event process.

For a finite horizon T, a time-dependent propensity system replaces aj(x) by functions aj:[0,T]×E→[0,∞) whose sections t↦aj(t,x) are measurable for the Borel sigma-algebra B([0,T]) of the usual topology on [0,T] (The Borel sigma-algebra of a topological space). Require finite total rate λ(t,x):=∑jaj(t,x). Its time-dependent generator operator is (Qtf)(x):=∑j:aj(t,x)>0aj(t,x)(f(x+νj)−f(x)). This definition specifies a stochastic model. It does not assert that a physical chemical system follows that model.

Depends on

Used by

Dependency tree · two levels

17 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