diff 342da3d..b1f9bc4 group_no_fixed_price_v2.txt
diff --git a/group_no_fixed_price_v2.txt b/group_no_fixed_price_v2.txt
index f75cf03..01a645b 100644
--- a/group_no_fixed_price_v2.txt
+++ b/group_no_fixed_price_v2.txt
@@ -21,41 +21,6 @@ the final proof is proved here. The only background assumed is the
 definition of a group, a group action, a probability space, and the free
 group on a finite set.
 
-==========================================================================
-PART 0. THE ONE IDEA, IN PLAIN WORDS
-==========================================================================
-
-Take a countable group G acting on a probability space X by
-measure-preserving bijections. Its orbit relation R connects two points
-when one is the image of the other under a group element. A graphing of
-R is a countable list of partially-defined bijections whose graphs sit
-inside R and whose compositions connect every pair of R-related points,
-up to a null set. The cost of a graphing is the sum of the measures of
-its domains. The cost of R is the smallest such sum.
-
-Cost asks: how many "edge slots", on average, are needed to wire up the
-orbits? A free group of rank r acting freely needs exactly r edges per
-point (its rank). An infinite amenable group can often be wired up with
-cost barely above 1 by using a single cyclic "spine" and cheap shortcuts.
-
-The fixed price question: does the cost of R depend only on G, not on the
-action? For free groups, for many product groups, and for many amenable
-groups the answer is yes. This paper shows the answer is no in general.
-
-The trick. Let Gamma = A *_J (J x Z), where A is free of rank 100 and J
-is a particular free subgroup of A of rank 100 (free on b_1,...,b_99 and a
-long word w). There is a homomorphism chi : Gamma -> Z that counts a's.
-Two actions:
-
-  (1) the Bernoulli shift on X; cost we will bound below by 1 + eta, some
-      positive eta;
-  (2) the product of the shift with a cyclic height coordinate mod M. The
-      height lets us recover most a-edges from a cheap spine, giving cost
-      at most 1 + 99/M, which tends to 1.
-
-Choosing M large makes the two costs differ. That is the whole strategy.
-Everything below is the machinery needed to make steps (1) and (2) rigorous.
-
 ==========================================================================
 PART 1. THE GROUP, THE COEFFICIENT HOMOMORPHISM, AND THE TWO ACTIONS
 ==========================================================================
@@ -86,7 +51,7 @@ The embedding J -> B is j |-> (j, 1).
 
 Lemma 1.1 (Normal form).
 (a) A and B embed in Gamma and A cap B = J.
-(b) If g_1, ..., g_n lie alternately in A \ J and B \ J then
+(b) If g_1, ..., g_n lie alternately in A  J and B  J then
     g_1...g_n is not in J for n >= 1, and for n >= 2 it lies in neither
     factor.
 (c) J is free on b_1, ..., b_99, w; in particular J is infinite.
@@ -303,12 +268,12 @@ Proof. On the union Z_fin of finite T-classes, choose the least point of each
 class (fix a Borel linear order on Z); this Borel transversal M_fin has
 measure kappa(T) by Lemma 4.0a.
 
-On Z_inf = Z \ Z_fin choose increasing finite Borel partitions P_n that
+On Z_inf = Z  Z_fin choose increasing finite Borel partitions P_n that
 separate all points. Let k_n(z) be the number of atoms of P_n meeting
 [z]_T; this is Borel and k_n(z) -> infinity. Fix 0 < p < 1 with
 p lambda(Z_inf) < eps/2. At level n mark each atom independently with
 probability p and let A be the union of marked atoms. The Borel set
-    M_inf = A cup (Z_inf \ [A]_T)
+    M_inf = A cup (Z_inf  [A]_T)
 meets every infinite T-class. The union is disjoint and
     E lambda(M_inf) = p lambda(Z_inf) + int_{Z_inf} (1-p)^{k_n(z)} dlambda(z),
 and the integral tends to 0. For large n the expectation is < eps, so some
