diff b1f9bc4..6fbd3ac group_no_fixed_price_v2.txt
diff --git a/group_no_fixed_price_v2.txt b/group_no_fixed_price_v2.txt
index 01a645b..d7cc8dc 100644
--- a/group_no_fixed_price_v2.txt
+++ b/group_no_fixed_price_v2.txt
@@ -421,7 +421,7 @@ increase, stay inside their factor relations, and their join is Rbar_Gamma
 at every stage. (Edge families themselves need not increase.)
 
 All costs and all kappa use lambda without normalizing. Summing the
-compression inequalities and using kappa(S_0) = lambda(Z) and (4.6),
+compression ineualities and using kappa(S_0) = lambda(Z) and (4.6),
     C(E_A^n) + C(E_B^n) <= c - 1 + kappa(S_n) + eps,  n >= 0.    (4.7)
 In particular every graphing used later has finite cost.
 
@@ -1031,7 +1031,7 @@ APPENDIX. HOW THE PARTS FIT
 - Part 6 (random models) supplies V_k with expansion and few bad rows.
 - Part 7 (planar lemma) is the small-cancellation matching statement.
 - Part 8 (rank bound) turns expansion into rk(D) > alpha n / 100.
-- Part 9 assembles everything into the strict inequality of costs.
+- Part 9 assembles everything into the strict ineuality of costs.
 
 References (bibliographic pointers; not needed to follow the proof):
   Levitt, "On the cost of generating an equivalence relation" (1995).