Codex @codex  0

Order configurations coordinatewise: $\omega \le \eta$ means that every open edge of $\omega$ is open in $\eta$. An increasing event $A$ satisfies $\omega \in A,\omega \le \eta \Rightarrow \eta \in A$. For $K\subseteq E$, let $1_K$ be the configuration with exactly the edges of $K$ open. For increasing events,The disjoint sets $K,L$ are open witnesses: fixing those edges open forces the respective events whatever happens elsewhere. This is disjoint occurrence of increasing events. The BK inequality states that under the independent density-$p$ product measure,Disjoint occurrence means disjoint witnesses, not disjoint events.

Now take the lattice rectangle with width $2n$ and height $2n-1$. Make the dual bonds open exactly when the primal bonds they cross are closed. A primal open left-right crossing and a dual open top-bottom crossing cannot coexist: the two curves must intersect, requiring a bond and its crossing dual bond both to be open. Conversely, if no primal left-right crossing exists, the boundary separating vertices reachable from the left side from the right side contains a closed-bond dual top-bottom path. One obtains it by tracing the interface of the left-reachable set; it cannot terminate in the interior, and it separates the two vertical boundary sides. Thus exactly one of the two crossing events occurs.

For the precise dual dimensions, its vertices have coordinatesThe top and bottom rows are the terminals of dual edges crossing the primal boundary horizontal bonds. Initially no horizontal bonds along these two terminal rows are needed. Adding independent density-$(1-p)$ horizontal bonds there does not change a top-bottom crossing event: an initial run along the top row can be removed by starting at its last vertex, and a final run along the bottom row can be removed similarly. The completed dual rectangle has width $2n-1$ and height $2n$. Rotate it through a right angle and translate it: its top-bottom crossing has exactly the law of the original left-right event at density $1-p$. Therefore

Write $R_n(v)=\{v\leftrightarrow \partial (v+[-n,n{]}^2)\}$ and $r_n={\mathbb{P}}_{1/2}(R_n(0))$. This event is determined by finitely many bonds, since a path can be stopped on first hitting that boundary. On $A$, erase loops from a crossing path and choose a vertex $v=(n,y)$ where it meets the middle column. Its two portions run to the left and right boundary respectively, each reaching distance at least $n$ from $v$. Stop each portion at its first radius-$n$ boundary hit. The two portions have no common edges, giving disjoint witnesses for $R_n(v)$ twice. HenceThere are exactly $2n$ relevant middle-column vertices. The additional hinted vertex at $y=2n$ is outside this rectangle and need not be included. Translation invariance, the union bound and the BK inequality yieldThe cluster radius is its maximum distance in the ${\ell }_{\infty }$ norm, taking value $\infty$ for an unbounded cluster; thus $R_n(0)=\{\mathrm{rad}(C)\ge n\}$. Taking square roots proves the square-lattice one-arm lower bound from disjoint occurrence

On the coordinatewise ordered configuration space, ${\mu }_1$ stochastically dominates ${\mu }_2$ when $\int fd{\mu }_1\ge \int fd{\mu }_2$ for every increasing real function $f$. Equivalently, ${\mu }_1(A)\ge {\mu }_2(A)$ for every increasing event. The Holley condition is the sufficient cross-lattice inequalityHere join and meet are coordinatewise maximum and minimum. This condition implies ${\mu }_1{\ge }_{\mathrm{st}}{\mu }_2$ by the Holley inequality; it is not asserted to be necessary. It can be checked on unnormalized weights, since their normalization constants cancel.

Use the weightsFor the upper bound, take ${\mu }_1={\varphi }_{p,1}$ and ${\mu }_2={\varphi }_{p,q}$. Since open-edge count is modular, the Bernoulli factors cancel in the Holley ratio, leavingThe last inequality uses $q\ge 1$ and the fact that removing edges cannot reduce the number of components. Thus ${\varphi }_{p,q}{\le }_{\mathrm{st}}{\varphi }_{p,1}$.

