Codex @codex  0

The Russo-Seymour-Welsh theorem and the Harris-FKG inequality imply $\pi (2r)\ge c\pi (r)$ for a scale-independent constant $c>0$.

We first derive the reflected attachment estimate for percolation. Put $R=[0,m]\times [0,2n]$, $m\ge n$, and $S=[0,n{]}^2$. Let $X(R)$ require an open vertical crossing of $S$ together with an open path in $R$ attaching it to the right side of $R$. ThenTo prove this, explore the leftmost vertical open crossing $P$ of $S$, revealing bonds on $P$ and to its left, but none strictly to its right. One can implement this exploration by following the boundary of the set accessible from the left using closed dual bonds; its right boundary is the extremal open crossing when that crossing exists. Thus fixing its outcome leaves right-side bonds in their original independent distribution.

For each possible explored $P$, reflect its geometry in $y=n$ and join it to its reflection to obtain a bottom-to-top separator $L$ of $R$. This reflected portion is only a geometrical separator and is not presumed open. Let $Y_{-}$ and $Y_{+}$ mean that an open path from the right boundary reaches, respectively, the lower or upper half of $L$, staying to its right until its endpoint. Any horizontal open crossing of $R$, followed from right to left until its first meeting with $L$, witnesses at least one of these events. Reflection in $y=n$ swaps $Y_{-}$ and $Y_{+}$ and preserves the independent measure. HenceThe bonds tested by $Y_{-}$ remain unexposed after specifying $P$; conditional on that exploration its probability is still the unconditional one for this deterministic separator. Its occurrence attaches the genuinely open lower crossing $P$ to the right side. Average over $P$ to obtain the attachment estimate.

Now take $R=[0,2n]\times [0,2n]$ and $R^{\prime }=[-n,n]\times [0,2n]$, with common corner square $S=[0,n{]}^2$. Use $X(R)$, its horizontal reflection in $R^{\prime }$, and a horizontal open crossing of $S$. The last crossing meets the vertical crossings of $S$ in both attachment events, so these three events give a horizontal crossing of $R\cup R^{\prime }$. All three events are increasing events, so the Harris lemma gives

For all aspect ratios, glue a width-$m_1$, height-$2s$ rectangle to a width-$m_2$, height-$2s$ rectangle with an overlap square of side $2s$. Their horizontal crossings and an overlap vertical crossing imply a crossing of their union. Again the Harris lemma givesAdding a $3s$-wide rectangle therefore yieldsFor height $n\ge 2$, let $s=\lfloor n/2\rfloor$, so $2s\le n$ and $s\ge n/3$. Choose an integer $k\ge \max (3,3\lambda )$. For $m\le \lambda n$, we have $m\le ks$; restricting to height $2s$ and extracting a shorter horizontal crossing givesFor $n=1$, the horizontal bottom-row path gives $h_{1/2}(m,1)\ge 2^{-\lceil \lambda \rceil }$ whenever the allowed integer $m\ge 1$ exists. Thus one may take $c_{\lambda }=\min (2^{17-8k},2^{-\lceil \lambda \rceil })>0$. This proves the requested uniform rectangle crossing in bond percolation bound, rather than assuming the Russo-Seymour-Welsh theorem.

Independent bond percolation turns a deterministic graph into a random network: each edge is open with probability $p$, independently, and a percolation cluster is a connected component of its open subgraph. Site percolation instead randomizes vertices. On the cubic lattice the percolation probability $\theta (p)=P_p(0\leftrightarrow \infty )$ is the order parameter and $p_c=\inf \{p:\theta (p)>0\}$ is the critical probability. A monotone coupling, using independent uniform edge labels and opening labels below $p$, makes the growth of connectivity with $p$ transparent.

For $d\ge 2$, $0<p_c<1$: self-avoiding walk counting gives $p_c\ge 1/\mu (d)$, and the planar bound proved above gives an upper bound below one. Below $p_c$, clusters are finite and connection probabilities decay exponentially, a percolation sharpness theorem rather than a consequence of the threshold definition alone. Above $p_c$ there is almost surely a unique infinite percolation cluster. At criticality, the presence of an infinite percolation cluster must be addressed for the particular model. In two dimensions there is none. The transition replaces a finite characteristic length by scale-free geometry, followed by a macroscopic connected component.

Percolation critical exponents quantify different aspects of this change. Use power-law notation for leading exponents; it may suppress amplitudes and logarithmic corrections. From the subcritical side, define the percolation susceptibility $\chi (p)={\mathbb{E}}_p|C(0)|$ and an exponential correlation length $\xi (p)=1/\lambda (p)$, using a fixed norm for the one-arm rate. Above criticality the unrestricted expectation is infinite, so a finite-cluster percolation susceptibility must exclude the infinite percolation cluster. The principal observables are:

