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.
Semilinear vector reaction-diffusion systems
Definition
Let , let with , and let be as in Reaction vector fields and quasi-positivity. A semilinear vector reaction-diffusion system is
on either a flat periodic torus or a bounded connected polyhedral domain with homogeneous no-flux conditions on each boundary face. Equivalently, is required for components with ; components with require no boundary condition. The diffusion matrix is diagonal and independent of ; this definition does not include cross-diffusion.
A classical solution is bounded in the rectangle on if at every point and time in its stated solution class, with as in Inward reaction rectangles. This item fixes the continuous PDE convention; the finite-volume and periodic discrete operators are defined separately.
Depends on
Used by
- Exact reaction-then-diffusion Lie step on FV or periodic grids Algorithm
- Forward-Euler reaction followed by exact FV or periodic diffusion Algorithm
- Mesh-uniform reaction-diffusion commutator bound on a periodic grid Lemma
- Second-order spatial consistency of the periodic FV heat stencil Lemma
- Two-species continuous and discrete dispersion criteria Proposition
- Continuous reaction-diffusion mass balance on boxes, tori, and piecewise C1 domains Theorem
- Mesh-uniform first-order Lie error for a smooth periodic reaction-diffusion solution 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
- Willem Hundsdorfer, Numerical Solution of Advection-Diffusion-Reaction Equations, lecture notes for Ph.D. course, 1996 (standard reference, not scraped)
- Luca Doria, Numerical Algorithms, lecture notes, Johannes Gutenberg-Universität Mainz, 2022 (standard reference, not scraped)