Indistinguishability of percolation clusters

We show that when percolation produces infinitely many infinite dusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is equivalent to nondecay of connectivity (a.k.a. long-range order) . We then derive applications concerning uniqueness in Kazhdan groups and i n wreath products and inequalities for p(u).