Chaos (source code)

= Chaos

= Chaotic
{synonym}

= Chaotic dynamics
{synonym}

<Chaos> describes sustained irregular behaviour in a deterministic <dynamical system>, with precise definitions emphasizing different features. <Deterministic evolution> fixes the future from an exact <initial condition>; <sensitive dependence on initial conditions> concerns what happens when that condition is changed by a small amount. These are compatible properties.

For a continuous map on an <invariant set>, <Devaney chaos> requires <topological transitivity>, dense <periodic points> and <sensitive dependence on initial conditions>. The invariant set and its <topology> are part of the claim. Other conventions use properties of an invariant <probability measure> or numerical <Lyapunov exponents>; those conventions are not universally equivalent.

A positive largest <Lyapunov exponent> indicates exponential separation along a trajectory, but alone does not prove every topological definition of <chaos>. For example, the map $f(x)=x^2$ has the <fixed point> $x=1$, with <derivative> two and <Lyapunov exponent> $\log2$. The orbit stays at one forever. On the singleton invariant set $\{1\}$ there are no distinct nearby states to separate, and the restricted system is not sensitive. Expansion transverse to a chosen invariant set must not be confused with complicated motion within it.

Numerical evidence should therefore specify the map or <vector field>, the <bifurcation parameter>, the relevant <invariant set> and the property actually measured. A visually irregular <phase portrait> can motivate a claim, while a proof must establish the chosen definition.