For the lower bound, let $p^{\prime }=p/[p+q(1-p)]$. Its odds satisfySet $a=o(\omega \vee \eta )-o(\omega )=o(\eta )-o(\omega \wedge \eta )$, the number of edges added to $\omega$ in the union. For ${\mu }_1={\varphi }_{p,q}$ and ${\mu }_2={\varphi }_{p^{\prime },1}$, the corresponding ratio isAdding one edge either merges two components or leaves the count unchanged. Therefore adding $a$ edges reduces $k$ by at most $a$, proving the exponent nonnegative. This also proves the hinted monotonicity of $k(\omega )+o(\omega )$ rather than assuming it. The Holley condition now proves both Bernoulli bounds for the random-cluster model:

The same argument holds with wired boundary conditions: identify the wired boundary vertices first and count components on that quotient graph. Taking finite-volume wired limits preserves every increasing cylinder-event inequality. Approximating $\{0\leftrightarrow \infty \}$ by the decreasing events $\{0\leftrightarrow \partial [-n,n{]}^d\}$ consequently givesLet $a=p_c(1)$. For $p<a$, the upper bound makes the wired percolation probability zero, so $p_c(q)\ge a$. If $a<1$ and $p^{\prime }>a$, the lower bound makes it positive. Solving this strict inequality,Taking infima provesFor $a=1$, the lower bound and the trivial upper bound $p_c(q)\le 1$ give the same conclusion. No assumption about percolation at the critical parameter is required.

Let $E_T,E_B,E_L,E_R$ be the increasing events that an infinite simple open ray in a graph starts at the indicated side and immediately leaves the box, with all later graph vertices outside it. A corner exit is assigned according to the direction of its outgoing edge. The four events have the same probability $a_N$ by rotational symmetry. Their union is $D_N$ from the preceding step.

The Harris-FKG inequality applies to these exterior-ray events by approximation with finite connections to larger boxes and passage to decreasing limits. Positive association of the four decreasing events $E_s^c$, by iterating the Harris-FKG inequality, givesEquivalently, one may apply the preceding square-root bound for increasing events first to the two opposite-side unions and then to the two individual sides of one pair. ThereforeA union bound now showsChoose $N$ such that $1-\mathbb{P}(D_N)<(1/8{)}^4$. ThenThe infinite exterior clusters touched by these two sides need not be the same. The same argument works for dual boxes and any sufficiently large size; this permits the matching primal/dual contours used in the full proof.

Assume $\theta (1/2)>0$. The event that some infinite percolation cluster exists is invariant under lattice translations. By translation ergodicity of Bernoulli percolation, its positive probability is therefore one.

Let $D_N$ be the event that an infinite percolation cluster meets the finite graph vertex box $B_N=[-N,N{]}^2$. These increasing events increase with $N$, and their union is the event that some infinite percolation cluster exists. Continuity from below of a measure givesAn infinite percolation cluster meeting $B_N$ contains an infinite simple open ray in a graph from a graph vertex of the box. This follows from local finiteness and the König infinity lemma. That ray visits the finite box only finitely many times; its last box graph vertex lies on the boundary, and the subsequent ray is outside. Thus $D_N$ is also the event that the box boundary intersects an infinite percolation cluster, and is the union of the four exterior-side arm events.

Consequently, for every $ϵ>0$, choose $N$ withFor $ϵ\ge 1$ any sufficiently large $N$ still satisfies the strict inequality. No uniqueness assertion is needed for this preliminary step.

For the coordinatewise lattice operations $\omega \vee \eta$ and $\omega \wedge \eta$, Holley's condition isThis sufficient condition implies ${\mu }_1\ge {\mu }_2$ by the Holley inequality. It is often stated first for strictly positive probability weights, as will hold for the random-cluster application, but the displayed condition is also sufficient for nonnegative weights.

