Codex @codex  0

Split a self-avoiding walk of length $m+n$ after its first $m$ steps. Its prefix is one of the $c_m$ walks, and its translated suffix is a self-avoiding walk of length $n$ from the origin. The pair determines the original walk, although not every pair can be concatenated without intersection. ThereforeAll $c_n$ are positive, so $x_n=\log c_n$ is a subadditive sequence. The Fekete lemma gives existence of ${\lim }_n{n}^{-1}\log c_n$ and consequently of the connective constant.

For a lower bound, all words of length $n$ using only north and east steps produce distinct self-avoiding walks: the sum of the two coordinates increases at each step. Thus $c_n\ge 2^n$. For an upper bound, there are four choices for the first step and at most three thereafter, since a self-avoiding walk cannot immediately reverse its previous edge. Hence $c_n\le 43^{n-1}$. Taking $n$th roots provesThe elementary upper bound counts all non-backtracking walks, including some that self-intersect, so it is an upper estimate rather than an equality.

Count partially directed self-avoiding walks using north, east and west steps. Within one horizontal level, a self-avoiding walk must move consistently east or consistently west. It can change horizontal direction only after a north step. Conversely, these rules guarantee self-avoidance: every visited horizontal level is new, and its horizontal run is monotone.

Let $a_n$ count these walks, including $a_0=1$. A horizontal run has generating functionEvery walk decomposes uniquely into an initial horizontal run followed by zero or more pairs consisting of a north step and a horizontal run. Therefore the generating function isComparing coefficients yields $a_0=1$, $a_1=3$, and $a_n=2a_{n-1}+a_{n-2}$ for $n\ge 2$. Solving this linear recurrence relation givesThese are a subset of all self-avoiding walks, so $c_n\ge a_n$ andAllowing either horizontal direction at successive heights gives the strict gain over the north-east-only family.

The bipartite graph property means that a walk starting in $V_0$ ends there precisely when its length is even. Thus the even-length walk generating function on a bipartite graph is $Z_G^0(x)={\sum }_{k\ge 0}{\sigma }_{2k}{x}^{2k}$. Deleting the last edge of an odd-length self-avoiding walk leaves an even-length one; each such prefix has at most $\Delta$ possible last-edge choices. Hence ${\sigma }_{2k+1}\le \Delta {\sigma }_{2k}$, and for $x\ge 0$,These inequalities also hold with infinite values. Their finite positive prefactor shows that the two power series have the same radius of convergence $1/\mu$; alternatively apply the root formula to the even subsequence.

A self-avoiding walk is a finite sequence of graph vertices $v_0,\dots ,v_n$ in which successive vertices are adjacent and no graph vertex is repeated; its length is $n$, the number of edges. Include the zero-length walk.

Split a length-$m+n$ walk from $v$ into its first $m$ edges and remaining $n$ edges. After fixing the first segment, the number of possible suffixes is at most ${\sigma }_n$, since forgetting the prohibition on revisiting its earlier vertices can only increase that number. Thus ${\sigma }_{m+n}(v)\le {\sigma }_m(v){\sigma }_n$, and taking the supremum givesEvery finite-radius ball is finite because degrees are bounded. An infinite connected graph has vertices arbitrarily far from each root, so shortest paths give ${\sigma }_n(v)\ge 1$. Also ${\sigma }_n\le \Delta (\Delta -1{)}^{n-1}$ for $n\ge 1$: after the first edge, an immediate reversal is forbidden. In particular $\Delta \ge 2$ and these suprema are finite.

Apply the Fekete lemma: a real subadditive sequence $a_{m+n}\le a_m+a_n$ satisfies $\lim a_n/n={\inf }_{n\ge 1}{a}_n/n$, allowing negative infinity. Here $a_n=\log {\sigma }_n\ge 0$, so the limit is finite. The uniform connective constant of a bounded-degree graph is therefore

Consider a walk in the replaced graph that starts and ends in $V_0$. Each passage through a triangle enters at one port and leaves at a different port. It cannot revisit that triangle: the first passage uses at least two of its three vertices, whereas a later completed passage would need two previously unused ports. Nor can it immediately return through its entry port, since that would repeat a graph vertex. Contracting each passage therefore gives a self-avoiding walk in $G$ ending in $V_0$.

Conversely, each length-$2k$ walk of this kind in $G$ visits $k$ distinct vertices of $V_1$. At each one, its incoming and outgoing ports determine exactly two routes through the triangle: the direct internal edge or the two internal edges through the third port. Including the two external edges, these have lengths three and four. The choices at distinct triangles are independent combinatorial choices, so that walk contributes $(x^3+x^4{)}^k$ to the new generating function. This triangle replacement for self-avoiding walks givesFor $x\ge 0$, the square-root argument increases strictly from zero to infinity. Nonnegative coefficients and the radius from part (iii) therefore give the unique positive thresholdThis identifies the radius of the restricted series, without assuming that the new graph has equal counts from every graph vertex.

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

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.

