diff d214c92..9506729 percolation_nonuniqueness_nonamenable_v2.txt
diff --git a/percolation_nonuniqueness_nonamenable_v2.txt b/percolation_nonuniqueness_nonamenable_v2.txt
index b2129e9..8665a04 100644
--- a/percolation_nonuniqueness_nonamenable_v2.txt
+++ b/percolation_nonuniqueness_nonamenable_v2.txt
@@ -688,7 +688,7 @@ Proof outline.
                              sum_{W: x, a in W, b not in W}
                              P( C_{x,e}^D = W )
                              (1 - h)^{|W|}
-                             b_{i-1}( D \ W, b ),
+                             b_{i-1}( D minus W, b ),
 
        where C_{x, e}^D is the root cluster after forcing e closed.
        The recursion shows b_i <= A_h^{i-1} b_1 <= A_h^i P(E) by
@@ -1252,7 +1252,7 @@ M times the price.  This is used to control the split between
 Lemma 7.3 (The map in a deleted domain).  Fix a map with parameters
 u, M, H as in 7.3.  For a deterministic set A, define
 
-    F_A(v)  =  f_{V \ A}(v) / chi    for v not in A,
+    F_A(v)  =  f_{V minus A}(v) / chi    for v not in A,
     F_A(v)  =  0                     for v in A,
     h_A(v)  =  sum_{a in A, dist(v, a) <= M} sum_{b ~ a} F_A(b).
 
@@ -1267,7 +1267,7 @@ times the value at v" inside the domain, plus a correction for the
 
 Proof sketch.  Unconditionally, the map's endpoint y is connected to v
 by an open path of length at most M.  If that path avoids A, y is
-inside the M-ball of v in V \ A, so Lemma 7.2 applies.  If the path
+inside the M-ball of v in V minus A, so Lemma 7.2 applies.  If the path
 exits A on its way to y, let a ~ b be the last exit from A, and use
 Harris with the event "the segment from b to y is open" to transfer
 susceptibility from y back to b.  The transfer cost is p^{-M}, and
@@ -1335,7 +1335,7 @@ a full chi of mass.  Each "leak" past the boundary corresponds to
 externalising one unit.  Because K_p has tiny norm r < 1:
 
     E_hat (K_p^j F_A)(x)
-        =  (mass that stayed in D \ A after j steps)
+        =  (mass that stayed in D minus A after j steps)
         +  (mass that leaked out through A).
 
 The first term is at least c_0 > 0 uniformly for large j (a lower
@@ -1821,7 +1821,7 @@ Proof sketch.
 Lemma 9.1 (Corridor calibration).  For a template w, let Q_w be the
 event that gamma_w is open and all its blockers are closed in the
 full graph.  Then Q_w is independent of the percolation on
-D_w = V \ I_w, and
+D_w = V minus I_w, and
 
     (9.4)  c(w) * Prob_p(Q_w)  =  mu_u(w).
 
@@ -1862,7 +1862,7 @@ We need two lemmas.
 Lemma 9.4 (Deletion estimate).  For A subset D, let Nb[A] be A
 together with all its neighbours in the full graph.  For every v:
 
-    (9.6)  s_t^{D \ A}(v)  >=  s_t^D(v)
+    (9.6)  s_t^{D minus A}(v)  >=  s_t^D(v)
                             - chi_0^+ * sum_{z in Nb[A]} T_0(v, z).
 
 Idea: Verify that the only "loss" from deleting A comes from