Math 2.0

Partial differential equations Definition

Turing pattern

Builds on Reaction–diffusion systemJacobian matrixEigenvalueLaplacian

Definition

Let m≥2m \ge 2, let DD be a diagonal m×mm \times m matrix with positive diagonal entries, and let f ⁣:ℝm→ℝmf \colon \R^m \to \R^m be smooth. Consider the reaction–diffusion system ∂tu=DΔu+f(u)\partial_t u = D \Delta u + f(u) for u ⁣:ℝn×[0,∞)→ℝmu \colon \R^n \times [0, \infty) \to \R^m, where Δ\Delta is the Laplacian. Let u∗∈ℝmu^* \in \R^m satisfy f(u∗)=0f(u^*) = 0 and let JJ be the Jacobian matrix of ff at u∗u^*. The uniform state u∗u^* is Turing unstable, or has a diffusion-driven instability, if:

  1. every eigenvalue of JJ has negative real part, so u∗u^* is stable without diffusion;
  2. there is k>0k > 0 such that J−k2DJ - k^2 D has an eigenvalue with positive real part.

A Turing pattern is a stationary, spatially non-constant solution near u∗u^* that bifurcates from a Turing unstable uniform state. It is typically periodic, with a wave number kk as in clause 2.

Remarks

The perturbation u=u∗+eλteiq⋅xwu = u^* + e^{\lambda t} e^{i q \cdot x} w with a wave vector q∈ℝnq \in \R^n, ∣q∣=k\abs{q} = k, solves the linearised system exactly when λ\lambda is an eigenvalue of J−k2DJ - k^2 D with eigenvector ww, which explains clause 2. Example: m=2m = 2, J=(1−13−2)J = \begin{pmatrix} 1 & -1 \\ 3 & -2 \end{pmatrix}, D=diag⁡(1,10)D = \operatorname{diag}(1, 10). Then tr⁡J=−1<0\tr J = -1 < 0 and det⁡J=1>0\det J = 1 > 0, so clause 1 holds. For k2=0.3k^2 = 0.3, det⁡(J−k2D)=(0.7)(−5)+3=−0.5<0\det(J - k^2 D) = (0.7)(-5) + 3 = -0.5 < 0, so J−k2DJ - k^2 D has a positive real eigenvalue and clause 2 holds. Non-example: if DD is a multiple dId I of the identity, the eigenvalues of J−k2DJ - k^2 D are those of JJ shifted by −dk2-d k^2, so clause 2 fails whenever clause 1 holds. For m=2m = 2, a necessary condition is that the two diffusion coefficients differ.

Reading path

To understand this page from the ground up, read these 15 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Eigenvalue concept
  2. Euclidean space object
  3. Function concept
  4. Reaction–diffusion system concept
  5. Total derivative concept
  6. Function of several variables concept
  7. Vector-valued function concept
  8. Differentiable function of several variables concept
  9. Partial derivative concept
  10. Vector field concept
  11. Gradient concept
  12. Jacobian matrix concept
  13. Divergence concept
  14. Laplacian concept
  15. Turing pattern definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Turing_pattern
About this page
TagKSA55H8Q8N
URIm2://KSA55H8Q8N
Kinddefinition
WritingW0 stub
MSC35B36, 35K57, 92C15
DefinesTuring pattern
UsesReaction–diffusion system, Jacobian matrix, Eigenvalue, Laplacian
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.