diff b34550f..f6bf760 percolation_nonuniqueness_nonamenable_v2.txt
diff --git a/percolation_nonuniqueness_nonamenable_v2.txt b/percolation_nonuniqueness_nonamenable_v2.txt
index 34b5035..1521767 100644
--- a/percolation_nonuniqueness_nonamenable_v2.txt
+++ b/percolation_nonuniqueness_nonamenable_v2.txt
@@ -1,91 +1,6 @@
 NONUNIQUENESS OF PERCOLATION ON NONAMENABLE QUASI-TRANSITIVE GRAPHS
 ==================================================================
 
-A self-contained guided tour.  Everything needed is introduced
-here.
-
-This document is the accessible rewrite of "Nonuniqueness of
-percolation on nonamenable quasi-transitive graphs".  The original
-technical paper is preserved next to this file; this rewrite keeps
-the statements and the logical flow intact but replaces the dense
-notation with plain language wherever possible, repairs a few typos,
-and adds intuition that the research version assumes the reader
-already has.
-
-The two main results, in one sentence each:
-
-  1.  Benjamini-Schramm.  On any nonamenable quasi-transitive
-      graph, Bernoulli bond percolation has a genuinely nonempty
-      phase where the infinite open cluster fails to be unique.
-
-  2.  Hutchcroft's operator threshold.  The same class of graphs
-      satisfies p_c < p_{2->2} <= p_u, so the L^2 connection
-      operator is bounded at criticality.
-
-The rest of this file explains what that means and why it is true.
-
-
-        
-
-
-==================================================================
-0. PROLOGUE: WHAT IS PERCOLATION?
-==================================================================
-
-Picture an enormous spiderweb: points (vertices) joined by silken
-strands (edges).  Now imagine that every strand is independent: with
-probability p it is left intact ("open"), and with probability
-1-p it is cut ("closed").  This is Bernoulli bond percolation.
-The parameter p is a single number between 0 and 1: a dial that
-runs from "everything cut" at p = 0 to "everything intact" at
-p = 1.
-
-A cluster is what you get by starting at some vertex and following
-open strands as far as they will go.  So the cluster of a vertex x
-is the set of all vertices it can reach through open strands,
-including x itself.
-
-The big question: at which p does an infinite cluster appear?
-
-When p is very small most strands are cut, so every cluster is a
-tiny finitely sized puff.  When p is very close to 1 almost every
-strand is intact, and the whole network is one gigantic connected
-blob.  Somewhere in between, the cluster of any given vertex stops
-being small and starts to be infinite with positive probability.
-That special value of p is called the critical probability p_c.
-
-On the ordinary infinite square grid (think graph paper going on
-forever), a beautiful classical result says that at p_c there is
-no infinite cluster, and just above p_c there is exactly one.
-Everything is crisp — one threshold, one infinite cluster.
-
-But on some graphs, there is a second threshold.  Write
-p_u for the smallest p such that there is almost surely exactly one
-infinite cluster.  On a regular tree of degree >= 3 (an ordinary
-family tree extending forever upward), p_c and p_u are different.
-There is a whole interval (p_c, p_u) in which there are infinitely
-many infinite clusters simultaneously — a "many-infinite" phase.
-
-For a long time it was conjectured (by Benjamini and Schramm in
-1996) that this two-threshold behaviour is not special to trees or
-to hyperbolic space: it happens on every "nonamenable" graph, which
-is roughly a graph that expands faster than flat Euclidean space at
-every scale.  The first main result of this paper proves that
-conjecture.  The second strengthens it to the L^2 language
-introduced by Hutchcroft: the boundary between "small" and
-"large" is not just p_c and p_u but a third threshold p_{2->2}
-that lives inside [p_c, p_u].
-
-Percolation on nonamenable graphs is fascinating because the graph
-itself is expanding: even if open strands are dense, they can get
-"used up" fast enough that no single infinite cluster can dominate
-the whole graph.  The intuition — that nonamenability forces
-nonuniqueness — was already known in special cases.  This paper
-proves it in complete generality for bond percolation on any
-nonamenable graph with finitely many symmetry classes of vertices.
-
-
-==================================================================
 1. THE TWO THEOREMS, STATED
 ==================================================================
 
@@ -444,90 +359,7 @@ eventually fed through.
 
 
 ==================================================================
