Overview
An orbit records which states a deterministic system visits from a specified initial state. The same rule may produce a fixed state, a repeating cycle, or an infinite collection of distinct states. Orbit language separates this elementary iteration from later questions about convergence, recurrence, density and statistical behavior.
An orbit is a set of visited states. The indexed trajectory retains their visiting times as well, so it carries information that the set alone suppresses.
Prerequisites
Start with a set and a self-map . Define to be the identity and . The exponent denotes repeated composition: , not the square of . Continuity and a metric are needed only when discussing closures and limits below.
Definition and conventions
The forward orbit of is
Here includes zero, so the initial state belongs to its orbit. If is bijective, define negative iterates using its inverse and the full orbit by . For a noninvertible map, a backward trajectory may have several choices or no continuation; a single inverse map is unavailable.
For a globally defined flow , replace integer time by real time: the full orbit uses and the forward orbit uses . A solution of an equation defined only on a limited time interval requires its own domain convention.
Intuition
Starting from discards the first step of the trajectory. Consequently, , but equality can fail. This is forward invariance, rather than a guarantee that every visited state has a predecessor within the forward orbit.
Full orbits of an invertible map behave differently: moving the starting point along its orbit changes only the time origin. They partition because the relation for some integer is reflexive, symmetric and transitive.
Examples and non-examples
For on , the forward orbit of is . Its closure also contains zero, while its omega-limit set consists only of zero: these are the limits approached along times tending to infinity. Zero is never visited from . The full orbit is because this map is invertible on .
The phase space matters. Restrict the same formula to and it is no longer surjective, so it has no inverse self-map of that interval.
For a finite example, take with , , , and . The forward orbit of is . It is finite, but is not periodic: it never returns. The cycle has least period two, and has a transient step before reaching it. This refutes the implication “finite forward orbit means periodic initial point” for arbitrary self-maps.
Important properties
A point is periodic if for some positive integer . Its least such is its least period, and its forward orbit contains exactly points.
More generally, a forward orbit is finite exactly when the trajectory is eventually periodic. Proof sketch: finiteness forces for some . Applying further iterates gives repetition with period after time . Conversely, a finite transient segment followed by a repeating segment visits finitely many states. If is invertible, applying cancels the transient segment and proves periodicity of itself.
For continuous on a metric space, the closure of a forward orbit is forward invariant. Indeed, if is a limit of visited states, continuity makes a limit of their successors. This argument explains why an orbit closure is often a useful state space even when the orbit is not closed.
Connections and further reading
Discrete forward orbits are countable, but continuous-time orbits need not be. A dense orbit is one whose closure fills the phase space; topological transitivity investigates closely related open-set connections. Poincaré recurrence instead concerns returns to measurable regions, using an invariant measure. Neither an orbit's mere infinitude nor its countability settles those questions.
Read Bullett, Chapter 2, pp.1–2 for periodicity conventions and Sarig, §1.1 for the wider orbit viewpoint.