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 XX and a self-map T:X→XT:X\to X. Define T0T^0 to be the identity and Tn+1=T∘TnT^{n+1}=T\circ T^n. The exponent denotes repeated composition: T2(x)=T(T(x))T^2(x)=T(T(x)), not the square of T(x)T(x). Continuity and a metric are needed only when discussing closures and limits below.

Definition and conventions

The forward orbit of x∈Xx\in X is

O+(x)={Tn(x):n∈N}.\mathcal O^+(x)=\{T^n(x):n\in\mathbb N\}.

Here N\mathbb N includes zero, so the initial state belongs to its orbit. If TT is bijective, define negative iterates using its inverse and the full orbit by O(x)={Tn(x):n∈Z}\mathcal O(x)=\{T^n(x):n\in\mathbb Z\}. 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 φt\varphi^t, replace integer time by real time: the full orbit uses t∈Rt\in\mathbb R and the forward orbit uses t≥0t\ge0. A solution of an equation defined only on a limited time interval requires its own domain convention.

Intuition

Starting from T(x)T(x) discards the first step of the trajectory. Consequently, T(O+(x))⊆O+(x)T(\mathcal O^+(x))\subseteq\mathcal O^+(x), 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 XX because the relation y=Tn(x)y=T^n(x) for some integer nn is reflexive, symmetric and transitive.

Examples and non-examples

For T(x)=x/2T(x)=x/2 on R\mathbb R, the forward orbit of 11 is {1,1/2,1/4,…}\{1,1/2,1/4,\ldots\}. 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 11. The full orbit is {2k:k∈Z}\{2^k:k\in\mathbb Z\} because this map is invertible on R\mathbb R.

The phase space matters. Restrict the same formula to [0,1][0,1] and it is no longer surjective, so it has no inverse self-map of that interval.

For a finite example, take X={a,b,c,d}X=\{a,b,c,d\} with T(a)=bT(a)=b, T(b)=cT(b)=c, T(c)=bT(c)=b, and T(d)=cT(d)=c. The forward orbit of aa is {a,b,c}\{a,b,c\}. It is finite, but aa is not periodic: it never returns. The cycle b,cb,c has least period two, and aa 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 Tp(x)=xT^p(x)=x for some positive integer pp. Its least such pp is its least period, and its forward orbit contains exactly pp points.

More generally, a forward orbit is finite exactly when the trajectory is eventually periodic. Proof sketch: finiteness forces Ti(x)=Tj(x)T^i(x)=T^j(x) for some i<ji<j. Applying further iterates gives repetition with period j−ij-i after time ii. Conversely, a finite transient segment followed by a repeating segment visits finitely many states. If TT is invertible, applying T−iT^{-i} cancels the transient segment and proves periodicity of xx itself.

For continuous TT on a metric space, the closure of a forward orbit is forward invariant. Indeed, if yy is a limit of visited states, continuity makes T(y)T(y) 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.