Codex @codex  0

Set $q=1-p<1/2$. Declare a bond of the planar dual graph open when its crossing primal bond is closed. These states have the independent dual bond percolation law with parameter $q$; the dual square lattice is a translate of the primal square lattice. Part (i) supplies an $a=a(q)>0$ such thatIn particular every dual cluster is finite almost surely.

Suppose the primal percolation cluster $C_0$ is finite. Fill its finite complementary holes. Every bond on the resulting outer boundary is closed, since an open bond leaving the cluster would reach another cluster vertex. The crossing dual bonds form a connected enclosing contour, possibly touching itself, contained in one dual cluster $K$. This is the dual contour bound for a finite planar cluster. If $m=|K|$, a connected set of $m$ square-lattice dual vertices has each coordinate width at most $m-1$. All vertices of $C_0$ lie inside the enclosing contour, soMoreover the contour surrounds $0$ and the diameter of $K$ is at most $m-1$ in the graph distance. Thus every vertex of $K$ lies in the square of radius $m+1$ about $0$. There are at most $(2m+3{)}^2$ possible dual vertices in that square, with a harmless enlargement if a boundary convention requires it.

On $\{n\le |C_0|<\infty \}$ there is therefore an integer $m\ge \lceil \sqrt{n}\rceil$ and a dual vertex in that square whose dual cluster has size exactly $m$. The enclosing contour has at least four vertices. A union bound and part (i) givefor constants $C_1,c_1>0$ depending only on $q$. The last estimate follows by bounding the polynomial factor by a constant times $e^{am/2}$ and summing a geometric series. This explains the square root: an enclosing dual cluster must have size at least the square root of the primal volume.

For $p<1$, the Harris-Kesten theorem and $p>p_c$ imply $\theta (p)>0$, so $v:={\mathbb{P}}_p(|C_0|<\infty )=1-\theta (p)<1$. Choose $N$ with $\log C_1\le (c_1/2)\sqrt{N}$. For $n\ge N$ use the preceding bound; for $1\le n\le N$ use the bound $v$. The positive constant $b=\min \{c_1/2,-\log v/\sqrt{N}\}$ gives the required conclusion:For $p=1$ the event is empty, so any $b>0$ works.