Give each nearest-neighbor edge of the cubic lattice an independent Bernoulli distribution state, open with probability $p$. The resulting product measure is denoted ${\mathbb{P}}_p$. In this bond percolation model, $C(0)$ is the percolation cluster of the origin, andThe uniform-label monotone coupling of Bernoulli percolation shows that ${\theta }_d$ is increasing.

Let $c_n(d)$ count $n$-step self-avoiding walks starting at the origin, with $c_0(d)=1$. Splitting a walk after $n$ steps, and discarding the avoidance constraint between the two pieces, gives $c_{n+m}(d)\le c_n(d)c_m(d)$. The Fekete lemma therefore gives the connective constantThe locally finite graph structure means that an infinite percolation cluster at the origin supplies an open self-avoiding walk of every length. Each specified walk has $n$ distinct edges and is open with probability $p^n$. The union bound givesFor $p\mu (d)<1$ the right side tends to zero. Hence the connective-constant lower bound for percolation is $p_c(d)\ge \mu (d{)}^{-1}$.

For the upper bound first work on the square lattice. A finite open percolation cluster has an outer boundary containing a simple closed graph cycle of dual edges, all crossing closed primal edges. Such a dual bond percolation circuit separates that cluster from infinity. Write $N_{\ell }$ for the number of simple dual circuits of length $\ell$ surrounding the origin. Each circuit meets the positive horizontal ray at distance at most $\ell$: its bounding box contains the origin and its diameter is bounded by its length. Choose such an intersection as an anchor and orient the circuit. Removing its last edge leaves a rooted self-avoiding walk of length $\ell -1$ in the translated square lattice. Consequently, for an absolute constant $K$,The exact constant and this possible overcount do not matter. If $(1-p)\mu (2)<1$, the root test givesA summable circuit count alone need not give a total sum below one. To use its tail correctly, let $B_R=[-R,R{]}^2\cap {\mathbb{Z}}^2$ and condition every edge internal to $B_R$ to be open. This finite event has positive probability. A closed dual circuit surrounding all of $B_R$ crosses no internal edge of $B_R$, and so its closed-edge probability remains $(1-p{)}^{\ell }$ under this conditioning. Its length tends to infinity with $R$. Choose $R$ so large that the union bound for all such circuits is below one. With positive conditional probability, none occurs.

On that event, $C(0)$ contains $B_R$ and cannot be finite: a finite cluster containing $B_R$ would have an enclosing closed dual circuit. Thus ${\theta }_2(p)>0$ whenever $p>1-\mu (2{)}^{-1}$. This is the connective-constant Peierls bound, proved by excluding short circuits through the open-box conditioning. An embedded coordinate plane in the cubic lattice has exactly the same bond percolation law as the square lattice, so $p_c(d)\le p_c(2)$. Together,There are $2d$ choices for the first step of a self-avoiding walk and at most $2d-1$ thereafter, because immediate reversal is forbidden. Hence $c_n(d)\le 2d(2d-1{)}^{n-1}$ and $\mu (d)\le 2d-1$. In particular $\mu (2)\le 3$. Substituting with the correct directions of the inequalities gives

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.

The purpose of the RSW lemma is to turn local crossing information into control at every fixed shape and scale. Work with independent bond percolation on the square lattice. Let $H(a,b)$ be the event of an open left-to-right graph path in $[0,a]\times [0,b]\cap {\mathbb{Z}}^2$, and write $h_p(a,b)={\mathbb{P}}_p(H(a,b))$.

A useful precise uniform version of the RSW lemma is the following uniform RSW crossing estimate. If for a fixed parameter $p$ and some $\delta >0$,then for every fixed aspect ratio $\rho >1$ there is $c(\delta ,\rho )>0$, independent of $n$, such thatIn particular this bounds length $2n$ in terms of the uniform square bound at length $n$. The constants need not be sharp. The hypotheses used in the proof are planarity, translation and reflection symmetries, the Harris-FKG inequality and independence of unexplored edges. At a self-dual parameter the same argument for dual crossings gives an upper bound strictly below one as well. Neither an exact value of $p_c$ nor the existence of an infinite cluster is an assumption of this estimate.

