diff f6bf760..6fbd3ac percolation_nonuniqueness_nonamenable_v2.txt
diff --git a/percolation_nonuniqueness_nonamenable_v2.txt b/percolation_nonuniqueness_nonamenable_v2.txt
index 1521767..420d848 100644
--- a/percolation_nonuniqueness_nonamenable_v2.txt
+++ b/percolation_nonuniqueness_nonamenable_v2.txt
@@ -66,7 +66,7 @@ That constant is the operator norm ||T_p||_{2 -> 2}.
The operator threshold p_{2->2} is the supremum of p for which
T_p is bounded. It always satisfies p_c <= p_{2->2} <= p_u.
The non-trivial content of the second theorem is that the
-inequalities are strict at the left.
+ineualities are strict at the left.
Now the theorems.
@@ -160,7 +160,7 @@ T_p(x, y) are nondecreasing in p.
The two thresholds p_c and p_u are as written above.
-On any infinite connected graph, 0 < p_c < 1. The lower inequality
+On any infinite connected graph, 0 < p_c < 1. The lower ineuality
is by counting paths (there are at most d^n length-n paths, and
that is too few to reach infinity when p is tiny). The upper is by
counting missing edges (in a bounded-degree graph, very few short
@@ -230,11 +230,11 @@ operator estimate in the paper.
3. BASIC PROBABILITY TOOLS USED EVERYWHERE
==================================================================
-Three inequalities handle almost every probabilistic estimate in the
+Three ineualities handle almost every probabilistic estimate in the
proof. We state and explain them, with the "why" first and the
statement second. The proofs are short and included.
-3.1 Harris's inequality (positive association).
+3.1 Harris's ineuality (positive association).
Intuition. If you take two "monotone increasing" events about a
random system — events that only become more likely when more edges
@@ -260,9 +260,9 @@ For two increasing functions of one bit, the covariance is
nonnegative. Induct on the number of bits.
This is where the name "Harris" comes from (Harris 1960). In
-statistical physics it is also called the FKG inequality.
+statistical physics it is also called the FKG ineuality.
-3.2 The van den Berg-Kesten (BK) inequality.
+3.2 The van den Berg-Kesten (BK) ineuality.
Intuition. Suppose event A needs a certain open "witness set" W_A of
edges, and event B needs its own witness set W_B. If the two
@@ -500,7 +500,7 @@ Proof outline.
E exp( lambda Z - lambda^2 T/8 ) <= 1.
- Conditional Jensen's inequality with H = P(E) >= h,
+ Conditional Jensen's ineuality with H = P(E) >= h,
yields
lambda E[Z | E] <= log(1/H) + (lambda^2 / 8) E[T | E].
@@ -522,7 +522,7 @@ Proof outline.
where C_{x, e}^D is the root cluster after forcing e closed.
The recursion shows b_i <= A_h^{i-1} b_1 <= A_h^i P(E) by
induction. Then an insertion of (1 + 1/(2A_h))^{D_p}
- and Markov's inequality produces the exponential tail.
+ and Markov's ineuality produces the exponential tail.
The upshot: E and D_p are exponentially controlled.
@@ -976,7 +976,7 @@ Therefore
So (t' / H') <= c_xi * (t / H), and c_xi < 1.
Also make H' bigger by choosing n larger if necessary (at each stage
-choose n so that H' >= 2H). This changes none of the inequalities
+choose n so that H' >= 2H). This changes none of the ineualities
above.
Iterate: (t_j / H_j) contracts geometrically to 0 while H_j -> inf.
@@ -1180,7 +1180,7 @@ Choose j = ceil( log(C_* chi) / (H-1) ) so that r^j chi^3 is at most
(c_0/2) chi^3 / chi^3 = c_0/2. Then the upper (7.7) and the lower
(c_0 minus the small term) bounds sandwich D(p).
-Result (the inequality at the heart of the proof):
+Result (the ineuality at the heart of the proof):
D(p) >= c_map chi^{-(U+m+C')/(H-1)}. (7.9)
@@ -1234,7 +1234,7 @@ successive conditioning gives
The last estimate is independent of N.
-Hölder's inequality + Markov: for any b > 1,
+Hölder's ineuality + Markov: for any b > 1,
P_{p_c}(s_x >= N)
= E_p [ L_N 1_{s_x >= N} ]
@@ -1279,7 +1279,7 @@ Each edge is queried with probability at most
2 C_a n^{-a}, where a in (0, 1/2) (from the moment bound
and Harris).
-The decision-tree covariance inequality says:
+The decision-tree covariance ineuality says:
Cov(f, g) <= sum_e (reveal prob of e) * (influence of e on f).
@@ -1757,7 +1757,7 @@ Section 10 supplies: a positive proportion b_* > 0 of raw paths have
both endpoint potentials large (specifically, s_t^{D_w}(u) and
s_t^{D_w}(v) are within a small factor of the full chi_t). This
converts the row-sum decrease into a concrete differential
-inequality.
+ineuality.
9.9 Path comparison along an edge.
@@ -1783,7 +1783,7 @@ escape endpoint where we need it.
10.1 What we need.
-Section 9 left us with the differential inequality
+Section 9 left us with the differential ineuality
-chi_t' >= exp(-t c_k) * E_path [ 1_{ell_w >= 3}
s_t^{D_w}(u) s_t^{D_w}(v) ]
@@ -1831,7 +1831,7 @@ Pick a geodesic segment gamma = (gamma_{-J}, ..., gamma_J) in G.
Such a segment exists (with length 2J) because G is infinite and
connected, so has infinite diameter. Write S = Gamma * gamma for
its orbit under Aut(G) (a set of anchored segments). Write O_i =
-Gamma * gamma_i for the orbit of position i and vartheta_i for its
+Gamma * gamma_i for the orbit of position i and theta_i for its
root weight.
For x in O_i, define
@@ -2003,7 +2003,7 @@ with Q_u-probability at least 1/2:
dist(u, v) >= 3).
By (10.6), the same event has ordinary walk probability at least
-(1/2) / D_J, hence at least b_* := vartheta_0 / (2 D_J) in the
+(1/2) / D_J, hence at least b_* := theta_0 / (2 D_J) in the
type-averaged sense.
That proves Lemma 10.1. The constants J, C_1, k_0, b_* are all
@@ -2035,7 +2035,7 @@ The R and a_3 quantities capture how "far" T_p is from being
11.2 Consequences of the assumed unboundedness.
-Suppose (11.1). Using the sprinkling inequality (Section 3.4), if we
+Suppose (11.1). Using the sprinkling ineuality (Section 3.4), if we
sprinkled at p with a = delta / (1-p) and this were bounded, then
T_{p_c} would be bounded too (contradiction). So a * d * m_0 >= 1,
which gives
@@ -2127,7 +2127,7 @@ In the deformation with parameters (p, k, t_*) on the time interval
The first uses Proposition 9.3. The second converts the row-sum
bound m_t <= c_sigma chi_t into a lower bound on chi_t.
-11.6 The differential inequality.
+11.6 The differential ineuality.
Apply the "two endpoints" selection lemma (Lemma 10.1) to pick a
positive fraction of raw paths whose two endpoint potentials are
@@ -2138,7 +2138,7 @@ large. Specifically, for a selected path w with endpoints u, v:
>= (c_f - 2 c_sigma tau) chi_t
>= (c_f / 2) chi_t, (11.13)
-where the first inequality uses the deletion estimate (Lemma 9.4)
+where the first ineuality uses the deletion estimate (Lemma 9.4)
with the selection lemma's Nb[I_w]-control, the second uses
chi_0^+ = R m_0, and the third uses (11.12) and the smallness of tau.
@@ -2168,10 +2168,10 @@ On the other hand, the error term in Proposition 9.7 is at most
<= 4 C' c_sigma^2 R^2 rho^k a_3 * chi_t^2
= o( (k R)^{-C_2} chi_t^2 ), (11.17)
-where the last inequality uses m_0 <= c_sigma chi_t (row sum bound)
+where the last ineuality uses m_0 <= c_sigma chi_t (row sum bound)
and the little-o is the content of (11.9).
-Therefore the differential inequality (9.9) becomes
+Therefore the differential ineuality (9.9) becomes
-chi_t' >= (c_1' / 2) (k R)^{-C_2} chi_t^2. (11.18)
@@ -2263,7 +2263,7 @@ that:
(i) Sprinkling (Section 3.4) at p = p_c with a small enough a > 0
gives boundedness of T_{p_c + delta}, hence p_c < p_{2->2}.
- (ii) The forward inequality p_{2->2} <= p_u is proved in Section
+ (ii) The forward ineuality p_{2->2} <= p_u is proved in Section
2.5 as follows. If uniqueness holds at p, then for any
x, y there is a single infinite open cluster with positive
probability theta_x > 0. Harris gives T_p(x, y)
@@ -2342,7 +2342,7 @@ The radius tails n^{-1} mean that a critical cluster of radius n is
predict.
The (d) and (e) statements require slightly more than the triangle
-condition -- they use the strict inequality p_c < p_{2->2} to tap into
+condition -- they use the strict ineuality p_c < p_{2->2} to tap into
results of Hutchcroft (2020, 2022). The exact quasi-transitive
statements are in Hutchcroft 2022 ("Slightly supercritical percolation
on non-amenable graphs I").