Poincaré recurrence theorem
In mathematics, the Poincaré recurrence theorem states that certain systems will, after a sufficiently long time, return to a state very close to the initial state. The Poincaré recurrence time is the length of time elapsed until the recurrence. The result applies to physical systems in which energy is conserved. The theorem is commonly discussed in the context of ergodic theory, dynamical systems and statistical mechanics.
The theorem is named after Henri Poincaré, who published it in 1890.
Contents |
Precise formulation [edit]
Any dynamical system defined by an ordinary differential equation determines a flow map f t mapping phase space on itself. The system is said to be volume-preserving if the volume of a set in phase space is invariant under the flow. For instance, all Hamiltonian systems are volume-preserving because of Liouville's theorem. The theorem is then: If a flow preserves volume and has only bounded orbits, then for each open set there exist orbits that intersect the set infinitely often.[1]
As an example, the deterministic baker's map exhibits Poincaré recurrence which can be demonstrated in a particularly dramatic fashion when acting on 2D images. A given image, when sliced and squashed hundreds of times, turns into a snow of apparent "random noise". However, when the process is repeated thousands of times, the image reappears, although at times marred with greater or lesser bits of noise.
Discussion of proof [edit]
The proof, speaking qualitatively, hinges on two premises:
- The phase trajectories of closed dynamical systems do not intersect.
- The phase volume of a finite element under dynamics is conserved.
Imagine an arbitrary small neighborhood of any point in the phase space and follow its path under dynamics of the system (usually called a "phase tube"). The volume "sweeps" points of phase space as it moves. It can never cross the regions that are already "swept", because phase trajectories do not intersect. Hence, the total volume accessible to it constantly decreases, and since the total volume is finite by assumption, in a finite time, all volume will be exhausted. At that point, the only way to continue would be for the phase tube to connect to its own starting point, which is QED.
Note that individual trajectories included in the phase tube need not connect to their respective starting points, most likely they will all be mixed up within the tube. This is why recurrence is only approximate up to the diameter of the tube. To achieve greater accuracy of recurrence, we need to take smaller initial volume, which means longer recurrence time.
Note also that nothing prevents the system from returning to its starting point before all the phase volume is exhausted. A trivial example of this is the harmonic oscillator. Systems that do cover all available phase volume are called ergodic.
Formal statement of the theorem [edit]
Let
be a finite measure space and let
be a measure-preserving transformation. Below are two alternative statements of the theorem.
Theorem 1 [edit]
For any
, the set of those points
of
such that
for all
has zero measure. That is, almost every point of
returns to
. In fact, almost every point returns infinitely often; i.e.
For a proof, see proof of Poincaré recurrence theorem 1, PlanetMath.org..
Theorem 2 [edit]
The following is a topological version of this theorem:
If
is a second-countable Hausdorff space and
contains the Borel sigma-algebra, then the set of recurrent points of
has full measure. That is, almost every point is recurrent.
For a proof, see proof of Poincaré recurrence theorem 2, PlanetMath.org.
Quantum mechanical version [edit]
For quantum mechanical systems with discrete energy eigenstates, a similar theorem holds. For every
and
there exists a time T larger than
, such that
, where
denotes the state vector of the system at time t.[2][3][4]
The essential elements of the proof are as follows. The system evolves in time according to:
where the
are the energy eigenvalues (we use natural units, so
), and the
are the energy eigenstates. The squared norm of the difference of the state vector at time T and time zero, can be written as:
We can truncate the summation at some n = N independent of T, because
![\sum_{n=N+1}^{\infty}\left | c_{n}\right |^{2}\left [1-\cos\left(E_{n}T\right)\right ] \leq \sum_{n=N+1}^{\infty}\left | c_{n}\right |^{2}](http://upload.wikimedia.org/math/f/3/4/f344405391ad5517767a0d155df1b40c.png)
which can be made arbitrarily small because the summation
, being the squared norm of the initial state, converges to 1.
That the finite sum
can be made arbitrarily small, follows from the existence of integers
such that
for arbitrary
. This implies that there exists intervals for T on which
. On such intervals, we have:
The state vector thus returns arbitrarily closely to the initial state, infinitely often.
See also [edit]
References [edit]
- ^ Barreira, Luis (2006). "Poincaré recurrence: old and new". In Zambrini, Jean-Claude. XIVth International Congress on Mathematical Physics. World Scientific. pp. 415–422. doi:10.1142/9789812704016_0039. ISBN 978-981-256-201-2.
- ^ Bocchieri, P.; Loinger, A. (1957). "Quantum Recurrence Theorem". Phys. Rev. 107 (2): 337–338. Bibcode:1957PhRv..107..337B. doi:10.1103/PhysRev.107.337.
- ^ Percival, I. C. (1961). "Almost Periodicity and the Quantal H theorem". J Math. Phys. 2 (2): 235–239. Bibcode:1961JMP.....2..235P. doi:10.1063/1.1703705.
- ^ Schulman, L. S. (1978). "Note on the quantum recurrence theorem". Phys. Rev. A 18 (5): 2379–2380. Bibcode:1978PhRvA..18.2379S. doi:10.1103/PhysRevA.18.2379.
Further reading [edit]
- Page, Don N. (November 25, 1994). Information Loss in Black Holes and/or Conscious Beings?. arXiv:hep-th/9411193.pdf.
External links [edit]
- Padilla, Tony. "The Longest Time". Numberphile. Brady Haran.
This article incorporates material from Poincaré recurrence theorem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.


![\left |\left | \psi(T)\right\rangle - \left |\psi(0)\right\rangle\right |^{2} = 2\sum_{n=0}^{\infty}\left | c_{n}\right |^{2}\left [1-\cos\left(E_{n}T\right)\right ]](http://upload.wikimedia.org/math/9/5/d/95ddfc344cc25cbf69bd584cfbb18957.png)
![\sum_{n=0}^{N}\left | c_{n}\right |^{2}\left [1-\cos\left(E_{n}T\right)\right ]](http://upload.wikimedia.org/math/0/d/3/0d3297661808dd2dc3edff8568962d76.png)
![2\sum_{n=0}^{N}\left | c_{n}\right |^{2}\left [1-\cos\left(E_{n}T\right)\right ] < \delta^{2}\sum_{n=0}^{N}\left | c_{n}\right |^{2}<\delta^{2}](http://upload.wikimedia.org/math/6/1/b/61bddbc50040d2936ebb4de66291e57e.png)