text/A-infty.tex
changeset 64 af22fa790d13
parent 57 1a9008a522d9
child 67 1df2e5b38eb2
equal deleted inserted replaced
63:71b4e45f47f6 64:af22fa790d13
   104 Is it possible to compute the blob homology of a non-trivial bundle in terms of the blob homology of its fiber?
   104 Is it possible to compute the blob homology of a non-trivial bundle in terms of the blob homology of its fiber?
   105 \end{question}
   105 \end{question}
   106 
   106 
   107 
   107 
   108 \subsection{Blob homology}
   108 \subsection{Blob homology}
   109 The definition of blob homology for $(\cF, \cU)$ a homological system of fields and local relations is essentially the same as that given before in \S \ref{???}.
   109 The definition of blob homology for $(\cF, \cU)$ a homological system of fields and local relations is essentially the same as that given before in \S \ref{???}, except now there are some extra terms in the differential accounting for the `internal' differential acting on the fields.
   110 The blob complex $\cB_*^{\cF,\cU}(M)$ is a doubly-graded vector space, with a `blob degree' and an `internal degree'. 
   110 The blob complex $\cB_*^{\cF,\cU}(M)$ is a doubly-graded vector space, with a `blob degree' and an `internal degree'. 
   111 
   111 
   112 We'll write $\cT$ for the set of finite rooted trees. We'll think of each such a rooted tree as a category, with vertices as objects  and each morphism set either empty or a singleton, with $v \to w$ if $w$ is closer to a root of the tree than $v$. We'll write $\hat{v}$ for the `parent' of a vertex $v$ if $v$ is not a root (that is, $\hat{v}$ is the unique vertex such that $v \to \hat{v}$ but there is no $w$ with $v \to w \to \hat{v}$. If $v$ is a root, we'll write $\hat{v}=\star$. Further, for each tree $t$, let's arbitrarily choose an orientation $\lambda_t$, that is, an alternating $\pm1$-valued function on orderings of the vertices.
   112 We'll write $\cT$ for the set of finite rooted trees. We'll think of each such a rooted tree as a category, with vertices as objects  and each morphism set either empty or a singleton, with $v \to w$ if $w$ is closer to a root of the tree than $v$. We'll write $\hat{v}$ for the `parent' of a vertex $v$ if $v$ is not a root (that is, $\hat{v}$ is the unique vertex such that $v \to \hat{v}$ but there is no $w$ with $v \to w \to \hat{v}$. If $v$ is a root, we'll write $\hat{v}=\star$. Further, for each tree $t$, let's arbitrarily choose an orientation $\lambda_t$, that is, an alternating $\pm1$-valued function on orderings of the vertices.
   113 
   113 
   114 Given $v \in t$ there's a functor $\partial_v : t \to t \setminus \{v\}$ which removes the vertex $v$. Notice that removing a vertex naturally produces an orientation on $t \setminus \{v\}$ from the orientation on $t$, by $(\partial_v \lambda_t)(o) = \lambda_t(vo)$. This orientation may or may not agree with the chosen orientation of $t \setminus \{v\}$. We'll define $\sigma(v \in t) = \pm 1$ according to whether or not they agree. Notice that $$\sigma(v \in t) \sigma(w \in \partial_v t) = - \sigma(w \in t) \sigma(v \in \partial_w t).$$
   114 Given $v \in t$ there's a functor $\partial_v : t \to t \setminus \{v\}$ which removes the vertex $v$. Notice that removing a vertex naturally produces an orientation on $t \setminus \{v\}$ from the orientation on $t$, by $(\partial_v \lambda_t)(o) = \lambda_t(vo)$. This orientation may or may not agree with the chosen orientation of $t \setminus \{v\}$. We'll define $\sigma(v \in t) = \pm 1$ according to whether or not they agree. Notice that $$\sigma(v \in t) \sigma(w \in \partial_v t) = - \sigma(w \in t) \sigma(v \in \partial_w t).$$