In mathematics, especially in probability theory and ergodic theory, the invariant sigma-algebra is a sigma-algebra formed by sets which are invariant under a group action or dynamical system. It can be interpreted as of being "indifferent" to the dynamics.
The invariant sigma-algebra appears in the study of ergodic systems, as well as in theorems of probability theory such as de Finetti's theorem and the Hewitt-Savage law.
Definition
editStrictly invariant sets
editLet be a measurable space, and let be a measurable function. A measurable subset is called invariant if and only if .[1][2][3] Equivalently, if for every , we have that if and only if .
More generally, let be a group or a monoid, let be a monoid action, and denote the action of on by . A subset is -invariant if for every , .
Almost surely invariant sets
editLet be a measurable space, and let be a measurable function. A measurable subset (event) is called almost surely invariant if and only if its indicator function is almost surely equal to the indicator function .[4][5][3]
Similarly, given a measure-preserving Markov kernel , we call an event almost surely invariant if and only if for almost all .
As for the case of strictly invariant sets, the definition can be extended to an arbitrary group or monoid action.
In many cases, almost surely invariant sets differ by invariant sets only by a null set (see below).
Sigma-algebra structure
editBoth strictly invariant sets and almost surely invariant sets are closed under taking countable unions and complements, and hence they form sigma-algebras. These sigma-algebras are usually called either the invariant sigma-algebra or the sigma-algebra of invariant events, both in the strict case and in the almost sure case, depending on the author.[1][2][3][4][5] For the purpose of the article, let's denote by the sigma-algebra of strictly invariant sets, and by the sigma-algebra of almost surely invariant sets.
Properties
edit- Given a measure-preserving function , a set is almost surely invariant if and only if there exists a strictly invariant set such that .[6][5]
- Given measurable functions and , we have that is invariant, meaning that , if and only if it is -measurable.[2][3][5] The same is true replacing with any measurable space where the sigma-algebra separates points.
Examples
editExchangeable sigma-algebra
editGiven a measurable space , denote by be the countable cartesian power of , equipped with the product sigma-algebra. We can view as the space of infinite sequences of elements of ,
Consider now the group of finite permutations of , i.e. bijections such that only for finitely many . Each finite permutation acts measurably on by permuting the components, and so we have an action of the countable group on .
An invariant event for this sigma-algebra is often called an exchangeable event or symmetric event, and the sigma-algebra of invariant events is often called the exchangeable sigma-algebra. A random variable on is exchangeable (i.e. permutation-invariant) if and only if it is measurable for the exchangeable sigma-algebra.
The exchangeable sigma-algebra plays a role in the Hewitt-Savage zero-one law, which can be equivalently stated by saying that for every probability measure on , the product measure on assigns to each exchangeable event probability either zero or one.[9] Equivalently, for the measure , every exchangeable random variable on is almost surely constant.
It also plays a role in the de Finetti theorem.[9]
Shift-invariant sigma-algebra
editAs in the example above, given a measurable space , consider the countably infinite cartesian product . Consider now the shift map given by mapping to . An invariant event for this sigma-algebra is called a shift-invariant event, and the resulting sigma-algebra is sometimes called the shift-invariant sigma-algebra.
This sigma-algebra is related to the one of tail events, which is given by the following intersection,
where is the sigma-algebra induced on by the projection on the -th component .
Every shift-invariant event is a tail event, but the converse is not true.
See also
editCitations
edit- ^ a b c Billingsley (1995), pp. 313–314
- ^ a b c Douc et al. (2018), p. 99
- ^ a b c d e Klenke (2020), p. 494-495
- ^ a b Viana & Oliveira (2016), p. 94
- ^ a b c d e Durrett (2010), p. 330
- ^ Viana & Oliveira (2016), p. 3
- ^ Douc et al. (2018), p. 102
- ^ Viana & Oliveira (2016), p. 95
- ^ a b Hewitt & Savage (1955)
References
edit- Viana, Marcelo; Oliveira, Krerley (2016). Foundations of Ergodic Theory. Cambridge University Press. ISBN 978-1-107-12696-1.
- Billingsley, Patrick (1995). Probability and Measure. John Wiley & Sons. ISBN 0-471-00710-2.
- Durrett, Rick (2010). Probability: theory and examples. Cambridge University Press. ISBN 978-0-521-76539-8.
- Douc, Randal; Moulines, Eric; Priouret, Pierre; Soulier, Philippe (2018). Markov Chains. Springer. doi:10.1007/978-3-319-97704-1. ISBN 978-3-319-97703-4.
- Klenke, Achim (2020). Probability Theory: A comprehensive course. Universitext. Springer. doi:10.1007/978-1-4471-5361-0. ISBN 978-3-030-56401-8.
- Hewitt, E.; Savage, L. J. (1955). "Symmetric measures on Cartesian products". Trans. Amer. Math. Soc. 80 (2): 470–501. doi:10.1090/s0002-9947-1955-0076206-8.