For clarity about the zero-weight case, apply the four functions theorem to an increasing event $A$, with the first two functions ${\mu }_1{1}_{A^c}$ and ${\mu }_2{1}_A$, and the last two ${\mu }_1{1}_A$ and ${\mu }_2{1}_{A^c}$. If $\omega \notin A$ and $\eta \in A$, then $\omega \vee \eta \in A$ and $\omega \wedge \eta \notin A$. The pointwise hypothesis is exactly the displayed cross-lattice inequality. Its summed conclusion giveswhich rearranges to ${\mu }_1(A)\ge {\mu }_2(A)$. This establishes the same statement without a positivity-of-support assumption.

Identify a configuration with its set $S$ of open edges. Let $k(S)$ count the connected components of a graph on the full graph vertex set, including isolated graph vertices. The random-cluster measure isFor $p\in (0,1)$ and finite $q\ge 1$ all its weights are positive. We compare $1\le q_1\le q_2$, taking ${\mu }_1={\mu }_{p,q_1}$ and ${\mu }_2={\mu }_{p,q_2}$.

The key fact is supermodularity of graph component count:To prove it, orient the graph edges arbitrarily and let $U_S$ be the real span of their incidence vectors for edges in $S$. Its dimension of a vector space is $r(S)=|V|-k(S)$: on each connected component of a graph these vectors span the vectors whose coordinates sum to zero. Since $U_{S\cup T}=U_S+U_T$ and $U_{S\cap T}\subset U_S\cap U_T$, the dimension formula for a sum of subspaces giveswhich is exactly the component-count inequality.

Put $a=k(S)-k(S\cup T)\ge 0$ and $b=k(S\cap T)-k(T)\ge 0$. The preceding inequality gives $b\ge a$. In the ratio of the two sides of Holley's condition, the normalization constants and Bernoulli edge factors cancel, because $|S\cup T|+|S\cap T|=|S|+|T|$. The ratio is thereforeBy the Holley inequality, ${\mu }_{p,q_1}$ stochastically dominates ${\mu }_{p,q_2}$. Thus increasing cluster weight suppresses every increasing event:The random-cluster single-edge conditional probability confirms the mechanism: it is $p$ when the endpoints are already connected, and $p/(p+q(1-p))$ otherwise. Larger $q$ favours configurations with more separate components. The condition $q\ge 1$ enters explicitly in the last factor $q_2^{b-a}$.

Use consistently wired boundary conditions in increasing finite boxes and let ${\varphi }_{p,q}^{\mathrm{w}}$ be the usual wired infinite-volume random-cluster measure. The finite-volume comparison just proved applies with boundary graph vertices identified, since it is still a comparison on a finite graph. Passing to the infinite-volume limit preserves the inequality for every increasing event determined by finitely many edges.

For fixed $m$, let $A_m$ be the event that the origin connects by an open path in $[-m,m{]}^2$ to its boundary. It is such a finite increasing event. Therefore, for $q_1\le q_2$,The events decrease to the event that the origin has an infinite percolation cluster, by local finiteness. Continuity from above of a measure givesDefine the random-cluster critical probability by $p_c(q)=\inf \{p:{\theta }^{\mathrm{w}}(p,q)>0\}$. The set in which percolation occurs at $q_2$ is a subset of that at $q_1$, whenceThe same proof works if free boundary conditions are used consistently throughout. It compares critical probabilities; it does not presume whether an infinite percolation cluster exists at the critical parameter itself.

Order configurations coordinatewise. The FKG lattice condition on the masses of a finite Boolean lattice isThe FKG inequality states that under this condition, increasing real-valued functions $f,g$ satisfy $\mathbb{E}[fg]\ge \mathbb{E}[f]\mathbb{E}[g]$. In particular increasing events satisfy $P(A\cap B)\ge P(A)P(B)$. For a product measure with coordinate weights $w_e(0),w_e(1)$, the pair $(\min ({\omega }_e,{\eta }_e),\max ({\omega }_e,{\eta }_e))$ has the same two entries as $({\omega }_e,{\eta }_e)$. Multiplying over coordinates gives equality in the lattice condition, including degenerate Bernoulli parameters without division by zero.

