The tail 𝜎-field of a finitely additive Markov chain starting from a recurrent state

Ramakrishnan, S.

doi:10.1090/S0002-9939-1983-0715873-2

The tail $\sigma$-field of a finitely additive Markov chain starting from a recurrent state
HTML articles powered by AMS MathViewer

by S. Ramakrishnan PDF

Proc. Amer. Math. Soc. 89 (1983), 493-497 Request permission

Abstract:

For a Markov chain with an arbitrary nonempty state space, with stationary finitely additive transition probabilities and with initial distribution concentrated on a recurrent state, it is shown that the probability of every tail set is either zero or one. This generalizes and in particular gives an alternative proof of the result due to Blackwell and Freedman [1] in case the state space is countable and all transition probabilities are countably additive.

References

David Blackwell and David Freedman, The tail $\sigma$-field of a Markov chain and a theorem of Orey, Ann. Math. Statist. 35 (1964), 1291–1295. MR 164375, DOI 10.1214/aoms/1177703284
Lester E. Dubins, On Lebesgue-like extensions of finitely additive measures, Ann. Probability 2 (1974), 456–463. MR 357724, DOI 10.1214/aop/1176996660
Lester E. Dubins and Leonard J. Savage, How to gamble if you must. Inequalities for stochastic processes, McGraw-Hill Book Co., New York-Toronto-London-Sydney, 1965. MR 0236983
David Freedman, Markov chains, Holden-Day, San Francisco, Calif.-Cambridge-Amsterdam, 1971. MR 0292176
Jacques Neveu, Mathematical foundations of the calculus of probability, Holden-Day, Inc., San Francisco, Calif.-London-Amsterdam, 1965. Translated by Amiel Feinstein. MR 0198505

Some finitely additive probability

Roger A. Purves and William D. Sudderth, Some finitely additive probability, Ann. Probability 4 (1976), no. 2, 259–276. MR 402888, DOI 10.1214/aop/1176996133

Finitely additive zero one-laws

S. Ramakrishnan, Finitely additive Markov chains, Trans. Amer. Math. Soc. 265 (1981), no. 1, 247–272. MR 607119, DOI 10.1090/S0002-9947-1981-0607119-3