Iterated function

Content sourced from Wikipedia, licensed under CC BY-SA 3.0.

Understanding Iterated Functions (a simple guide)

What is an iterated function?
- An iterated function is applying the same function over and over. If f is a function from a set X to itself, you can apply f once, twice, three times, and so on.
- The n-th iterate, written f^n, is defined by f^0 = the identity on X, and f^{n+1} = f ∘ f^n (apply f to the result of f^n).
- The sequence x, f(x), f^2(x), … is called the orbit of x.

Fixed points, cycles, and orbits
- A fixed point is a point x with f(x) = x.
- If f^m(x) = x for some m > 0, x has period m; the smallest such m is the period. When m = 1, x is a fixed point.
- The set of all fixed points is Fix(f).
- Orbits help us see long-term behavior: do points settle down, wander, or do something else?

How orbits behave
- Attracting fixed points pull nearby points toward themselves; unstable fixed points push points away.
- The long-term behavior can be a single limit point, several limit points, or more complex sets (like the omega-limit set).
- If you think about distributions of points (instead of individual points), iteration can lead to a steady distribution called an invariant measure.

Topological conjugacy and simplifying iteration
- If two functions f and g are topologically conjugate, there is a change of coordinates h such that g = h^{-1} ∘ f ∘ h.
- The iterates of f and g correspond under h, so solving one system helps you solve the other.
- A classic example: the tent map and the logistic map are topologically conjugate.

Fractional and continuous iteration
- You can ask for fractional iterates, like f^{1/2}, a function whose self-composition gives f (g ∘ g = f). These are not always unique, but they exist in many cases.
- When f is linear, such as f(x) = Cx + D, you can often write a closed form for f^n. For example, with a fixed point a = D/(1 − C),
f^n(x) = a + (x − a) C^n = (D/(1 − C)) + (x − D/(1 − C)) C^n.
- Negative iterates exist when f is bijective and relate to applying inverses.

A few practical notes
- Many iterated functions do not have simple closed-form expressions for f^n. In such cases, researchers study their behavior using ideas from dynamical systems, chaos, and related tools.
- Fractional and continuous iteration lead to the idea of a flow, where the iteration count n acts like a continuous time parameter.
- Some classic examples involve chaotic behavior, while others are well-behaved or linearizable near fixed points.

Where iterated functions appear
- They are central in dynamical systems, fractals, and chaos theory.
- They show up in computer science (recursive algorithms), physics (flows and renormalization), and various mathematical models.
- Notable concepts include fixed points, periodic points, conjugacy, and invariant measures, all used to understand long-term behavior under repeated application of a function.