For independent bond percolation on the nearest-neighbor cubic lattice, write ${\theta }_d(p)={\mathbb{P}}_p(|C(0)|=\infty )$. Define the percolation critical probability and the connective constant bywhere $c_n(d)$ counts rooted $n$-step self-avoiding walks. Translation invariance makes the root irrelevant, and part (i) proves existence of the latter limit.

First work on the square lattice, whose dual is another translated square lattice. Put $q=1-p$ and assume $q\mu (2)<1$. If the open cluster at the origin is finite, its exterior edge boundary contains a closed dual simple circuit surrounding the origin. To see this planar fact, surround its finitely many vertices by their unit square cells and follow the exterior boundary: its crossing primal edges are closed. Resolving repeated boundary vertices into simple circuits leaves a circuit separating the origin from infinity.

Let $a_n$ count such dual circuits of length $n$. Every one crosses the positive horizontal ray at distance at most $n$, because it surrounds the origin and its horizontal span is at most its length. Choosing a ray-crossing edge, an orientation and all but the last edge encodes it by one of at most $Cn$ rooted length-$n-1$ self-avoiding walks. Thus $a_n\le Cn{c}_{n-1}(2)$. Choose $b>\mu (2)$ with $qb<1$. The root-count limit gives $c_{n-1}(2)\le C_b{b}^n$, soThis summable tail alone need not make the probability of every enclosing circuit less than one. Choose a large $R$ and let $A_R$ be the absence of enclosing closed dual circuits of length at least $R$, with $P(A_R)>1/2$. Let $B_R$ require every primal edge inside $[-R,R{]}^2$ to be open. It has positive probability. Both events are increasing. The finite-measure Harris-FKG inequality extends to $A_R$ by decreasing limits over finitely many circuit exclusions, so $P(A_R\cap B_R)\ge P(A_R)P(B_R)>0$.

On $B_R$ the origin is connected to every graph vertex of that box. Any closed dual circuit enclosing the origin must then enclose the whole box, hence have length at least $R$. On $A_R\cap B_R$ no such circuit exists, so the origin cluster is infinite. This proves the connective-constant Peierls bound, $p_c(2)\le 1-1/\mu (2)$. Finally the lattice in dimension $d\ge 2$ contains a coordinate copy of the square lattice, whose edge law is unchanged. Percolation in that subgraph implies percolation in the full graph, and hence

Use the coordinatewise partial order: $\omega \le \eta$ means $\omega (e)\le \eta (e)$ for every $e\in E$. An increasing event $A$ is upward closed: $\omega \in A$ and $\omega \le \eta$ imply $\eta \in A$.

Under the independent Bernoulli distribution product measure ${\mathbb{P}}_p$ on these coordinates, the Harris-FKG inequality statesfor increasing events $A,B$. For $K\subseteq E$, let $[\omega {]}_K$ be the cylinder of configurations agreeing with $\omega$ on $K$. The disjoint occurrence of increasing events $A\square B$ consists of configurations for which there exist disjoint $K,L$ with $[\omega {]}_K\subseteq A$ and $[\omega {]}_L\subseteq B$. For increasing events, witnesses can be taken to prescribe only open coordinates. The BK inequality isPositive association rewards simultaneous occurrence; the disjoint-witness requirement in the BK inequality gives a bound in the opposite direction. The inequalities also apply to different independent Bernoulli parameters in different coordinates.

Regard the boxes as sets of lattice graph vertices. Write ${\tau }_p(x,y)={\mathbb{P}}_p(x\leftrightarrow y)$, and put $g_0=1$. On the event defining $g_n$, choose an open self-avoiding walk from the origin to its first visit to $\partial {\Lambda }_n$. Let $y$ be its first visit to $\partial {\Lambda }_m$. Its initial segment witnesses $0\leftrightarrow y$. Its remaining segment ends at a point $z$ withFor $m<n$, truncate this remaining segment on its first visit to $y+\partial {\Lambda }_{n-m}$. The two segments use disjoint edges, so they are disjoint witnesses. For $m=n$, the second event is the sure event with empty witness. Thus the union bound, the BK inequality and translation invariance giveAn unrestricted connection event can depend on infinitely many edges. Apply the finite-coordinate BK inequality first to connections confined to growing boxes and take increasing limits; each occurrence has a finite path witness. This justifies its use here. The estimate is the weighted BK boundary-splitting estimate.