@@ -337,8 +302,8 @@ exactly on Y. For each S-class K outside Y pick an oriented E-edge instance
 from y_K in K to y'_K with d(y'_K) = d(K) - 1 (it exists on a shortest
 path); make the choice Borel by taking the least eligible (map index,
 direction) and then the least point of the finite class K. The set V = {y_K}
-is a Borel transversal of S on Z \ Y, so
-    lambda(V) = kappa(S ; Z \ Y).                                (4.2)
+is a Borel transversal of S on Z  Y, so
+    lambda(V) = kappa(S ; Z  Y).                                (4.2)
 
 For each original map phi_i let V_i^+ be the chosen origins whose edge is
 traversed forward under phi_i, and V_i^- those traversed under phi_i^{-1}.
@@ -346,8 +311,8 @@ Delete the domain set H_i = V_i^+ cup phi_i^{-1}(V_i^-) from D_i. The two parts
 are disjoint: an instance chosen both ways would make each endpoint class
 closer than the other. The V_i^+, V_i^- partition V and inverse images under
 phi_i preserve measure, so the residual family E' = (phi_i restricted to
-D_i \ H_i) satisfies the exact identity
-    C(E') = C(E) - sum_i lambda(H_i) = C(E) - kappa(S ; Z \ Y).  (4.3)
+D_i  H_i) satisfies the exact identity
+    C(E') = C(E) - sum_i lambda(H_i) = C(E) - kappa(S ; Z  Y).  (4.3)
 (Count distinct indices even when geometric edges coincide; this handles
 graphings with repetitions.)
 
@@ -379,7 +344,7 @@ Q|Y = (S|Y) v F. For arbitrary x Q x', pick y in [x]_T cap Y and y' in
 using S subset T and F, and two T-steps finish: Q = T v F.
 
 Finally combine (4.1), (4.3), (4.4):
-    C(F) <= C(E) - kappa(S ; Z \ Y) = C(E) - kappa(S) + kappa(S ; Y)
+    C(F) <= C(E) - kappa(S ; Z  Y) = C(E) - kappa(S) + kappa(S ; Y)
          <= C(E) - kappa(S) + lambda(M)
          <= C(E) - kappa(S) + kappa(T) + eps. QED
 
@@ -533,13 +498,13 @@ to the identity, matching the role of R_J being supplied for free.) Write
 number of generators of D.
 
 PROPOSITION 5.2 (transfer). Let V_k be finite exact right A-sets with
-n_k = |V_k| -> infinity such that for every fixed g in A \ {1},
+n_k = |V_k| -> infinity such that for every fixed g in A  {1},
     |Fix_{V_k}(g)| / n_k -> 0.                                   (5.3)
 Then, for the free Bernoulli action on X from Part 1,
     delta_X >= limsup_k rk(D_{V_k}) / n_k.
 
 Proof. We use right actions, so (xg)(h) = x(gh). Choose representatives h_c
-for the cosets A h_c in Gamma and let Omega = [0,1]^{A \ Gamma} with product
+for the cosets A h_c in Gamma and let Omega = [0,1]^{A  Gamma} with product
 measure. The coordinate rearrangement x |-> ( (x(g h_c))_c )_{g in A}
 identifies the restriction of X_0 to A with Omega^A (independent base
 coordinates, right action (xi q)(g) = xi(qg)). Write mu for the product
@@ -906,7 +871,7 @@ be the first s of them; at that moment N(T') subset S and |S| <= 2 alpha n + 90
 96 s, because alpha n < s + 1 <= 2 s < 3 s gives 2 alpha n < 6 s. But (8.2)
 gives |N(T')| > 96 s, contradiction. So fewer than s rows are processed and
     |S| <= 2 alpha n + 90 (s - 1) <= 92 alpha n < n.              (8.4)
-Put U = V \ S, nonempty. At termination every arc has either no U-labelled
+Put U = V  S, nonempty. At termination every arc has either no U-labelled
 edge or more than 30. Every row not entirely in S is good and has at most 9
 S-occurrences, hence at least 91 distinct positive U-letters, and distinct
 such rows share at most one U-letter.