Zero-one laws for events with positional symmetries
Yahya Ayach, Anthony Khairallah, Tia Manoukian, Jad Mchaimech, Adam Salha, Siamak Taati
TL;DR
The paper develops a unifying zero-one law for events governed by a countable family of random variables under positional symmetries, proving that sufficient injective symmetries force such events to have probability in {0,1}. Building on O'Connell's information-theoretic approach, the authors first establish a general iid result and then extend it to non-iid settings via approximate independence and closeness of distributions, yielding robust corollaries. The framework encompasses classical Hewitt–Savage and shift-ergodicity results and applies to infinite random graphs and renormalization maps, with further reach to Kolmogorov-type mixing settings and other dependent structures. Overall, the work provides a versatile, information-theoretic toolkit for deterministic behavior arising from symmetry in broad stochastic systems.
Abstract
We use an information-theoretic argument due to O'Connell (2000) to prove that every sufficiently symmetric event concerning a countably infinite family of independent and identically distributed random variables is deterministic (i.e., has a probability of either 0 or 1). The i.i.d. condition can be relaxed. This result encompasses the Hewitt-Savage zero-one law and the ergodicity of the Bernoulli process, but also applies to other scenarios such as infinite random graphs and simple renormalization processes.
