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.
Stopped density-scaled jump versus chemical Langevin weak model error
Statement
Assume Countable Choice and Dependent Choice. Use the density-scaled generators in Density-scaled reaction jump and chemical Langevin generators. Let be compact and the closure of a bounded open stopping region with nonempty interior, let , and let be a containing lattice. For fixed , the set is finite: boundedness of bounds each integer coordinate index in the lattice. Let be the jump process stopped at and let be a chemical Langevin diffusion stopped at . Assume both stopped processes exist with , and write and .
Assume , on , and every segment for with lies in . For a bounded payoff with , suppose the stopped CLE backward solution has an extension to an open neighborhood of and all these jump segments that is in space and in time, with on all states reached by the stopped jump chain and on every exit state (including diffusion boundary points), and and is continuous in time on the stated neighborhood. The third-derivative bound holds along every jump segment. The derivatives are spatial Fréchet derivatives with operator norm. Then If the original local jump and diffusion models are defined through and are coupled to agree with their stopped versions up to their respective exits, then The term is density-model error from the generator expansion; the exit term is separate. Neither term is time-discretization error. The existence and regularity of the CLE backward solution are assumptions, not consequences of this estimate.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, the density-scaled generators, the compact stopping region, bounded propensities on , and the stopped CLE backward solution with the stated boundary and derivative conditions, with .
Density-scaled reaction jump and chemical Langevin generators: for a state before exit,
Dynkin identity for a bounded-rate finite stopped reaction chain: a finite-state reaction chain stopped on its finite exit set obeys the time-dependent Dynkin identity. For this fixed , the lattice states in form a finite set, and each has at most one-jump destinations, so their exit set is finite. The total reaction rate before exit is bounded by . Relabeling a density state by transports the channel increments to and the rates to , so the supplier applies to this chain.
Countable Choice is assumed for the exponential event law in [F2]. The Axiom of Countable Choice ()
Dependent Choice is assumed in [F2] for the countable input streams. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
The stopped CLE and its stated backward solution exist; the backward equation, boundary values, and third-derivative bound hold. They are not inferred from Taylor expansion of the jump generator.
For the unstopped comparison, each original process agrees with its stopped version up to its first exit, and globally.
Proof
Given: Countable Choice, Dependent Choice, the stopped processes starting at , the derivative and propensity bounds, the backward equation, and the finite stopped-chain Dynkin identity.
Fix an interior lattice state and a time . For channel , apply one-variable Taylor's theorem to on . Its third-order remainder has absolute value at most . Multiplying by and summing over channels gives where The first two terms are exactly by [F1].
Set , , and let be the images under of the one-jump exit destinations from . These are disjoint finite subsets of . The transported stopped chain moves from by channel increment at rate and is fixed on . For , its time derivative is unchanged and its reaction generator on equals . Apply [F2] to this integer-lattice chain and . Before , the integrand is by the backward equation [A3]. After exit, is fixed at an exit destination where is independent of , so both its time derivative and stopped generator vanish. At time , , and the common initial condition gives and . Therefore
Bound the integrand in step 1.2 by step 1.1 and use . This proves the stopped-process estimate. Under [A4], the stopped and original terminal payoffs agree unless their respective process exits by time ; on that event their difference is at most . The triangle inequality for the two expectations adds at most , which proves the unstopped bound.
Depends on
- Density-scaled reaction jump and chemical Langevin generators
- Dynkin identity for a bounded-rate finite stopped reaction chain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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
- Daniel T. Gillespie, Approximate accelerated stochastic simulation of chemically reacting systems (standard reference, not scraped)
- Tiejun Li, Lecture 21: Application in chemical reaction kinetics, Applied Stochastic Analysis course notes (standard reference, not scraped)