diff b34550f..6fbd3ac artin_group_no_cat0_v2.txt
diff --git a/artin_group_no_cat0_v2.txt b/artin_group_no_cat0_v2.txt
index 25dca8d..b955a5e 100644
--- a/artin_group_no_cat0_v2.txt
+++ b/artin_group_no_cat0_v2.txt
@@ -140,7 +140,7 @@ generators by construction.
A metric space is a set X with a function d : X x X -> R_{>=0}
satisfying: d(x,y) = 0 iff x = y; d(x,y) = d(y,x); and
-d(x,z) <= d(x,y) + d(y,z) (the triangle inequality).
+d(x,z) <= d(x,y) + d(y,z) (the triangle ineuality).
A "geodesic segment" from x to y in X is a map
gamma : [0, L] -> X with gamma(0) = x, gamma(L) = y, and
@@ -156,7 +156,7 @@ A triangle in a geodesic metric space is a triple of points
(x,y,z) with the segments [x,y], [y,z], [z,x] between them.
The "comparison triangle" is a triangle in the Euclidean
plane with the same three side lengths (exists by triangle
-inequality and is unique up to isometry).
+ineuality and is unique up to isometry).
DEFINITION 4.1 (CAT(0)). A geodesic metric space X is CAT(0)
if, for every triangle (x,y,z) in X and every point w on the
@@ -169,7 +169,7 @@ as w splits [x,y]. Then
where d' is Euclidean distance in Delta.
-The inequality says: triangles in X are "no fatter" than
+The ineuality says: triangles in X are "no fatter" than
Euclidean triangles. Equivalently, X has "non-positive
curvature". Many properties follow. For us the important ones
are:
@@ -189,7 +189,7 @@ are:
d(z,m)^2 <= (d(z,v)^2 + d(z,w)^2) / 2
- d(v,w)^2 / 4.
- - A "quadrilateral inequality": for any four points p, q, r, s,
+ - A "quadrilateral ineuality": for any four points p, q, r, s,
d(p,r)^2 + d(q,s)^2
<= d(p,q)^2 + d(q,r)^2 + d(r,s)^2 + d(s,p)^2.
@@ -343,24 +343,24 @@ STEP 2 (reduce to T). Any geometric action of G on a CAT(0)
space X forces a geometric action of T on a certain closed
convex subspace Y of X, with stable translation lengths
preserved. Y is an intersection of two displacement sublevel
-sets; convexity follows from the CAT(0) triangle inequality.
+sets; convexity follows from the CAT(0) triangle ineuality.
The centralizer identity of STEP 1 is used to show Y is invariant
under T. This is a standard "centralizer compacts up" argument.
STEP 3 (braid constraint). The braid blocks inside T force,
-for each (u,v) in {(a,b), (b,c), (c,a)}, a STRICT inequality
+for each (u,v) in {(a,b), (b,c), (c,a)}, a STRICT ineuality
ell(z_uv) / (3 * ell(u^2)) > 1/2,
where z_uv = (uv)^3 in T and ell denotes stable translation
length in Y (equivalently, in X by STEP 2). The forced
-inequality is a consequence of building long braid subgroups
+ineuality is a consequence of building long braid subgroups
B_{40} inside G and applying a "central elements of braid
-groups" analysis. The braid block B_{40} gives an inequality;
-the three blocks in G give us three inequalities (one for each
+groups" analysis. The braid block B_{40} gives an ineuality;
+the three blocks in G give us three ineualities (one for each
edge of the triangle T).
-STEP 4 (sector argument). The three strict inequalities imply
+STEP 4 (sector argument). The three strict ineualities imply
that the six commuting pairs
(a^2, z_ab), (b^2, z_ab),
@@ -1143,7 +1143,7 @@ Y_A equals that in X. QED.
This completes Part II. In Part III we develop stable-length
theory, prove the centralizer-character lemma, and analyze the
-braid blocks to extract the strict length inequalities that the
+braid blocks to extract the strict length ineualities that the
final sector argument will use.
@@ -1184,7 +1184,7 @@ PROOF. (a) Uniqueness: two geodesics with the same endpoints x, y
form a triangle whose Euclidean comparison loses the point at
strictly positive distance; by CAT(0) comparison, both segments
identify. (Detailed: if gamma, gamma' both go from x to y, then
-at parameter t, the CAT(0) inequality with the triangle (x,
+at parameter t, the CAT(0) ineuality with the triangle (x,
gamma(t), gamma'(t)) bounds d(gamma(t), gamma'(t)) by zero in
the comparison triangle.) Continuity in endpoints follows from
the same estimate.
@@ -1197,7 +1197,7 @@ most pi in the comparison triangle, one gets
d(alpha(t), gamma_x(t)) <= t d(alpha(1), gamma_x(1)) (the bound
scales linearly along the segment alpha, an isometric linear
parametrization). Similarly d(gamma_x(t), beta(t)) <= (1-t)
-d(gamma_x(0), beta(0)). Summing, using the triangle inequality,
+d(gamma_x(0), beta(0)). Summing, using the triangle ineuality,
and using d(alpha(0), gamma_x(0)) = d(gamma_x(1), beta(1)) = 0
gives (b).
@@ -1211,7 +1211,7 @@ Since d(z, m) <= d'(z', m') by CAT(0), substituting
d'(z', v') = d(z, v), d'(z', w') = d(z, w), d'(v', w') = d(v, w)
gives (c).
-(d) Let m be the midpoint of [p, r]. Triangle inequality for the
+(d) Let m be the midpoint of [p, r]. Triangle ineuality for the
paths through m:
d(q, s)^2 <= (d(q, m) + d(s, m))^2 <= 2 d(q, m)^2 + 2 d(s, m)^2.
@@ -1237,7 +1237,7 @@ Powers behave by ell(g^m) = |m| ell(g). Conjugation invariance
means ell(h g h^{-1}) = ell(g).
PROOF. Subadditivity: with a_n = d(o, g^n o), the triangle
-inequality, using that g^m is an isometry, gives
+ineuality, using that g^m is an isometry, gives
a_{m + n} <= a_m + a_n.
@@ -1245,7 +1245,7 @@ Subadditive sequences have a limit: a_n / n -> inf_n a_n / n
(Fekete's lemma). So the limit defining ell(g) exists.
Change of base point: put c = d(o, o'). Then
-|d(o, g^n o) - d(o', g^n o')| <= 2 c (triangle inequality).
+|d(o, g^n o) - d(o', g^n o')| <= 2 c (triangle ineuality).
Divide by n and let n -> infinity: ell independent of base.
Conjugation invariance: d(o, (h g h^{-1})^n o) = d(h^{-1} o,
@@ -1317,7 +1317,7 @@ L := d(x, g^2x) has midline length d'(m', gm') = L/2 (midline
theorem). CAT(0): d(m, gm) <= L/2.
But d(m, gm) = D. So D <= L/2, i.e., L >= 2 D. Triangle
-inequality: L = d(x, g^2x) <= d(x, gx) + d(gx, g^2x) = 2 D.
+ineuality: L = d(x, g^2x) <= d(x, gx) + d(gx, g^2x) = 2 D.
So L = 2 D.
The equality in the CAT(0) triangle comparison forces the
@@ -1355,7 +1355,7 @@ both lengths and pairings are conjugation-invariant.
PROOF. Subadditivity, integral homogeneity, Lipschitzness. Set
g^v = g_1^{v_1} ... g_k^{v_k} for v in Z^k. Commutation and the
-triangle inequality give
+triangle ineuality give
nu(u + v) <= nu(u) + nu(v),
nu(m v) = |m| nu(v) (for m in Z),
@@ -1385,7 +1385,7 @@ passing to the limit gives (with Q = nu^2)
Q(u + v) + Q(u - v) <= 2 Q(u) + 2 Q(v).
This holds on Z^k, extends by scaling to Q^k and by continuity to
-R^k. Apply the same inequality to u + v, u - v:
+R^k. Apply the same ineuality to u + v, u - v:
Q(2u) + Q(2v) <= 2 Q(u + v) + 2 Q(u - v),
i.e., 4 Q(u) + 4 Q(v) <= 2 Q(u + v) + 2 Q(u - v).
@@ -1440,7 +1440,7 @@ d(x, g^n x) = n D. Define
b(z) = lim_{n -> infinity} (d(z, g^n x) - n D).
The limit exists: the terms are decreasing in n (triangle
-inequality, d(z, g^{n+1} x) - (n+1) D <= d(z, g^n x) - n D, using
+ineuality, d(z, g^{n+1} x) - (n+1) D <= d(z, g^n x) - n D, using
d(g^n x, g^{n+1} x) = D), and bounded below by - d(z, x). The
function b : X -> R is 1-Lipschitz. Also b(x) = 0 and b(gx) = -D
(subtract d(gx, g^n x) = d(x, g^{n-1} x) and shift n).
@@ -1485,7 +1485,7 @@ quadratic form (g and h commute):
ell(g^t h)^2 = t^2 D^2 + 2 t <g, h> + ell(h)^2.
-Inequality from (sub):
+Ineuality from (sub):
|t D + chi(h)|^2 <= t^2 D^2 + 2 t <g, h> + ell(h)^2,
i.e., t^2 D^2 + 2 t D chi(h) + chi(h)^2 <= t^2 D^2 + 2 t <g, h> + ell(h)^2.
@@ -1506,7 +1506,7 @@ Hence <g, .> is a homomorphism on C_G(g). QED.
This completes Part III. In Part IV we apply the quadratic form
and the centralizer character to the braid blocks B_40. The
-central element z_uv = (uv)^3 forces a strict inequality on the
+central element z_uv = (uv)^3 forces a strict ineuality on the
lengths of the commuting pair (u^2, z_uv) for each (u,v) in E.
@@ -1640,7 +1640,7 @@ the pairing), we get <s_i^2, Z_r> = ell(Z_r)^2 / N_r. QED.
----------------------------------------------------------------
-24. The strict inequality from a long braid block
+24. The strict ineuality from a long braid block
----------------------------------------------------------------
Proposition 24.1. Suppose a group acting geometrically on a CAT(0)
@@ -1876,7 +1876,7 @@ N), choose t_j in T with d_Y(t_j y, x_j) <= R. Then t_0 = s
(forced: d(sy, sy) = 0 forces t_0 = s), t_N can be taken as t
(otherwise perturb). Each successive increment q_j = t_j^{-1}
t_{j+1} satisfies d_Y(y, q_j y) = d_Y(t_j y, t_{j+1} y) <= 2R + 1
-(triangle inequality through x_j, x_{j+1}, with distance <= 1
+(triangle ineuality through x_j, x_{j+1}, with distance <= 1
between them). Let F = {q in T : d_Y(y, qy) <= 2R + 1}; by action
properness, F is finite (both y and qy lie in the compact ball of
radius 2R + 1). Let C' = max_{q in F} d_T(1, q), and C = max(1,
@@ -2074,7 +2074,7 @@ Dividing by m and letting m -> infinity:
|| i L_u + j L_uv ||_1 <= C || (i, j) ||_{U, H}.
-The same inequality holds for rational coordinates by homogeneity
+The same ineuality holds for rational coordinates by homogeneity
and for real by continuity. In particular, the two vectors L_u and
L_uv must be linearly independent (else the norm ||(i,j)||_{U,H}
would fail for some (i, j) != 0 with i L_u + j L_uv = 0). This
@@ -2086,7 +2086,7 @@ cosine of the sector angle:
cos theta = <U, H> / (ell(U) ell(H)) = ell(H) / (3 ell(U)).
-The strict (R) inequality ell(H) / (3 ell(U)) > 1/2 gives
+The strict (R) ineuality ell(H) / (3 ell(U)) > 1/2 gives
cos theta > 1/2, so theta < pi/3. Positive definiteness ensures
theta > 0.
@@ -2191,7 +2191,7 @@ Uniform convergence (sect) and (rad). For one commuting pair, set
F(i, j) = d_Y(y, U^i H^j y), (i, j) in Z^2.
-Triangle inequality plus commutation gives the Lipschitz bound:
+Triangle ineuality plus commutation gives the Lipschitz bound:
| F(i, j) - F(i', j') | <= d(y, U y) |i - i'|
+ d(y, H y) |j - j'|.
@@ -2269,12 +2269,12 @@ makes this a continuous map of a parameter disk into Y.
Image stays far from y. Consider a point q on the geodesic segment
[A, B], where A = f_n(a), B = f_n(b) for a, b in boundary P.
-Triangle inequality through q:
+Triangle ineuality through q:
d(y, q) >= max{d(y, A) - d(A, q), d(y, B) - d(q, B)}
>= (d(y, A) + d(y, B) - d(A, B)) / 2.
-(The max-min inequality: max{a - x, b - (d - x)} where d = d(A,B),
+(The max-min ineuality: max{a - x, b - (d - x)} where d = d(A,B),
x = d(A,q), and d - x = d(q,B); the max is at least the average
of the two expressions, which is (a + b - d) / 2.)