diff --git a/main.tex b/main.tex
index 35869fc68471f174a1d752ebf997ee0e684df413..c5a999c027c22f6a88457f807704a9da737f00b0 100644
--- a/main.tex
+++ b/main.tex
@@ -402,10 +402,10 @@ The intuition of the following lemma is that if two sites have distance $d$ in t
 \begin{lemma}\label{lemma:distancePower}
 	Suppose $G=(V,E)$ is a graph, $X,Y\subseteq V$ and $A^X$ is a local event on $X$. Then
 	$$\P^{G}(A^X)-\P^{G\setminus Y}(A^X)=\bigO{p^{d(X,Y)}}.$$
-	(Should be true with $+1$ in the degree!)
+	(Should be true with $+1$ in the degree, when $d(X,Y)>0$!)
 \end{lemma}
 \begin{proof}
-	We can assume without loss of generality, that $X\neq \emptyset\neq Y$, otherwise the statement is trivial.
+	We can assume without loss of generality, that $X\neq \emptyset\neq Y$, otherwise the statement is trivial. Also we can assume without loss of generality that $d(X,Y)\leq \infty$, i.e., $X,Y$ are in the same connected component of $G$, otherwise we can use Lemma~\ref{lemma:splitting} with $S=\emptyset$.
 	
 	The proof goes by induction on $d(X,Y)$. The statement is trivial for $d(X,Y)=0$, and is easy to check for $d(X,Y)=1$, by looking at resample sequences that reach the all $1$ state in at most $0$ step (which is simply the case when everything is sampled to $1$ initially).