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.
Reaction-diffusion systems, invariants and pattern computation — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Elliptic finite-difference methods
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Finite generator master equations and uniformization
- Finite-volume diffusion on admissible meshes
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Parabolic finite-difference methods
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Reaction-diffusion systems, invariants and pattern computation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The examples calculate a Brusselator instability on a continuous torus, show how a three-node periodic grid suppresses that unstable mode, verify the Fisher–KPP forward-Euler interval bound before exact TPFA diffusion, and give a three-node consistent-mass P1 counterexample to nodal positivity. The Turing examples make linear mode claims only; the finite-element calculation does not assert failure of mass-lumped methods.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Consistent-mass P1 diffusion can leave the nonnegative cone
Statement
On the interval with three uniform P1 nodes and homogeneous Neumann boundary conditions, the semidiscrete heat equation with consistent mass matrix,
does not preserve nodal nonnegativity: there is a nonnegative initial vector for which the first component becomes negative immediately.
Facts & Assumptions
Given: The P1 nodal basis on two elements of length , the consistent mass and Neumann stiffness matrices assembled from their defining integrals, and .
Finite matrix exponential series and its identities: for a finite matrix , is differentiable with derivative and .
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.
The consistent mass entries are and the stiffness entries are for the three piecewise-linear nodal basis functions.
Proof
On an element , the two affine basis functions are and . Direct integration gives and their derivatives are and , so the element stiffness entries are . Assembling the two elements yields the displayed matrices: The Neumann condition is natural in this stiffness form and adds no boundary matrix.
Write and for the displayed integer matrices. Direct multiplication verifies Thus , so in particular . With , the ODE gives , whose first component is .
The linear field is globally Lipschitz. By [F1], solves the IVP, and [F2] makes it the unique solution. Since and by step 2.1, the right difference quotient is negative for all sufficiently small . Hence the consistent-mass P1 semidiscrete diffusion is not positivity preserving, despite the nonnegative initial nodal vector.
A Brusselator with a continuous Turing-unstable torus mode
Statement
Consider the Brusselator field
with diagonal diffusivity . Its homogeneous equilibrium is . On the one-dimensional torus of length , the continuous reaction-diffusion linearization has an unstable Fourier mode with wave number .
Facts & Assumptions
Given: The reaction field and diffusivities in the Statement, and the dispersion criterion of Two-species continuous and discrete dispersion criteria.
Two-species continuous and discrete dispersion criteria: for a mode with Laplacian eigenvalue , the linearized matrix is ; with negative trace, it has one positive eigenvalue when its determinant is negative.
The example uses , in the standard Brusselator .
Proof
Direct substitution gives . Differentiating the two components gives
The coefficient in the dispersion polynomial is and . Therefore
For the continuous torus mode , . This lies strictly between and , so step 2.1 gives . By [F1], the mode matrix has one positive eigenvalue and one negative eigenvalue. This example proves a linear mode instability only; it does not assert nonlinear pattern existence or stability.
A three-cell periodic grid suppresses the Brusselator's unstable continuous mode
Statement
Use the Brusselator and torus from A Brusselator with a continuous Turing-unstable torus mode, but discretize the torus by the periodic centered grid with . The continuous mode is unstable, while every mode of this three-node linearized grid is Hurwitz.
The diagram is schematic and not to scale; it records only the three cell indices and their periodic nearest-neighbor adjacency. The edge joining to is the wraparound face, and each edge is labeled by the physical periodic center spacing . For three cells the two distinct neighbors of each cell are the other two nodes. The eigenvalue calculation below uses the stencil formula, not the drawing.
Facts & Assumptions
Given: The Brusselator dispersion polynomial and continuous unstable band from A Brusselator with a continuous Turing-unstable torus mode, and the periodic grid symbol from Two-species continuous and discrete dispersion criteria.
A Brusselator with a continuous Turing-unstable torus mode: , the homogeneous Jacobian has negative trace and determinant , and the continuous torus has an eigenvalue in the unstable interval.
Two-species continuous and discrete dispersion criteria: for a three-node periodic grid on length , its Laplacian eigenvalues are for , and the mode matrix is Hurwitz when .
Proof
Here . The grid symbol gives and where the last inequality follows from , since .
At , the reaction Jacobian has trace and determinant , so it is Hurwitz by the two-dimensional criterion in [F2]. For , step 1.1 gives , so both factors in are negative and their product is positive. The mode trace is , so [F2] makes both modes Hurwitz. These are all three grid modes, even though the continuous mode in [F1] is unstable.
A forward-Euler Fisher–KPP reaction step preserves its interval under a sharp simple bound
Statement
Let and use the scalar Fisher–KPP reaction on , followed by exact no-flux TPFA diffusion with any diffusivity . For a nonnegative step , the forward-Euler reaction map preserves for every starting value exactly when ; after that step, exact no-flux TPFA diffusion also preserves the interval. For , on any finite grid with positive cell weights, the reaction strictly increases the discrete mass if at least one cell value lies in and leaves it unchanged if every cell value is a reaction equilibrium or . At the reaction map is the identity. This example makes no mass-conservation claim.
Facts & Assumptions
Given: The scalar reaction and rectangle in the Statement, the no-flux TPFA diffusion flow, and the Euler Lie update theorem.
No-flux TPFA diffusion generator: the no-flux TPFA diffusion generator is a finite conservative diffusion operator with positive cell weights.
Forward-Euler reaction followed by exact FV or periodic diffusion: the Euler Lie update applies at each cell before applying exact diffusion.
A bounded Euler-reaction Lie step preserves rectangles and mass balance: when the Euler reaction map preserves under its step restriction, exact TPFA diffusion preserves the same component interval.
The reaction equation is the scalar Fisher–KPP field with .
Proof
On , , so the field points inward at both endpoints. Also , giving the coordinate Lipschitz constant and Euler restriction .
For , set . The Euler value is , while because both factors are nonnegative. Thus the reaction step preserves .
If , choose with . Then , so the Euler map leaves . Together with step 2.1 this proves the stated necessary-and-sufficient bound for the reaction map.
The reaction map satisfies the hypothesis of [F3] by step 2.1; applying [F2] and then [F3] proves that the full TPFA Lie update also remains in . For a grid state with positive weights , its Euler reaction mass increment is . This is strictly positive for exactly when some , and is zero when every ; for it is zero for every state. Thus the mass claim in the Statement holds, and no mass-conservation claim is made.