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.
Immigration-death chain projected onto two states
Example
Consider immigration at rate and death at rate from state , starting at . For , the cemetery lift on is
Writing the lifted law as , the exact cemetery mass is
It equals the probability of having exited by time and therefore is the exact embedded killed-vector error. A path can exit and return: has positive probability for every , so the full marginal at state can exceed the killed projection there.
Facts & Assumptions
Given: State space , immigration rate , death rate at state , initial state , and finite projection .
Finite-channel reaction propensity systems and their generator: a finite-channel reaction system has a countable state set, integer increments, finite propensities, and generator when that finite sum is defined.
A proper Lyapunov bound prevents reaction-network explosion: under Countable Choice and Dependent Choice, a proper with for finite implies that the constructed reaction process is nonexplosive.
Given countable nonexplosive pure-jump chain with finite rates: the countable chain used by the projection is already given and nonexplosive; the definition does not prove this from rates alone.
Killed finite-state projection and cemetery lift: the killed projection stays at after the first exit, and its finite lift adds the aggregate exit rate into the cemetery row.
Finite master equation and uniformization formula: a finite column generator evolves the initial column law by the unique solution of .
Finite-state killed projection has an exact lost-mass certificate: the cemetery mass equals the first-exit probability and the embedded killed-vector error.
Countable Choice and Dependent Choice are assumed only for the nonexplosion conclusion [F2]. (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
The system has two channels, increments and , and propensities and ; the death channel is inactive at , so every positive-propensity poststate remains in and the total rate is finite. Thus [F1] applies.
Let . Its sublevel set is finite for each integer , so is proper. For , ; at the same value satisfies this bound. Hence [F2] with and [A1] proves the immigration-death chain is nonexplosive, as required by [F3].
On , state jumps to at rate ; state jumps to at rate and exits to at rate . These off-diagonal rates are nonnegative, and the cemetery construction [F4] gives the displayed with zero column sums. Multiplying by the lifted probability vector gives , , and , with initial vector .
From we have ; differentiating and using yields , with and . The characteristic roots are and , so the unique solution is .
Since and , integrating the expression in step 2.1 gives the displayed formula for . By [F6], this coordinate is and equals the embedded killed-vector error.
Fix and choose ordered times . The joint density for jumps at , at , and at , followed by no further jump through , is , which is strictly positive; integrating this positive density over the nonempty ordered-time simplex gives positive probability. Such paths contribute to the full marginal at state but have already been killed at their first exit from .
Depends on
- Given countable nonexplosive pure-jump chain with finite rates
- Killed finite-state projection and cemetery lift
- Finite-state killed projection has an exact lost-mass certificate
- Finite master equation and uniformization formula
- Finite-channel reaction propensity systems and their generator
- A proper Lyapunov bound prevents reaction-network explosion
- 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
47 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
- Brian Munsky and Mustafa Khammash, The Finite State Projection Algorithm for the Solution of the Chemical Master Equation (standard reference, not scraped)