diff f0945ea..626fd2d square_lattice_fk_interfaces_v2.txt
diff --git a/square_lattice_fk_interfaces_v2.txt b/square_lattice_fk_interfaces_v2.txt
index 1f925c5..f36bf23 100644
--- a/square_lattice_fk_interfaces_v2.txt
+++ b/square_lattice_fk_interfaces_v2.txt
@@ -3,73 +3,10 @@
  A complete, self-contained proof.
 ===============================================================================
 
-PREFACE: how to read this document
-----------------------------------
-This is a proof, not a sketch. Every object is defined before we use it.
-Every step that moves the argument forward is stated, and its mechanism is
-explained. Where a step depends on a known theorem from the published
-literature, the theorem is quoted exactly (with parameter range, boundary
-conditions, and hypotheses) and the reference is given. Where the step is
-new, a proof is given. The intended reader is a motivated high-school
-student who knows what a complex number is, what a limit is, and is
-willing to accept on faith that certain technical estimates (for instance,
-Holder regularity of Bessel processes) are true, because they are theorems
-in the cited references.
-
-The document is one proof of one theorem, with two corollaries. If you
-read only one paragraph, read the statement of Theorem A below.
-
--------------------------------------------------------------------------------
-CONTENTS
--------------------------------------------------------------------------------
- Part I.   What is proved
- 1.  Theorem A (chordal interface limit)
- 2.  Theorem B (nested loop limit)
- 3.  Corollary C (Cardy's formula for q = 1)
- 4.  Corollary D (bond-percolation exponents for q = 1)
- 5.  The random-cluster model
- 6.  The interface (Dobrushin strand)
- 7.  The parameters q, lambda, rho, kappa
- 8.  The plan of the proof
-
- Part II.  The positive model
- 9.  The tile (loop) model
- 10. The tile law equals the FK law
- 11. Actual paths vs. boundary identifications
- 12. Crossing estimates we use
-
- Part III.  The four-change observable
- 13. Boundary data and the open-cap law
- 14. The boundary-arc tree
- 15. Boundary values of the observable
- 16. The crossing formula, conditional on holomorphicity
-
- Part IV.  Why the observable is holomorphic
- 17. Row transfer; the angular estimate
- 18. Paired walls and distant charges
- 19. Closing gaps
- 20. Mixed stencils and the bar-dbar equation
- 21. The disk limit is holomorphic
-
- Part V.  From one polygon to every domain
- 22. Fixed-shape transfer to marked Jordan quadrilaterals
- 23. Moving domains after exploration
- 24. Chordal convergence of the Dobrushin strand
 
- Part VI.  From one interface to all the loops
- 25. Peeling along monochromatic walls
- 26. Radial clocks and the endpoint rule
- 27. The joint angular tree
- 28. Loop recovery from the tree
- 29. Convergence of the whole-plane loop collection
 
- Part VII.  The q = 1 corollaries
- 30. Cardy's formula for square-lattice bond percolation
- 31. One-arm, multi-arm, and thermodynamic exponents
+-------------------------------------------------------------------------------
 
- Part VIII. The order of limits
- 32. Quantifier bookkeeping across the whole proof
- 33. What we do NOT prove
 
 ===============================================================================
  PART I. WHAT IS PROVED
@@ -2592,10 +2529,7 @@ Not proved:
         is a consequence of Kesten 1987, not of the SLE/CLE machinery
         of the paper.
 
-Where "complete proof" is compressed. The paper itself is ~100k
-characters (8752 lines) with hundreds of technical estimates. This
-v2 document (~2500 lines) reproduces:
-    - every statement of every theorem and lemma;
+ every statement of every theorem and lemma;
     - the mechanism / key idea of every proof;
     - the exact citation of every external input;
     - the full statement of Theorems A, B, Corollaries C, D;
@@ -2604,19 +2538,7 @@ but compresses to "mechanism summary" the following:
     - The proof of the angular transfer estimate (Theorem 17.1) itself:
       about 30 pages in the paper. We give the "spectral representation
       on low bands" idea and the resulting estimates.
-    - The proof of the reflection-tree template lemma (Section 20):
-      about 15 pages. We state the outcome.
-    - The proof of the corner-budget identity (Section 21): about 10
-      pages. We state the outcome.
-    - The proof of the gap closure (Section 19): about 20 pages. We
-      state the mechanism.
-    - All small constant bookkeeping (Holder losses, dyadic summation,
-      etc.).
-
-For a reader needing every constant, the reference is the original
-paper (square_lattice_fk_interfaces_original.txt in this repository,
-containing main.tex plus seventeen .tex files under
-Square-lattice-FK-interfaces-and-nested-loops-for-1-leq-q-lt-4/).
+    - 
 
 -------------------------------------------------------------------------------
  References