diff f6bf760..6fbd3ac chromatic_splitting_sphere_kernels_v2.txt
diff --git a/chromatic_splitting_sphere_kernels_v2.txt b/chromatic_splitting_sphere_kernels_v2.txt
index 6f08bcb..4778eeb 100644
--- a/chromatic_splitting_sphere_kernels_v2.txt
+++ b/chromatic_splitting_sphere_kernels_v2.txt
@@ -271,7 +271,7 @@ Reasons:
     has good upper and lower behavior. This makes the proof CONCRETE.
 
 Why p >= 5 (and p >= 7 at the next height)? The proofs use three
-inequalities that hold automatically in that range:
+ineualities that hold automatically in that range:
 
     2(p-1)^2 - (p^2 + 1)  =  p^2 - 4p + 1  > 0    (p >= 5)
     2(p-1)^2 - ((p+1)^2 + 1)  =  p(p - 6)  > 0    (p >= 7)
@@ -1125,7 +1125,7 @@ If one drops any of the following, the proof breaks:
 This section gives the second, unrelated proof of Theorem 1. It uses a
 different tool: H-equivariant descent exponents. The heart of the
 argument is that weak CSC would force two finite numbers to satisfy
-opposite inequalities.
+opposite ineualities.
 
 Fix p >= 5 and put t = p-1, h = p. (The number h = p here is the upper
 height the exponent argument is going to obstruct; t = p-1 is the lower
@@ -1763,7 +1763,7 @@ specific range.
       refuted at heights p and p+1, and only at p >= 5 and p >= 7
       respectively.
 
-    * No claim at primes p = 2 or p = 3. The proofs use inequalities
+    * No claim at primes p = 2 or p = 3. The proofs use ineualities
       like p^2 - 4p + 1 > 0 which fail at small primes; supplying these
       cases would require different techniques.