# HG changeset patch
# User Scott Morrison <scott@tqft.net>
# Date 1279308187 21600
# Node ID c50ae482fe6a916f973ac1a687e37406244e5e5d
# Parent  0d62ea7c653d0bbd6e53898c9c2e76f310f1757d
spelling

diff -r 0d62ea7c653d -r c50ae482fe6a text/a_inf_blob.tex
--- a/text/a_inf_blob.tex	Wed Jul 14 11:06:20 2010 -0600
+++ b/text/a_inf_blob.tex	Fri Jul 16 13:23:07 2010 -0600
@@ -114,7 +114,7 @@
 However, we {\it can} find another decomposition $L$ such that $L$ shares common
 refinements with both $K$ and $K'$.
 Let $KL$ and $K'L$ denote these two refinements.
-Then filtration degree 1 chains associated to the four anti-refinemnts
+Then filtration degree 1 chains associated to the four anti-refinements
 $KL\to K$, $KL\to L$, $K'L\to L$ and $K'L\to K'$
 give the desired chain connecting $(a, K)$ and $(a, K')$
 (see Figure \ref{zzz4}).