lacunary - Mathnotes

Discrete Time Dynamical Systems

We'll go over systems in which time is discrete rather than continuous. These systems are called difference equations, @recursion-relations, iterated maps, or simply maps. These can be interesting; even in one dimension they can exhibit oscillations and chaos.

Definition: Difference equation \@{difference-equation}

A difference equation has the general form

xn+1=f(xn,n),

where n is a time-like variable, f and xn may be vectors, n=0,1,2,⋯=N0.

Referenced by (1 direct)

Solutions to difference equations are sequences (x0,x1,...,xn). If x0 is the initial condition, then

x1=f(x0,0)x2=f(x1,0)⋮xn=f(xn−1,0)

So the solution is (x1,x2,…,xn). Long term dynamics are given by moving along this sequence as n→∞.

We will consider ourselves, for now, with @autonomous-systems where there is no explicit dependence on n, i.e.

xn+1=f(xn).

So xn∈RN and f:RN→RN.

Example: xn+1=−xn. If we start with x0, then x1=−x0,x2=−x1=−(−x0)=x0,dots so the solution is the sequence

x=(x0,−x0,x0,−x0,…).

Orbits and Fixed Points

Definition: orbit (also: solution) \@{orbit}

A sequence (x0,x1,x2,…) is called the orbit (or solution) starting from x0. This is analogous to a trajectory in a continuous time dynamical system.

A fixed point in a DTDS is a point whose further iteration does not change, i.e. xn+1=xn. Fixed points satisfy

x∗=f(x∗).

Stability of Linear Maps

Consider

xn+1=λxn,λ∈R.

Starting with x0, x1=λx0,x2=λx1=λ(λx0)=λ2x0,…, so our general solution is

xn=λnx0.

Fixed points satisfy x∗=f(x∗)⟹x∗=λx∗⟹x∗(λ−1)=0. Therefore, x∗=0 is always a fixed point, and if lambda=1, then every x∗∈R is a fixed point, i.e. the map is just xn+1=xn.

Given that x∗=0 is always a fixed point of a linear map, we'll consider different cases of the value of λ and how it impacts the stability of x∗.

If λ>1, then λn→∞ as n→∞. Thus, xn grows without bound and x∗=0 is unstable.

If 0<λ<1, then λn→0 as n→∞. Thus, xn→0 and keeps the same sign. Hence, x∗=0 is stable.

If λ=0, then xn=0 for all n≥1. Hence x∗=0 is stable.

If −1<λ<0, then |λ|n→0 as n→∞, but xn alternates sign (oscillates.) Hence, x∗=0 is stable.

If λ<−1, then |λ|n→∞ as n→∞, and xn oscillates with increasing magnitude. Hence x∗=0 is unstable.

If λ=−1, then xn=(−1)nx0, so the solution alternates between x0 and −x0. The fixed point x∗=0 is unstable.

If λ=1, then xn=x0 for all n, so every point is a stable fixed point.

In summary, if |λ|<1, then x∗=0 is stable. if |λ|>1, then x∗=0 is unstable.