Discrete Dynamical Systems - Core Definitions

Discrete dynamical systems model evolution through iterated maps rather than continuous flows. These systems arise naturally in population biology, numerical methods, and Poincare sections of continuous systems. Despite their apparent simplicity, discrete maps exhibit the full richness of dynamical phenomena including chaos.

DefinitionIterated Map

A discrete dynamical system (or iterated map) is given by:

$x_{n+1} = f(x_n)$

where $f: X \to X$ is a map on a space $X$ (typically $\mathbb{R}$ , $\mathbb{R}^n$ , or a manifold). The orbit of $x_0$ is the sequence $\{x_0, x_1, x_2, \ldots\}$ where $x_n = f^n(x_0)$ , with $f^n$ denoting $n$ -fold composition.

Properties of the map $f$ determine the long-term behavior: convergence to fixed points, periodic cycles, quasi-periodic motion, or chaos.

Discrete systems compress the infinite detail of continuous evolution into snapshots at discrete times. This simplification often makes analysis tractable while preserving essential dynamics. The stroboscopic view reveals patterns obscured in continuous flows, much like freeze-frame photography captures motion invisible to the naked eye.

DefinitionFixed Points and Periodic Orbits

A point $x^*$ is a fixed point of $f$ if $f(x^*) = x^*$ . It is attracting (or stable) if $|f'(x^*)| < 1$ , repelling (or unstable) if $|f'(x^*)| > 1$ , and neutral if $|f'(x^*)| = 1$ .

A point $p$ is periodic of period $n$ if $f^n(p) = p$ but $f^k(p) \neq p$ for $0 < k < n$ . The set $\{p, f(p), \ldots, f^{n-1}(p)\}$ forms a periodic cycle. Stability is determined by the multiplier $\lambda = (f^n)'(p) = \prod_{i=0}^{n-1} f'(f^i(p))$ .

Periodic orbits are fixed points of the $n$ -fold iterate $f^n$ . The chain rule for derivatives yields the multiplier as the product of derivatives around the cycle. This stability criterion generalizes one-dimensional analysis to arbitrary dimensions through eigenvalues of the derivative matrix.

DefinitionBifurcations in Maps

As parameters vary, discrete maps undergo bifurcations similar to continuous flows, but with important differences:

Saddle-node bifurcation: Pairs of fixed points (or periodic orbits) collide and annihilate
Period-doubling (flip) bifurcation: A multiplier passes through $-1$ , creating a period-2 orbit
Neimark-Sacker bifurcation: Complex multipliers cross the unit circle, creating an invariant curve

The period-doubling route to chaos, prominent in discrete maps, has no direct analog in continuous two-dimensional flows.

ExampleLogistic Map Revisited

The logistic map $x_{n+1} = \mu x_n(1 - x_n)$ on $[0,1]$ epitomizes discrete dynamics:

For $\mu \in (0,1)$ : $x^* = 0$ is globally attracting
For $\mu \in (1, 3)$ : $x^* = 1 - 1/\mu$ is stable
For $\mu \in (3, 1+\sqrt{6})$ : stable period-2 orbit
For $\mu > \mu_\infty \approx 3.569946$ : chaotic behavior emerges

The period-doubling cascade $(1 \to 2 \to 4 \to 8 \to \cdots)$ accumulates at $\mu_\infty$ , beyond which chaos and periodic windows alternate in a complex pattern.

Remark

Discrete maps serve dual purposes: modeling inherently discrete processes (annual plant populations, digital signal processing) and analyzing continuous systems via Poincare sections. The Poincare map transforms a continuous flow to a discrete map on a lower-dimensional cross-section, enabling application of one-dimensional techniques to higher-dimensional problems. This reduction is particularly powerful for studying limit cycles and their bifurcations.

Understanding discrete dynamics provides a bridge between continuous analysis and computational methods. Numerical integration of differential equations effectively creates discrete maps (numerical schemes), so discrete dynamics insights inform both theoretical understanding and practical computation. The interplay between continuous and discrete perspectives enriches both, revealing universal patterns transcending the continuous-discrete divide.