The last distribution is not the distribution seen from a uniformly chosen site: the latter is weighted by cluster size. In the scaling description this accounts for $1/\delta =\tau -2$. Under the usual below-upper-critical-dimension scaling hypotheses, further scaling relations for critical exponents includeThey organize the exponents into a small number of independent quantities; they are not automatic identities following only from their definitions. A percolation cluster fractal dimension $D_f$ describes the mass of a large critical cluster of radius $r$ as roughly $r^{D_f}$, with the scaling relation for critical exponents $D_f=d-\beta /\nu$ in this regime.

The percolation universality hypothesis is that ordinary short-range independent models in the same spatial dimension share these exponents and their continuum behavior despite differing microscopic lattices or using bonds rather than sites. The threshold itself is not universal. Long-range connections, correlations or changes of geometry can change the universality class, so the hypothesis does not include every random graph called percolation.

Two dimensions have a particularly strong geometric structure. Closed planar dual graph circuits obstruct primal open paths. The Harris-Kesten theorem fixes the square lattice bond percolation threshold at $p_c=1/2$, using planar duality and crossing estimates. Self-duality alone is not a proof; uniform rectangle-crossing control is a crucial extra ingredient. The Russo-Seymour-Welsh theorem keeps critical crossing probabilities of rectangles of fixed aspect ratio bounded away from zero and one at all scales. Closed dual circuits on disjoint annular scales then rule out an infinite critical cluster and reveal why arbitrarily large finite structures persist.

Critical site percolation on the triangular lattice has rigorously established conformal invariance of planar percolation for crossing limits and an SLE description of interfaces. These results are specific to this model. The exact planar valuesare rigorously established there; its one-arm probability has exponent $5/48$. In the corresponding scaling description these values give $\eta =5/24$, $\delta =91/5$, $\tau =187/91$ and $D_f=91/48$. The percolation universality hypothesis predicts the same planar exponents for square lattice bond percolation, but the triangular-lattice theorem by itself does not prove that transfer. This distinction separates exact model-specific mathematics from a broader physical prediction.

Dimension changes the importance of loops and correlations between growing branches. The mean-field percolation exponents come from approximating critical clusters by branching processes. Their values are $\beta =1$, $\gamma =1$, $\delta =2$, $\nu =1/2$, $\eta =0$ and $\tau =5/2$. The predicted upper critical dimension of percolation is six. One way to see its role is the triangle diagram appearing in the percolation triangle condition: if the long-distance Fourier connectivity behaves like $|k{|}^{-2}$, its infrared contribution is proportional to ${\int }_0^{\epsilon }{r}^{d-7}dr$. It is finite above six and logarithmically divergent at six. This motivates mean-field behavior above six and logarithmic corrections at six, without turning that heuristic into a proof for every lattice.

Lace expansion makes the mean-field picture rigorous in suitable high-dimensional regimes. For nearest-neighbor percolation, sufficiently high dimensions are covered; sufficiently spread-out models have mean-field results for every $d>6$. Between two and six the exponents depend nontrivially on dimension, and exact three-dimensional values are not supplied by the planar theory. Hyperscaling relation illustrates the change: mean-field values give $2\beta +\gamma =3$, while $d\nu =d/2$, so the naive equality fails above six. In $d=1$, $p_c=1$ and no infinite percolation cluster exists for $p<1$; this is a degenerate endpoint case rather than the ordinary interior transition.

Write $H(R)$ and $V(R)$ for the horizontal and vertical open-crossing increasing events of a rectangle in the rotated square lattice. At parameter $1/2$, planar duality for rectangle crossings says that failure of $H$ is exactly a closed dual vertical crossing. Quarter-turn symmetry and the boundary convention of the rotated rectangles identify the two alternatives on a square. Thus its crossing probability is $1/2$; a rectangle obtained by a harmless one-step boundary adjustment has crossing probability at least $1/2$. This is the finite-domain exact self-dual rectangle crossing probability, not an assumption about infinite percolation clusters.

We first prove a RSW reflection extension lemma. In coordinate units adapted to the rotated drawing, take $S=[0,n{]}^2$, $T=[-n,n{]}^2$, and $R=[-n,2n]\times [-n,n]$. Reveal the rightmost open vertical crossing $\Gamma$ of $S$, when one exists, using only its edges and the region to its right. Reflect $\Gamma$ across the horizontal axis. The part $D$ of $T$ to the left of these two paths remains unexposed and has the independent parameter-$1/2$ law. A horizontal crossing of $T$ must reach their union. Its probability is at least $1/2$. Reflection symmetry and the union bound give a probability at least $1/4$ of reaching the upper path $\Gamma$ through $D$. Conditional opening of the edges on $\Gamma$ can only help. Since $V(S)$ has probability at least $1/2$, the increasing event $B$ that a vertical crossing of $S$ is connected inside $T$ to its left side has probability at least $1/8$.

Reflect this construction in the vertical midline of $S$ to obtain an increasing event $B^{\prime }$ of the same probability, connecting a vertical crossing of $S$ to the right side of $[0,2n]\times [-n,n]$. On $H(S)\cap B\cap B^{\prime }$, the horizontal crossing of $S$ meets both vertical crossings, so all three graph paths join and give $H(R)$. The Harris-FKG inequality now yieldsThe exploration only conditions the exposed side of the extremal graph path; reflecting a drawn path does not assert that its reflected edges are open. This distinction is what makes the extension argument valid.

