logo

Poincaré Recurrence Theorem Proof 📂Dynamics

Poincaré Recurrence Theorem Proof

Theorem

In the Euclidean space where a multidimensional map g:RnRng : \mathbb{R}^{n} \to \mathbb{R}^{n} is defined to be injective and continuous, and DRnD \subset \mathbb{R}^{n} is a compact invariant set, let’s say g(D)=Dg(D) = D. For any xD\overline{x} \in D, given any neighborhood UU, there exists xUx \in U such that for some nn \in, gn(x)Ug^{n} (x) \in U is satisfied.

Explanation

The statement is simple: if DD is a compact invariant set, then grabbing any UU within it means there’s a moment when it can’t immediately escape UU but will eventually return to it. This can be applied repeatedly, first, second, third time… so no matter how far gg takes UU through UU, it inevitably returns to UU.

Proof 1

Consider repeatedly taking gg on UU as follows: U,g(U),g2(U),,gn(U), U , g (U), g^{2} (U) , \cdots , g^{n} (U) , \cdots Since gg was injective from the premise, they conserve the volume exactly. If they don’t overlap, then DD containing them would have infinite volume. However, as DD is compact from the premise, for some k>lk >l gk(U)gl(U) g^{k} (U) \cap g^{l} (U) \ne \emptyset Taking the pre-image gives gkl(U)U g^{k-l} \left( U \right) \cap U \ne \emptyset Thus, for n:=kln := k - l, there exists xx that satisfies both xUx \in U and gn(x)Ug^{n} (x) \in U.


  1. Wiggins. (2003). Introduction to Applied Nonlinear Dynamical Systems and Chaos Second Edition(2nd Edition): p101. ↩︎