Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm currently studying the uniqueness of the infinite cluster in supercritical percolation. In the proof the rv $N$ counts the number of infinite clusters on the infinite 2-D square lattice. The claim is that $N$ is translation invariant (obvious) and that this implies it is constant almost surely (in the extended reals). I'm having trouble verifying the implication that it must be constant. Is this a sort of Hewitt Savage 0-1 law? Except that for Hewitt Savage I need invariance under finite permutations as well. I feel like the proof should be obvious but I'm not seeing it. Can anyone offer a hint in the right direction? Thanks!

share|cite|improve this question
Could you add a reference to the paper/book you are reading? – Byron Schmuland Jan 15 '12 at 3:08
This is the line of reasoning from Grimmett's Percolation book – Alex R. Jan 15 '12 at 19:06
up vote 1 down vote accepted

You are right, it is a sort of Hewitt-Savage zero-one law, but not exactly.

Following Grimmett, take $\Omega=\{0,1\}^{\mathbb{E}^d}$ with the natural family of translations inherited from the translations of the lattice $\mathbb{L}^d$. Since we are interested in bond percolation, $P_p$ is the product of Bernoulli($p$) measures on $\Omega$.

You need the fact that the $\sigma$-field $\cal T$ of translation invariant events is $P_p$ trivial. This is proved with exactly the same argument used to proved the Hewitt-Savage zero-one law, except the map on the index set is a translation instead of a finite permutation.

share|cite|improve this answer
Actually, I realized this question is almost trivial if we realize translation invariant events are ergodic w.r.t. product measures. – Alex R. Jan 30 '12 at 5:44

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.