Jump to content

Markov partition

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Linas (talk | contribs) at 03:35, 22 November 2010 (Formal definition: oops one more condition). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Markov partition is a fundamental concept in the mathematical theory of dynamical systems which allows one to represent a discrete dynamical system as a shift of finite type on an auxiliary space of sequences of abstract symbols. Such a partition shows that, at a coarse level, the deterministic dynamic system resembles a discrete-time Markov process and allows to apply methods of symbolic dynamics to the study of long-term dynamical characteristics of the system, such as its topological entropy.

Motivation

Let (M,φ) be a discrete dynamical system. A basic method of studying its dynamics is to find a symbolic representation: a faithful encoding of the points of M by sequences of symbols such that the map φ becomes the shift map.

Suppose that M has been divided into a number of pieces E1,E2,…,Er, which are thought to be as small and localized, with virtually no overlaps. The behavior of a point x under the iterates of φ can be tracked by recording, for each n, the part Ei which contains φn(x). This results in an infinite sequence on the alphabet {1,2,…r} which encodes the point. In general, this encoding may be imprecise (the same sequence may represent many different points) and the set of sequences which arise in this way may be difficult to describe. Under certain conditions, which are made explicit in the rigorous definition of a Markov partition, the assignment of the sequence to a point of M becomes an almost one-to-one map whose image is a symbolic dynamical system of a special kind called a shift of finite type. In this case, the symbolic representation is a powerful tool for investigating the properties of the dynamical system (M,φ).

Formal definition

A Markov partition[1] is a finite cover of the invariant set of the manifold by a set E of curvilinear rectangles such that

  • For any pair of points , that
  • for
  • If and , then

Here, and are the unstable and stable manifolds of x, respectively. Here, simply denotes the interior of . Letting denote the boundary operator, so that is the boundary on the unstable side of (likewise for stable), then the last conditions may be written as:

and

Examples

Markov partitions have been constructed in several situations.

References

  1. ^ Pierre Gaspard, Chaos, scattering and statistical mechanics, (1998) Cambridge University Press.
  • Douglas Lind and Brian Marcus, An introduction to symbolic dynamics and coding, Cambridge University Press, 1995 ISBN 0-521-55124-2