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.
Modified Patankar Euler for conservative transfer systems
Definition
Let , let be the rates of a finite conservative PDS Finite conservative production destruction systems with state domain , and take an input state , a step size , and declared denominators . If , , or any , return an inadmissible-input status before evaluating any rate. Otherwise the modified Patankar Euler step returns the unique solution of
Equivalently, form by
and solve . The rates in the solve are evaluated only at the admissible state . For every input passing the branch, return the unique exact solution of the stated linear system. The standard first-order choice is , which is admissible only when every . A separately defined rate-factor form extends a first-order step to zero donor coordinates under an additional source-factorization hypothesis.
Depends on
Used by
- The positive-interior MPRK22(1) step Algorithm
- An arbitrarily small residual does not certify the candidate's nonnegativity Counterexample
- A stiff reversible two-compartment transfer Example
- A zero compartment makes the standard ratio undefined Example
- Modified Patankar Euler has a uniform first-order defect and one-step bound on positive tubes Lemma
- MPRK22(1) has a uniform second-order defect and one-step bound on positive tubes Lemma
- Certified residuals bound mass drift and the exact-solve positivity margin Theorem
- Modified Patankar Euler converges globally with first-order error on a positive tube Theorem
- Modified Patankar Euler preserves positivity and total mass Theorem
Dependency tree · one level
2 results within one dependency step 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
- Stefan Kopecz and Andreas Meister, On order conditions for modified Patankar-Runge-Kutta schemes, §1 (standard reference, not scraped)
- Sergio Blanes, Arieh Iserles, and Shev Macnamara, Positivity-preserving methods for ordinary differential equations, §3.4 (standard reference, not scraped)