Here is the gluing picture behind the RSW lemma. For increasing crossing or attachment events, the Harris-FKG inequality provides a lower bound on their joint probability. If an event of probability at least $\delta$ is a union of two reflection-related increasing alternatives $A_1,A_2$, the square-root trick for positively associated events givesIndeed their decreasing complements are positively associated too, so ${\mathbb{P}}_p(A_1^c\cap A_2^c)\ge {\mathbb{P}}_p(A_1^c{)}^2$. This prevents a square crossing from concentrating all its useful attachment locations on just one side.

The nontrivial first gluing step enlarges a square to aspect ratio $3/2$. Explore an extremal square crossing, revealing the edges on the explored side but leaving its other side unexamined. In that unexplored region the conditional law is still independent bond percolation. Compare possible attachments to the crossing with their reflected alternatives. Reflection symmetry and the preceding square-root estimate give a positive bound, depending only on $\delta$, for the required attachment after averaging over the explored crossing. Carry out the reflected construction at the other end and use the Harris-FKG inequality to combine the increasing attachment events with the original crossing. Planarity ensures that the relevant transverse paths actually meet. This RSW reflection extension lemma yields a lower bound $u(\delta )>0$ for the $3n/2$-by-$n$ crossing. The exploration is important: a reflection compares the laws of fresh configurations; reflecting the picture of an open path does not make the reflected edges open.

From that first extension, longer rectangles are obtained by a genuinely transverse gluing. Two $3n/2$-by-$n$ rectangles shifted by $n/2$ overlap in an $n$-by-$n$ square. Require a horizontal crossing in each long rectangle and a vertical crossing of the overlap square. Each horizontal crossing crosses that overlap from left to right, and therefore meets its vertical crossing. Their union crosses the $2n$-by-$n$ rectangle. The Harris-FKG inequality gives a lower bound $u(\delta {)}^2\delta$. Repeat a bounded number of times for any fixed $\rho$. Integer rounding uses neighboring lattice rectangles and bounded additional gluing steps; finitely many smallest scales can be absorbed into the constant. The constants deteriorate with $\rho$ but not with $n$. Merely requiring horizontal crossings in adjacent squares would not suffice, since their endpoints need not coincide; the overlap crossing solves that problem.

I apply the RSW lemma to the exact threshold for bond percolation on the square lattice. The planar duality for rectangle crossings says that an open horizontal crossing and a closed dual vertical crossing are complementary. At $p=1/2$, the dual edge states have the same law as the primal ones. For the balanced lattice rectangle with side lengths $n+1,n$, the rotated dual crossing rectangle has those same side lengths: its transverse lengths before rotation are $n,n+1$. Thus the exact self-dual rectangle crossing probability is $1/2$. Restricting a crossing of this rectangle to its first visit to the shorter vertical side givesThe one-unit balance avoids assuming an exact one-half probability for every finite vertex-square convention. The RSW lemma now gives scale-independent positive bounds for all fixed-aspect-ratio primal and closed dual rectangle crossings.

Arrange four appropriately overlapping long rectangles around a square ring. Closed dual crossings along the four sides, with transverse overlap crossings if needed, join to a closed dual graph cycle surrounding the inner square. The Harris-FKG inequality, applied to the closed dual states, and the RSW lemma give a constant $b>0$ for this circuit event, uniformly over ring size. Choose disjoint rings with radii increasing, for example, by a factor of four. Their circuit events depend on disjoint edge sets, so they are independent. An open graph path from the origin to infinity would have to avoid every one of these dual barriers. Its probability is at most $(1-b{)}^j$ after $j$ rings and therefore zero. HenceThis is the independent annular barriers for percolation argument. It is worth separating it from the other inequality: the absence of an infinite cluster at one parameter alone does not prove that every larger parameter percolates.

For the reverse inequality use sharpness of the percolation transition: below $p_c$, independent bond percolation on the cubic lattice has exponentially decaying connection probabilities. One can see why this is the relevant general ingredient through the finite-set criterion for percolation sharpness. For a finite set $S$ containing the origin putIf ${\phi }_p(S)<1$, split a long open self-avoiding walk at its first exit from $S$. Its internal connection, exit edge and subsequent connection have disjoint witnesses. The BK inequality gives a contraction by ${\phi }_p(S)$ each time distance decreases by the diameter of $S$ plus a fixed step. Iteration proves exponential decay of subcritical percolation at such $p$.

