diff --git a/edit_distance_l1_matching_v2.txt b/edit_distance_l1_matching_v2.txt
index 0ed019f..e20a021 100644
--- a/edit_distance_l1_matching_v2.txt
+++ b/edit_distance_l1_matching_v2.txt
@@ -162,11 +162,11 @@ corresponding a_r over all coordinates. At first c_A may be +infinity. All
 terms are nonnegative, so the coordinate sum may be interchanged with the
 finite sum over unordered pairs. This gives
 
-    sum_A c_A |A| |X\A|
+    sum_A c_A |A| |X minus A|
       = sum_{{x,y}} sum_n |H_n(x)-H_n(y)|
       = sum_{{x,y}} ||H(x)-H(y)||_1 < infinity.
 
-Every indexed cut separates at least one pair, so |A||X\A| >= 1. Hence all
+Every indexed cut separates at least one pair, so |A||X minus A| >= 1. Hence all
 c_A are finite and their total is at most the right side. Summing the
 coordinate identities and grouping nonnegative terms gives the displayed cut
 identity. QED.