1. Introduction
We study site percolation on the hypercubic lattice $\mathbb Z^d$ . To this end, we fix a parameter $p\in[0,1]$ and create a random subgraph of $\mathbb Z^d$ as follows. Each site (or vertex) $x\in\mathbb Z^d$ , independently of all other sites, is declared occupied with probability p (and vacant otherwise). A bond (edge) between two nearestneighbour sites in $\mathbb Z^d$ is an edge of the random subgraph if and only if the two sites are occupied. Denote by $\theta(p)$ the probability that there is a path starting at the origin $\textbf{0}\in\mathbb Z^d$ and diverging to infinity that consists only of occupied vertices. This allows us to define the critical point as:
It is standard that $0<p_c<1$ in all dimensions $d\ge2$ . In general, it is not possible to write down an explicit value for $p_c=p_c(d)$ (see Table 1 for numerical values), a notable exception is site percolation on the twodimensional triangular lattice (when $p_c=1/2$ ). However, it is possible to derive an asymptotic expansion for $p_c(d)$ when $d\to\infty$ . Indeed, it is known in the physics literature that
The first four terms were found by Gaunt, Ruskin and Sykes in 1976 [Reference Gaunt, Sykes and Ruskin5] through exact enumeration, the last two terms have been obtained by Mertens and Moore [Reference Mertens and Moore16] by exploiting involved numerical methods. When writing this in powers of $\frac{1}{2d}$ , (1.2) becomes
In this paper, we extend the previously known first term by establishing the second and third term, including a rigorous bound on the error term.
Theorem 1.1 (Expansion of $p_c$ in terms of $(2d)^{1}$ ) As $d \to \infty$ ,
The key technical tool for our approach is the lace expansion for site percolation. It was established in a recent paper [Reference Heydenreich and Matzke13], which itself draws its inspiration from Hara and Slade’s seminal paper [Reference Hara and Slade11]. The lace expansion provides an expression for $p_c$ in terms of laceexpansion coefficients, which are defined in Definition 2.5. Moreover, it provides good control over these coefficients, and the results of [Reference Heydenreich and Matzke13] identify already the leading order term in (1.3).
Comparison with bond percolation. It is most instructive to compare the critical thresholds for site and bond percolation. While the critical behaviour of bond and site percolation is comparable, the actual values of the critical thresholds differ, as illustrated by the following table:
Grimmett and Stacey [Reference Grimmett and Stacey10] prove that $p_c^{\text{site}}>p_c^{\text{bond}}$ on $\mathbb Z^d$ for all dimensions $d\ge2$ . This difference must be reflected in the asymptotic expansion for $p_c$ . Indeed, Hara and Slade [Reference Hara and Slade12] and van der Hofstad and Slade [Reference van der Hofstad and Slade15] rigorously obtain a series expansion for bond percolation as:
which indeed differs from the expansion of $p_c^{\text{site}}$ in Theorem 1.1. Again, more precise estimates are known by nonrigorous methods [Reference Gaunt and Ruskin4,Reference Mertens and Moore16]:
for $\sigma={2d1}$ , which is equivalent to
We remark that (1.4) was proved in [Reference van der Hofstad and Slade15] also for the ddimensional cube. More recently, an asymptotic expansion was also proven for the Hamming graph [Reference Federico, van der Hofstad, den Hollander and Hulshof3].
Borel summability of the coefficients. Theorem 1.1 establishes an expansion to the third order, but it is plausible that even an expansion to all orders for site percolation exist: writing $s=\frac1{2d}$ and $\bar p_c(s)=p_c(d)$ , this means that there is a real sequence $(\alpha_n)_{n\in\mathbb N}$ such that for any $M\in\mathbb N$ ,
The corresponding statement for bond percolation was proved by Hofstad and Slade [Reference van der Hofstad and Slade14]. However, it is expected that the radius of convergence of the series $\sum\alpha_ns^n$ is zero (even though rigorous evidence is lacking), and this nonconvergence is valid in greater generality for series expansions of critical thresholds of various statistical mechanical models. The reason is that the sequence of absolute values $\alpha_1,\alpha_2,\alpha_3,\dots$ grows very rapidly (with sign changes for higher n), and that therefore it is not possible to compute $\bar p_c(s)$ from the sequence $(\alpha_n)$ .
Instead, we believe that the coefficients $(\alpha_n)$ are Borel summable: suppose $\bar p_c(s)$ has an analytic extension to the complex disc $D=\{z\in\mathbb C\colon \textrm{Re}(z^{1})>1\}$ , and suppose further that there is $C>0$ such that for all $s\in D$ and all M, we have
then Sokal [Reference Sokal17] proves that the Borel transform $B(t)=\sum_{n=1}^\infty{\alpha_n t^n}/{n!}$ exists, and $\bar p_c(s)$ equals the Borel sum
It is, however, unclear how an analytic extension of $\bar p_c(s)$ for site percolation could be obtained.
A rare example for which we know Borel summability is the exact solution $K_c(d)$ of the spherical model. Gerber and Fisher [Reference Gerber and Fisher6] prove that there is an expansion of $K_c(d)$ in powers of $1/d$ , that the radius of convergence is zero, but that we may interpret the expansion as a Borel sum as described above. They also prove that the signs of the coefficients of $K_n$ oscillate: the first 12 terms are positive, the next 8 are negative, the next 9 are positive, and so on. For the wellknown model of selfavoiding walk, Graham [Reference Graham7] proves bounds for the connective constant as in (1.7).
1.1 Strategy of proof, outline of the paper
Theorem 1.1 heavily builds upon the results obtained in [Reference Heydenreich and Matzke13]. We use Section 2 to collect the necessary notation and results from [Reference Heydenreich and Matzke13] in order to prove our main result. At the heart of these results is an identity for $\tau_p$ . From this, we almost immediately get an identity for $p_c$ in terms of socalled laceexpansion coefficients (see Definition 2.5). It will be clear that sufficient control over the coefficients will result in the expansion of Theorem 1.1. In fact, the results from [Reference Heydenreich and Matzke13] immediately give the first term of (1.3).
For the other terms in Theorem 1.1, however, we require even better control of these coefficients, which is provided by Lemma 3.1. Section 3 proves Theorem 1.1 assuming Lemma 3.1. The latter is at the heart of this paper and is proved in Section 5. As a preparation for the proof, Section 4 introduces some new notation on connection events and proves bounds on them. Those bounds are in essence an extension of the bounds presented in Section 2.
2. Preliminaries
2.1 Site percolation: Model and basic definitions
We introduce the model more formally. Given $p \in [0,1]$ , we can choose our probability space to be $(\{0,1\}^{\mathbb Z^d}, \mathcal F, \mathbb P_p)$ , where the $\sigma$ algebra $\mathcal F$ is generated by the cylinder sets, and $\mathbb P_p = \bigotimes_{x\in\mathbb Z^d} \text{Ber}(p)$ . We call $\omega\in\{0,1\}^{\mathbb Z^d}$ a configuration and say that a site $x\in\mathbb Z^d$ is open or occupied in $\omega$ if $\omega(x)=1$ . If $\omega(x)=0$ , we say that the site x is closed or vacant. We often identify $\omega$ with the set $\{x\in\mathbb Z^d: \omega(x)=1\}$ .
For $k\in\mathbb N$ and a configuration $\omega$ , we call $(v_0,v_1,\dots,v_k)\in(\mathbb Z^d)^{k+1}$ an occupied path of length k from $v_0$ to $v_k$ if $ v_iv_{i1} = 1$ for all $1 \leq i \leq k$ , and $v_i\in\omega$ for $1 \leq i \leq k1$ . Here, and throughout the paper, we write $x= \sum_{i=1}^dx_i$ for $x\in\mathbb R^d$ (which is equal to the graph distance in $\mathbb Z^d$ ). For two points $x \neq y\in\mathbb Z^d$ we write $\{x \longleftrightarrow y\}$ (and say that x is connected to y) if there exists an occupied path from x to y of arbitrary length; mind that the this event is irrespective of the occupation status of x and y. We set $\{x \longleftrightarrow x\}=\varnothing$ , that is, x is not connected to itself. Moreover, $xy=1$ implies $\{x \longleftrightarrow y\}=\{0,1\}^{\mathbb Z^d}$ (neighbours are always connected).
We define the cluster of x to be $\mathscr {C}(x) = \{x\} \cup \{y \in \omega: x \longleftrightarrow y\}$ . Note that apart form x itself, points in $\mathscr {C}(x)$ need to be occupied.
The twopoint function $\tau_p\colon \mathbb Z^d \to [0,1]$ is defined as $\tau_p(x):=\mathbb P_p(\textbf{0} \longleftrightarrow x)$ , where $\textbf{0}$ denotes the origin in $\mathbb Z^d$ . The percolation probability is defined as $\theta(p) = \mathbb P_p(\textbf{0} \longleftrightarrow \infty) = \mathbb P_p(  \mathscr {C}(\textbf{0}) = \infty)$ . We note that $p \mapsto \theta(p)$ is increasing and define the critical point for $\theta$ as in (1.1). The critical point $p_c$ depends on the underlying graph.
For an absolutely summable function $f\colon\mathbb Z^d \to \mathbb R$ , the discrete Fourier transform is defined as $\widehat f\colon(\pi,\pi]^d \to \mathbb C$ , where
and $k\cdot x = \sum_{j=1}^{d} k_j x_j$ denotes the scalar product.
2.2 The lace expansion in high dimension
We use this section to state the definitions and results from [Reference Heydenreich and Matzke13] needed in the proof of Theorem 1.1. We note that the below definition uses the notion of disjoint occurrence (denoted $`\circ$ ’) related to the BK inequality (which we will use at a later stage as well). For details on both, see e.g. [Reference Bollobás and Riordan2, Chapter 2] or [Reference Grimmett9, Section 2.3].
Definition 2.1 (Connection events, modified clusters) Let $x,u\in\mathbb Z^d$ and $A \subseteq \mathbb Z^d$ .

1. We set $\Omega := 2d$ .

2. We define $J(x) := \textrm{1}_{\{x=1\}} = \textrm{1}_{\{\textbf{0}\sim x\}}$ and $D := J/\Omega$ .

3. Let $\{u \longleftrightarrow x\textrm { in } A\}$ be the event that there is a path from u to x, all of whose internal vertices are elements of $\omega\cap A$ .

4. We define $\{u \Longleftrightarrow x\} := \{u \longleftrightarrow x\} \circ \{u \longleftrightarrow x\} $ and say that u and x are doubly connected.

5. We define the modified cluster of x with a designated vertex u as:
\begin{equation*} \widetilde{\mathscr{C}}^{u}(x) := \{x\} \cup \{y \in \omega \setminus\{u\} : x \longleftrightarrow y \textrm{ in } \mathbb{Z}^d \setminus\{u\} \} . \end{equation*} 
6. Let $\langle A \rangle := A \cup \{y \in \mathbb Z^d: \exists x \in A: xy = 1\}$ .
Note that we introduce $\Omega=2d$ . For better readability, we stick to using $\Omega$ for the remainder of the paper. We also address the Landau notation $f(\Omega) \leq \mathcal O(g(\Omega))$ that will appear frequently throughout the paper. It is always to be understood in the sense that there exists some $d_0$ and a constant $C(d_0)$ , such that $f(\Omega) \leq C g(\Omega)$ for all $\Omega \geq d_0$ . The constant C may depend on other appearing parameters.
We remark that $\{x \longleftrightarrow y\textrm { in } {\mathbb Z^d}\} = \{x \longleftrightarrow y\} = \{x \longleftrightarrow y\textrm { in } {\omega}\}$ and that $\{u \Longleftrightarrow x\} = \{0,1\}^{\mathbb Z^d}$ for $ux = 1$ . Similarly, $\{u \Longleftrightarrow x\} = \varnothing$ for $u=x$ . We state two elementary observations made in [Reference Heydenreich and Matzke13] involving J that will be important later on.
Observation 2.2 (Convolutions of J, [Reference Heydenreich and Matzke13, Observation 4.4]). Let $m\in\mathbb N$ and $x\in\mathbb Z^d$ with $m \geq x$ . Then there is a constant $c=c(m,x)$ with $c \leq m!$ such that
Observation 2.3 (Elementary bound on $\tau_p^{\ast n}$ , [Reference Heydenreich and Matzke13, Observation 4.5]). Let $m,n \in \mathbb N, p\in[0,1]$ and $x \in\mathbb Z^d$ . Then there is a constant $c=c(m,n)$ such that
The statement of [Reference Heydenreich and Matzke13, Observation 4.5] is actually slightly stronger than Observation 2.3, but the version stated here suffices for our purpose. The following, more specific definitions are important to define the laceexpansion coefficients:
Definition 2.4 (Extended connection events) Let $v,u,x \in\mathbb Z^d$ and $A \subseteq \mathbb Z^d$ .

1. Define
\begin{equation*} \{u \leftrightarrow{\ {A} \ } x \} := \{u \longleftrightarrow x\} \cap \Big( \{u \not \longleftrightarrow x\textrm { in } {\mathbb Z^d \setminus\langle {A} \rangle}\} \cup \{x \in \langle {A} \rangle \} \Big). \end{equation*}In words, this is the event that u is connected to x, but either any path from u to x has an interior vertex in $\langle {A} \rangle$ , or x itself lies in $\langle {A} \rangle$ . 
2. We introduce $\textsf {Piv}({u,x})$ as the set of pivotal points for $\{u \longleftrightarrow x\}$ . That is, $v \in\textsf {Piv}({u,x})$ if the event $\{x \longleftrightarrow x\textrm { in } {\omega \cup \{v\}}\}$ holds but $\{u \longleftrightarrow x\textrm { in } {\omega\setminus\{v\}}\}$ does not.

3. Define the event
\begin{equation*} E'(v,u;A) := \{v \leftrightarrow{\ {A} \ } u\} \cap \{ \nexists u' \in \textsf {Piv}({v,u}): v \leftrightarrow{\ {A} \ } u'\} \end{equation*}
We remark that $\{u \leftrightarrow{\ {\mathbb Z^d} \ } x\} = \{ u \longleftrightarrow x\}$ . We can now define the laceexpansion coefficients. To this end, let $(\omega_i)_{i\in\mathbb N_0}$ be a sequence of independent site percolation configurations. For an event E taking place on $\omega_i$ , we highlight this by writing $E_i$ . We also stress the dependence of random variables on the particular configuration they depend on. For example, we write $\mathscr {C}(u; \omega_i)$ to denote the cluster of u in configuration i.
Definition 2.5 (Laceexpansion coefficients) Let $n\in\mathbb N_0, x\in\mathbb Z^d$ , and $p \in [0,p_c]$ . We define
where $u_{1}=\textbf{0}, u_n=x$ and $\mathscr {C}_{i} = \widetilde{\mathscr {C}}^{u_i}(u_{i1};\omega_i)$ . Let furthermore $\Pi_{p}(x) := \sum_{n=0}^{\infty} (1)^n \Pi_p^{(n)}(x)$ .
It is proved in [Reference Heydenreich and Matzke13] that the functions $(\Pi_p^{(n)}(x))_{n\in\mathbb N_0}$ are (absolutely) summable for every x and that $\Pi_p$ is thus well defined. We remark that $E'(u_{i1},u_i; \mathscr {C}_{i1})_i$ takes place solely on $\omega_i$ only if $\mathscr {C}_{i1}$ is regarded as a fixed set; otherwise, it takes place on $\omega_{i1}$ as well as $\omega_i$ . Proposition 2.6 summarises the main results of [Reference Heydenreich and Matzke13] (namely, Theorem 1.1 and Proposition 4.2).
Proposition 2.6 (OZE, infrared bound and bounds on the laceexpansion coefficients). Let $p \in [0,p_c]$ . Then there is $d_0 \geq 6$ such that, for all $d > d_0$ , $\tau_p$ satisfies the Ornstein–Zernike equation
Secondly, there is a constant $C=C(d_0)$ such that
where we take the righthand side to be $\infty$ for $k=0$ . Thirdly, $2dp \leq 1+C/d$ , and lastly, for $n\in\mathbb N_0$ ,
As a consequence, we also have $p \sum_{x} \Pi_p(x) \leq C/d$ .
2.3 Diagrammatic bounds
In the proofs to follow, we need another result from [Reference Heydenreich and Matzke13]. We formulate it in terms of a diagrammatic notation, as we are going to make use of this later as well. To this end, we introduce some quantities related to $\tau_p$ .
Definition 2.7 (Modified twopoint functions and triangles). Let $x\in\mathbb Z^d$ and define
Moreover, let $\triangle_p(x) = p^2(\tau_p\ast\tau_p\ast\tau_p)(x)$ , $\triangle_p^{\bullet}(x) = p(\tau_p^\bullet\ast\tau_p\ast\tau_p)(x)$ , $\triangle_p^{\bullet\circ}(x) = p(\tau_p^\bullet\ast\tau_p^\circ\ast\tau_p)(x)$ , and $\triangle_p^{\bullet\bullet\circ}(x) = (\tau_p^\bullet\ast\tau_p^\bullet\ast\tau_p^\circ)(x)$ . We also set
We need the following bounds obtained in [Reference Heydenreich and Matzke13].
Proposition 2.8 (Triangle bounds, [Reference Heydenreich and Matzke13, Lemma 4.7]). Let $p\in[0,p_c]$ . Then there is $d_0\geq 6$ and a constant $C=C(d_0)$ such that, for all $d>d_0$ ,
As part of the proof that bounds the functions $\Pi_p^{(i)}$ in [Reference Heydenreich and Matzke13], a first bound is formulated in terms of a long sum over products of the modified twopoint functions. In the second step, those are decomposed into products of the modified triangles. We need a formulation of this intermediate bound on $\Pi_p^{(i)}$ for $i\in\{1,2\}$ for Section 5, as well as a pictorial representation. We first state the needed bound on $\Pi_p^{(1)}$ .
Lemma 2.9 (Diagrammatic bound on $\Pi_p^{(1)}$ , [Reference Heydenreich and Matzke13, Lemma 3.10]). Let $p \in [0, p_c]$ . Then
The bounds in [Reference Heydenreich and Matzke13] are formulated only for $p<p_c$ , but as the bounds are increasing in p, a limit argument easily extends them to the critical point. We now show how we represent the bound in (2.4) in terms of pictorial diagrams. As the bound on $\Pi_p^{(2)}$ is even longer to write down, Lemma 2.10 is stated only in terms of these pictorial bounds.
The points w,u,t,z,x summed over are represented as squares, factors of $\tau_p$ are represented as lines and lines with a ‘ $\bullet$ ’ (‘ $\circ$ ’) symbol represent factors of $\tau_p^\bullet$ ( $\tau_p^\circ$ ). For example, the factor $\tau_p(wu)$ is represented as a line between two squares, which we think of as the points w and u. We interpret the factor $\tau_p(u)$ as a line between u and the origin. We indicate the position of u and x in the below diagrams. After expanding the two cases in (2.4) according to whether $\{t,z,x\}=3$ or $\{t,z,x\}=1$ , this pictorial representation allows us to rewrite the bound in (2.4) as:
We now formulate the bound on $\Pi_p^{(2)}$ ; more precisely, we are going to insert a case distinguishing indicator, resulting in two bounds.
Lemma 2.10 (Diagrammatic bound on $\Pi_p^{(2)}$ , [Reference Heydenreich and Matzke13, Lemma 3.10]). Let $p\in[0,p_c]$ . Then
and
2.4 Convolution bounds
The last result from [Reference Heydenreich and Matzke13] we need to state is going to be important for the proofs of Section 4.
Lemma 2.11 (Bounds on convolutions of and $\tau_p$ , [Reference Heydenreich and Matzke13, Lemma 4.6]). Let $m,n\in\mathbb N_0$ with $2m+n\geq 2$ . For $p\in[0,p_c]$ and $d>20n/9$ ,
for some constant $c=c(m,n)$ .
Lemma 4.6 in [Reference Heydenreich and Matzke13] states only the upper bound $c\Omega^{1}$ , but an inspection of its proof gives the stronger bound of Lemma 2.11: for $m\ge4$ this is evident from the first bound on page 842 in [Reference Heydenreich and Matzke13], and for $m\le4$ one has to adapt [13, (4.10)] and the subsequent lines accordingly.
Again, Lemma 4.6 in [Reference Heydenreich and Matzke13] is stated only for $p<p_c$ , but the bounds
are sufficient for the statement to extend to $p_c$ . While the former bound is a direct consequence of Proposition 2.6, the latter bound (for $k\neq 0$ ) follows from the infrared bound (2.2) and $\widehat D(k) \leq 1$ . The bound for $k=0$ follows from the continuity of the Fourier transform.
3. Proof of Theorem 1.1
In this section, we prove Theorem 1.1 assuming Lemma 3.1, the latter providing an asymptotic expansion of the laceexpansion coefficients $\Pi^{(0)}, \Pi^{(1)}$ and $\Pi^{(2)}$ up to order $\mathcal O(\Omega^{2})$ .
Lemma 3.1 (Expansion of laceexpansion coefficients) As $d\to\infty$ ,
Lemma 3.1 is the union of Lemmas 5.1, 5.2 and 5.3, which are proved in Section 5. As a preparation for these proofs, we need Section 4. These proofs are lengthy considerations of numerous percolation configurations in search for contributions of the right order of magnitude (in terms of powers of $\Omega^{1}$ ). They are very mechanical in that they boil down to counting exercises and case distinctions. This also means that no new ideas are needed to extend Lemma 3.1 to higher orders of $\Omega^{1}$ and expand the higherorder coefficients $\widehat\Pi^{(3)}, \widehat\Pi^{(4)}$ , etc. The necessary effort increases exponentially however.
Proof of Theorem 1.1. Let first $p<p_c$ . Taking the Fourier transform of (2.1) and solving for $\widehat\tau_p$ at $k=0$ gives
A standard result is that $p\widehat\tau_p(0)=\mathbb E_p[\mathscr {C}(\textbf{0})]1$ diverges as $p \nearrow p_c$ , cf. [Reference Aizenman and Newman1]. As the numerator of (3.1) is bounded by $1+\mathcal O(\Omega^{1})$ , we conclude that $p_c$ satisfies
From here on out, we abbreviate $\widehat\Pi = \widehat{\Pi}_{p_c}(0)$ and $\widehat\Pi^{(m)} = \widehat\Pi_{p_c}^{(m)}(0)$ . We know from Proposition 2.6 that $\widehat\Pi/\Omega = \mathcal O(\Omega^{1})$ , and so rearranging (3.2) yields
Proposition 2.6 moreover provides the bound $\widehat\Pi^{(m)} = \mathcal O(\Omega^{1(m\vee 1)})$ for all $m\geq 0$ . We can use this to describe $\Omega p_c$ in more detail as:
Simplifying (3.4) to an error term of order $\mathcal O(\Omega^{2})$ gives
Plugging in the expansion for $\widehat\Pi^{(0)}$ and $\widehat\Pi^{(1)}$ from Lemma 3.1 gives $\Omega p_c = 1 + \tfrac 52 \Omega^{1} + \mathcal O(\Omega^{2})$ . Using this and the first identity of (3.3) in (3.4) gives
4. Further bounds on connection events
This section extracts some results that are frequently used in the proofs of Section 5. We start by defining lstep connections.
Definition 4.1 (lstep connections) Let $l\in\mathbb N$ and $p\leq p_c$ .

1. We define $\{u \leftrightarrow{\,\, ({1}) \,\,} v\}$ as the event that u is connected to v via an occupied and selfavoiding path of length at least l (shorter occupied paths might be present as well), and let $\tau_p^{(l)} = \mathbb P_p(u \leftrightarrow{\,\, ({1}) \,\,} v)$ .We define $\{u \leftrightarrow{\,\, ({\geq 1}) \,\,} v\}$ as the event that u is connected to v but there is no occupied path from u to v of length less than l. Furthermore, let $\{u \leftrightarrow{\,\, ({\leq 1}) \,\,} v\}$ be the event that u and v are connected by an occupied path of length at most l. Lastly, set $\{u \leftrightarrow{\,\, ({= 1}) \,\,} v\} := \{u \leftrightarrow{\,\, ({\leq 1}) \,\,} v\} \cap \{u \leftrightarrow{\,\, ({\geq 1}) \,\,} v\}$ .

2. We define $\{u \Longleftrightarrow{\,\, ({1}) \,\,} v\}:=\cup_{j=1}^{l1} \{u \leftrightarrow{\,\, ({j}) \,\,} v\} \circ\{u \leftrightarrow{\,\, ({lj}) \,\,} v\}$ as the event that u and v lie in a cycle of length at least l, where all sites—except possibly u and v—are occupied.
Let $\{ u \Longleftrightarrow{\,\, ({\geq l}) \,\,} v\}$ be the event that $\{u \Longleftrightarrow v\}$ and the shortest cycle containing u and v (with all other vertices occupied) is of length at least l. Similarly, let $\{ u \Longleftrightarrow{\,\, ({\leq l}) \,\,} v\}$ be the event that $\{u \Longleftrightarrow v\}$ and the shortest cycle containing u and v is of length at most l, and let $\{ u \Longleftrightarrow{\,\, ({= l}) \,\,} v\}:=\{ u \Longleftrightarrow{\,\, ({\geq l}) \,\,} v\} \cap \{ u \Longleftrightarrow{\,\, ({\leq l}) \,\,} v\}$ .

3. Also, define
\begin{align*}{ \triangle^{(l)} (u,v,w) := \sum_{\substack{l_1, l_2, l_3 \geq 1: \\ l_1+l_2+l_3=l}} \tau_p^{(l_1)}(u)\tau_p^{(l_2)}(vu) \tau_p^{(l_3)}(wv), \\ \triangleleft \hspace{3.1 pt} \triangleright^{(l)} (u,t,z,x) := \sum_{\substack{l_1, l_2 \geq 0, l_3 \geq 3: \\ l_1+l_2+l_3=l1} }\!\! \big(\delta_{t,u}\delta_{0,l_1} + p(1\delta_{0,l_1})\tau_p^{(l_1)}(tu) \big) \big(\delta_{\textbf{0},z}\delta_{0,l_2} + (1\delta_{0,l_2})\tau_p^{(l_2)}(z) \big) \\ \times J(u) \triangle^{(l_3)}(tz,xz,\textbf{0}).}\end{align*}
See Figure 1 for an illustration of $\triangleleft \hspace{1 pt} \triangleright^{(l)}$ . We remark that $\tau_p^{(1)}=\tau_p$ . Moreover, note that $\mathbb Z^d$ is bipartite and thus contains no cycles of odd length, which is why $\{u \Longleftrightarrow{\,\, ({2l1}) \,\,} v\} = \{u \Longleftrightarrow{\,\, ({2l}) \,\,} v\}$ and $\triangle^{(2l1)} (u,v,0) = \triangle^{(2l)} (u,v,0)$ .
The bounds stated in Lemma 4.2 provide the core tools in dealing with lowerorder terms in the bounds on $\Pi^{(i)}$ in the proofs of Section 5.
Lemma 4.2 (Bounds on step connection probabilities) Let $2\leq l\in\mathbb N, x\in\mathbb Z^d$ and $p\leq p_c$ . Then
Moreover,
and
Proof. We observe that
Iterating this yields
To prove the first part in (4.2), note that by the BK inequality,
To prove the second part of (4.2), we combine (4.4) with Observation 2.3, yielding
where the last inequality is due to Lemma 2.11.
To prove the bound on $\tau_p^{(l)}$ , we first use the bound (4.4) and then apply Observation 2.3 with $n=1$ and $m=x+1$ to obtain
The first term, that is, the term including a convolution with $\tau_p$ , is bounded using Lemma 2.11. The second term, that is, the convolutions over J, are bounded using Observation 2.2 and (3.3) to get
To prove (4.3), we split $\triangleleft \hspace{1 pt} \triangleright$ . First observe that when $l_1=l_2=0$ ,
which is in $\mathcal O(\Omega^{2})$ for $l_3 =9$ . Let next $l_1 \neq 0 = l_2$ . Then
When $l_1 = 0 \neq l_2$ ,
If $l_3 \geq 5$ , then (4.6) is bounded by $p\triangle_p^{\bullet} \sum_{u,z} \triangle^{(5)}(u,z,\textbf{0}) = \mathcal O(\Omega^{2})$ . If $l_3 \leq 4$ , then $l_2 \geq 4$ . We can rewrite the lefthand side of (4.6) as:
as $l_2+m_1 \geq 5$ .
Lastly, let $l_1 \neq 0 \neq l_2$ . If $l_3 \geq 5$ , then
If $l_3 \leq 4$ , then $l_1+l_2 \geq 4$ . We bound
where we used the same sequence of bounds as in (4.5).
Lastly, we state an observation that appears enough times throughout the arguments of Section 5 for us to extract and state it here.
Observation 4.3 Let $a\in\mathbb Z^d$ . Let further $u\neq v$ be two neighbours of a, and set $t=v+ua$ . Then
Proof. Let $A= \{a\}$ . We know that $E'(u,v;\ A) \subset \{u \longleftrightarrow v\}$ . If a is vacant, then the shortest possible $uv$ path that may be occupied is of length 4 and the claim holds.
On the other hand, if a is occupied, then $\{u \longleftrightarrow v\}$ holds. However, $\{u \leftrightarrow{\ {A} \ } a\}$ also holds, and so for $E'(u,v;\ A)$ to hold, a cannot be a pivotal vertex. But in order for a not to be pivotal, there needs to be a second $uv$ path, avoiding a. But either t is vacant, or $t=a$ ; in both cases, a second $uv$ path must be of length at least 4, proving the claim.
5. Detailed analysis of the first three laceexpansion coefficients
5.1 Analysis of $\widehat{\Pi}^{(0)}$
We recall that we write $\widehat\Pi^{(i)} = \widehat\Pi_{p_c}^{(i)}(\textbf{0})$ . We will also abbreviate $\mathbb P=\mathbb P_{p_c}$ and $\tau=\tau_{p_c}$ throughout Section 5. We use (3.3) a lot throughout Section 5, and we recall that it states
and follows from Proposition 2.6. Moreover, we will use (4.1) of Lemma 4.2 frequently in the proofs to follow and will not mention every time we do so.
Lemma 5.1 (Finer asymptotics of $\widehat\Pi^{(0)}$ ) As $d\to\infty$ ,
Proof. Recall that $\widehat{\Pi}^{(0)} = \sum_{x} \big(\mathbb P(\textbf{0} \Longleftrightarrow x)  J(x)\big)$ . This sum only gets contributions from $x \geq 2$ . Now,
where the last identity is due to Lemma 4.2. We first consider 4cycles. The only points x with $x \geq 2$ that can form a 4cycle with the origin are those with $x=2, \x\_\infty=1$ . There are $\tfrac 12 \Omega(\Omega2)$ such points. If $x=v_1+v_2$ (with $v_i=1$ ) is such a point, then $\{\textbf{0} \Longleftrightarrow{\,\, ({\leq 4}) \,\,} x\}$ holds if and only if $\{v_1, v_2\} \subseteq \omega$ . Therefore,
We are left to consider points $x \geq 2$ contained in cycles of length 6 that also contain the origin. Note that this is possible for $x\in\{2,3\}$ and $\ x\_\infty \in\{1,2\}$ . We first claim that $\x\_\infty=2$ gives a contribution of order $\mathcal O(\Omega^{2})$ .
Indeed, there are $\Omega$ points x with $x = 2$ and $\x\_\infty=2$ , and any such point is contained in at most $c \Omega$ many originincluding cycles of length 6 (where c is some absolute constant). Any given 6cycle has probability $p_c^4$ of being present, and so the contribution is at most $c \Omega^2 p_c^4 = \mathcal O(\Omega^{2})$ .
Similarly, there are at most $\Omega(\Omega2)$ points x with $x=3, \x\_\infty=2$ , and any such point is contained in exactly one originincluding cycle of length 6. Hence, this contributes at most $\Omega^2 p_c^4 = \mathcal O(\Omega^{2})$ as well.
Let now $x=3, \x\_\infty=1$ . There are $\tfrac 16\Omega(\Omega2)(\Omega4)$ such points. Such a point spans a (3dimensional) cube with the origin, in which two internally disjoint paths of respective length 3, making up the soughtafter 6cycle, have to be occupied. There are nine such cycles. By inclusionexclusion,
(for the lower bound, we sum the probabilities for the nine cycles to be occupied and substract the probability that at least two of them are occupied at the same time). Lastly, consider one of the $\tfrac 12\Omega(\Omega2)$ points $x=v_1+v_2$ with $x=2, \x\_\infty=1$ , and $v_i=1$ . Note that there are precisely two paths of length 2 from $\textbf{0}$ to x, namely the ones using $v_i$ . To produce a relevant contribution to $\{\textbf{0} \Longleftrightarrow{\,\, ({= 6}) \,\,} x\}$ , we claim that exactly one of the two vertices must be vacant and the other occupied. Indeed, if both are occupied, then there is a 4cycle containing $\textbf{0}$ and x. If both are vacant, then the shortest possible cycle containing $\textbf{0}$ and x is of length 8.
We assume $v_1$ to be occupied and $v_2$ to be vacant (the reverse gives the same contribution by symmetry, and we respect it with a factor of 2). It remains to count the number of paths of length 4 from $\textbf{0}$ to x that avoid $v_1$ and $v_2$ . Avoiding $\pm v_i$ gives $\Omega4$ options for the first step. There are two options for the second step (namely, to a neighbour of $v_1$ or $v_2$ ). Steps 3 and 4 are now fixed: Out of the two shortest paths to x, one is via $v_i$ , and is not an option. In conclusion, the probability that there is a $\textbf{0}x$ path of length 4 traversing some fixed neighbour of $\textbf{0}$ (which is not $\pm v_i$ ) first is $p_c^2 (2p_cp_c^2)$ . This gives
5.2 Analysis of $\widehat\Pi^{(1)}$
Lemma 5.2 (Finer asymptotics of $\widehat\Pi^{(1)}$ ) As $d\to\infty$ ,
Proof. Abbreviating $\mathscr {C}_0 = \widetilde{\mathscr {C}}^{u}(\textbf{0};\ \omega_0)$ , we recall that
While this is a double sum over all points in $\mathbb Z^d$ , we first prove that only small values of u give relevant contributions. To this end, assume that $u \geq 3$ . We use the pictorial representation of the bound in Lemma 2.9 and decompose it in terms of modified triangles introduced in Definition 2.7. In the below pictorial diagrams, points over which the supremum is taken (in particular, those points are not summed over) are represented by coloured discs. The indicator that two such points (discs) may not coincide is represented by a disrupted twosided arrow. Lemma 2.9 together with Proposition 2.8 then gives
where the last identity is due to Lemma 4.2. When we encounter similar diagrams to the ones in (5.5) at later stages of this paper, we decompose them in the same way as performed in (5.5), but in less detail.
We consider the cases of $u \in \{1,2\}$ separately. For both, we make further case distinctions according to the value of $x$ . The contributions are summarised in the following table:
Contributions of $u=1$ . By rotational symmetry, we can drop the sum over u, and rewrite (5.4) as:
In (5.7) and in the following, we take u to be an arbitrary (but fixed) neighbour of the origin. We recall that $\omega_i$ is a sequence of independent percolation configurations and an event with subscript i takes place on $\omega_i$ . Moreover, $E'(u,x;\ \mathscr {C}_0)$ is indexed to take place on configuration 1, which is only accurate if $\mathscr {C}_0$ is regarded as a fixed set; otherwise, the event takes place on $\omega_0$ and $\omega_1$ .
We proceed by splitting the sum over x in (5.7) (respectively, (5.6)) into different cases.
$\underline{\textrm{The case of}\ u=1, x=\textbf{0}\ \textrm{contributes}\ \Omega p_c}$ : The event $E'(u,x;\ \mathscr {C}_0)_1$ in (5.7) holds, the sum collapses to 1, and the contribution is $\Omega p_c$ .
$\underline{\textrm{The case of}\ u=1=x\ \textrm{contributes}\ \Omega^2p_c^2  2\Omega^{1} + \mathcal O(\Omega^{2})}$ : There are $\Omega1$ choices for $x\neq u$ . We exclude the special case $x=u$ first. For other choices of x, we let $v:=x+u$ .

For $x=u$ , we have $E'(u,x;\ \mathscr {C}_0)_1 \subseteq \{u \leftrightarrow{\,\, ({4}) \,\,} x\}_1$ by Observation 4.3. Hence, (5.7) is bounded by
\begin{equation*} \Omega p_c \tau^{(4)}(ux) = \mathcal O(\Omega^{2}).\end{equation*} 
Let $x \neq \pm u$ and $v\in \omega_1$ , so that $\textbf{0},u,v,x$ span a ‘square’ in one of the hyperplanes. Note first that there are $\Omega2$ choices for x, and we can treat them equally by symmetry. Since $x\sim \textbf{0}$ and hence $x\in\langle {\mathscr {C}_0} \rangle$ , we have that on the event $\{v\in\omega_1\}$ , the occurrence of $E'(u,x;\ \mathscr {C}_0)_1$ implies that either v is not pivotal for $\{u\longleftrightarrow x\}$ , or it is pivotal but $v\notin\langle {\mathscr {C}_0} \rangle$ :
\begin{equation*} E'(u,x;\ \mathscr {C}_0)_1 \cap\{v \in\omega_1\}_1 = \{v \in\omega_1\}_1 \cap \Big( \{v \notin \langle {\mathscr {C}_0} \rangle\}_0 \cup \{v \notin\textsf {Piv}({u,x})\}_1 \Big). \end{equation*}Note that all three appearing events on the right are independent of each other. Recalling that $\mathscr {C}_0$ is shorthand for $\tilde{\mathscr {C}}^u(0,\omega_0)$ , we see that $\{0\leftrightarrow v\}_0$ if either $x\in\omega_0$ or if there is an occupied path of length $\ge 4$ in $\omega_0\setminus\{u\}$ :\begin{equation*}\mathbb P (v \notin \langle {\mathscr {C}_0} \rangle) =1 \mathbb P\big( x \in\omega_0\big)  \mathbb P\big(\textbf{0} \leftrightarrow{\,\, ({\geq 4}) \,\,} v \text{ in } \omega_0\setminus\{u\}\big) = 1p_c+\mathcal O(\Omega^{2}). \end{equation*}In order for v to be not pivotal, there must be a ‘second connection’ from u to x, either a short one via $\textbf{0}$ , or via a longer path, that is,\begin{equation*} \mathbb P(v \notin\textsf {Piv}({u,x})) = \mathbb P(\textbf{0} \in \omega_1) + \mathbb P\big(u \leftrightarrow{\,\, ({\geq 4}) \,\,} x \text{ in } \omega_1\setminus\{v\}\big) = p_c + \mathcal O(\Omega^{2}). \end{equation*}We can now replace the sum over x in (5.7) by a factor of $(\Omega2)$ and thus obtain the contribution:\begin{align*}{ \Omega p_c (\Omega2) \mathbb P \big( E'(u,x;\ \mathscr {C}_0)_1 \cap \{v \in\omega_1\}_1 \big) = \Omega(\Omega2) p_c^2 \Big( 1p_c+p_c  (1p_c)p_c \Big) + \mathcal O(\Omega^{2}) \\ = (\Omega p_c)^2 (1p_c)  2\Omega p_c^2 + \mathcal O(\Omega^{2}) \\ = \Omega^2 p_c^2  3 \Omega^{1} + \mathcal O(\Omega^{2}). }\end{align*} 
Let $x \neq \pm u, v \notin \omega_1$ and $\textbf{0} \notin \omega_1$ . For $E'(u,x;\ \mathscr {C}_0)_1$ to hold, there needs to be a $\omega_1$ path between u and x. Its pivotal points cannot lie in $\langle {\mathscr {C}_0} \rangle$ however. First, note that any relevant path between u and x is of length 4, as
\begin{equation*} \Omega p_c (\Omega2) \mathbb P\big(E'(u,x;\ \mathscr {C}_0)_1 \cap \{ u \leftrightarrow{\,\, ({\geq 6}) \,\,} x\}_1\big) \leq \Omega^2 p_c \tau^{(6)}(xu) = \mathcal O(\Omega^{2}). \end{equation*}We now investigate the 4paths from u to x that avoid $\textbf{0}$ and v—from Lemma 5.1, we already know that there are $2(\Omega4)$ of them. Let z be one of the $\Omega4$ unit vectors satisfying $\dim \langle\!\langle {u,x,z} \rangle\!\rangle =3$ , where we let $\langle\!\langle {\cdot} \rangle\!\rangle$ denote the span. We denote by $\gamma_1$ and $\gamma_2$ the two $ux$ paths of length 4 that visit $y_1:=u+z$ . W.l.o.g., $\gamma_1$ visits $y_2:=y_1+x$ second and $y_3:=y_2u$ third, whereas $\gamma_2$ visits z second and $y_3$ third. Let $\{\gamma_i \subseteq \omega_1\}$ denote the event that the three internal vertices of $\gamma_i$ are $\omega_1$ occupied. See Figure 2a for an illustration.We now show that only $\gamma_1$ produces a relevant term. Assume first that $y_2 \notin\omega_1$ , but $\gamma_2\subseteq\omega_1$ . For $E'(u,x;\ \mathscr {C}_0)_1$ to hold, $z\in\langle {\mathscr {C}_0} \rangle$ must not be a pivotal point. Under $\gamma_2 \subseteq \omega_1$ ,
(5.8) \begin{equation} \{ z \notin \textsf {Piv}({u,x}) \}_1 \subseteq \bigcup_{a\in\{u,y_1\}, b\in\{y_3, x\} } \{a \longleftrightarrow b \text{ in } \omega_1 \setminus \{z\}\}_1. \end{equation}Resolving the righthand side of (5.8) by a union bound gives four connection events. The shortest $\omega_1$ path from u to x of nonvacant vertices is of length 4. Moreover, the shortest $\omega_1$ path from $y_1$ to $y_3$ of nonvacant vertices that avoids z is of length 4 as well, and so (5.7) is bounded by:\begin{align*}\Omega (\Omega2) p_c \sum_z \mathbb P\Big(E'(u,x;\ \mathscr {C}_0)_1, \{\textbf{0},v,y_2\}\cap\omega_1 = \varnothing, \gamma_2\subseteq\omega_1 \Big) \\ \leq \Omega^3 p_c^4 \Big( \tau^{(4)}(xu) + \tau^{(3)}(y_3u) + \tau^{(3)}(xy_1) + \tau^{(4)}(y_3y_1)\Big) = \mathcal O(\Omega^{2}). \end{align*}We now show that $\gamma_1\in\omega_1$ gives a contribution. Note that under $\{\textbf{0},v\notin\omega_1, \gamma_1 \subseteq \omega_1\}$ ,(5.9) \begin{equation} E'(u,x;\ \mathscr {C}_0)_1 = \bigcap_{i\in\{1,2,3\}} \Big( \{y_i \notin\textsf {Piv}({u,x})\}_1 \cup \{y_i \notin\langle {\mathscr {C}_0} \rangle\}_0\Big). \end{equation}But $\mathbb P(\{y_i \notin\textsf {Piv}({u,x})\}_1 \cup \{y_i \notin\langle {\mathscr {C}_0} \rangle\}_0) \geq 1\mathbb P(y_i \in \langle {\mathscr {C}_0} \rangle) \geq 1\tau^{(2)}(y_i) =1\mathcal O(\Omega^{1})$ for all i by Lemma 4.2, and so, by inclusionexclusion,\begin{align*}\Omega (\Omega2) p_c \sum_z \mathbb P\Big(E'(u,x;\ \mathscr {C}_0)_1, \{\textbf{0},v\}\cap\omega_1 = \varnothing, \gamma_1\subseteq\omega_1 \Big) \\ \begin{cases} \leq \Omega(\Omega2)(\Omega4) (1p_c)^2 p_c^4 \big(1\mathcal O(\Omega^{1}) \big) = \Omega^{1} + \mathcal O(\Omega^{2}), \\ \geq \Omega^3 p_c^4 (1\mathcal O(\Omega^{1}))  \Omega^2 \binom{\Omega4}{2} p_c^7 = \Omega^{1} + \mathcal O(\Omega^{2}). \end{cases} \end{align*} 
Let $x \neq \pm u, v\notin\omega_1$ , and $\textbf{0}\in \omega_1$ . By Observation 4.3,
\begin{equation*} \Omega p_c (\Omega2) \mathbb P \big( E'(u,x;\ \mathscr {C}_0)_1 \cap \{v \notin\omega_1,\textbf{0}\in\omega_1\} \big) \leq \Omega^2 p_c^2 \tau^{(4)}(xu) = \mathcal O(\Omega^{2}). \end{equation*}
$\underline{\textrm{The case of}\ u=1, x=2\ \textrm{contributes}\ {\Omega^2 p_c^2 +\Omega^{1} + \mathcal O(\Omega^{2})}}$ : There are $\tfrac 12 \Omega^2$ choices for x. We first consider the $\Omega1$ choices neighbouring u and, among those, exclude the special case $x=2u$ first. For x a neighbour of u, we set $v:=xu$ .

Let $x=2u$ . Since $x \sim u$ , we have $E'(u,x;\ \mathscr {C}_0)_1 = \{x \in \langle {\mathscr {C}_0} \rangle\}_0 \subseteq \{ \textbf{0} \leftrightarrow{\,\, ({4}) \,\,} x \}_0$ , and so the contribution to (5.7) is bounded by $\Omega p_c \tau^{(4)}(x) = \mathcal O(\Omega^{2})$ .

Let $2u\neq x\sim u$ and $v\in \omega_0$ . There are $\Omega2$ choices for x. The event $E'(u,x;\ \mathscr {C}_0)_1$ holds, and so
\begin{equation*} \Omega p_c \sum_{2u\neq x\sim u} \mathbb E_0\left[ \textrm{1}_{\{v\in\omega_0\}}\mathbb P_1\left( E'(u,x;\ \mathscr {C}_0) \right) \right] = \Omega(\Omega2) p_c^2 = \Omega^2 p_c^2  2\Omega^{1} + \mathcal O(\Omega^{2}).\end{equation*} 
Let $2u\neq x\sim u$ and $v\notin \omega_0$ . We partition
\begin{align*} E'(u,x;\ \mathscr {C}_0)_1 = \Big( E'(u,x;\ \mathscr {C}_0)_1 \cap \{\textbf{0} \leftrightarrow{\,\, ({\leq 4}) \,\,} x \text{ in } \mathbb Z^d\setminus\{u\} \}_0 \Big)\\[3pt]\quad \cup \Big(E'(u,x;\ \mathscr {C}_0)_1 \cap \{\textbf{0} \leftrightarrow{\,\, ({\geq 6}) \,\,} x \text{ in } \mathbb Z^d\setminus\{u\}\}_0\Big) \end{align*}and treat the second event by observing\begin{equation*} \Omega p_c \sum_{2u\neq x\sim u} \mathbb P \Big( \{v\notin\omega_0\}_0 \cap \{\textbf{0} \leftrightarrow{\,\, ({\geq 6}) \,\,} x \text{ in } \mathbb Z^d\setminus\{u\}\}_0 \cap E'(u,x;\ \mathscr {C}_0)_1 \Big) \leq \Omega^2 p_c \tau^{(6)}(x) = \mathcal O(\Omega^{2}).\end{equation*}As the only 2paths from $\textbf{0}$ to x go through u and v, respectively, we can focus on paths of length 4 avoiding v and u. Hence, the status of v is independent of such paths. Let z be one of the $\Omega4$ neighbours of $\textbf{0}$ with $\dim \langle\!\langle {u,v,z} \rangle\!\rangle =3$ . For any such z, there are two $\textbf{0}x$ paths of length 4 that first visit z and avoid $\{v,u\}$ . More precisely, these paths are $(\textbf{0},z,u+z,x+z,x)$ and $(\textbf{0},z,v+z,x+z,x)$ . Let $Q_4(z)$ denote the event that at least one of these paths is in $\omega_0$ . See Figure 2b for an illustration. As the events $\{ Q_4(z) \}$ are pairwise independent,\begin{align*}{\{v\notin\omega_0\}_0 \cap \{\textbf{0} \leftrightarrow{\,\, ({\leq 4}) \,\,} x \text{ in } \mathbb Z^d\setminus\{u\}\}_0 \cap E'(u,x;\ \mathscr {C}_0)_1 = \{v\notin\omega_0\}_0 \cap \big( \cup_{z} Q_4(z)\big) , \\[3pt] \mathbb P(\cup_z Q_4(z)) = (\Omega4)\mathbb P( Q_4(z)) +\mathcal O(\Omega^{4}) = 2(\Omega4)p_c^3 + \mathcal O(\Omega^{3}). }\end{align*}Consequently,\begin{align*}{\Omega p_c \sum_{2u\neq x\sim u} \mathbb P \Big( \{v\notin\omega_0\}_0 \cap \{\textbf{0} \leftrightarrow{\,\, ({\leq 4}) \,\,} x \text{ in } \mathbb Z^d\setminus\{u\}\}_0 \cap E'(u,x;\ \mathscr {C}_0)_1 \Big) \\[3pt] = \Omega p_c (\Omega2)2(\Omega4) p_c^3 + \mathcal O(\Omega^{2}) = 2\Omega^{1} + \mathcal O(\Omega^{2}).}\end{align*} 
Let $ux=3$ and $\x\_\infty =2$ . There are $\Omega1$ choices for x. Let $2v = x$ . Note first that
\begin{align*}{ \Omega(\Omega1)p_c \mathbb P \Big( \big(\{x \in \langle {\mathscr {C}_0} \rangle\}_0 \cup \{ u \leftrightarrow{\,\, ({5}) \,\,} x\}_1 \big) \cap E'(u,x;\ \mathscr {C}_0)_1 \Big) \\ \leq \Omega^2 p_c \Big( \tau^{(2)}(x) \tau^{(3)}(xu) + \tau^{(5)}(xu)\Big) = \mathcal O(\Omega^{2}). }\end{align*}The complementary event is that $x \notin\langle {\mathscr {C}_0} \rangle$ and the presence of a $ux$ path of length 3. The former implies $v\notin\omega_0$ . There are at most four potential sites that can make up internal vertices on a $ux$ path of length 3, namely $\textbf{0}, v, u+v, u+2v$ . To avoid potential pivotality of $\textbf{0}$ and v and still guarantee a path of length 3, we require $\{v+u, u+2v\} \subseteq \omega_1$ . But both these vertices are of distance at least 2 from the origin, and at least one of them must be in $\langle {\mathscr {C}_0} \rangle$ . In conclusion,\begin{align*}{ \Omega(\Omega1)p_c \mathbb P \Big( \{x \notin \langle {\mathscr {C}_0} \rangle\}_0 \cap \{ u \leftrightarrow{\,\, ({\leq 3}) \,\,} x\}_1 \cap E'(u,x;\ \mathscr {C}_0)_1 \Big) \\ \leq 2 \Omega^2 p_c \tau^{(2)}(u+v) \tau^{(3)}(xu) = \mathcal O(\Omega^{2}). }\end{align*} 
Let $ux=3, \ x\_\infty=1$ and $x\in\langle {\mathscr {C}_0} \rangle$ . Write $x=v_1+v_2$ , where $v_i=1$ . We first show that contributions arise when precisely one point in $\{v_1, v_2\}$ is $\omega_0$ occupied. Note that when both $v_1$ and $v_2$ are vacant in $\omega_0$ , the contribution to (5.7) is bounded by $\Omega^3 p_c \tau^{(4)}(x) \tau^{(3)}(xu) = \mathcal O(\Omega^{2})$ . On the other hand, if $\{v_1,v_2\} \subseteq \omega_0$ , then the contribution is bounded by $\Omega^3 p_c^3 \tau^{(3)}(ux) =\mathcal O(\Omega^{2})$ . Let now $v_1\in\omega_0$ and $v_2\notin\omega_0$ (the other case is identical and is respected by counting the contribution twice). There are $\tfrac 12 \Omega^2 (1+\mathcal O(\Omega^{1}))$ choices for x. If $\{u \leftrightarrow{\,\, ({5}) \,\,} x\}_1$ , then the contribution to (5.7) is $\mathcal O(\Omega^{2})$ . Set $z_1=u+v_2, z_2=u+v_2+v_1$ and set $y=u+v_1$ . We claim that the only $ux$ path of length 3 that produces a relevant contribution is $(u,z_1,z_2,x)$ . See Figure 2c for an illustration. First, assume $z_1 \notin \omega_1$ . Note that the only other paths of length 3 from u to x go through either $\textbf{0}$ or y. But $\{0,y\} \subseteq \langle {\mathscr {C}_0} \rangle$ , and so neither $\textbf{0}$ nor y can be a pivotal point. Hence, $E'(u,x;\ \mathscr {C}_0)_1\cap \{z_1\notin \omega_1\}$ enforces $\{\textbf{0},y\} \subseteq \omega_1$ . To get to x and avoid pivotality of any points in $\langle {\mathscr {C}_0} \rangle$ , at least two points in $\{v_1, v_2, z_1\}$ must be occupied, and the contribution to (5.7) is at most
\begin{equation*} 2 \Omega p_c \big(\tfrac 12 \Omega^2(1+\mathcal O(\Omega^{1}))\big) p_c^2 \binom{3}{2} p_c^2 = \mathcal O(\Omega^{2}).\end{equation*}If $z_1\in \omega_1$ and $z_2 \notin\omega_1$ , then the only $ux$ path of length 3 through $z_1$ visits $v_2\in\langle {\mathscr {C}_0} \rangle$ . This gives a contribution of $\mathcal O(\Omega^{2})$ by the same bound as above. We may turn to the case $z_i \in\omega_1$ for $i\in\{1,2\}$ . Now, under $\{v_1\in\omega_0, \{z_1, z_2\} \subseteq \omega_1\}$ , we can express $E'(u,x;\ \mathscr {C}_0)_1$ similarly to (5.9), replacing $y_i$ ( $i\in[3]$ ) by $z_i$ ( $i \in[2]$ ). Applying the same bounds, we obtain a contribution to (5.7) of\begin{equation*} 2\Omega p_c \big( \tfrac 12 \Omega^2 (1+\mathcal O(\Omega^{1})) \big) \mathbb P\big(v_1\in \omega_0, \{z_1, z_2\} \subseteq\omega_1 \big) (1\mathcal O(\Omega^{1})) = \Omega^{1} + \mathcal O(\Omega^{2}).\end{equation*} 
Let $ux=3,\ x\_\infty=1$ and $x \notin\langle {\mathscr {C}_0} \rangle$ . Let $\gamma$ be a $ux$ path in $\omega_1$ . By assumption, there needs to be some $z\in\gamma$ with $z \in\langle {\mathscr {C}_0} \rangle$ . Consequently, z cannot be a pivotal point and so there needs to be another $ux$ path $\tilde{\gamma}$ in $\omega_1$ that contains a point $\tilde z \notin \gamma$ with $\tilde z\in\langle {\mathscr {C}_0} \rangle$ . Assume first that both $\gamma, \tilde \gamma$ are paths of length 3. If they are disjoint, then the contribution to (5.7) is at most $9\Omega^3 p_c^5 = \mathcal O(\Omega^{2})$ . If they share their first vertex, then, in the terminology of Figure 2c, it must be either y or $z_1$ (otherwise $\textbf{0}$ is pivotal). W.l.o.g., $\tilde\gamma$ must then pass through $z_2$ and so $\tilde z=z_2 \in \langle {\mathscr {C}_0} \rangle$ needs to hold, and the contribution to (5.7) is at most $\Omega^3 p_c^4 \tau^{(3)}(z_2) = \mathcal O(\Omega^{2})$ . Assume next that $\tilde\gamma$ is of length 5. As $\gamma$ and $\tilde\gamma$ share at most one internal vertex (and there are two internal vertices in $\gamma$ ), we count a factor of $p_c$ for the unique vertex of $\gamma$ , and the contribution to (5.7) is at most $18 \Omega^3 p_c^2 \tau^{(5)}(xu) = \mathcal O(\Omega^{2})$ . Similarly, when both $\gamma$ and $\tilde\gamma$ are of length at least 5, the contribution is $\mathcal O(\Omega^{2})$ .
$\underline{\textrm{The case of}\ u=1, x=3\ \textrm{contributes}\ {2\Omega^{1} + \mathcal O(\Omega^{2})}}$ : Note that when $\{u \leftrightarrow{\,\, ({4}) \,\,} x\}_1$ , then the contribution to (5.6) is at most
by Lemma 4.2. We can therefore focus on x with $xu=2$ and $\{u \leftrightarrow{\,\, ({=2}) \,\,} x\}_1$ . Moreover, we can assume that there is no $ux$ path of length 4. Let $x=u+v_1+v_2$ , where $v_1=1=v_2$ , and assume first that $\dim\langle\!\langle {u,v_1,v_2} \rangle\!\rangle=3$ . There are $\tfrac 12 (\Omega2)(\Omega4)$ choices for x. Let $z_i=u+v_i$ be the two internal vertices of the two shortest $ux$ paths—see Figure 2a for an illustration.
We first claim that only $x\in\langle {\mathscr {C}_0} \rangle$ produces a relevant contribution. Indeed, if $x \notin\langle {\mathscr {C}_0} \rangle$ , and as there is no $ux$ path of length 4, we must have $z_i \in \omega_1 \cap \langle {\mathscr {C}_0} \rangle$ for $i \in\{1,2\}$ . For $\{\textbf{0} \longleftrightarrow z_i\}_0$ to hold, either $v_i \in\omega_0$ , or $\{ \textbf{0} \leftrightarrow{\,\, ({4}) \,\,} z_i \}_0$ , and so (5.7) is at most
Turning to $x\in \langle {\mathscr {C}_0} \rangle$ , note that when $\{z_1, z_2\} \subseteq \omega_1$ , then (5.7) is at most
W.l.o.g., we assume that $z_1\in \omega_1$ (and $z_2 \notin \omega_1$ ) and (by symmetry) count the contribution twice. Now, the contribution to (5.7) is equal to
If $v_1 \in\omega_0$ , then $z_1\in\langle {\mathscr {C}_0} \rangle$ and so $z_1$ cannot be pivotal, which, in turn, forces $\{u \leftrightarrow{\,\, ({4}) \,\,} x\}_1$ . But this was already shown to produce an $\mathcal O(\Omega^{2})$ contribution. Further, if $\{\textbf{0} \leftrightarrow{\,\, ({5}) \,\,} x\}_0$ , then (5.11) is at most $\Omega^3 p_c^2 \tau^{(5)}(x) = \mathcal O(\Omega^{2})$ , and so $\textbf{0}$ must be $\omega_0$ connected to x by a path of length 3.
There are precisely two $\textbf{0}x$ paths of length 3 that use neither $v_1$ nor u, namely $\gamma_1=(\textbf{0},v_2,v_1+v_2,x)$ and $\gamma_2=(\textbf{0},v_2,z_2,x)$ . If both are occupied, the contribution is $\mathcal O(\Omega^{2})$ . Note that
and so (5.11) becomes
Finally, if $\dim\langle\!\langle {u,v_1,v_2} \rangle\!\rangle \leq 2$ , then the same bounds with at least one factor of $\Omega$ in the choice of x gives a contribution of $\mathcal O(\Omega^{2})$ .
$\underline{\textrm{The case of}\ u=1, x \geq 4\ \textrm{contributes}\ \mathcal O(\Omega^{2})}$ : The bound is the same as in (5.10).
Contributions of $u=2$ . If u is one of the $\Omega$ points with $u=2=\ u \_\infty$ , then $\widehat\Pi^{(1)}$ is bounded by $\Omega p_c\sum_x \mathbb P(\textbf{0} \Longleftrightarrow u) \tau(ux)$ . For fixed $j=ux$ , this is bounded by
We now show that we can impose some further restrictions on u and x. Recall the bound in (5.5), and observe that if $x\notin\langle {\mathscr {C}_0} \rangle$ , then
Similar considerations enforce that $x \leq 3$ and $xu \leq 2$ as well as $\{\textbf{0} \Longleftrightarrow{\,\, ({\leq 4}) \,\,} u\}_0$ . Before going into the different cases, we note that there are $\tfrac 12\Omega(\Omega2)$ choices for $u=v_1+v_2$ (where $v_i=1$ ), and on every choice, $\{v_1,v_2\} \subseteq \omega_0$ need to hold for a relevant contribution to arise. Taking all this into consideration, the contribution to $\widehat\Pi^{(1)}$ becomes
where $v_1$ and $v_2$ is a pair of arbitrary but fixed independent unit vectors (and $u=v_1+v_2$ ).
$\underline{\textrm{The case of}\ u=2, x=\textbf{0}\ \textrm{contributes}\ \mathcal O(\Omega^{2})}$ : As $ux=2$ , the contribution to (5.12) is at most $\Omega^2 p_c^3 \tau^{(2)}(xu) = \mathcal O(\Omega^{2})$ .
$\underline{\textrm{The case of}\ u=2, x=1\ \textrm{contributes}\ {\Omega^{1} + \mathcal O(\Omega^{2})}}$ : Note that we only need to consider $x \in\{v_1,v_2\}$ (otherwise $ux =3$ ). For these choices of x, both $x\in\langle {\mathscr {C}_0} \rangle$ and $E'(u,x;\ \mathscr {C}_0)_1$ hold and the contribution to (5.12) is as claimed.
$\underline{\textrm{The case of}\ u=2, x=2\ \textrm{contributes}\ \Omega^{1} + \mathcal O(\Omega^{2})}$ : By the indicator in (5.12), we only consider $xu=2$ . Let first $\x\_\infty=2$ . There are only two such points at distance 2 of u, and so the contribution to (5.12) is at most $\Omega^2 p_c^3 \tau^{(2)}(xu) = \mathcal O(\Omega^{2})$ .
Let thus x be one of the $2(\Omega3)$ points with $\x\_\infty=1$ . W.l.o.g., we assume that $x=v_1+v_3$ , where $v_3=1$ . If $v_3=v_2$ , then the contribution is bounded by $\Omega^2 p_c^3 \tau^{(2)}(xu) = \mathcal O(\Omega^{2})$ . Let x be one of the remaining $2(\Omega4)$ points with $\dim\langle\!\langle {v_1,v_2,v_3} \rangle\!\rangle =3$ . As $x \sim v_1$ , the event $x\in\langle {\mathscr {C}_0} \rangle$ holds. We partition $E'(u,x;\ \mathscr {C}_0)_1$ into whether $\{u \leftrightarrow{\,\, ({=2}) \,\,} x\}_1$ or $\{u \leftrightarrow{\,\, ({\geq 4}) \,\,} x\}_1$ and see that in the latter case, the contribution to (5.12) is at most $\Omega^3 p_c^3 \tau^{(4)}(xu) = \mathcal O(\Omega^{2})$ .
For the existence of a path of length 2, either $v_1$ or $v_4:=x+v_2$ need to be $\omega_1$ occupied. As $v_1\in\mathscr {C}_0$ , it cannot be a pivotal point for the $\omega_1$ connection between u and x and there needs to be another path. The contribution to (5.12) is therefore at most $\Omega^3 p_c^4 \tau^{(2)}(xu) = \mathcal O(\Omega^{2})$ . We observe that
As previously, $\mathbb P(v_4\notin\textsf {Piv}({u,x})) = \mathcal O(\Omega^{1})$ and $\mathbb P(\textbf{0} \not \leftrightarrow v_4 \text{ in } \mathbb Z^d\setminus\{u\}) = 1\mathcal O(\Omega^{1})$ , and so the contribution to (5.12) is
$\underline{\textrm{The case of}\ u=2, x=3\ \textrm{contributes}\ {\Omega^{1} + \mathcal O(\Omega^{2})}}$ : We only need to consider neighbours of u, otherwise $ux\geq 3$ . Recall that for $ux=1$ , the event $E'(u,x;\ \mathscr {C}_0)_1$ holds precisely when $x \in\langle {\mathscr {C}_0} \rangle$ . Under our conditioning, x must be connected to $\{\textbf{0},v_1,v_2\}$ . Note that there are two choices for x with $\x\_\infty=2$ . Since $\mathbb P(x\in\langle {\mathscr {C}_0} \rangle) \leq 3 \max_{y\in\{\textbf{0},v_1,v_2\}} \tau^{(2)}(xy) = \mathcal O(\Omega^{1})$ , we may focus on the $\Omega2$ choices of x with $\x\_\infty=1$ .
Let $x=u+v_3$ and set $z_1:=v_1+v_3, z_2:=v_2+v_3$ . If $\{z_1,z_2\} \cap \omega_0 = \varnothing$ , then $\{\textbf{0} \leftrightarrow{\,\, ({5}) \,\,} x\}_0$ holds, and the contribution to (5.12) is at most $\Omega^3p_c^3 \max_{y\in\{\textbf{0},v_1,v_2\}} \tau^{(3)}(xy) = \mathcal O(\Omega^{2})$ . If $\{z_1,z_2\} \subset \omega_0$ , then the contribution to (5.12) is at most $\Omega^3 p_c^5 = \mathcal O(\Omega^{2})$ .
We consider the case where $z_1\notin\omega_0\ni z_2$ and respect the other case with a factor of 2. The contribution to (5.12) is
This finishes the analysis of $\widehat\Pi^{(1)}$ .
5.3 Analysis of $\widehat\Pi^{(2)}$
Lemma 5.3 (Asymptotics of $\widehat\Pi^{(2)}$ ). As $d\to\infty$ ,
Proof. For the proof, we recall that
where $\mathscr {C}_0= \widetilde{\mathscr {C}}^{u}(\textbf{0};\ \omega_0)$ and $\mathscr {C}_1=\widetilde{\mathscr {C}}^v(u;\ \omega_1)$ . We first show that when either $v\notin\langle {\mathscr {C}_0} \rangle$ or $x\notin\langle {\mathscr {C}_1} \rangle$ , then the contribution to $\widehat{\Pi}^{(2)}$ is $\mathcal O(\Omega^{2})$ . Indeed, by Lemma 2.10 and Proposition 2.8,
We expanded the third diagram in (5.14) to get the two diagrams of (5.15). We next show that only $u=1$ gives a relevant contribution. Indeed,
We can thus fix u to be an arbitrary neighbour of the origin and need to investigate
Before going into specific cases, we exclude some of them right away: When $x \vee ux \geq 4$ , then the contribution to (5.16) is
by Lemma 4.2. In the above, a line decorated with a ‘ $\sim$ ’ symbol denotes a direct edge. Similarly, when $v \geq 3$ or $xv\geq 3$ , the contribution to (5.16) is at most
We now investigate (5.16) by splitting the double sum over v and x. We organise this by considering the three main cases for $v\in\{0,1,2\}$ . An overview of the contributions is given in the following table:
Contributions of $v=\textbf{0}$ . The events $E'(u,v;\ \mathscr {C}_0)_1$ and $\{v\in \langle {\mathscr {C}_0} \rangle\}$ hold.
$\underline{\textrm{The case of}\ x=1\ \textrm{contributes}\ 2\Omega^{1} + \mathcal O(\Omega^{2})}$ : First, consider the choice of $x=u$ . It is easy to see that the event in (5.16) holds and the contribution is $\Omega p_c^2 = \Omega^{1} + \mathcal O(\Omega^{2})$ .
Consider $0\sim x\neq u$ . As $v\sim x$ , we have $E'(v,x;\ \mathscr {C}_1)_2 = \{x \in \langle {\mathscr {C}_1} \rangle\}_1$ . If $x=u$ , then $\{x \in \langle {\mathscr {C}_1} \rangle\}_1 \subseteq \{u \leftrightarrow{\,\, ({4}) \,\,} x\}_1$ and we receive a contribution of order $\mathcal O(\Omega^{2})$ . Consider now one of the $\Omega2$ remaining choices for x and set $z=u+x$ . Then
yielding a contribution to (5.16) of $\Omega(\Omega2)p_c^3 + \mathcal O(\Omega^{2}) = \Omega^{1}+\mathcal O(\Omega^{2})$ .
$\underline{\textrm{The case of}\ x=2\ \textrm{contributes}\ {\Omega^{1} + \mathcal O(\Omega^{2})}}$ : If $ux=3$ , then the contribution to (5.16) is bounded by $\Omega^3 p_c^2 \tau^{(2)}(xv) \tau^{(3)}(ux) =\mathcal O(\Omega^{2})$ . Similarly, if $x=2u$ , we obtain a bound of $\Omega p_c^2 \tau^{(2)}(xv) = \mathcal O(\Omega^{2})$ . Let therefore x be one of the $\Omega2$ remaining neighbours of u and note that $\{x\in\langle {\mathscr {C}_1} \rangle\}$ holds.
We set $z=xu$ . If $z\notin\omega_2$ , then $E'(v,x;\ \mathscr {C}_1)_2 \subseteq \{ v \leftrightarrow{\,\, ({4}) \,\,} x\}_2$ by Observation 4.3, and the contribution to (5.16) is at most $\Omega^2 p_c^2 \tau^{(4)}(xv) = \mathcal O(\Omega^{2})$ . If $z\in\omega_2$ , then $E'(v,x;\ \mathscr {C}_1)_2 = \{z \notin\textsf {Piv}({v,x})\}_2 \cup \{z \notin\langle {\mathscr {C}_1} \rangle \}_1$ . By a similar argument to the one below (5.9), the contribution to (5.16) becomes
$\underline{\textrm{The case of}\ x=3\ \textrm{contributes}\ {\mathcal O(\Omega^{2})}}$ : Distinguishing between $ux=4$ (at most $\Omega^3$ choices for x) and $ux=2$ (at most $\Omega^2$ choices), the contribution to (5.16) is at most
Contributions of $v=1$ . Let us first consider $v=u$ and show that this case contributes $\mathcal O(\Omega^{2})$ . Indeed, $E'(u,v;\ \mathscr {C}_0)_1 \subseteq \{u \leftrightarrow{\,\, ({4}) \,\,} v\}_1$ by Observation 4.3. With the further inclusion $E'(v,x;\ \mathscr {C}_1)_2 \cap \{x \in\langle {\mathscr {C}_1} \rangle\} \subseteq \{v \longleftrightarrow x\}_2$ , we have that the contribution to (5.16) is at most
We may therefore take $v\neq \pm u$ to be one of the $\Omega2$ remaining neighbours of the origin. Set $t=v+u$ . We first claim that $t \notin \omega_1$ results in an $\mathcal O(\Omega^{2})$ contribution. Note that, by Observation 4.3, $E'(u,v;\ \mathscr {C}_0)_1 \cap \{t \notin \omega_1\} \subseteq \{u \leftrightarrow{\,\, ({4}) \,\,} v\}_1$ . As there is only one choice of x such that $u \sim x \sim v$ and at most $\Omega$ choices such that $x=3$ and $x \sim v$ , we can bound (5.16) by
It remains to bound the last probability. There are at most $\Omega$ choices for x. If $\{u \leftrightarrow{\,\, ({5}) \,\,} x\}$ , then the contribution is $\mathcal O(\Omega^{2})$ . Note that the $uv$ path in $\omega_1$ cannot use and is independent of the status of $\textbf{0}$ , as the origin may not be a pivotal point. Hence, if $\textbf{0} \in\omega_1$ , the contribution is at most $\Omega p_c \tau^{(4)}(vu) = \mathcal O(\Omega^{2})$ . We therefore assume $\textbf{0}\notin\omega_1$ and aim to bound
When avoiding $\textbf{0}$ and t, there are only two $ux$ paths of length 3, namely $\gamma_1=(u,y,z,x)$ and $\gamma_2=(u,y,yu,x)$ , where $y:=x+uv$ and $z:=y+v$ . See Figure 3a for an illustration. But now, (5.17) is bounded by:
As a consequence, we can focus on $t\in\omega_1$ , and (5.16) reduces to
But under $t \in\omega_1$ , we have $E'(u,v;\ \mathscr {C}_0)_1 = \{t \notin\textsf {Piv}({u,v})\}_1 \cup \{t \notin \langle {\mathscr {C}_0} \rangle\}_0$ . The latter event has probability $1\mathcal O(\Omega^{1})$ , and so we can can instead investigate
where u and v are two arbitrary (but fixed) neighbours of $\textbf{0}$ (satisfying ( $u \neq \pm v$ ).
$\underline{\textrm{The contribution of}\ x=\textbf{0}\ \textrm{is}\ {\Omega^{1} + \mathcal O(\Omega^{2})}}$ : Note that $x \in \langle {\mathscr {C}_1} \rangle$ holds, and so does $E'(v,x;\ \mathscr {C}_1)_2$ . Hence, the contribution to (5.18) is $\Omega^{1} + \mathcal O(\Omega^{2})$ .
$\underline{\textrm{The contribution of}\ x=1\ \textrm{is}\ {\mathcal O(\Omega^{2})}}$ : If $x \in\{\pm u, v\}$ , we can bound the contribution to (5.18) by $\Omega^2 p_c^2 \tau^{(2)}(uv)\tau^{(2)}(xv) = \mathcal O(\Omega^{2})$ (as both $\{v \longleftrightarrow x\}_2$ and $\{u\longleftrightarrow v\}_1$ need to hold). Consider thus one of the $\Omega4$ choices for x satisfying $\dim\langle\!\langle {u,v,x} \rangle\!\rangle=3$ . Conditional on $t \in \omega_1$ , we have $\{x\in\langle {\mathscr {C}_1} \rangle\}_1 \subseteq \{u \leftrightarrow{\,\, ({2}) \,\,} x\}_1 \cup \{t \leftrightarrow{\,\, ({3}) \,\,} x\}_1$ , and so the contribution is at most
$\underline{\textrm{The contribution of}\ x=2\ \textrm{is}\ {2\Omega^{1}+\mathcal O(\Omega^{2})}}$ : We can restrict to the choices of x where $v\sim x$ by the considerations made in the beginning of the proof.

Let