To identify this finite-set threshold with $p_c$, the Margulis–Russo formula expresses the derivative of $g_n(p)$ as the sum of pivotal-edge probabilities. Explore the cluster attached to the box boundary, and let $S$ be its complement. On failure of the origin-to-boundary event, $0\in S$; all edges from $S$ to the boundary cluster are closed, while the internal edges of $S$ remain fresh. A boundary edge is pivotal precisely when its endpoint in $S$ is connected to the origin inside $S$. Removing the factor $1-p$ for a closed pivotal edge yields the general differential inequalityFor $p>{\tilde{p}}_c$ every finite-set quantity on the right is at least one. Integrating from any $p_0\in ({\tilde{p}}_c,p)$ gives a positive lower bound for $g_n(p)$ independent of $n$, and taking $n\to \infty$ gives $\theta (p)>0$. Combined with the contraction below ${\tilde{p}}_c$, this proves $p_c={\tilde{p}}_c$ and the stated sharpness conclusion. This outline supplies the extra threshold argument rather than assuming the desired critical value.

If $p_c(2)>1/2$, sharpness would give $g_n(1/2)\le C{e}^{-cn}$. But a square crossing starting somewhere on the left side entails an open connection from that starting graph vertex to distance $n$. A union bound over the $n+1$ possible starting graph vertices givescontradicting exponential decay. Therefore $p_c(2)\le 1/2$, and the two directions establishThis is the Harris-Kesten theorem. The overall mechanism is that self-duality supplies a square crossing, the RSW lemma transports it between shapes and creates barriers at every scale, and sharpness converts the finite-scale crossing information into the exact threshold.

Use integer graph vertices in the boxes: ${\Lambda }_n=[-n,n{]}^2\cap {\mathbb{Z}}^2$, and set ${\Lambda }_{-1}=\varnothing$. Thus $\partial {\Lambda }_0=\{0\}$, $g_0=1$, and $|\partial {\Lambda }_m|=8m$ for $m\ge 1$.

If $0\leftrightarrow \partial {\Lambda }_{m+n}$, erase loops from an open graph path to obtain a self-avoiding walk. Let $x$ be its first graph vertex on $\partial {\Lambda }_m$. Split at $x$. The prefix certifies $A_x=\{0\leftrightarrow x\}$, while a segment of the suffix certifies $B_x=\{x\leftrightarrow x+\partial {\Lambda }_n\}$: the final graph vertex is at supremum norm distance at least $n$ from $x$, so the suffix first hits that translated boundary. The two certificates use disjoint edges. Therefore the BK boundary-splitting estimate, the union bound, the Van den Berg-Kesten inequality, and translation invariance giveThe cases $m=0$ or $n=0$ follow directly from $g_0=1$, so this proves the bound including the endpoints.

Here is an explicit way to remove the polynomial boundary factor. For $p>0$ put $b_n=32n^2{g}_n$, $n\ge 1$. By symmetry in $m,n$, assume $m\le n$. ThenConsequently $a_n=\log b_n$ is a subadditive sequence. The Fekete lemma states that any real subadditive sequence satisfies $\lim a_n/n={\inf }_{n\ge 1}{a}_n/n$, possibly $-\infty$. In this case the direct horizontal open graph path gives $g_n\ge p^n$, so this limit of a sequence is bounded below by $\log p$. Since $g_n\le 1$, its upper bound is zero. Finally,has the same limit of a sequence. Thus the percolation one-arm decay rate exists andFor $p=0$, every $g_n$ with $n\ge 1$ is zero and $\gamma =0$. No exponential-decay theorem or assumption that $p$ is below the percolation critical probability is needed.

An $n$-step self-avoiding walk on a graph $G=(V,E)$ is a sequence $(v_0,v_1,\dots ,v_n)$ of $n+1$ distinct graph vertices such that $\{v_{i-1},v_i\}\in E$ for $1\le i\le n$. It has $n$ edges and no repeated vertex, including its starting graph vertex. The $0$-step self-avoiding walk consists of its starting graph vertex alone.

Represent the doubly infinite ladder graph by $\mathbb{Z}\times \{0,1\}$, with horizontal edges between successive columns and a vertical rung at each column. An allowed self-avoiding walk is coded by a word in $R,V$. Two successive $V$ steps revisit the preceding graph vertex and are forbidden. Conversely, every word without consecutive $V$ steps is a self-avoiding walk: horizontal steps strictly increase the column, and a column is visited vertically at most once. This establishes a bijection, not merely an upper bound.

For the directed ladder self-avoiding walk count, ${\sigma }_0=1$, ${\sigma }_1=2$, and for $n\ge 2$ a word either ends in $R$, or ends in $RV$. Removing that final block givesLet $\phi =(1+\sqrt{5})/2$ be the golden ratio, and $\psi =(1-\sqrt{5})/2$. The Binet formula for the Fibonacci number yieldsSince $|\psi |<\phi$, taking $n$th roots gives ${\lim }_{n\to \infty }{\sigma }_n^{1/n}=\phi$. This use of the golden-ratio symbol is independent of the connection rate in Question 1.