author | kevin@6e1638ff-ae45-0410-89bd-df963105f760 |
Wed, 26 Aug 2009 02:35:24 +0000 | |
changeset 117 | b62214646c4f |
parent 116 | 3f180943709f |
child 119 | a044fda18400 |
permissions | -rw-r--r-- |
113 | 1 |
%!TEX root = ../blob1.tex |
2 |
||
3 |
\section{The blob complex for $A_\infty$ $n$-categories} |
|
4 |
\label{sec:ainfblob} |
|
5 |
||
6 |
Given an $A_\infty$ $n$-category $\cC$ and an $n$-manifold $M$, we define the blob |
|
7 |
complex $\bc_*(M)$ to the be the colimit $\cC(M)$ of Section \ref{sec:ncats}. |
|
8 |
\nn{say something about this being anticlimatically tautological?} |
|
9 |
We will show below |
|
10 |
\nn{give ref} |
|
11 |
that this agrees (up to homotopy) with our original definition of the blob complex |
|
12 |
in the case of plain $n$-categories. |
|
13 |
When we need to distinguish between the new and old definitions, we will refer to the |
|
14 |
new-fangled and old-fashioned blob complex. |
|
15 |
||
16 |
\medskip |
|
17 |
||
18 |
Let $M^n = Y^k\times F^{n-k}$. |
|
19 |
Let $C$ be a plain $n$-category. |
|
20 |
Let $\cF$ be the $A_\infty$ $k$-category which assigns to a $k$-ball |
|
21 |
$X$ the old-fashioned blob complex $\bc_*(X\times F)$. |
|
22 |
||
23 |
\begin{thm} |
|
24 |
The old-fashioned blob complex $\bc_*^C(Y\times F)$ is homotopy equivalent to the |
|
25 |
new-fangled blob complex $\bc_*^\cF(Y)$. |
|
26 |
\end{thm} |
|
27 |
||
28 |
\begin{proof} |
|
29 |
We will use the concrete description of the colimit from Subsection \ref{ss:ncat_fields}. |
|
30 |
||
31 |
First we define a map from $\bc_*^\cF(Y)$ to $\bc_*^C(Y\times F)$. |
|
32 |
In filtration degree 0 we just glue together the various blob diagrams on $X\times F$ |
|
33 |
(where $X$ is a component of a permissible decomposition of $Y$) to get a blob diagram on |
|
34 |
$Y\times F$. |
|
35 |
In filtration degrees 1 and higher we define the map to be zero. |
|
36 |
It is easy to check that this is a chain map. |
|
37 |
||
115 | 38 |
Next we define a map from $\phi: \bc_*^C(Y\times F) \to \bc_*^\cF(Y)$. |
113 | 39 |
Actually, we will define it on the homotopy equivalent subcomplex |
115 | 40 |
$\cS_* \sub \bc_*^C(Y\times F)$ generated by blob diagrams which are small with |
41 |
respect to some open cover |
|
113 | 42 |
of $Y\times F$. |
43 |
\nn{need reference to small blob lemma} |
|
44 |
We will have to show eventually that this is independent (up to homotopy) of the choice of cover. |
|
45 |
Also, for a fixed choice of cover we will only be able to define the map for blob degree less than |
|
46 |
some bound, but this bound goes to infinity as the cover become finer. |
|
47 |
||
115 | 48 |
Given a decomposition $K$ of $Y$ into $k$-balls $X_i$, let $K\times F$ denote the corresponding |
49 |
decomposition of $Y\times F$ into the pieces $X_i\times F$. |
|
50 |
||
51 |
%We will define $\phi$ inductively, starting at blob degree 0. |
|
52 |
%Given a 0-blob diagram $x$ on $Y\times F$, we can choose a decomposition $K$ of $Y$ |
|
53 |
%such that $x$ is splittable with respect to $K\times F$. |
|
54 |
%This defines a filtration degree 0 element of $\bc_*^\cF(Y)$ |
|
55 |
||
56 |
We will define $\phi$ using a variant of the method of acyclic models. |
|
57 |
Let $a\in S_m$ be a blob diagram on $Y\times F$. |
|
58 |
For $m$ sufficiently small there exist decompositions of $K$ of $Y$ into $k$-balls such that the |
|
59 |
codimension 1 cells of $K\times F$ miss the blobs of $a$, and more generally such that $a$ is splittable along $K\times F$. |
|
60 |
Let $D(a)$ denote the subcomplex of $\bc_*^\cF(Y)$ generated by all $(a, \bar{K})$ |
|
61 |
such that each $K_i$ has the aforementioned splittable property |
|
62 |
(see Subsection \ref{ss:ncat_fields}). |
|
116 | 63 |
\nn{need to define $D(a)$ more clearly; also includes $(b_j, \bar{K})$ where |
64 |
$\bd(a) = \sum b_j$.} |
|
65 |
(By $(a, \bar{K})$ we really mean $(a^\sharp, \bar{K})$, where $a^\sharp$ is |
|
115 | 66 |
$a$ split according to $K_0\times F$. |
67 |
To simplify notation we will just write plain $a$ instead of $a^\sharp$.) |
|
68 |
Roughly speaking, $D(a)$ consists of filtration degree 0 stuff which glues up to give |
|
69 |
$a$, filtration degree 1 stuff which makes all of the filtration degree 0 stuff homologous, |
|
70 |
filtration degree 2 stuff which kills the homology created by the |
|
71 |
filtration degree 1 stuff, and so on. |
|
72 |
More formally, |
|
73 |
||
74 |
\begin{lemma} |
|
75 |
$D(a)$ is acyclic. |
|
76 |
\end{lemma} |
|
77 |
||
78 |
\begin{proof} |
|
79 |
We will prove acyclicity in the first couple of degrees, and \nn{in this draft, at least} |
|
80 |
leave the general case to the reader. |
|
116 | 81 |
|
115 | 82 |
Let $K$ and $K'$ be two decompositions of $Y$ compatible with $a$. |
116 | 83 |
We want to show that $(a, K)$ and $(a, K')$ are homologous via filtration degree 1 stuff. |
84 |
\nn{need to say this better; these two chains don't have the same boundary.} |
|
85 |
We might hope that $K$ and $K'$ have a common refinement, but this is not necessarily |
|
86 |
the case. |
|
87 |
(Consider the $x$-axis and the graph of $y = x^2\sin(1/x)$ in $\r^2$.) |
|
88 |
However, we {\it can} find another decomposition $L$ such that $L$ shares common |
|
89 |
refinements with both $K$ and $K'$. |
|
90 |
Let $KL$ and $K'L$ denote these two refinements. |
|
91 |
Then filtration degree 1 chains associated to the four anti-refinemnts |
|
92 |
$KL\to K$, $KL\to L$, $K'L\to L$ and $K'L\to K'$ |
|
93 |
give the desired chain connecting $(a, K)$ and $(a, K')$ |
|
94 |
(see Figure xxxx). |
|
95 |
||
96 |
Consider a different choice of decomposition $L'$ in place of $L$ above. |
|
97 |
This leads to a cycle consisting of filtration degree 1 stuff. |
|
98 |
We want to show that this cycle bounds a chain of filtration degree 2 stuff. |
|
99 |
Choose a decomposition $M$ which has common refinements with each of |
|
100 |
$K$, $KL$, $L$, $K'L$, $K'$, $K'L'$, $L'$ and $KL'$. |
|
117
b62214646c4f
preparing for semi-public version soon
kevin@6e1638ff-ae45-0410-89bd-df963105f760
parents:
116
diff
changeset
|
101 |
\nn{need to also require that $KLM$ antirefines to $KM$, etc.} |
116 | 102 |
Then we have a filtration degree 2 chain, as shown in Figure yyyy, which does the trick. |
103 |
For example, .... |
|
104 |
||
105 |
||
115 | 106 |
\end{proof} |
107 |
||
108 |
||
113 | 109 |
\nn{....} |
110 |
\end{proof} |
|
111 |
||
115 | 112 |
|
113 | 113 |
\nn{need to say something about dim $< n$ above} |
114 |
||
115 |
||
116 |
||
117 |
\medskip |
|
118 |
\hrule |
|
119 |
\medskip |
|
120 |
||
121 |
\nn{to be continued...} |
|
122 |
\medskip |
|
123 |