To pass from aspect ratio $3/2$ to $3$, put four rectangles of width $3h/2$ and height $h$ next to each other, with successive left boundaries separated by $h/2$. Adjacent rectangles overlap in a square of side $h$. Require horizontal crossings of the four rectangles and vertical crossings of the three overlap squares. Every consecutive pair of horizontal crossings meets the vertical crossing in its overlap; together they form a horizontal crossing of width $3h$. The Harris-FKG inequality gives a strictly positive bound, for these compatible scales, ofThe construction works on the rotated square lattice with the boundary sites used in the source drawing. Integer roundings do not create a scale restriction: for an odd height use the largest smaller compatible even height, and use eight horizontal rectangles and seven overlap squares, whose union has auxiliary aspect ratio $5$, so that its width exceeds the desired $3m$ width for all sufficiently large $m$. Truncate its horizontal crossing on first reaching the desired right side. The number of extra rectangles and overlap-square crossings is bounded independently of $m$, and every factor is bounded below by the same positive constants. The finitely many smallest rectangles each have positive crossing probability, since a specified finite open graph path suffices. Therefore a constant $c>0$ works at every integer scale. Taking $\tau =c/2$ ensures the requested strict inequality:This proves the required instance of the Russo-Seymour-Welsh theorem through reflection, exploration and gluing. The parameter in this calculation is $1/2$.

The Russo-Seymour-Welsh theorem and self-duality give a scale-independent $c>0$ such that every annuluscontains a closed circuit surrounding the origin with probability at least $c$. Choose every second annulus so that the corresponding site sets are disjoint. Their circuit events are then independent, and the Borel-Cantelli lemmas say that infinitely many of them occur almost surely.

Every such closed circuit separates the origin from infinity, so the origin cannot belong to an infinite open cluster. By translation invariance, the same holds for every site. Since the triangular lattice is countable, a countable union shows that almost surely no infinite open cluster exists at $p=1/2$.

Set $N=3^j$. At $p=1/2$, first use the Russo-Seymour-Welsh theorem to produce, with probability bounded below independently of $N$, two separated open crossings from left to right and a closed crossing between them. Explore the interface separating the lower open cluster from the adjacent closed cluster until it reaches the opposite macroscopic boundary. The explored interface supplies two alternating arms, while fresh RSW crossings in the unexplored regions supply the other two.

Repeat this construction in the geometrically separated scale bandsThe domain Markov property of a percolation exploration leaves unrevealed sites with their original independent critical law. RSW and the Harris-FKG inequality therefore give a uniform conditional probability $c>0$ that the required open and closed connections occur in each band. On that event the exploration identifies a site having four alternating arms to the four sides of $W_N$, hence a pivotal site for $E_N$.

Choose the candidates in disjoint scale bands, so successful bands give distinct pivotal sites. If $Y_k$ indicates success at scale $k$, thenThusfor $j\ge 2$, after adjusting the positive constant. This is the required logarithmic-in-$N$ lower bound.

WriteThe Russo-Seymour-Welsh theorem and the Harris-FKG inequality give the standard one-arm extension estimate: there is $c>0$ such thatuniformly in $r$. Indeed, on the one-arm event to scale $r$, a fixed finite collection of open rectangle crossings in the annulus ${\Lambda }_{2r}\setminus {\Lambda }_r$, each having probability bounded below by RSW, joins that arm to $\partial {\Lambda }_{2r}$; FKG multiplies the lower bounds. Iteration shows that $\pi (ar)$ and $\pi (r)$ are comparable for every fixed $a>0$. This proves the estimate suggested in the hint.

Fix $x\in \partial {\Lambda }_n$ and choose $r=\lfloor n/4\rfloor$. If $0⟷x$, there is an open arm from $0$ to distance $r$ and another from $x$ to distance $r$. These are independent events because they use disjoint edge sets, so the extension estimate gives

For the reverse inequality, take one-arm events from $0$ and $x$ at scale comparable with $n$, in disjoint boxes. A fixed collection of open crossings of rectangles of bounded aspect ratio joins the two arms. The Russo-Seymour-Welsh theorem bounds the probability of every added crossing below uniformly in $n$ and in the position of $x$ along the four sides; the Harris-FKG inequality and the arm-extension estimate therefore giveThis is the usual RSW gluing lemma for two one-arm events. Enlarging the constants handles the finitely many small $n$, proving the claim with positive constants $c_1,c_2$.

At $p=1/2$ for independent bond percolation on the square lattice, there exist $C<\infty$ and $\alpha >0$ with ${\mathbb{P}}_{1/2}(0\leftrightarrow \partial [-n,n{]}^2)\le C{n}^{-\alpha }$. The Russo-Seymour-Welsh theorem and the Harris-FKG inequality give a uniform positive probability of a closed dual graph cycle around each geometrically spaced square ring. The independent annular barriers for percolation give the polynomial bound and imply zero critical percolation probability. This does not determine the exact critical exponent.