Iterated Maps

Studies discrete iterations, fixed points, stability, and bifurcations through nonlinear maps.

Conceptual context

An iterated map describes how a discrete system moves from one state to the next through a repeated rule. Even a simple formula can generate convergence, oscillation, bifurcation, or aperiodic behavior. The key ingredients are the shape of $f$, the value of $r$, and the local sensitivity expressed by $f'(x_n)$. Analysis goes beyond calculating $x_{n+1}$: it finds $x*$, evaluates $f'(x*)$, studies $|f'(x*)|$, and observes how $x_n$ changes as $n$ grows. A local rule therefore produces a global dynamical structure.

🟢 Essential level

An iterated map takes $x_n$ and produces $x_{n+1}$. That result becomes the next input, and the process repeats. The sequence starts from $x_0$ and generates $x_n$ after many applications. If the orbit approaches one value, an attracting $x*$ appears. If it alternates among several values, periodic behavior develops. If nearby initial states separate rapidly, the behavior may be chaotic. $r$ changes the shape of $f$ and may switch the regime. $f'(x_n)$ indicates whether nearby states locally approach or separate. At a $x*$, $|f'(x*)|$ determines linear stability. A negative slope does not automatically mean instability because it may produce alternating contraction. The map graph, identity line, and cobweb display each update and distinguish transient motion, attraction, and repulsion.

This repeated feedback is the essential mechanism. To tell each case apart it helps to discard the initial transient, run enough steps, and compare orbits that start very close together, since these graphical tools reveal attraction, alternation, and repulsion before the formal stability criterion is introduced below.

🔵 Formal level

Basic formulas

The general discrete evolution is written as:

General iterative rule

The logistic map is a canonical model of growth with saturation:

Logistic map

A $x*$ must reproduce itself under the rule:

Fixed-point condition

Local sensitivity is obtained from the map derivative:

Map derivative

Real student questions

Does every fixed point attract? No. A fixed point may exist and be unstable.

Does a negative slope mean chaos? No. It may indicate stable alternation when $|f'(x*)|$ is below one.

How many iterations are enough? It depends on the transient and proximity to bifurcations.

Is an irregular sequence automatically chaotic? No. It may be transient, long-periodic, or numerical.

Why use the identity line? Its intersections with the map identify self-reproducing states.

Is iteration number physical time? Only when the model assigns a physical duration to each update.

Final synthesis

The iterative rule determines evolution, while its slope organizes local stability. $r$ can transform a fixed point into cycles or aperiodic behavior. Reliable analysis combines domain, transient removal, graph reading, $|f'(x*)|$, and orbit comparison.