1 Basic definition

A periodic point is a point that returns to itself after repeated application of a function or transformation. If a map is iterated and the point comes back to its starting value after a positive number of steps, the point is said to be periodic. Periodic points are central in dynamical systems because they reveal repeating patterns in otherwise complicated motion.

1.1 Iterated functions

Given a function \(f\), one may apply it repeatedly to a point \(x\). The first image is \(f(x)\), the second is \(f(f(x))\), and so on. The result of applying \(f\) a total of \(n\) times is written \(f^n(x)\). A periodic point is one for which some iterate \(f^n(x)\) equals \(x\) again.

1.2 Periodic points and orbits

The orbit of a point is the collection of values produced by repeated iteration. For a periodic point, the orbit eventually repeats exactly, forming a finite loop. In many settings, periodic points are studied together with the entire orbit they generate.

1.2.1 Period

The period of a periodic point is the smallest positive integer \(n\) such that \(f^n(x)=x\). This number measures the length of the repeating cycle. A point with period 1 is fixed; a point with period 2 alternates between two values.

1.2.2 Orbit length

For a periodic point, the orbit length is the number of distinct points visited before the pattern repeats. In standard finite cycles, the orbit length equals the period. When a point is part of a larger orbit description that includes repeated representations, care is taken to distinguish the number of distinct states from the number of iterations needed to return.

1.3 Fixed points as period-one points

A fixed point satisfies \(f(x)=x\). Such a point is periodic with period 1, so fixed points are the simplest periodic points. They often serve as the starting point for analyzing more complicated cycles, stability, and nearby dynamics.

2 Examples

Periodic points appear in many kinds of maps, from simple real functions to transformations on finite sets. Some examples are easy to compute explicitly, while others arise as solutions of polynomial or transcendental equations.

2.1 Real-valued maps

For the map \(f(x)=1-x\), every point has period 2, because applying the map twice returns the original value. For \(f(x)=x^2\) on suitable domains, the fixed points \(x=0\) and \(x=1\) are periodic of period 1. Such examples show how simple formulas can produce different periodic structures.

2.2 Polynomial maps

Polynomial iteration gives many classical examples of periodic points. For instance, the map \(f(x)=x^2-1\) has fixed points and points of higher period depending on the algebraic solutions of \(f^n(x)=x\). In complex dynamics, polynomial maps are especially important because their periodic points strongly influence global behavior.

2.3 Rational and transcendental maps

Rational maps, formed from ratios of polynomials, can have rich periodic point structures. Transcendental maps such as exponential-type functions may also possess periodic orbits, though their analysis can be more subtle. In these cases, periodic points may be isolated, accumulate in complicated ways, or interact with singularities of the map.

2.4 Dynamical systems on finite sets

On a finite set, every orbit eventually repeats because only finitely many states exist. A periodic point in this context lies on a cycle of the directed graph associated with the map. Such systems are common in computer science, combinatorics, and discrete models, where periodic behavior can be listed exhaustively.

3 Classification of periodic points

Periodic points are classified according to how they repeat and how they relate to other points in the orbit structure. These distinctions help organize the dynamics into cycles, transient behavior, and nested recurrence.

3.1 Exact period

A point has exact period \(n\) if \(n\) is the smallest positive integer with \(f^n(x)=x\). Exact period distinguishes genuine \(n\)-cycles from points that return earlier. This notion is important in counting problems and in the study of orbit structure.

3.2 Preperiodic points

A preperiodic point is not itself periodic, but after finitely many iterations it lands on a periodic cycle. Such points form the transient part of an orbit. They are often called eventually periodic points, since the orbit becomes periodic after a finite initial segment.

3.3 Prime period

The prime period of a periodic point is another term for its minimal positive period. The word “prime” here does not mean prime number; it means fundamental or basic. Prime period is used to emphasize that no smaller positive iterate returns the point to itself.

3.4 Cycles and periodic orbits

A periodic orbit, or cycle, is the finite set of points visited by a periodic point under iteration. Each point in the cycle has the same period. Cycles can be represented as closed chains, making them convenient objects for both theoretical analysis and computation.

4 Local behavior

The local behavior of a periodic point describes what happens to nearby points under repeated iteration. A periodic orbit may attract nearby trajectories, repel them, or behave neutrally depending on the derivative or linearized map.

4.1 Stability of periodic points

Stability concerns whether nearby points move toward or away from a periodic orbit under iteration. Stable periodic points persist under small perturbations of initial conditions, while unstable ones quickly lose nearby orbits. This distinction is fundamental in the analysis of long-term dynamics.

4.1.1 Attracting periodic points

An attracting periodic point pulls nearby points toward its orbit. Iterates of close initial conditions converge to the cycle as time progresses. Attracting cycles are often visible in numerical experiments because they dominate the local dynamics.

4.1.2 Repelling periodic points

A repelling periodic point pushes nearby points away under iteration. Small differences in initial conditions grow, so nearby orbits separate from the cycle. Repelling cycles are common in chaotic systems and play an important role in organizing global structure.

4.1.3 Neutral periodic points

