Math 2.0

Dynamical systems and ergodic theory Definition

Markov partition

Builds on Hyperbolic setDiffeomorphism

Definition

Let MM be a compact Riemannian manifold with distance dd, and let f ⁣:M→Mf \colon M \to M be a C1C^1 diffeomorphism. Let Λ⊆M\Lambda \subseteq M be a hyperbolic set of ff. For ε>0\varepsilon > 0 and x∈Mx \in M, let Wεs(x)={y∈M:d(fnx,fny)≤ε for all n≥0}W^s_\varepsilon(x) = \set{y \in M : d(f^n x, f^n y) \le \varepsilon \text{ for all } n \ge 0} and Wεu(x)={y∈M:d(f−nx,f−ny)≤ε for all n≥0}W^u_\varepsilon(x) = \set{y \in M : d(f^{-n} x, f^{-n} y) \le \varepsilon \text{ for all } n \ge 0}. Assume that Λ\Lambda has a local product structure, with constants ε>0\varepsilon > 0 and δ>0\delta > 0. This means that for all x,y∈Λx, y \in \Lambda with d(x,y)<δd(x, y) < \delta, the set Wεs(x)∩Wεu(y)W^s_\varepsilon(x) \cap W^u_\varepsilon(y) is a single point [x,y][x, y] of Λ\Lambda. A rectangle is a nonempty set R⊆ΛR \subseteq \Lambda of diameter less than δ\delta such that [x,y]∈R[x, y] \in R for all x,y∈Rx, y \in R. It is proper if RR is the closure of its interior, taken relative to Λ\Lambda. For x∈Rx \in R put Ws(x,R)=Wεs(x)∩RW^s(x, R) = W^s_\varepsilon(x) \cap R and Wu(x,R)=Wεu(x)∩RW^u(x, R) = W^u_\varepsilon(x) \cap R. A Markov partition of Λ\Lambda is a finite family R1,…,RkR_1, \ldots, R_k of proper rectangles such that:

  1. Λ=R1∪⋯∪Rk\Lambda = R_1 \cup \cdots \cup R_k.
  2. The interiors of RiR_i and RjR_j are disjoint for i≠ji \ne j.
  3. If xx lies in the interior of RiR_i and f(x)f(x) lies in the interior of RjR_j, then f(Ws(x,Ri))⊆Ws(f(x),Rj)f(W^s(x, R_i)) \subseteq W^s(f(x), R_j) and f(Wu(x,Ri))⊇Wu(f(x),Rj)f(W^u(x, R_i)) \supseteq W^u(f(x), R_j).

Remarks

Clause 3 says that ff maps stable slices into stable slices and stretches unstable slices across the whole rectangle. Then the transition matrix Tij=1T_{ij} = 1 when f(int⁡Ri)∩int⁡Rj≠∅f(\operatorname{int} R_i) \cap \operatorname{int} R_j \ne \emptyset, and Tij=0T_{ij} = 0 otherwise, defines a subshift of finite type ΣT\Sigma_T. The map π(x)=⋂n∈ℤf−n(Rxn)\pi(x) = \bigcap_{n \in \Z} f^{-n}(R_{x_n}) is a continuous surjection ΣT→Λ\Sigma_T \to \Lambda with π∘σ=f∘π\pi \circ \sigma = f \circ \pi. Example: let Λ\Lambda be the invariant Cantor set of the Smale horseshoe, identified with {0,1}ℤ\set{0,1}^{\Z} so that ff becomes the shift. Fix m≥1m \ge 1, and for each word ww of length 2m+12m + 1 let RwR_w be the set of points whose coordinates −m,…,m-m, \ldots, m spell ww. For large mm these sets are small. The point [x,y][x, y] takes its coordinates of index n≥0n \ge 0 from xx and of index n<0n < 0 from yy, so each RwR_w is a rectangle. It is open and closed, so it is proper. Applying the shift moves the agreeing future of a stable slice to the future of f(x)f(x), which gives clause 3. Non-example: removing one set RwR_w from this family leaves a family that violates clause 1. Sinai constructed Markov partitions for Anosov diffeomorphisms, and Bowen for the basic sets of Axiom A diffeomorphisms.

Reading path

To understand this page from the ground up, read these 21 pages in order. The foundations come first.

Show the path as a graph
Euclidean space, object, no evidence levelEuclidean spaceobjectFunction, concept, no evidence levelFunctionconceptFunction composition, concept, no evidence levelFunction compositionconceptHyperbolic set, concept, no evidence levelHyperbolic setconceptFréchet derivative, definition, no evidence levelFréchet derivativedefinitionFunction of several variables, concept, no evidence levelFunction of several v…conceptLimit of a function of several variables, concept, no evidence levelLimit of a function o…conceptPartial derivative, concept, no evidence levelPartial derivativeconceptDifferentiable function of several variables, definition, no evidence levelDifferentiable functi…definitionPartial derivative, definition, no evidence levelPartial derivativedefinitionDifferentiable on an open set, definition, no evidence levelDifferentiable on an …definitionJacobian matrix, definition, no evidence levelJacobian matrixdefinitionChain rule in several variables, statement, no evidence levelChain rule in several…statementHigher partial derivatives, definition, no evidence levelHigher partial deriva…definitionIterated derivative, definition, no evidence levelIterated derivativedefinitionJacobian determinant, definition, no evidence levelJacobian determinantdefinitionDerivative of the inverse function, statement, no evidence levelDerivative of the inv…statementC^k function characterised by continuous derivatives, statement, no evidence levelC^k function characte…statementInverse function theorem, statement, no evidence levelInverse function theo…statementDiffeomorphism, definition, no evidence levelDiffeomorphismdefinitionMarkov partition, definition, no evidence levelMarkov partitiondefinition
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Euclidean space object
  2. Function concept
  3. Function composition concept
  4. Hyperbolic set concept
  5. Fréchet derivative definition
  6. Function of several variables concept
  7. Limit of a function of several variables concept
  8. Partial derivative concept
  9. Differentiable function of several variables definition
  10. Partial derivative definition
  11. Differentiable on an open set definition
  12. Jacobian matrix definition
  13. Chain rule in several variables statement
  14. Higher partial derivatives definition
  15. Iterated derivative definition
  16. Jacobian determinant definition
  17. Derivative of the inverse function statement
  18. C^k function characterised by continuous derivatives statement
  19. Inverse function theorem statement
  20. Diffeomorphism definition
  21. Markov partition definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Markov_partition
About this page
Tag3S543TYT8C
URIm2://3S543TYT8C
Kinddefinition
WritingW0 stub
MSC37D20, 37B10
DefinesMarkov partition
UsesHyperbolic set, Diffeomorphism

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.