\chapter{Connectivity of the cut}\label{s:topology} In this appendix, we prove the two topological facts used in \zcref{s:cut-geometry}. The first, \zcref{l:boundaryconn}, states that the outer $\ell^\infty$ boundary of a finite $*$-connected set with $*$-connected complement is itself $*$-connected. The second, \zcref{l:thicken}, states that adding to a $*$-connected set the nearest neighbors of its sites gives a connected set; it also compares sums over the two sets. Recall from \zcref{s:cut-geometry} the definitions of $*$-neighbors, $*$-paths, $*$-connected and connected sets, and of the outer $\ell^\infty$ boundary \begin{equation*} \partial_\infty A = \{ z \in \Z^2 \setminus A : \dist_\infty(z, A) = 1 \}. \end{equation*} We also recall the depth $\dep_G$ from \zcref{s:cut-removal}. Note that a connected set is also $*$-connected. For connected subsets of $\Z^d$, results on the connectivity of their exterior boundaries go back to \cite{Kesten86} and \cite{DeuschelPisztora96}. The graph-theoretic criterion of \cite[Lemma~2 in the arXiv version]{Timar13} applies to the graph on $\Z^2$ whose edges join $*$-neighbors. Since the complement of $A$ is $*$-connected, every site of $\partial_\infty A$ is reachable from a fixed site outside $A$ by a $*$-path that avoids $A$. The criterion gives \zcref{l:boundaryconn} once we show that the cycle space of the graph is generated by its triangles. We give a self-contained proof. \section{The outer boundary of a set}\label{s:topology-boundary} In this subsection, we call an unordered pair of $*$-neighbors an \emph{edge}. The finite sets of edges form a vector space over $\mathbb F_2$, with the symmetric difference as addition. We call a finite set of edges \emph{even} if every site of $\Z^2$ belongs to an even number of edges of the set. We call a set of three sites that are pairwise $*$-neighbors a \emph{triangle}, and we call the set of its three edges its \emph{boundary}. Every triangle lies in a square $(a, b) + \{0, 1\}^2$. The boundary of a triangle is even, and so is every sum of boundaries of triangles. \begin{lemma}\label{l:boundaryconn} Let $A \subset \Z^2$ be finite, nonempty, and $*$-connected, and suppose that $\Z^2 \setminus A$ is $*$-connected. Then $\partial_\infty A$ is nonempty and $*$-connected. \end{lemma} \begin{proof} The proof has three steps. In the first, we show that the boundaries of triangles generate all even sets of edges; this is the only place where we use the geometry of $\Z^2$. The second and third steps deduce the lemma from this fact by a parity argument. \emph{Step 1.} We show that every even set of edges is a sum of boundaries of triangles. Let $\mathcal F$ be an even set of edges. Every diagonal edge can be written uniquely as $\{p, p + (1, \epsilon)\}$ with $p \in \Z^2$ and $\epsilon \in \{1, -1\}$. For each such edge of $\mathcal F$, we add to $\mathcal F$ the boundary of the triangle $\{p, p + (1, 0), p + (1, \epsilon)\}$, whose only diagonal edge is $\{p, p + (1, \epsilon)\}$. The resulting set $\mathcal F'$ is even and consists of bonds. For $(i, j) \in \Z^2$, let $\alpha_{i, j} \in \mathbb F_2$ be equal to $1$ if and only if the bond $\{(i, j), (i + 1, j)\}$ belongs to $\mathcal F'$, and let $\beta_{i, j} \in \mathbb F_2$ be equal to $1$ if and only if the bond $\{(i, j), (i, j + 1)\}$ belongs to $\mathcal F'$. We set \begin{equation*} \gamma_{i, j} = \sum_{r > j} \alpha_{i, r} \in \mathbb F_2. \end{equation*} We claim that \begin{equation}\label{e:rowparity} \sum_{r \in \Z} \alpha_{i, r} = 0 \qquad \text{for all } i \in \Z. \end{equation} Indeed, the left side of \eqref{e:rowparity} is the parity of the number of bonds of $\mathcal F'$ that join the half-plane $\{x_1 \le i\}$ to its complement. This number has the same parity as the sum, over the sites of the half-plane, of the number of bonds of $\mathcal F'$ that contain the site, and this sum is even because $\mathcal F'$ is even. Since $\mathcal F'$ is finite, \eqref{e:rowparity} implies that $\gamma_{i, j} = 0$ for all but finitely many $(i, j)$. For $(i, j) \in \Z^2$, let $\partial \square_{i, j}$ denote the set of the four bonds of the square $(i, j) + \{0, 1\}^2$. We now show that \begin{equation}\label{e:squaresum} \mathcal F' = \sum_{(i, j) \in \Z^2} \gamma_{i, j} \, \partial \square_{i, j}. \end{equation} The bond $\{(i, j), (i + 1, j)\}$ belongs to $\partial \square_{i, j}$ and to $\partial \square_{i, j - 1}$, and to no other set $\partial \square_{i', j'}$. Its coefficient on the right side of \eqref{e:squaresum} is \begin{equation*} \gamma_{i, j - 1} + \gamma_{i, j} = \alpha_{i, j}. \end{equation*} The bond $\{(i, j), (i, j + 1)\}$ belongs to $\partial \square_{i, j}$ and to $\partial \square_{i - 1, j}$. The site $(i, r)$ belongs to an even number of bonds of $\mathcal F'$, which means that $\alpha_{i - 1, r} + \alpha_{i, r} = \beta_{i, r - 1} + \beta_{i, r}$ for all $r$. Only finitely many $\beta_{i, r}$ are nonzero, and the coefficient of the bond is therefore \begin{equation*} \gamma_{i - 1, j} + \gamma_{i, j} = \sum_{r > j} (\alpha_{i - 1, r} + \alpha_{i, r}) = \sum_{r > j} (\beta_{i, r - 1} + \beta_{i, r}) = \beta_{i, j}, \end{equation*} where the last sum telescopes. This proves \eqref{e:squaresum}. Finally, each set $\partial \square_{i, j}$ is the sum of the boundaries of the two triangles $\{(i, j), (i + 1, j), (i + 1, j + 1)\}$ and $\{(i, j), (i, j + 1), (i + 1, j + 1)\}$, since their common edge cancels. Together with \eqref{e:squaresum}, this shows that $\mathcal F'$ is a sum of boundaries of triangles. The same holds for $\mathcal F$, which differs from $\mathcal F'$ by a sum of boundaries of triangles. \emph{Step 2.} Let $\partial_{\mathrm e} A$ denote the set of edges with one site in $A$ and the other in $\Z^2 \setminus A$. This set is finite, since $A$ is finite. It is nonempty, since a site of $A$ with the largest first coordinate has a $*$-neighbor outside $A$. We call two edges of $\partial_{\mathrm e} A$ \emph{linked} if they belong to the boundary of one triangle. We will show that any two edges of $\partial_{\mathrm e} A$ are joined by a chain of edges of $\partial_{\mathrm e} A$ in which consecutive edges are linked. Suppose that this fails. Then $\partial_{\mathrm e} A$ is the disjoint union of two nonempty sets $\mathcal E_1$ and $\mathcal E_2$ such that no edge of $\mathcal E_1$ is linked to an edge of $\mathcal E_2$. Given a triangle, let $m$ denote the number of its sites in $A$. Exactly $m (3 - m) \in \{0, 2\}$ edges of its boundary belong to $\partial_{\mathrm e} A$, and when there are two, they are linked and lie in the same set $\mathcal E_q$. Hence the boundary of every triangle contains an even number of edges of $\mathcal E_1$. The map $\mathcal F \mapsto |\mathcal F \cap \mathcal E_1| \bmod 2$ is linear on finite sets of edges and vanishes on the boundaries of triangles. By Step~1, it vanishes on every even set of edges. We now construct an even set of edges on which this map does not vanish. For $q = 1, 2$, we choose an edge $\{a_q, b_q\} \in \mathcal E_q$ with $a_q \in A$ and $b_q \notin A$. By assumption, there exist a $*$-path from $a_1$ to $a_2$ in $A$ and a $*$-path from $b_2$ to $b_1$ in $\Z^2 \setminus A$. Together with the edges $\{a_2, b_2\}$ and $\{b_1, a_1\}$, these paths form a closed walk. Let $\mathcal F$ be the set of edges that this walk traverses an odd number of times. The set $\mathcal F$ is even, because the walk is closed. Every edge of the first path has its two sites in $A$, and every edge of the second path has its two sites outside $A$. We conclude that \begin{equation*} \mathcal F \cap \partial_{\mathrm e} A = \bigl\{ \{a_1, b_1\}, \{a_2, b_2\} \bigr\}, \qquad |\mathcal F \cap \mathcal E_1| = 1, \end{equation*} which contradicts the fact that this map vanishes on every even set of edges. \emph{Step 3.} A site $z \notin A$ belongs to $\partial_\infty A$ if and only if it has a $*$-neighbor in $A$, which means that $z$ is the site outside $A$ of some edge of $\partial_{\mathrm e} A$. In particular, $\partial_\infty A$ is nonempty. The sites outside $A$ of two linked edges lie in one triangle, and they are equal or $*$-neighbors. Consequently, a chain of linked edges as in Step~2 gives a $*$-path in $\partial_\infty A$ between the sites outside $A$ of its first and last edges. By Step~2, $\partial_\infty A$ is $*$-connected. \end{proof} \section{Thickening}\label{s:topology-thicken} \begin{lemma}\label{l:thicken} Let $X_0 \subset \Z^2$ be finite, and let $X = \{ z \in \Z^2 : \dist(z, X_0) \le 1 \}$. \begin{enumerate} \item If $X_0$ is nonempty and $*$-connected, then $X$ is connected. \item Let $G \subset \Z^2$ be finite, and let $t \in (0, 1)$. Then \begin{equation*} \sum_{z \in X} t^{\dep_G(z)} \le 5 t^{-1} \sum_{x \in X_0} t^{\dep_G(x)}. \end{equation*} \end{enumerate} \end{lemma} \begin{proof} For $x \in \Z^2$, we let \begin{equation*} C(x) = \{ z \in \Z^2 : \dist(z, x) \le 1 \} \end{equation*} denote the set consisting of $x$ and its four neighbors. Each set $C(x)$ is connected and has five sites, and $X$ is the union of the sets $C(x)$ with $x \in X_0$. We begin with the first part. Let $x, x' \in X_0$ be $*$-neighbors. When $x \sim x'$, we have $x' \in C(x) \cap C(x')$. Otherwise, there exist $\epsilon_1, \epsilon_2 \in \{1, -1\}$ such that \begin{equation*} x' - x = (\epsilon_1, \epsilon_2), \qquad x + (\epsilon_1, 0) \in C(x) \cap C(x'). \end{equation*} In the two cases, the union $C(x) \cup C(x')$ is connected. Any two sites of $X_0$ are joined by a $*$-path in $X_0$, and the corresponding sets $C(x)$ form a chain in which consecutive sets intersect. It follows that $X$ is connected. We now prove the second part. Let $z \in X$, and choose $x \in X_0$ with $z \in C(x)$. Using the fact that $\dep_G$ is Lipschitz with constant $1$ for the graph distance, together with $t < 1$, we obtain \begin{equation*} t^{\dep_G(z)} \le t^{\dep_G(x) - 1}. \end{equation*} Summing this bound over $z \in C(x)$ and over $x \in X_0$, and using $|C(x)| = 5$, we arrive at the claim. \end{proof}