A neutral periodic point is neither clearly attracting nor repelling. Nearby points may neither converge rapidly nor diverge quickly, and the local behavior can be delicate. Neutral cycles often require more refined analysis than hyperbolic ones.

4.2 Multipliers

The multiplier of a periodic point is the derivative of the appropriate iterate evaluated at the point, or more generally the eigenvalues of the linearized return map. It measures local expansion or contraction around the cycle. In one-dimensional settings, the magnitude of the multiplier helps determine whether the cycle is attracting, repelling, or neutral.

4.3 Linearization near periodic points

Linearization replaces the map near a periodic point with its best linear approximation. This simplification makes the local dynamics easier to study, especially near hyperbolic cycles. When linearization is valid, it can reveal whether the orbit behaves like a contraction, an expansion, or a rotation near the cycle.

5 Counting periodic points

Counting periodic points is a major theme in dynamical systems. One seeks formulas, asymptotic estimates, or generating functions that describe how many cycles or points of a given period exist.

5.1 Periodic point equations

Periodic points of period dividing \(n\) satisfy the equation \(f^n(x)=x\). Solving this equation often produces many candidates, some of which have smaller exact period. To count exact-period points, one typically removes contributions from lower periods.

5.2 Number of points of a given period

The number of periodic points of a fixed period may be finite or infinite, depending on the map and space. In symbolic and finite systems, these numbers can sometimes be computed directly. In complex or higher-dimensional settings, they may grow rapidly with the period.

5.3 Dynamical zeta functions

Dynamical zeta functions encode periodic orbit counts in a generating-function-like form. They package information about cycles of different lengths into a single analytic object. Such functions are useful for studying orbit growth, entropy, and related invariants.

6 Periodic points in complex dynamics

Complex dynamics studies iteration of holomorphic maps, especially rational and polynomial functions on the complex plane or Riemann sphere. Periodic points are among the main tools for understanding the geometry and fine structure of these systems.

6.1 Iteration of holomorphic maps

For holomorphic maps, periodic points arise from equations involving iterates of complex functions. Their multipliers and stability can often be studied using complex analytic methods. The distribution of periodic points reflects both local analytic behavior and global dynamical structure.

6.2 Julia sets and periodic points

Periodic points are closely connected to Julia sets, which describe the boundary between regular and chaotic behavior in complex dynamics. Repelling periodic points are often dense in the Julia set for many classical maps. This density makes periodic points a key diagnostic of chaotic regions.

6.3 Fatou components

Fatou components are regions where the iterates behave in a stable and regular manner. Periodic points may lie inside attracting or neutral components, where nearby points exhibit coherent long-term motion. The relationship between periodic orbits and Fatou components helps organize the global decomposition of the plane.

6.4 Bifurcations of periodic orbits

As a parameter changes in a family of complex maps, periodic orbits may appear, disappear, split, or change stability. These changes are called bifurcations. They are central to parameter-space studies, where the behavior of periodic points marks transitions between different dynamical regimes.

7 Periodic points in topological dynamics

Topological dynamics studies iteration on topological spaces, often focusing on continuity rather than differentiability. Periodic points provide a bridge between local recurrence and the global geometry of the system.

7.1 Periodic orbits in compact spaces

In compact spaces, periodic orbits are often easier to control because sequences of iterates have accumulation properties. Continuous maps on compact spaces can exhibit a wide variety of cycle structures. Periodic orbits are frequently used to compare systems and classify their complexity.

7.2 Dense periodic points

A system has dense periodic points when periodic points are dense in the space. This means every open region contains periodic behavior. Dense periodic points are often associated with rich and complicated dynamics, especially in systems that also show sensitivity to initial conditions.

7.3 The role of periodic points in chaos

Periodic points are often viewed as signatures of chaos. In many chaotic systems, one finds infinitely many periodic orbits of various lengths, together with strong mixing and sensitive dependence on initial conditions. Periodic orbits can organize the chaotic set and provide a scaffold for understanding the dynamics.

Several related notions extend or refine the idea of a periodic point. These concepts describe nearby recurrence, symbolic patterns, and return behavior in more general settings.

8.1 Preperiodic and eventually periodic points

Preperiodic points eventually land on a periodic cycle after a transient phase. The term eventually periodic is often used interchangeably with preperiodic. Such points are common in discrete systems, where orbits may stabilize into repeating loops after some initial motion.

8.2 Recurrent points

A recurrent point returns arbitrarily close to itself under iteration, though not necessarily exactly to its original position. Periodic points are recurrent, but not all recurrent points are periodic. Recurrence is therefore a broader concept that captures approximate return rather than exact repetition.

8.3 Minimal periods and return maps

The minimal period is the smallest positive return time for a periodic point. Return maps record how a system revisits a selected region and are often used to detect periodic structure. These tools are useful in reducing complex dynamics to more manageable subsystems.

8.4 Periodic sequences and symbolic dynamics

In symbolic dynamics, trajectories are represented by sequences of symbols, and periodic points correspond to repeating symbol blocks. This representation makes cycles easy to encode and analyze combinatorially. Periodic sequences provide a simplified model for more complicated dynamical systems.