Introduction to Dynamical Systems

Introduction

Dynamical systems theory studies how states evolve over time under fixed rules. The rules may be discrete (iterated maps) or continuous (differential equations). The main goals are qualitative: long-term behavior, stability, sensitivity to initial conditions, and structural changes as parameters vary.

Core questions:

  • Where do trajectories go?

  • Are equilibria stable?

  • How do behaviors change with parameters?

  • Can deterministic rules produce unpredictable motion?

Discrete and Continuous Systems

Discrete system:

xn+1=f⁡(xn) x sub n plus 1 equals f of open paren x sub n close paren

Continuous system:

dxdt=F⁡(x) d x over d t equals F of x

The state space X⊆Rn X subset of or equal to R to the n-th power contains all possible configurations. Dynamics define a flow (continuous time) or iteration (discrete time).

Fixed Points

A fixed point x∗ x raised to the asterisk power satisfies:

  • Discrete: f⁡(x∗)=x∗ f of open paren x raised to the asterisk power close paren equals x raised to the asterisk power

  • Continuous: F⁡(x∗)=0 F of open paren x raised to the asterisk power close paren equals 0

These represent equilibria.

Logistic Map Example

f⁡(x)=r⁢x⁢(1−x) f of x equals r x times open paren 1 minus x close paren

Fixed points solve:

r⁢x∗⁢(1−x∗)=x∗ r x raised to the asterisk power times open paren 1 minus x raised to the asterisk power close paren equals x raised to the asterisk power

Solutions:

x∗=0,x∗=1−1r⁢(r>1) x raised to the asterisk power equals 0 comma x raised to the asterisk power equals 1 minus 1 over r times open paren r is greater than 1 close paren

Stability

A fixed point is:

  • Stable if nearby states remain nearby.

  • Asymptotically stable if nearby states converge to it.

  • Unstable if perturbations grow.

Linear Stability

Linearize near x∗ x raised to the asterisk power.

For continuous systems:

J=D⁢F⁡(x∗) J equals D F of open paren x raised to the asterisk power close paren

Asymptotically stable if all eigenvalues of J J have negative real part.

For discrete systems:

Stable if all eigenvalues of D⁢f⁡(x∗) D f of open paren x raised to the asterisk power close paren satisfy: |λ|<1 the absolute value of lamda is less than 1

One-Dimensional Case

Continuous:

f′⁢(x∗)<0 f prime times open paren x raised to the asterisk power close paren is less than 0 ⇒ right double arrow stable, f′⁢(x∗)>0 f prime times open paren x raised to the asterisk power close paren is greater than 0 ⇒ right double arrow unstable

Discrete:

|f′⁢(x∗)|<1⇒ the absolute value of f prime times open paren x raised to the asterisk power close paren is less than 1 right double arrow stable

Orbits and Attractors

Orbit:

  • Discrete: {x0,x1,x2,…} the set x sub 0 comma x sub 1 comma x sub 2 comma dot dot dot

  • Continuous: trajectory curve

Attractor: a set that attracts nearby trajectories.

Types:

  • Fixed point

  • Periodic orbit (limit cycle)

  • Strange attractor

Basin of attraction: set of initial conditions converging to an attractor.

Periodic Orbits

Discrete:

f⁡(x∗)n=x∗ f of open paren x raised to the asterisk power close paren to the n-th power equals x raised to the asterisk power with minimal period n n.

Continuous:

Closed attracting orbit = equals limit cycle.

Bifurcations

Qualitative change as parameter varies.

Saddle-Node

x˙=r+x2 x dot above equals r plus x squared

Two equilibria merge and disappear.

Transcritical

x˙=r⁢x−x2 x dot above equals r x minus x squared

Fixed points exchange stability.

Pitchfork

x˙=r⁢x−x3 x dot above equals r x minus x cubed

One equilibrium splits into two.

Hopf

Complex eigenvalues cross imaginary axis → right arrow limit cycle emerges.

Period-Doubling

Orbit of period n n replaced by one of period 2⁢n 2 n. Common route to chaos.

Chaos

Deterministic but unpredictable due to sensitive dependence on initial conditions. Small perturbations grow exponentially.

Lyapunov Exponent

δ⁡(t)≈δ0⁢eλ⁢t delta of t almost equals delta sub 0 e raised to the lamda t power

If largest λ>0 lamda is greater than 0, system is chaotic.

Logistic Map

For r≳3.57 r is greater than or equivalent to 3.57, chaotic behavior appears via period-doubling cascade.

Feigenbaum Constant

Ratio of successive period-doubling intervals:

δ≈4.669 delta almost equals 4.669

Universal across many systems.

Phase Space

Each point = equals full system state.

Flow: ϕt⁡(x0) phi sub t of open paren x sub 0 close paren

Phase portraits visualize trajectories.

Poincaré–Bendixson (2 2D continuous systems):

  • Only fixed points and limit cycles possible.

  • No chaos in 2 2D autonomous flows.

Conservative vs Dissipative Systems

Conservative:

  • Preserve phase volume (Liouville’s theorem).

  • Example: Hamiltonian mechanics.

Dissipative:

  • Contract volume.

  • Allow attractors of lower dimension.

Divergence test:

∇⋅F<0⇒ nabla times F is less than 0 right double arrow volume contraction

Symbolic Dynamics

Encode trajectories as symbol sequences based on region visits.

Shift map on sequences provides a canonical chaotic model.

Symbolic representations simplify proofs and reveal topological structure.

Applications

  • Population dynamics

  • Climate models

  • Control systems

  • Financial markets

  • Neural networks

Summary

Dynamical systems describe time evolution via maps or differential equations.

Key structures:

  • Fixed points

  • Stability via eigenvalues

  • Periodic orbits

  • Bifurcations

  • Chaos

Linearization determines local behavior. Bifurcations mark structural change. Positive Lyapunov exponents signal chaos.

The theory provides a unified language for understanding complex time-dependent behavior across disciplines.