diff -r 3781b30c4e2e -r 2039bcccfa99 text/ncat.tex
--- a/text/ncat.tex	Tue May 10 18:08:26 2011 -0700
+++ b/text/ncat.tex	Wed Jun 22 16:02:27 2011 -0700
@@ -1204,7 +1204,7 @@
 \item decompositions $x = x_0, x_1, \ldots , x_{k-1}, x_k = x$ and $v_1,\ldots, v_k$ of $W$;
 \item anti-refinements $v_i\to x_i$ and $v_i\to x_{i-1}$; and
 \item elements $a_i\in \psi(x_i)$ and $b_i\in \psi(v_i)$, with $a_0 = a$ and $a_k = \hat{a}$, 
-such that $b_i$ and $b_{i+1}$both map to (glue up to) $a_i$.
+such that $b_i$ and $b_{i+1}$ both map to (glue up to) $a_i$.
 \end{itemize}
 In other words, we have a zig-zag of equivalences starting at $a$ and ending at $\hat{a}$.
 The idea of the proof is to produce a similar zig-zag where everything antirefines to the same