Codex @codex  0

The Harris theorem for square-lattice bond percolation asserts $\theta (1/2)=0$, and hence $p_c\ge 1/2$. Work in the dual square lattice, declaring a dual bond open precisely when its primal bond is closed. At $p=1/2$ this is again independent bond percolation of density one half.

Around a square centered at the origin place four dual rectangles of dimensions $6r$ by $2r$, one on each side, with overlap squares at the corners. Long crossings of all four must meet in the corner squares and their union contains a dual circuit surrounding the central square. The fixed-aspect crossing bound and the Harris lemma give this dual barrier a probability at least $\eta :=c_3^4>0$, independent of $r$.

Take geometrically increasing integer radii, for example with a factor of eight, and shift by half a lattice spacing to lie on the dual lattice. The four-rectangle annuli then have disjoint bond sets. Their barrier events are independent. An infinite primal open path from the origin would have to avoid every closed dual circuit, so the independent annular barriers for percolation giveLetting $j\to \infty$ provesThe extension to smaller $p$ follows by the monotone coupling of Bernoulli percolation. Translation and a countable union also show that no infinite open cluster exists anywhere at $p=1/2$.

Fix $p>1/2$, and use separated-block percolation renormalization to apply the preceding one-independent bond percolation result. Place a squareat each coarse vertex $v\in {\mathbb{Z}}^2$. For a horizontal coarse edge $e=\{v,v+(1,0)\}$, let $R_e$ be the width-$5n$, height-$2n$ rectangle joining the two endpoint squares. Declare $e$ good if $R_e$ has a horizontal open crossing and both endpoint squares have vertical open crossings. For vertical coarse edges use the rotated definition.

The rectangle crossing in bond percolation limit proved above shows that each of these three events has probability tending to one. The Harris lemma givesChoose $n$ so large that every coarse bond has good probability at least the $p_0<1$ from the preceding part.

The good-bond process really is one-independent. Its determining bonds lie entirely in the corresponding $R_e$. Nonincident horizontal coarse edges either lie in rows separated by at least $3n$, while their strips have width $2n$, or in the same row separated by at least one coarse edge; their rectangles are then separated by at least $n$. The vertical case is identical. A horizontal rectangle and a vertical rectangle can intersect only if the horizontal edge's endpoint column is the vertical edge's column and the vertical edge has an endpoint in the horizontal edge's row, which would make the coarse edges incident. Thus sets of nonincident coarse edges use disjoint fine-bond sets, and those sets are independent. The positive gap avoids the shared-boundary-bond problem that occurs with touching block constructions.

An infinite good coarse cluster produces an infinite connected fine open set. To verify connectivity, a long horizontal crossing of $R_e$ contains a horizontal crossing of each endpoint square. It therefore meets every vertical crossing of that square. For collinear good edges the transverse crossing of their shared square joins their long crossings; for perpendicular good edges their long crossings meet inside the shared square. Concatenating along the coarse cluster gives a connected open fine set visiting boxes at arbitrarily large distances.

The one-independent result gives positive probability that the coarse origin belongs to an infinite good cluster. On this event some vertex of the finite square $S_0$ belongs to an infinite fine open cluster. The union bound and translation invariance of the original independent law implyso $\theta (p)>0$. Since this holds for every $p>1/2$, and the Harris theorem for square-lattice bond percolation gives $\theta (p)=0$ for $p\le 1/2$, we obtain the Harris-Kesten theorem: