Summary
Let {Y n ,− ∞ < n < ∞} be either a function of a stationary Markov chain with countable state space, or a finitary process in the sense of Heller [3]. The purpose of this note is to prove that if {Y n ,− ∞ < n < ∞} is mixing, then it is aK-shift. (Definitions will be given below.)
IfT is a measure-preserving transformation on a probability space, then the following implications relevant to the present paper are known: (1)T is aK-shift ⇒T is (r + 1)-mixing ⇒T isr-mixing ⇒T is totally ergodic ⇒T is ergodic, and (2)T is ergodic ⇏T is totally ergodic ⇏T isr-mixing ⇏T is aK-shift.
It is not known if the classes ofr-mixing and (r + 1)-mixing transformations are distinct. (1-mixing is also called mixing.) The results of this note then imply that for the classes of transformation that we are consideringr-mixing and (r + 1)-mixing are equivalent.
Similar content being viewed by others
References
J. Blum andD. Hanson, On a problem in Hilbert space with applications,J. Math. Mech. 11 (1962), 497–501.
S. Dharmadhikari, Functions of finite Markov chains,Ann. Math. Statist. 34 (1963), 1022–1032.
A. Heller, On stochastic processes derived from Markov chains,Ann. Math. Statist. 36 (1965), 1286–1291.
A. Heller, Probabilistic automata and stochastic transformations,Math. Systems Theory 1 (1967), 197–208.
V. Rohlin, On the fundamental ideas of measure theory,Mat. Sborn. (N.S.)25 (1949), 107–150. (Amer. Math. Soc. Transl. 10 (1952), 1–54.)
V. Rohlin andJa. Sinai, Construction and properties of invariant measurable partitions,Dokl. Akad. Nauk. SSSR 141 (1961), 1038–1041. (Soviet Math. Dokl. 2 (1961), 1611–1614.)
Author information
Authors and Affiliations
Additional information
This research was partially supported by NSF Grant GP-19660.
Rights and permissions
About this article
Cite this article
Robertson, J.B. The mixing properties of certain processes related to Markov chains. Math. Systems Theory 7, 39–43 (1973). https://doi.org/10.1007/BF01824805
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01824805