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:

(x_n+1)=f((x_n))

Continuous system:

d(x)/d(t)=F(x)

The state space X⊆Rn contains all possible configurations. Dynamics define a flow (continuous time) or iteration (discrete time).

Fixed Points

A fixed point (x^∗) satisfies:

• Discrete: f((x^∗))=(x^∗)

• Continuous: F((x^∗))=0

These represent equilibria.

Logistic Map Example

f(x)=r*x*(1−x)

Fixed points solve:

r*(x^∗)*(1−(x^∗))=(x^∗)

Solutions:

(x^∗)=0,(x^∗)=1−1/r*(r>1)

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^∗).

For continuous systems:

J=D*F((x^∗))

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

For discrete systems:

Stable if all eigenvalues of D*f((x^∗)) satisfy: |λ|<1

One-Dimensional Case

Continuous:

f′*((x^∗))<0 ⇒ stable, f′*((x^∗))>0 ⇒ unstable

Discrete:

|f′*((x^∗))|<1⇒ stable

Orbits and Attractors

Orbit:

• Discrete: {(x_0),(x_1),(x_2),…}

• 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^∗) with minimal period n.

Continuous:

Closed attracting orbit = limit cycle.

Bifurcations

Qualitative change as parameter varies.

Saddle-Node

x=r+x2

Two equilibria merge and disappear.

Transcritical

x=r*x−x2

Fixed points exchange stability.

Pitchfork

x=r*x−x3

One equilibrium splits into two.

Hopf

Complex eigenvalues cross imaginary axis → limit cycle emerges.

Period-Doubling

Orbit of period n replaced by one of period 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)

If largest λ>0, system is chaotic.

Logistic Map

For r≳3.57, chaotic behavior appears via period-doubling cascade.

Feigenbaum Constant

Ratio of successive period-doubling intervals:

δ≈4.669

Universal across many systems.

Phase Space

Each point = full system state.

Flow: (ϕ_t)((x_0))

Phase portraits visualize trajectories.

Poincaré–Bendixson (2D continuous systems):

• Only fixed points and limit cycles possible.

• No chaos in 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⇒ 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.