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.
Finite-volume and periodic diffusion preserve intervals and weighted mass
Statement
Consider either the no-flux TPFA cell system of No-flux TPFA diffusion generator or the periodic grid system of Periodic rectangular reaction-diffusion grid. Write its finite index set as , its positive diagonal mass matrix as , and its stiffness matrix as . In both cases , , and for , where . For each species , let and solve . Assume for every species. If initially for all , then the solution exists for all and remains in those intervals. More precisely, each species evolution matrix has nonnegative entries and row sums one, so it is a contraction in the maximum norm. The flow also preserves each weighted species sum and therefore every finite linear combination of species sums, including of Stoichiometric conservation and dissipation functionals.
Facts & Assumptions
Given: Either stated finite diffusion discretization, a finite index set , positive masses, symmetric stiffness with nonpositive off-diagonal entries and zero row sums, species diffusivities , and initial component values in the stated intervals.
No-flux TPFA diffusion generator: its mass matrix has entries ; its stiffness has symmetric off-diagonal entries and zero row sums.
Periodic rectangular reaction-diffusion grid: its mass matrix is and its stiffness is symmetric, has nonpositive off-diagonal entries, and annihilates constants.
Finite matrix exponential series and its identities: for a finite matrix , is defined by a convergent power series, is differentiable with derivative , and exponentials of commuting matrices multiply to the exponential of their sum.
The exponential is positive and satisfies : for every real .
Picard-Lindelöf local existence and uniqueness for first-order systems: a locally Lipschitz finite-dimensional vector field has a unique local solution through each initial state.
Proof
Fix a species and put . If , the solution is constant. If , then for , every row sums to zero, and . Choose at least as large as every exit rate , and set . Then is entrywise nonnegative with row sums one. Matrix multiplication shows inductively that every has these same properties.
Symmetry of and give . Hence , and multiplication by every power of gives for . The exponential series therefore yields , so the weighted sum of species is conserved.
If , has nonnegative entries and row sums one. Otherwise use the and of step 1.1. Since , [F3] gives . The power series shows , whose scalar coefficient is positive by [F4]. Every term in the series for is entrywise nonnegative by step 1.1. Thus is entrywise nonnegative. Since , its power series also gives . By [F3], this exponential has derivative and initial value , so it solves the finite ODE; [F6] gives uniqueness.
The initial inequalities are and . Applying the nonnegative matrix and using from step 2.1 proves . The explicit exponential is defined for every finite ; step 1.2 preserves its weighted sum. Taking the finite linear combination in [F5] proves the stated mass assertion.
Depends on
- No-flux TPFA diffusion generator
- Periodic rectangular reaction-diffusion grid
- Stoichiometric conservation and dissipation functionals
- Finite matrix exponential series and its identities
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- Picard-Lindelöf local existence and uniqueness for first-order systems
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
- A bounded Euler-reaction Lie step preserves rectangles and mass balance Theorem
- Exact reaction-diffusion Lie steps preserve rectangles and mass balance Theorem
- Mesh-uniform first-order Lie error for a smooth periodic reaction-diffusion solution Theorem
Dependency tree · two levels
32 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
- R. Eymard, T. Gallouët, and R. Herbin, Finite Volume Methods, updated author text, 2019 (standard reference, not scraped)
- Willem Hundsdorfer, Numerical Solution of Advection-Diffusion-Reaction Equations, lecture notes for Ph.D. course, 1996 (standard reference, not scraped)