📖 Definition: Chaos

🗒️ Note: SIC means that neighbouring orbits separate exponentially fast on average


Goal: lets try to measure the sensitivity on initial conditions of a map


💃 Example: Suppose $f$ has a stable $p$-cycle containing the point $x_0$, Show that the Lyapunov exponent $\lambda <0.$ If the cycle is super stable show that $\lambda \to -\infin$

  1. From the question we know

  2. $p$ term keeps appearing in the infinite sum so we can re-write $\lambda$ as

    $$ \lambda = \lim_{n\to \infin} \left [ \frac 1n \sum^{n-1}{i=0} \ln \left | f'(x_i) \right | \right ]= \frac 1p \sum^{p-1}{i=0} \ln |f'(x_i )| $$

  3. Now we use our second condition to to rewrite it as

    $$ \lambda = \frac 1p\sum^{p-1}_{i=0}\ln |f'(x_i)|=\frac 1p \ln |(f^{(p)})'(x_0)|<0 $$

    This is the first part of the question completed

  4. For the second part we care about the cycle being super stable ie $|(f^{(p)})'(x_0)|=0$ thus

    $$ \lambda = \frac{1}{p}\ln(0)\to -\infin $$

    Second part of question completed

Numerical computation of the Lyapunov exponent

🖥️ Algorithm

  1. Choose $x_0$
  2. Calculate $N\gg 1$ iterates ($N\sim 10^4$)
  3. Neglect the transients before the the iterations reach the attractor ($n_T\sim300$)
  4. Calculate your exponent $\lambda = \frac 1n \sum^{N}_{n=n_T}\ln |f'(x_n)|$
  5. Update $x_0$ and repeat

🗒️ Note: while this looks and is very computational intense modern computers can easy handle it