-4. THE OVERALL STRATEGY IN ONE PAGE
-==================================================================
-
-We prove that ||T_{p_c}||_{2 -> 2} is finite.  From that and
-sprinkling we get p_c < p_{2->2}, and from that plus the fact that
-uniqueness forces an unbounded T_p we get p_{2->2} <= p_u.
-
-So the whole task is:  bound ||T_{p_c}||.
-
-Direct lower bound on ||T_{p_c}||.  Ask: is there a finite constant
-M such that ||T_p|| <= M for all p < p_c?  Equivalently by the
-monotone limit lemma (which we prove later), ||T_{p_c}|| <= M.
-The row sum of T_p at x is the expected size chi_x(p) = E_p |C_x|.
-If we could bound chi uniformly we would be done.  We cannot, in
-general: chi_x(p) -> infinity as p -> p_c.
-
-So we need a different mechanism.  The operator norm ||T_p|| is
-at most sup_x chi_x(p), but it can be strictly less — even tend to
-infinity much more slowly than chi does, or be bounded while chi
-blows up.  The hard content of the theorem is that on nonamenable
-graphs this "cheaper than chi" behaviour holds at p_c: the operator
-stays bounded even while its row sums diverge.
-
-The proof has five moving parts.  Each one is a barrier.
-
-Part A:  Fractional moments of the cluster size.
-    Assume for contradiction that chi_x(p_c) blows up so fast that
-    even a fractional moment E_{p_c} s_x^alpha, for some
-    alpha in (0, 1/2), is infinite.  Once confirmed, we are going
-    to derive a contradiction from it.  If no such alpha exists,
-    the theorem is already on its way to being true.
-
-Part B:  Small endpoint maps with enormous dispersion.
-    Under the fractional-moment blowup, we build a randomized rule
-    which either fails, or picks out a vertex in the root's cluster
-    with properties that scale "wrong".  The rule's success
-    probability u is not too small, but its conditional endpoint
-    kernel K has tiny norm r.  In words: the rule spreads endpoints
-    very widely while remaining likely to succeed.  Making r the
-    small parameter in the proof is the key.
-
-Part C:  The map as an operator.
-    Each map is a subcritical object (it is built from a scale that
-    sits inside the root cluster and can be run at any p < p_c).
-    Its small norm is what makes it destructive as an operator.
-
-Part D:  A differential inequality.
-    Iterate the map.  Its tiny norm pushes mass outside the root
-    cluster; exposing the cluster and applying the map on the
-    exterior gives a fine upper bound on how much of the resulting
-    mass lands inside the original cluster.  Comparing to a
-    full-graph susceptibility gives a lower bound for "how
-    exterior" the iterates must be.  Interpolating the two forces
-    a strong lower bound on chi'(p), which is the key estimate.
-
-Part E:  The corridor deformation.
-    Even a subpower bound on chi and on the "triangle trace"
-    (essentially the third moment of T_p) is not enough on its own
-    because a nonamenable graph can still push up the operator norm
-    through sheer visual density.  We therefore add a penalty to
-    connections that use a "corridor" — a simple open path with no
-    side opening at its interior.  Applying the penalty strictly
-    reduces the row sums, while only mildly reducing the operator
-    norm, thanks to the spectral gap of the lazy walk.
-
-Combining D and E forces a contradiction, proving that
-||T_{p_c}|| < infinity.  Then:
-
-    boundedness at p_c + sprinkling  =>  p_c < p_{2->2}
-    p_{2->2} <= p_u                              (proved directly)
-    strict gap + coupling argument   =>  simultaneous interval
-
-Each of the following sections corresponds to one of the moving
-parts.  They are all long; read each as an independent story, not
-as a linear script.
-
-A note on quantifier order.  The proof fixes all "path constants"
-in advance (they depend only on the graph), then closes the
-subcritical parameter p to p_c and then deforms.  This is why the
-statement "there exists a K_* depending only on G" appears so often:
-constants must be independent of p and of any auxiliary objects.
-
-==================================================================
-5. GOOD CLUSTERS SURVIVE DELETION
+4. GOOD CLUSTERS SURVIVE DELETION
 ==================================================================
 
 5.1 What is this for.
@@ -1420,14 +1252,14 @@ alpha (possible because 0 < alpha < 1/2), the exponent theta > alpha.  Then
     E_{p_c}[s_x^alpha]
         =  sum_{N >= 1} ( (N+1)^{alpha} - N^{alpha} )
                        P_{p_c}(s_x > N)
-        <=  C  sum_{N >= 1} N^{alpha - 1} N^{-theta}   < infty.
+        <=  C  sum_{N >= 1} N^{alpha - 1} N^{-theta}   < infinity.
 
 This contradicts (6.1).  That proves Proposition 7.1.
 
 7.11 From critical tails to a susceptibility bound.
 
 We also need the complementary direction: given
