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.
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.
Depends on
Used by
Dependency tree · two levels
5 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
- Luca Doria, Numerical Algorithms, lecture notes, Johannes Gutenberg-Universität Mainz, 2022 (standard reference, not scraped)