Math 2.0

Dynamical systems and ergodic theory Definition

Parry measure

Builds on Subshift of finite typeInvariant measurePerron–Frobenius theoremIrreducible matrixProbability measure

Definition

Let AA be a k×kk \times k matrix with entries in {0,1}\set{0, 1} that is irreducible. Let ΣA={x∈{1,…,k}ℤ:Axixi+1=1 for all i}\Sigma_A = \set{x \in \set{1, \ldots, k}^{\Z} : A_{x_i x_{i+1}} = 1 \text{ for all } i} be its vertex shift, a subshift of finite type, with shift map σ\sigma. By the Perron–Frobenius theorem, AA has a positive eigenvalue λ\lambda of largest modulus, with eigenvectors u,vu, v with positive entries such that uTA=λuTu^T A = \lambda u^T and Av=λvA v = \lambda v. Normalise them so that ∑iuivi=1\sum_i u_i v_i = 1. Put pi=uivip_i = u_i v_i and Pij=Aijvj/(λvi)P_{ij} = A_{ij} v_j / (\lambda v_i). The Parry measure is the probability measure μ\mu on ΣA\Sigma_A such that, for all n∈ℤn \in \Z, m≥0m \ge 0 and states i0,…,imi_0, \ldots, i_m, μ{x:xn=i0,…,xn+m=im}=pi0Pi0i1⋯Pim−1im.\mu\set{x : x_{n} = i_0, \ldots, x_{n+m} = i_m} = p_{i_0} P_{i_0 i_1} \cdots P_{i_{m-1} i_m}.

Remarks

The matrix PP is stochastic and pTP=pTp^T P = p^T, so these values are consistent and μ\mu is a σ\sigma-invariant measure. Its entropy is log⁡λ\log \lambda, which is the topological entropy of σ\sigma on ΣA\Sigma_A, and it is the only invariant probability measure with this entropy. Example: the golden mean shift has A=(1110)A = \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix} and λ=φ=(1+5)/2\lambda = \varphi = (1 + \sqrt5)/2. Here u=v=(φ,1)u = v = (\varphi, 1) up to scaling, since φ+1=φ2\varphi + 1 = \varphi^2. After normalisation, p1=φ2/(φ2+1)p_1 = \varphi^2/(\varphi^2 + 1) and p2=1/(φ2+1)p_2 = 1/(\varphi^2 + 1), and P11=1/φP_{11} = 1/\varphi, P12=1/φ2P_{12} = 1/\varphi^2, P21=1P_{21} = 1, P22=0P_{22} = 0. Each row of PP sums to 11, because 1/φ+1/φ2=11/\varphi + 1/\varphi^2 = 1. Non-example: on the same shift, the Markov measure with P11=P12=1/2P_{11} = P_{12} = 1/2 is invariant for its stationary vector but is not the Parry measure, and its entropy is smaller than log⁡φ\log \varphi.

Reading path

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

  1. Characteristic polynomial concept
  2. Construction of the reals from Cauchy sequences concept
  3. Directed graph concept
  4. Eigenvalue concept
  5. Eigenvector concept
  6. Element definition
  7. Integers object
  8. Invariant measure concept
  9. Irreducible matrix concept
  10. Nonnegative matrix concept
  11. Ordered field definition
  12. Permutation matrix concept
  13. Proposition concept
  14. Random experiment concept
  15. Rational numbers object
  16. Shift space concept
  17. Spectral radius concept
  18. Square matrix concept
  19. Set definition
  20. Ring of integers statement
  21. Perron–Frobenius theorem statement
  22. Irreducible matrix definition
  23. Conjunction definition
  24. Disjunction definition
  25. Implication definition
  26. Predicate definition
  27. Empty set object
  28. Family of sets definition
  29. Ordered pair definition
  30. Intersection definition
  31. Union definition
  32. Sample space definition
  33. Existential quantifier definition
  34. Universal quantifier definition
  35. The rationals form a field statement
  36. Cartesian product definition
  37. Union of a family of sets definition
  38. Subset definition
  39. The rationals form an ordered field statement
  40. Universal set definition
  41. Topological space definition
  42. Order on the reals definition
  43. Power set definition
  44. Basis of a topology definition
  45. Interval definition
  46. Complement definition
  47. Product topology definition
  48. Sigma-algebra definition
  49. Event definition
  50. Subshift of finite type definition
  51. Probability axioms concept
  52. Probability measure definition
  53. Parry measure definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Subshift_of_finite_type
About this page
TagBE3E2AH0EV
URIm2://BE3E2AH0EV
Kinddefinition
WritingW0 stub
MSC37B10, 37A35
DefinesParry measure
UsesSubshift of finite type, Invariant measure, Perron–Frobenius theorem, Irreducible matrix, Probability measure

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.