-sup_x E_{p_c} s_x^alpha < infty for some alpha in (0, 1/2),
+sup_x E_{p_c} s_x^alpha < infinity for some alpha in (0, 1/2),
 prove
 
     chi_max(p)  <=  C_eta (p_c - p)^{-1 - eta}
@@ -1573,7 +1405,7 @@ Then, uniformly for p_c / 2 <= p < p_c and L >= 1,
 
 So the square of the edge contact count between two large clusters,
 averaged over roots, decays as a negative power of L.  Since r < 0,
-the right side -> 0 as L -> infty.
+the right side -> 0 as L -> infinity.
 
 Proof idea.  Fix an oriented graph edge (x, v) and a size bin
 n <= min(|C_x|, |C_v|) < 2n.  There are three ingredients.
@@ -2103,7 +1935,7 @@ where
 
     E_J  =  (2J+1) * (sum_{r>=J} rho^r + sum_{n>=2J} (n+1) rho^n) / c_*.  (10.8)
 
-E_J -> 0 as J -> infty.  So most escapes avoid the segment for large J.
+E_J -> 0 as J -> infinity.  So most escapes avoid the segment for large J.
 
 For collisions with the "last block" (the segment h plus the escape
 from v that has to avoid it), a similar argument shows:
@@ -2446,7 +2278,7 @@ Together, (i) and (ii) give p_c < p_{2->2} <= p_u.
 That is Theorem (Hutchcroft's operator threshold).
 
 ==================================================================
-12. CONSEQUENCES AND WHERE TO GO NEXT
+12. CONSEQUENCES
 ==================================================================
 
 12.1 Spinoffs of critical boundedness.
@@ -2600,170 +2432,4 @@ So the gap p_c < p_{2->2} proven here is compatible with p_{2->2}
 being tight against p_u.  This is the sharpest possible form the
 "strict gap" can take in the operator language.
 
-12.6 What this does *not* do.
-
-  - It does not give any quantitative control on the interval
-    (p_c, p_u).  Its length may shrink to 0 in different graphs.
-
-  - It does not give an explicit p_{2->2} in terms of any other
-    invariant of G.  Bounds depend on the graph and on the
-    operator itself.
-
-  - It does not extend to site percolation at this level of
-    generality.  Site percolation is likely similar, but the required
-    mass-transport and pivoting arguments would need rework.
-
-  - It does not identify the "critical exponents" explicitly for
-    specific graphs; the mean-field exponent statements are "if
-    this class of graphs, then these exponents" independent of the
-    graph.  For the regular tree, they coincide with the classical
-    computations; for hyperbolic groups, the exponents are also of
-    mean-field type.
-
-
-==================================================================
-13. GLOSSARY
-==================================================================
-
-This is the "read it once and come back to it" reference.
-
-SYMBOLS
-
-    G, V, E       graph, vertices, edges
-    x ~ y         adjacency
-    deg(x)        number of edges incident to x
-    Aut(G)        group of graph automorphisms
-    O_x           orbit of x under Aut(G)
-    h_V(G)        vertex isoperimetric constant (inf of dA / A)
-    p_c(G)        critical probability
-    p_u(G)        uniqueness threshold
-    p_{2->2}(G)   L^2 operator threshold
-    p_exp(G)      exponential connectivity threshold
-
-    T_p(x, y)     connection probability (x <-> y at p)
-    C_x           open cluster of x (random)
-    s_x           |C_x|
-    pi_n          Prob_{p_c}(n <= s_o < 2n) (dyadic scale bin)
-    chi_x(p)      E_p |C_x| (susceptibility)
-    chi(p)        type average of chi_x
-    chi_max(p)    sup_x chi_x(p)
-    a_j(p)        tr(T_p^j), triangle (j=3), six-arm (j=6), ...
-    m_p           ||T_p||_{2->2}
-
-    nable_p(v)    sum_{y,z} T_p(v,y) T_p(y,z) T_p(z,v) (triangle diagram)
-
-    P             lazy random walk kernel
-    rho           ||P||_{2->2} (spectral radius; < 1 on nonamenable G)
-
-CONCEPTS
-
-    amenability     h_V(G) = 0
-    nonamenability  h_V(G) > 0 (equivalently, exponential growth and rho < 1)
-    quasi-transitive  finitely many vertex orbits
-
-    bond percolation  each edge open independently with prob p
-    cluster           connected open component
-    infinite cluster  unbounded connected open component
-
-    pivotal edge   a bridge whose toggling changes the event
-    good cluster   finite cluster whose pivotal distances are controlled after
-                   any vertex deletion (Section 5)
-    cap M          bound on cluster size
-
-    local endpoint map   randomized rule that either fails or outputs y in C_x
-                         using finitely many bits; parameters (u, M, r)
-
-    figure of merit    (U + m) / H, minimised in the amplification
-
-    corridor       simple open path with no other open edges at its interior
-    deformation    penalising corridors by exp(-t N_{xy})
-    escape path    simple path from a corridor endpoint into the pulled-apart
-                   graph with low interaction with the interior
-    anchored segment  geodesic segment gamma of length 2J with well-defined
-                      orbit / anchor structure
-
-INEQUALITIES
-
-    Harris (FKG)       E[fg] >= E[f] E[g] for increasing f, g
-    BK                 Prob(A [] B) <= Prob(A) Prob(B) for disjoint witnesses
-    three-arm bound    Prob(x <-> y, x <-> z) <= sum_w T(x,w) T(w,y) T(w,z)
-    sprinkling         T_{p + (1-p)a} <= sum_j a^j T_p (Adj T_p)^j
-    Russo              derivative of connection probability = expected
-                       number of closed pivotals
-
-MAIN THEOREM
-
-    For any infinite connected locally finite quasi-transitive graph G
-    with h_V(G) > 0:
-
-        sup_{p < p_c} ||T_p||_{2->2} = ||T_{p_c}||_{2->2} < infinity,
-        p_c(G) < p_{2->2}(G) <= p_u(G).
-
-    Additionally, there exists p_c < p_1 < p_2 < 1 such that in a single
-    uniform coupling, almost surely for every p in [p_1, p_2] there are
-    infinitely many infinite open clusters.
-
-KEY REFERENCES (for further reading)
-
-    Benjamini-Schramm 1996 -- posed the nonuniqueness conjecture
-    Haggstrom-Peres-Schonmann 1999 -- simultaneous phase theorem
-    BLPS 1999 -- critical finiteness for nonamenable Cayley graphs
-    Hutchcroft 2016 -- critical finiteness for quasi-transitive
-                       exponential growth
-    Hutchcroft 2019 -- L^2 operator thresholds, nonunimodular case
-    Hutchcroft 2020a,b,c -- L^2 consequences, nonunimodular theorem,
-                            exponential connectivity
-    Hutchcroft 2022 -- critical exponents, quasicritical tail
-    Aizenman-Newman 1984; Barsky-Aizenman 1991 -- triangle condition
-                                                   consequences
-    Duminil-Copin-Tassion 2016 -- sharpness of phase transition
-    Antunovic-Veselic 2008 -- quasi-transitive subcritical decay
-    O'Donnell-Saks-Schramm-Servedio 2005 -- decision-tree covariance
-    Kozma 2011 -- finite modifications, pivotal trees
-    Aldous-Lyons 2007 -- unimodular random networks, finite trace
-
-
-==================================================================
-EPILOGUE
-==================================================================
-
-If you have made it all the way through, you have seen how a modern
-mathematical theorem is built:
-
-    - A practical question (does percolation on nonamenable graphs
-      have a nonuniqueness phase?) is turned into an estimate on
-      an operator.
-
-    - The operator estimate is broken into sub-estimates, each of
-      which is smaller and more concrete than the last.
-
-    - Each sub-estimate is proved using a small toolkit of classical
-      inequalities (Harris, BK, Chernoff, Cauchy-Schwarz) plus one
-      or two clever ideas specific to the problem.
-
-    - Global arguments (differential inequalities in a "deformation
-      parameter") are used to string these together.
-
-The reward is a statement about a very general class of graphs:
-every nonamenable quasi-transitive graph satisfies p_c < p_u.
-No tree structure, no planar embedding, no Gromov-hyperbolicity
-needed.  Just the abstract expansion property of the graph, and
-a careful accumulation of small estimates.
-
-This does not mean the subject is closed.  Mean-field theory also
-predicts quantitatively many things about critical percolation on
-these graphs, most of which are still open for general
-quasi-transitive nonamenable graphs.  And the nonuniqueness
-conjecture for site percolation is still open in this generality.
-The methods here are a starting point, not a finish line.
-
-For a reader who wants to continue:
-
-    1. Read Hutchcroft 2020 for the L^2 framework.
-    2. Read Duminil-Copin-Tassion 2016 for sharpness machinery.
-    3. Read the technical paper this file accompanies for exact
-       proofs of every lemma stated here.
-    4. Try to sharpen any one of the estimates in Section 11;
-       even small improvements are publishable.
 
-Good luck.