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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Event observation, censoring, truncation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Parametric survival and reliability
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Poisson and Cox point processes
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Stochastic Reaction Jump Simulation and Coupling
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tau Leaping and Reaction Diffusion Model Error
- Temporal intensity and likelihood
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
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
A minimum-intensity coupling reduces a Poisson count correction
Example
For one channel with jump , compare a fine-step propensity and a coarse-step propensity over a half interval of length . Couple the counts by a shared variable and an independent fine-only residual variable.
Facts & Assumptions
Given: Two Poisson marginal counts with parameters and , coupled by Shared-minimum coupling of two Poisson counts.
The scalar Poisson count law: a Poisson count of parameter has mass .
Normalization, moments, and generating function of the Poisson count law: its mean and variance are both .
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.
By [F3], the fine count is and the coarse count is , where the three count components have the independent laws in the Example. Their marginals have parameters and because independent Poisson counts add; this also follows by convolving the masses in [F1].
The coupled difference is exactly , so its variance is by [F2]. If the two counts were independent, their difference would have variance . Thus the shared minimum reduces the correction variance by a factor of 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.
A Poisson leap can make a pure-death population negative
Example
Take one species with physical states and one death reaction , , . Start at and take one Poisson leap of length with draw budget . The exact reaction chain stays in .
Facts & Assumptions
Given: The pure-death propensity system above and the leap Explicit Poisson tau-leaping with an invalid-state status.
Finite-channel reaction propensity systems and their generator: one firing at state changes the state by , and the rate at state is zero.
Explicit Poisson tau-leaping with an invalid-state status: the number of firings in one step from state has law and the proposed state is .
The scalar Poisson count law: the Poisson mass at is .
Verification
Given: and .
The leap state is negative exactly when , equivalently . Using the masses in [F3], The strict inequality follows from for .
For small , Taylor expansion of gives . The exact chain cannot become negative because its only positive-rate event sends to , after which the rate is zero by [F1]. Thus the invalid tau-leap event is a distinct numerical exit from the physical state set.
A CLE can assign negative density near an empty population
Example
Assume the Axiom of Choice. Consider constant immigration with density jump and rate , where , , and the time horizon . Let be the count of a homogeneous Poisson point process on with intensity times Lebesgue measure, and set . For the associated constant-coefficient CLE, let be a standard Brownian motion and set . Its generator is and, with , its terminal marginal is Then almost surely, while the CLE marginal can be negative.
Facts & Assumptions
Given: AC, , , the exact jump-count construction, the Brownian motion used to define , and the count and density-scaled model laws.
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.
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.
The scalar Poisson count law and Normalization, moments, and generating function of the Poisson count law: a count with law has masses , mean , and .
Density-scaled reaction jump and chemical Langevin generators: a jump of size at rate has generator ; its CLE coefficients are the drift and covariance rate .
Standard normal and normal laws: the law has density on .
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
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
The normal-law and Brownian constructions use AC, recorded as The Axiom of Choice.
Verification
Given: The inputs above, with .
By [F1], , so almost surely. The point-process counts on disjoint intervals are independent by [F2]. On an interval of length , put . By [F3], and ; also . For bounded , the multiple-count contribution to its expected increment is therefore . Dividing the zero/single-count expansion by gives the density-count generator , as in [F4].
Let be the Brownian motion in [F6] and define . By [F7] and the independent increments in [F6], is a continuous Markov process. For any with three bounded continuous derivatives, put . The Brownian increment is independent of the past and has variance . The density in [F5] has finite third absolute moment by substituting , so Taylor's formula therefore gives the generator in the Example. Also by [F6], so and .
The density in [F5] is even. The moments of orders one and three are absolutely integrable, as follows by substituting in the tail integrals, so symmetry gives . Since and at both infinities, integration by parts gives Expanding the Gaussian marginal in step 1.2 now gives
Reindexing the nonnegative Poisson mass series gives Using [F3] and yields
Subtracting the two moments in steps 2.2 and 2.1 gives Thus this exact marginal comparison has a weak discrepancy of order for the cubic payoff.
The CLE value is negative exactly when . The normal density is strictly positive on every nonempty interval, so this event has positive probability. As , continuity of the normal distribution and symmetry give 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.
A stiff reversible system exposes explicit tau-leap mean instability
Example
Assume Countable Choice and Dependent Choice. Consider with fixed total population , state , rates and , and jumps . Let .
Facts & Assumptions
Given: with , , the exact chain with these rates, and the one-step Poisson leap Explicit Poisson tau-leaping with an invalid-state status.
Finite-channel reaction propensity systems and their generator: the generator on the state coordinate is , with forbidden boundary rates zero.
Dynkin identity for a bounded-rate finite stopped reaction chain: for this finite-state chain, expectations of satisfy the generator identity.
Explicit Poisson tau-leaping with an invalid-state status and Conditional moments of one Poisson tau-leap increment: one leap has conditional mean .
Countable Choice is assumed by [F2] for the exponential event law. The Axiom of Countable Choice ()
Dependent Choice is assumed by [F2] for the countable event input sequence. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Verification
Given: Countable Choice, Dependent Choice, , and a one-step duration .
Apply [F2] to and use [F1]. The exact mean satisfies This makes absolutely continuous; differentiating almost everywhere shows that the derivative of is zero almost everywhere. This product is absolutely continuous, so it is constant; its value at is . Rearranging gives
By [F3], one Poisson leap has . Its linear mean amplification factor is , whose absolute value exceeds when . For the symmetric case and initial state , the choice gives , outside the physical upper bound , whereas the exact expectation from step 1.1 is . This is a one-step comparison; it does not assume that invalid Poisson leaps remain in the physical state set.
A binomial guard prevents overdraw but changes Poisson noise
Example
For a pure-death reaction on with molecules and propensity , choose a critical threshold , maximum leap , horizon , and step budget , where . The death channel is noncritical at the initial state, its capacity is , and the guarded rule uses on its first step.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, integers and , , , 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.
Explicit Poisson tau-leaping with an invalid-state status: the unguarded firing count is .
Critical-reaction binomial guarded tau-leaping: for capacity and , the guarded count is and cannot exceed .
Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials: a count is a sum of independent trials.
Normalization, moments, and generating function of the Poisson count law: a count has mean and variance .
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 (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Verification
Given: The input conditions in the Example.
Since , the death channel is noncritical, and . The critical set is empty, so the algorithm skips the critical SSA call, records no critical event, and sets . Thus . The guarded count is a sum of Bernoulli variables, each in by [F3], so and the updated population is nonnegative. Its mean is .
Independence of the Bernoulli trials gives . In contrast, the Poisson count has mean and variance 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.
The unguarded Poisson count has , since every mass at is positive when its parameter is positive. Therefore its leap can overdraw the available molecules, while the guarded count cannot.
Sources
- David F. Anderson and Desmond J. Higham, Multilevel Monte Carlo for continuous time Markov chains, with applications in biochemical kinetics
- Daniel T. Gillespie, Approximate accelerated stochastic simulation of chemically reacting systems
- Tiejun Li, Lecture 21: Application in chemical reaction kinetics, Applied Stochastic Analysis course notes