For each , the event that belongs to an infinite open cluster implies that has an open path to . Translation invariance gives probability for the former event. Therefore
Both and are increasing events. The first has probability at least by part (a2), while the second has probability at least because an infinite origin cluster reaches . The Harris-FKG inequality gives
On , additionally require every site of to be open and every site of to be closed. The open ring joins every component of to the origin component, and the closed outer ring makes that component finite. It contains at least sites. These ring states are independent of , and their probability isSince both ring sizes are linear in , this is at least . Multiplication by proves the claimed lower bound.
The variables are independent Bernoulli variables with parameter . They therefore form subcritical site percolation on the triangular lattice; their open clusters are precisely the closed-site clusters of the original configuration.
A closed circuit of diameter at least through a fixed listed point contains a closed path from that point to graph distance at least . Exponential decay of subcritical percolation bounds this probability by . A union bound over the listed points givesafter reducing and adjusting finitely many small .
A closed circuit surrounding the origin and passing through has diameter at least . By the one-point estimate used in part (b2), its probability is at most . Therefore
By planar duality on the triangular lattice, a finite open cluster containing the origin is surrounded by a closed circuit. If its diameter exceeds , an outermost surrounding circuit reaches distance of order and crosses the positive coordinate ray at some with . Part (b3), with constants rescaled, therefore gives
Articles by others on the same topic
There are currently no matching articles.