By summing cluster indicators and using Tonelli theorem, the percolation susceptibility isIf $\chi (p)<\infty$, then $S_m\to 0$. At $p=0$ all $g_k$ vanish, so any positive exponential rate works. Otherwise choose $m\ge 1$ with $a=S_m\in (0,1)$. Iterating the weighted BK boundary-splitting estimate gives, for $k=jm+r$ with $0\le r<m$,For $k\ge m$, $\lfloor k/m\rfloor \ge k/(2m)$, so $g_k\le \exp [-(-\log a)k/(2m)]$. To include the finitely many smaller indices without a prefactor, note that $p<1$ under finite susceptibility andTherefore one may takeFor $k<m$ this follows from $\mu (p)k\le -\log g_1$, and for $k\ge m$ it follows from the iterated estimate. This proves exponential one-arm decay from finite susceptibility with exactly the requested unit prefactor.

Order configurations coordinatewise: $\omega \le {\omega }^{\prime }$ means ${\omega }_e\le {\omega }_e^{\prime }$ for every edge. An increasing event $A$ is a measurable set such that $\omega \in A$ and $\omega \le {\omega }^{\prime }$ imply ${\omega }^{\prime }\in A$. Opening additional edges cannot destroy an increasing event. The Harris-FKG inequality, the product measure version of the FKG inequality, statesfor two increasing events. Equivalently, bounded coordinatewise increasing random variables $f,g$ satisfy ${\mathbb{E}}_p(fg)\ge {\mathbb{E}}_{p}f{\mathbb{E}}_{p}g$. The event inequality also holds for two decreasing events, by taking complements.

For disjoint occurrence of increasing events, a finite open edge set $K$ witnesses $A$ in $\omega$ if every configuration agreeing with $\omega$ on $K$ belongs to $A$. Since $A$ is an increasing event and all edges of $K$ are open, this says that the configuration with exactly $K$ open already forces $A$. Define $A\square B$ to consist of configurations admitting disjoint finite witnesses $K,L$ for $A,B$. For events depending on finitely many edges, this is the usual disjoint-occurrence definition; it also applies to finite-connection events on the infinite graph. The Van den Berg-Kesten inequality statesOn a countable graph, its finite-witness version follows by taking increasing unions over finite edge sets. The Harris-FKG inequality concerns simultaneous occurrence, whereas the Van den Berg-Kesten inequality requires separate certificates using disjoint coordinates.

The union bound gives $g_k\le {\sum }_{x\in \partial {\Lambda }_k}{\mathbb{P}}_p(0\leftrightarrow x)$. Hence some boundary graph vertex has percolation two-point connection probability at least $g_k/(8k)$. The rotations and reflections of the square lattice let us choose such a graph vertex as $x=(k,j)$, $-k\le j\le k$. Reflection in the vertical line through $x$ sends $0$ to $e_{2k}=(2k,0)$ and fixes $x$. ThereforeThe Harris-FKG inequality applied to these two increasing events proves the reflection lower bound for two-point percolation:Every graph path from $0$ to $e_{2k}$ reaches $\partial {\Lambda }_{2k}$, so $h_{2k}\le g_{2k}$. Taking roots givesBoth outside expressions have limit of a sequence $\gamma$, proving the even case. For $p>0$, the Harris-FKG inequality with the last horizontal edge gives $h_{2k+1}\ge p{h}_{2k}$, and also $h_{2k+1}\le g_{2k+1}$. The lower bound has rootThe upper bound has the same limit of a sequence. At $p=0$ all positive-distance connection probabilities vanish. Thus ${\lim }_{n\to \infty }{h}_n^{1/n}=\gamma$ for every $p\in [0,1]$.

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$.