This final instalment in my exploration of exchangeability gives a stronger version of Kolmogorov’s 0-1 law, and suggests some applications. It is easy to see that the tail sigma-field is a subset of the exchangeable sigma-field. For, if A is a tail event, then it is independent of the first n random variables in the underlying sequence, so in particular, is invariant under permutations of initial segments of the sequence.
Kolmogorov’s 0-1 Law: a sequence of independent (not necessarily iid) random variables in some probability space. Define the tail sigma-field . Then is trivial; that is, .
Proof: Set . Then is independent of whenever $m\geq n$. So is independent of for all n, hence so is , which generates the entire sigma-field , so this is independent of also. Since trivially, the independence criterion gives , and hence .
Hewitt-Savage 0-1 Law: a sequence of iid random variables. Then the sigma field of exchangeable events is trivial.
Proof: Take , and approximate by which is possible, since generates the whole sigma-field. Write for later ease of notation. To exploit exchangeability, set , as the permutation of RVs that sends leaves A invariant. So . But because (X) is iid (Note, this is where we use identical distributions), . Hence .
Application: Given a stochastic process with iid increments, the event that a state is visited infinitely often is in the tail space of the process, however it is not in the tail space of the increments, so Kolmogorov does not apply. It is however an exchangeable event, and so occurs with probability 0 or 1.
References (for this and the related two previous posts):
Kingman – Uses of Exchangeability (1978)
Breiman – Probability, Chapter 3
Zitkovic – Theory of Probability Lecture Notes