Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts

Marcus, Brian¹ ; Tuncel, Selim²

¹ IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120
² Department of Mathematics, Box 354350, University of Washington, Seattle, WA 98195

Electronic research announcements of the American Mathematical Society, Tome 05 (1999), pp. 91-101.

Résumé

We give necessary and sufficient conditions for a Markov chain to factor onto a Bernoulli shift (i) as an eventual right-closing factor, (ii) by a right-closing factor map, (iii) by a one-to-one a.e. right-closing factor map, and (iv) by a regular isomorphism. We pass to the setting of polynomials in several variables to represent the Bernoulli shift by a nonnegative polynomial $p$ in several variables and the Markov chain by a matrix $A$ of such polynomials. The necessary and sufficient conditions for each of (i)–(iv) involve only an eigenvector $r$ of $A$ and basic invariants obtained from weights of periodic orbits. The characterizations of (ii)–(iv) are deduced from (i). We formulate (i) as a combinatorial problem, reducing it to certain state-splittings (partitions) of paths of length $n$. In terms of positive polynomial masses associated with paths, the aim then becomes the construction of partitions so that the masses of the paths in each partition element sum to a multiple of $p^n$, the multiple being prescribed by $r$. The construction, which we sketch, relies on a description of the terms of $p^n$ and on estimates of the relative sizes of the coefficients of $p^n$.

Détail

DOI : 10.1090/S1079-6762-99-00066-9

Bibliographie

[1] Ashley, Jonathan Resolving factor maps for shifts of finite type with equal entropy Ergodic Theory Dynam. Systems 1991 219 240

[2] Ashley, Jonathan, Marcus, Brian, Tuncel, Selim The classification of one-sided Markov chains Ergodic Theory Dynam. Systems 1997 269 295

[3] Boyle, Mike, Marcus, Brian, Trow, Paul Resolving maps and the dimension group for shifts of finite type Mem. Amer. Math. Soc. 1987

[4] Boyle, Mike, Tuncel, Selim Regular isomorphism of Markov chains is almost topological Ergodic Theory Dynam. Systems 1990 89 100

[5] Handelman, David Positive polynomials and product type actions of compact groups Mem. Amer. Math. Soc. 1985

[6] Lind, Douglas, Marcus, Brian An introduction to symbolic dynamics and coding 1995

[7] Marcus, Brian Factors and extensions of full shifts Monatsh. Math. 1979 239 247

[8] Marcus, Brian, Tuncel, Selim The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains Ergodic Theory Dynam. Systems 1991 129 180

[9] Marcus, Brian, Tuncel, Selim Entropy at a weight-per-symbol and embeddings of Markov chains Invent. Math. 1990 235 266

[10] Marcus, Brian, Tuncel, Selim Matrices of polynomials, positivity, and finite equivalence of Markov chains J. Amer. Math. Soc. 1993 131 147

[11] Ornstein, Donald S. Ergodic theory, randomness, and dynamical systems 1974

[12] Parry, William, Schmidt, Klaus Natural coefficients and invariants for Markov-shifts Invent. Math. 1984 15 32

[13] Parry, William, Tuncel, Selim On the stochastic and topological structure of Markov chains Bull. London Math. Soc. 1982 16 27

[14] Tuncel, Selim Faces of Markov chains and matrices of polynomials 1992 391 422