author | Kevin Walker <kevin@canyon23.net> |
Wed, 10 Aug 2011 13:11:59 -0600 | |
changeset 872 | 933a93ef7df1 |
parent 865 | 7abe7642265e |
child 887 | ab0b4827c89c |
child 888 | a0fd6e620926 |
permissions | -rw-r--r-- |
169 | 1 |
%!TEX root = ../../blob1.tex |
114 | 2 |
|
512
050dba5e7bdd
fixing some (but not all!?) of the hyperref warnings; start on revision of evmap
Kevin Walker <kevin@canyon23.net>
parents:
510
diff
changeset
|
3 |
\section{Comparing \texorpdfstring{$n$}{n}-category definitions} |
114 | 4 |
\label{sec:comparing-defs} |
5 |
||
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
6 |
In \S\ref{sec:example:traditional-n-categories(fields)} we showed how to construct |
865
7abe7642265e
relentless adding 'disk-like' everywhere it could possibly go
Scott Morrison <scott@tqft.net>
parents:
854
diff
changeset
|
7 |
a disk-like $n$-category from a traditional $n$-category; the morphisms of the |
7abe7642265e
relentless adding 'disk-like' everywhere it could possibly go
Scott Morrison <scott@tqft.net>
parents:
854
diff
changeset
|
8 |
disk-like $n$-category are string diagrams labeled by the traditional $n$-category. |
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
9 |
In this appendix we sketch how to go the other direction, for $n=1$ and 2. |
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
10 |
The basic recipe, given a disk-like $n$-category $\cC$, is to define the $k$-morphisms |
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
11 |
of the corresponding traditional $n$-category to be $\cC(B^k)$, where |
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
12 |
$B^k$ is the {\it standard} $k$-ball. |
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
13 |
One must then show that the axioms of \S\ref{ss:n-cat-def} imply the traditional $n$-category axioms. |
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
14 |
One should also show that composing the two arrows (between traditional and disk-like $n$-categories) |
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
15 |
yields the appropriate sort of equivalence on each side. |
853
870d6fac5420
several minor corrections, from referee
Scott Morrison <scott@tqft.net>
parents:
792
diff
changeset
|
16 |
Since we haven't given a definition for functors between disk-like $n$-categories, we do not pursue this here. |
114 | 17 |
|
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
18 |
We emphasize that we are just sketching some of the main ideas in this appendix --- |
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
19 |
it falls well short of proving the definitions are equivalent. |
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
20 |
|
680
0591d017e698
plain n-cat -> ordinary n-cat
Kevin Walker <kevin@canyon23.net>
parents:
530
diff
changeset
|
21 |
%\nn{cases to cover: (a) ordinary $n$-cats for $n=1,2$; (b) $n$-cat modules for $n=1$, also 2?; |
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
22 |
%(c) $A_\infty$ 1-cat; (b) $A_\infty$ 1-cat module?; (e) tensor products?} |
204 | 23 |
|
512
050dba5e7bdd
fixing some (but not all!?) of the hyperref warnings; start on revision of evmap
Kevin Walker <kevin@canyon23.net>
parents:
510
diff
changeset
|
24 |
\subsection{1-categories over \texorpdfstring{$\Set$ or $\Vect$}{Set or Vect}} |
194 | 25 |
\label{ssec:1-cats} |
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
26 |
Given a disk-like $1$-category $\cX$ we construct a $1$-category in the conventional sense, $c(\cX)$. |
345 | 27 |
This construction is quite straightforward, but we include the details for the sake of completeness, |
28 |
because it illustrates the role of structures (e.g. orientations, spin structures, etc) |
|
29 |
on the underlying manifolds, and |
|
194 | 30 |
to shed some light on the $n=2$ case, which we describe in \S \ref{ssec:2-cats}. |
114 | 31 |
|
194 | 32 |
Let $B^k$ denote the \emph{standard} $k$-ball. |
345 | 33 |
Let the objects of $c(\cX)$ be $c(\cX)^0 = \cX(B^0)$ and the morphisms of $c(\cX)$ be $c(\cX)^1 = \cX(B^1)$. |
34 |
The boundary and restriction maps of $\cX$ give domain and range maps from $c(\cX)^1$ to $c(\cX)^0$. |
|
114 | 35 |
|
36 |
Choose a homeomorphism $B^1\cup_{pt}B^1 \to B^1$. |
|
345 | 37 |
Define composition in $c(\cX)$ to be the induced map $c(\cX)^1\times c(\cX)^1 \to c(\cX)^1$ |
38 |
(defined only when range and domain agree). |
|
194 | 39 |
By isotopy invariance in $\cX$, any other choice of homeomorphism gives the same composition rule. |
201 | 40 |
Also by isotopy invariance, composition is strictly associative. |
114 | 41 |
|
194 | 42 |
Given $a\in c(\cX)^0$, define $\id_a \deq a\times B^1$. |
43 |
By extended isotopy invariance in $\cX$, this has the expected properties of an identity morphism. |
|
114 | 44 |
|
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
45 |
We have now defined the basic ingredients for the 1-category $c(\cX)$. |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
46 |
As we explain below, $c(\cX)$ might have additional structure corresponding to the |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
47 |
unoriented, oriented, Spin, $\text{Pin}_+$ or $\text{Pin}_-$ structure on the 1-balls used to define $\cX$. |
114 | 48 |
|
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
49 |
For 1-categories based on unoriented balls, |
737 | 50 |
there is a map $\dagger:c(\cX)^1\to c(\cX)^1$ |
194 | 51 |
coming from $\cX$ applied to an orientation-reversing homeomorphism (unique up to isotopy) |
114 | 52 |
from $B^1$ to itself. |
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
53 |
(Of course our $B^1$ is unoriented, i.e.\ not equipped with an orientation. |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
54 |
We mean the homeomorphism which would reverse the orientation if there were one; |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
55 |
$B^1$ is not oriented, but it is orientable.) |
114 | 56 |
Topological properties of this homeomorphism imply that |
737 | 57 |
$a^{\dagger\dagger} = a$ ($\dagger$ is order 2), $\dagger$ reverses domain and range, and $(ab)^\dagger = b^\dagger a^\dagger$ |
58 |
($\dagger$ is an anti-automorphism). |
|
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
59 |
Recall that in this context 0-balls should be thought of as equipped with a germ of a 1-dimensional neighborhood. |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
60 |
There is a unique such 0-ball, up to homeomorphism, but it has a non-identity automorphism corresponding to reversing the |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
61 |
orientation of the germ. |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
62 |
Consequently, the objects of $c(\cX)$ are equipped with an involution, also denoted $\dagger$. |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
63 |
If $a:x\to y$ is a morphism of $c(\cX)$ then $a^\dagger: y^\dagger\to x^\dagger$. |
114 | 64 |
|
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
65 |
For 1-categories based on oriented balls, there are no non-trivial homeomorphisms of 0- or 1-balls, and thus no |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
66 |
additional structure on $c(\cX)$. |
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
67 |
|
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
68 |
For 1-categories based on Spin balls, |
791
c5a33223af00
adding remarks on objects to C.1; this is pretty uninspired writing, so feel free to improve
Kevin Walker <kevin@canyon23.net>
parents:
790
diff
changeset
|
69 |
the nontrivial spin homeomorphism from $B^1$ to itself which covers the identity |
194 | 70 |
gives an order 2 automorphism of $c(\cX)^1$. |
791
c5a33223af00
adding remarks on objects to C.1; this is pretty uninspired writing, so feel free to improve
Kevin Walker <kevin@canyon23.net>
parents:
790
diff
changeset
|
71 |
There is a similar involution on the objects $c(\cX)^0$. |
792
966a571daa10
added remark on super algebra
Kevin Walker <kevin@canyon23.net>
parents:
791
diff
changeset
|
72 |
In the case where there is only one object and we are enriching over complex vector spaces, this |
966a571daa10
added remark on super algebra
Kevin Walker <kevin@canyon23.net>
parents:
791
diff
changeset
|
73 |
is just a super algebra. |
966a571daa10
added remark on super algebra
Kevin Walker <kevin@canyon23.net>
parents:
791
diff
changeset
|
74 |
The even elements are the $+1$ eigenspace of the involution on $c(\cX)^1$, |
966a571daa10
added remark on super algebra
Kevin Walker <kevin@canyon23.net>
parents:
791
diff
changeset
|
75 |
and the odd elements are the $-1$ eigenspace of the involution. |
114 | 76 |
|
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
77 |
For 1-categories based on $\text{Pin}_-$ balls, |
194 | 78 |
we have an order 4 antiautomorphism of $c(\cX)^1$. |
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
79 |
For 1-categories based on $\text{Pin}_+$ balls, |
194 | 80 |
we have an order 2 antiautomorphism and also an order 2 automorphism of $c(\cX)^1$, |
114 | 81 |
and these two maps commute with each other. |
791
c5a33223af00
adding remarks on objects to C.1; this is pretty uninspired writing, so feel free to improve
Kevin Walker <kevin@canyon23.net>
parents:
790
diff
changeset
|
82 |
In both cases there is a similar map on objects. |
790
ec8587c33c0b
more details in C.1; reorganized to-do list
Kevin Walker <kevin@canyon23.net>
parents:
737
diff
changeset
|
83 |
|
114 | 84 |
|
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
85 |
\noop{ |
114 | 86 |
\medskip |
87 |
||
194 | 88 |
In the other direction, given a $1$-category $C$ |
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
89 |
(with objects $C^0$ and morphisms $C^1$) we will construct a disk-like |
194 | 90 |
$1$-category $t(C)$. |
114 | 91 |
|
194 | 92 |
If $X$ is a 0-ball (point), let $t(C)(X) \deq C^0$. |
93 |
If $S$ is a 0-sphere, let $t(C)(S) \deq C^0\times C^0$. |
|
94 |
If $X$ is a 1-ball, let $t(C)(X) \deq C^1$. |
|
114 | 95 |
Homeomorphisms isotopic to the identity act trivially. |
96 |
If $C$ has extra structure (e.g.\ it's a *-1-category), we use this structure |
|
97 |
to define the action of homeomorphisms not isotopic to the identity |
|
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
98 |
(and get, e.g., an unoriented disk-like 1-category). |
114 | 99 |
|
194 | 100 |
The domain and range maps of $C$ determine the boundary and restriction maps of $t(C)$. |
114 | 101 |
|
194 | 102 |
Gluing maps for $t(C)$ are determined by composition of morphisms in $C$. |
114 | 103 |
|
194 | 104 |
For $X$ a 0-ball, $D$ a 1-ball and $a\in t(C)(X)$, define the product morphism |
114 | 105 |
$a\times D \deq \id_a$. |
106 |
It is not hard to verify that this has the desired properties. |
|
107 |
||
108 |
\medskip |
|
109 |
||
345 | 110 |
The compositions of the constructions above, $$\cX\to c(\cX)\to t(c(\cX))$$ |
111 |
and $$C\to t(C)\to c(t(C)),$$ give back |
|
114 | 112 |
more or less exactly the same thing we started with. |
194 | 113 |
|
114 | 114 |
As we will see below, for $n>1$ the compositions yield a weaker sort of equivalence. |
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
115 |
} %end \noop |
114 | 116 |
|
115 | 117 |
\medskip |
118 |
||
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
119 |
Similar arguments show that modules for disk-like 1-categories are essentially |
115 | 120 |
the same thing as traditional modules for traditional 1-categories. |
114 | 121 |
|
451
bb7e388b9704
starting on comparing_defs.tex
Kevin Walker <kevin@canyon23.net>
parents:
433
diff
changeset
|
122 |
|
481 | 123 |
\subsection{Pivotal 2-categories} |
194 | 124 |
\label{ssec:2-cats} |
685
8efbd2730ef9
"topological n-cat" --> either "disk-like n-cat" or "ordinary n-cat" (when contrasted with A-inf n-cat)
Kevin Walker <kevin@canyon23.net>
parents:
680
diff
changeset
|
125 |
Let $\cC$ be a disk-like 2-category. |
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
126 |
We will construct from $\cC$ a traditional pivotal 2-category. |
115 | 127 |
(The ``pivotal" corresponds to our assumption of strong duality for $\cC$.) |
128 |
||
854 | 129 |
We will try to describe the construction in such a way that the generalization to $n>2$ is clear, |
124 | 130 |
though this will make the $n=2$ case a little more complicated than necessary. |
115 | 131 |
|
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
132 |
Before proceeding, we must decide whether the 2-morphisms of our |
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
133 |
pivotal 2-category are shaped like rectangles or bigons. |
125 | 134 |
Each approach has advantages and disadvantages. |
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
135 |
For better or worse, we choose bigons here. |
128 | 136 |
|
728
83c1ec0aac1f
two more transverse symbols
Scott Morrison <scott@tqft.net>
parents:
685
diff
changeset
|
137 |
Define the $k$-morphisms $C^k$ of $C$ to be $\cC(B^k) \trans E$, where $B^k$ denotes the standard |
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
138 |
$k$-ball, which we also think of as the standard bihedron (a.k.a.\ globe). |
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
139 |
(For $k=1$ this is an interval, and for $k=2$ it is a bigon.) |
115 | 140 |
Since we are thinking of $B^k$ as a bihedron, we have a standard decomposition of the $\bd B^k$ |
141 |
into two copies of $B^{k-1}$ which intersect along the ``equator" $E \cong S^{k-2}$. |
|
728
83c1ec0aac1f
two more transverse symbols
Scott Morrison <scott@tqft.net>
parents:
685
diff
changeset
|
142 |
Recall that the subscript in $\cC(B^k) \trans E$ means that we consider the subset of $\cC(B^k)$ |
115 | 143 |
whose boundary is splittable along $E$. |
144 |
This allows us to define the domain and range of morphisms of $C$ using |
|
145 |
boundary and restriction maps of $\cC$. |
|
146 |
||
124 | 147 |
Choosing a homeomorphism $B^1\cup B^1 \to B^1$ defines a composition map on $C^1$. |
148 |
This is not associative, but we will see later that it is weakly associative. |
|
149 |
||
125 | 150 |
Choosing a homeomorphism $B^2\cup B^2 \to B^2$ defines a ``vertical" composition map |
151 |
on $C^2$ (Figure \ref{fzo1}). |
|
124 | 152 |
Isotopy invariance implies that this is associative. |
153 |
We will define a ``horizontal" composition later. |
|
154 |
||
126 | 155 |
\begin{figure}[t] |
530
b236746e8e4d
futzing with figures (\begin{center|equation} to \centering)
Kevin Walker <kevin@canyon23.net>
parents:
529
diff
changeset
|
156 |
\centering |
510 | 157 |
\begin{tikzpicture} |
158 |
||
159 |
\newcommand{\vertex}{node[circle,fill=black,inner sep=1pt] {}} |
|
160 |
\newcommand{\nsep}{1.8} |
|
161 |
||
162 |
\node[outer sep=\nsep](A) at (0,0) { |
|
163 |
\begin{tikzpicture} |
|
164 |
\draw (0,0) coordinate (p1); |
|
165 |
\draw (4,0) coordinate (p2); |
|
166 |
\draw (2,1.2) coordinate (pu); |
|
167 |
\draw (2,-1.2) coordinate (pd); |
|
168 |
||
169 |
\draw (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
170 |
\draw (p1)--(p2); |
|
171 |
||
172 |
\draw (p1) \vertex; |
|
173 |
\draw (p2) \vertex; |
|
174 |
||
175 |
\node at (2.1, .44) {$B^2$}; |
|
176 |
\node at (2.1, -.44) {$B^2$}; |
|
177 |
||
178 |
\end{tikzpicture} |
|
179 |
}; |
|
180 |
||
181 |
\node[outer sep=\nsep](B) at (6,0) { |
|
182 |
\begin{tikzpicture} |
|
183 |
\draw (0,0) coordinate (p1); |
|
184 |
\draw (4,0) coordinate (p2); |
|
185 |
\draw (2,.6) coordinate (pu); |
|
186 |
\draw (2,-.6) coordinate (pd); |
|
187 |
||
188 |
\draw (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
189 |
\draw[help lines, dashed] (p1)--(p2); |
|
190 |
||
191 |
\draw (p1) \vertex; |
|
192 |
\draw (p2) \vertex; |
|
193 |
||
194 |
\node at (2.1,0) {$B^2$}; |
|
195 |
||
196 |
\end{tikzpicture} |
|
197 |
}; |
|
198 |
||
199 |
\draw[->, thick, blue!50!green] (A) -- node[black, above] {$\cong$} (B); |
|
200 |
||
201 |
\end{tikzpicture} |
|
126 | 202 |
\caption{Vertical composition of 2-morphisms} |
203 |
\label{fzo1} |
|
204 |
\end{figure} |
|
205 |
||
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
206 |
Given $a\in C^1$, define $\id_a = a\times I \in C^2$ (pinched boundary). |
125 | 207 |
Extended isotopy invariance for $\cC$ shows that this morphism is an identity for |
208 |
vertical composition. |
|
124 | 209 |
|
125 | 210 |
Given $x\in C^0$, define $\id_x = x\times B^1 \in C^1$. |
211 |
We will show that this 1-morphism is a weak identity. |
|
212 |
This would be easier if our 2-morphisms were shaped like rectangles rather than bigons. |
|
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
213 |
|
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
214 |
In showing that identity 1-morphisms have the desired properties, we will |
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
215 |
rely heavily on the extended isotopy invariance of 2-morphisms in $\cC$. |
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
216 |
This means we are free to add or delete product regions from 2-morphisms. |
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
217 |
|
201 | 218 |
Let $a: y\to x$ be a 1-morphism. |
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
219 |
Define 2-morphsims $a \to a\bullet \id_x$ and $a\bullet \id_x \to a$ |
125 | 220 |
as shown in Figure \ref{fzo2}. |
126 | 221 |
\begin{figure}[t] |
530
b236746e8e4d
futzing with figures (\begin{center|equation} to \centering)
Kevin Walker <kevin@canyon23.net>
parents:
529
diff
changeset
|
222 |
\centering |
498
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
223 |
\begin{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
224 |
\newcommand{\rr}{6} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
225 |
\newcommand{\vertex}{node[circle,fill=black,inner sep=1pt] {}} |
503
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
226 |
\newcommand{\namedvertex}[1]{node[circle,fill=black,inner sep=1pt] (#1) {}} |
498
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
227 |
|
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
228 |
\node(A) at (0,0) { |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
229 |
\begin{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
230 |
\node[red,left] at (0,0) {$y$}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
231 |
\draw (0,0) \vertex arc (-120:-105:\rr) node[red,below] {$a$} arc(-105:-90:\rr) \vertex node[red,below](x2) {$x$}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
232 |
\draw (0,0) \vertex arc (120:105:\rr) node[red,above] {$a$} arc (105:90:\rr) \vertex node[red,above](x1) {$x$} -- (x2); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
233 |
\begin{scope} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
234 |
\path[clip] (0,0) arc (-120:-60:\rr) arc (60:120:\rr); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
235 |
\foreach \x in {0,0.24,...,3} { |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
236 |
\draw[green!50!brown] (\x,1) -- (\x,-1); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
237 |
} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
238 |
\end{scope} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
239 |
\draw[red, decorate,decoration={brace,amplitude=5pt}] ($(x1)+(0.2,-0.2)$) -- ($(x2)+(0.2,0.2)$) node[midway, xshift=0.7cm] {$x \times I$}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
240 |
\end{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
241 |
}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
242 |
|
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
243 |
\node(B) at (-4,-4) { |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
244 |
\begin{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
245 |
\node[red,left] at (0,0) {$y$}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
246 |
\draw (0,0) \vertex |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
247 |
arc (120:105:\rr) node[red,above] {$a$} |
503
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
248 |
arc (105:90:\rr) node[red,above] {$x$} \namedvertex{x1}; |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
249 |
% arc (90:75:\rr) node[red,above] {$x \times I$}; |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
250 |
% arc (75:60:\rr) \vertex node[red,right] {$x$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
251 |
% arc (-60:-90:\rr) node[red,below] {$a$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
252 |
% arc (-90:-120:\rr); |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
253 |
\draw (0,0) |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
254 |
arc (-120:-90:\rr) node[red,below] {$a$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
255 |
arc (-90:-61:\rr) \namedvertex{x2} node[red,right] {$x$}; |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
256 |
\draw (x1) -- node[red, above=3pt] {$x \times I$} (x2); |
498
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
257 |
\begin{scope} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
258 |
\path[clip] (0,0) arc (-120:-60:\rr) arc (60:120:\rr); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
259 |
\foreach \x in {0,0.48,...,9} { |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
260 |
\draw[green!50!brown] (\x/4,1) -- (\x,-1); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
261 |
} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
262 |
\end{scope} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
263 |
\end{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
264 |
}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
265 |
|
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
266 |
\node(C) at (4,-4) { |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
267 |
\begin{tikzpicture}[y=-1cm] |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
268 |
\node[red,left] at (0,0) {$y$}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
269 |
\draw (0,0) \vertex |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
270 |
arc (120:105:\rr) node[red,below] {$a$} |
503
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
271 |
arc (105:90:\rr) node[red,below] {$x$} \namedvertex{x1}; |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
272 |
% arc (90:75:\rr) node[red,below] {$x \times I$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
273 |
% arc (75:60:\rr) \vertex node[red,right] {$x$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
274 |
% arc (-60:-90:\rr) node[red,above] {$a$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
275 |
% arc (-90:-120:\rr); |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
276 |
\draw (0,0) |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
277 |
arc (-120:-90:\rr) node[red,above] {$a$} |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
278 |
arc (-90:-61:\rr) \namedvertex{x2} node[red,right] {$x$}; |
c221d8331f30
straight lines in figure 42
Scott Morrison <scott@tqft.net>
parents:
498
diff
changeset
|
279 |
\draw (x1) -- node[red, below=3pt] {$x \times I$} (x2); |
498
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
280 |
\begin{scope} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
281 |
\path[clip] (0,0) arc (-120:-60:\rr) arc (60:120:\rr); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
282 |
\foreach \x in {0,0.48,...,9} { |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
283 |
\draw[green!50!brown] (\x/4,1) -- (\x,-1); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
284 |
} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
285 |
\end{scope} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
286 |
\end{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
287 |
}; |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
288 |
|
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
289 |
\draw[->] (A) -- (B); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
290 |
\draw[->] (A) -- (C); |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
291 |
\end{tikzpicture} |
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
292 |
\caption{Producing weak identities from half pinched products} |
126 | 293 |
\label{fzo2} |
294 |
\end{figure} |
|
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
295 |
As suggested by the figure, these are two different reparameterizations |
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
296 |
of a half-pinched version of $a\times I$. |
125 | 297 |
We must show that the two compositions of these two maps give the identity 2-morphisms |
298 |
on $a$ and $a\bullet \id_x$, as defined above. |
|
299 |
Figure \ref{fzo3} shows one case. |
|
126 | 300 |
\begin{figure}[t] |
530
b236746e8e4d
futzing with figures (\begin{center|equation} to \centering)
Kevin Walker <kevin@canyon23.net>
parents:
529
diff
changeset
|
301 |
\centering |
508 | 302 |
\begin{tikzpicture} |
303 |
||
304 |
\newcommand{\vertex}{node[circle,fill=black,inner sep=1pt] {}} |
|
305 |
\newcommand{\nsep}{1.8} |
|
306 |
||
307 |
\node(A) at (0,0) { |
|
308 |
\begin{tikzpicture} |
|
309 |
||
310 |
\draw (0,0) coordinate (p1); |
|
311 |
\draw (3.6,0) coordinate (p2); |
|
312 |
\draw (2.3,1) coordinate (p3); |
|
313 |
\draw (2.3,-1) coordinate (p4); |
|
314 |
||
315 |
\begin{scope} |
|
316 |
\clip (p1) .. controls +(.5,-.5) and +(-.8,0) .. (p4) -- |
|
317 |
(p2) -- (p3) .. controls +(-.8,0) and +(.5,.5) .. (p1); |
|
318 |
\foreach \x in {0,0.26,...,4} { |
|
319 |
\draw[green!50!brown] (\x,0) -- (intersection cs: first line={(p2)--(p3)}, second line={(0,0)--(0,1)}); |
|
320 |
\draw[green!50!brown] (\x,0) -- (intersection cs: first line={(p2)--(p4)}, second line={(0,0)--(0,1)}); |
|
321 |
} |
|
322 |
\end{scope} |
|
323 |
||
324 |
\draw (p1) .. controls ($(p1) + (.5,.5)$) and ($(p3) + (-.8,0)$) .. node[red, above=3pt] {$a$} (p3); |
|
325 |
\draw (p1) .. controls ($(p1) + (.5,-.5)$) and ($(p4) + (-.8,0)$) .. node[red, below=3pt] {$a$} (p4); |
|
326 |
\draw (p3) -- node[red, above=7pt, right=1pt] {$x \times I$} (p2); |
|
327 |
\draw (p4) -- node[red, below=7pt, right=1pt] {$x \times I$} (p2); |
|
328 |
\draw (p1) -- (p2); |
|
329 |
||
330 |
\draw (p1) \vertex; |
|
331 |
\draw (p2) \vertex; |
|
332 |
\draw (p3) \vertex; |
|
333 |
\draw (p4) \vertex; |
|
334 |
||
335 |
\end{tikzpicture} |
|
336 |
}; |
|
337 |
||
338 |
\node[outer sep=\nsep](B) at (5.5,0) { |
|
339 |
\begin{tikzpicture} |
|
340 |
||
341 |
\draw (0,0) coordinate (p1); |
|
342 |
\draw (3.6,0) coordinate (p2); |
|
343 |
\draw (2.3,1) coordinate (p3); |
|
344 |
\draw (2.3,-1) coordinate (p4); |
|
345 |
\draw (4.6,0) coordinate (p2b); |
|
346 |
||
347 |
\begin{scope} |
|
348 |
\clip (p1) .. controls +(.5,-.5) and +(-.8,0) .. (p4) -- |
|
349 |
(p2) -- (p3) .. controls +(-.8,0) and +(.5,.5) .. (p1); |
|
350 |
\foreach \x in {0,0.26,...,4} { |
|
351 |
\draw[green!50!brown] (\x,0) -- (intersection cs: first line={(p2)--(p3)}, second line={(0,0)--(0,1)}); |
|
352 |
\draw[green!50!brown] (\x,0) -- (intersection cs: first line={(p2)--(p4)}, second line={(0,0)--(0,1)}); |
|
353 |
} |
|
354 |
\end{scope} |
|
355 |
||
356 |
\begin{scope} |
|
357 |
\clip (p3)--(p2)--(p4)--(p2b)--cycle; |
|
358 |
\draw[blue!50!brown, step=.23] ($(p4)+(0,-1)$) grid +(3,3); |
|
359 |
\end{scope} |
|
360 |
||
361 |
\draw (p1) .. controls ($(p1) + (.5,.5)$) and ($(p3) + (-.8,0)$) .. node[red, above=3pt] {$a$} (p3); |
|
362 |
\draw (p1) .. controls ($(p1) + (.5,-.5)$) and ($(p4) + (-.8,0)$) .. node[red, below=3pt] {$a$} (p4); |
|
363 |
\draw (p3) -- (p2); |
|
364 |
\draw (p4) -- (p2); |
|
365 |
\draw (p3) -- node[red, above=7pt, right=1pt] {$x \times I$} (p2b); |
|
366 |
\draw (p4) -- node[red, below=7pt, right=1pt] {$x \times I$} (p2b); |
|
367 |
||
368 |
\draw (p1) \vertex; |
|
369 |
\draw (p2) \vertex; |
|
370 |
\draw (p3) \vertex; |
|
371 |
\draw (p4) \vertex; |
|
372 |
\draw (p2b) \vertex; |
|
373 |
||
374 |
\end{tikzpicture} |
|
375 |
}; |
|
376 |
||
377 |
\node[outer sep=\nsep](C) at (11,0) { |
|
378 |
\begin{tikzpicture} |
|
379 |
||
380 |
\draw (0,0) coordinate (p1); |
|
381 |
\draw (2.3,0) coordinate (p2); |
|
382 |
\draw (2.3,1) coordinate (p3); |
|
383 |
\draw (2.3,-1) coordinate (p4); |
|
384 |
\draw (3.6,0) coordinate (p2b); |
|
385 |
||
386 |
\begin{scope} |
|
387 |
\clip (p1) .. controls +(.5,-.5) and +(-.8,0) .. (p4) -- |
|
388 |
(p2) -- (p3) .. controls +(-.8,0) and +(.5,.5) .. (p1); |
|
389 |
\foreach \x in {0,0.26,...,4} { |
|
390 |
\draw[green!50!brown] (\x,-1) -- (\x,1); |
|
391 |
} |
|
392 |
\end{scope} |
|
393 |
||
394 |
\begin{scope} |
|
395 |
\clip (p3)--(p2)--(p4)--(p2b)--cycle; |
|
396 |
\draw[blue!50!brown, step=.23] ($(p4)+(0,-1)$) grid +(3,3); |
|
397 |
\end{scope} |
|
398 |
||
399 |
\draw (p1) .. controls ($(p1) + (.5,.5)$) and ($(p3) + (-.8,0)$) .. node[red, above=3pt] {$a$} (p3); |
|
400 |
\draw (p1) .. controls ($(p1) + (.5,-.5)$) and ($(p4) + (-.8,0)$) .. node[red, below=3pt] {$a$} (p4); |
|
401 |
\draw[green!50!brown] (p3) -- (p4); |
|
402 |
\draw (p3) -- node[red, above=7pt, right=1pt] {$x \times I$} (p2b); |
|
403 |
\draw (p4) -- node[red, below=7pt, right=1pt] {$x \times I$} (p2b); |
|
404 |
||
405 |
\draw (p1) \vertex; |
|
406 |
\draw (p3) \vertex; |
|
407 |
\draw (p4) \vertex; |
|
408 |
\draw (p2b) \vertex; |
|
409 |
||
410 |
\end{tikzpicture} |
|
411 |
}; |
|
412 |
||
413 |
\draw[->, thick, blue!50!green] (A) -- (B); |
|
414 |
\draw[->, thick, blue!50!green] (B) -- node[black, above] {$=$} (C); |
|
415 |
||
416 |
\end{tikzpicture} |
|
498
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
417 |
\caption{Composition of weak identities, 1} |
126 | 418 |
\label{fzo3} |
419 |
\end{figure} |
|
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
420 |
In the first step we have inserted a copy of $(x\times I)\times I$. |
125 | 421 |
Figure \ref{fzo4} shows the other case. |
126 | 422 |
\begin{figure}[t] |
530
b236746e8e4d
futzing with figures (\begin{center|equation} to \centering)
Kevin Walker <kevin@canyon23.net>
parents:
529
diff
changeset
|
423 |
\centering |
509 | 424 |
\begin{tikzpicture} |
425 |
||
426 |
\newcommand{\vertex}{node[circle,fill=black,inner sep=1pt] {}} |
|
427 |
\newcommand{\nsep}{1.8} |
|
428 |
||
510 | 429 |
\clip (-4,-1.25)--(12,-1.25)--(16,1.25)--(-1,1.25)--cycle; |
430 |
||
431 |
||
509 | 432 |
\node[outer sep=\nsep](A) at (0,0) { |
433 |
\begin{tikzpicture} |
|
434 |
\draw (0,0) coordinate (p1); |
|
435 |
\draw (4,0) coordinate (p2); |
|
436 |
\draw (2.4,0) coordinate (p2a); |
|
437 |
\draw (2,1.2) coordinate (pu); |
|
438 |
\draw (2,-1.2) coordinate (pd); |
|
439 |
||
440 |
\begin{scope} |
|
441 |
\clip (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
442 |
\foreach \t in {0,.065,...,1} { |
|
443 |
\draw[green!50!brown] ($(p1)!\t!(p2a)$) -- +(90 - \t*90 + \t*6 : 4); |
|
444 |
\draw[green!50!brown] ($(p1)!\t!(p2a)$) -- +(-90 + \t*90 - \t*6 : 4); |
|
445 |
} |
|
446 |
\draw[dashed] ($(p2a) + (-.6,3)$)--(p2a)--($(p2a) + (-.6,-3)$); |
|
447 |
\end{scope} |
|
448 |
||
449 |
\draw (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
450 |
\draw (p1)--(p2); |
|
451 |
||
452 |
\draw (p1) \vertex; |
|
453 |
\draw (p2) \vertex; |
|
454 |
\draw (p2a) \vertex; |
|
455 |
\end{tikzpicture} |
|
456 |
}; |
|
457 |
||
458 |
\node[outer sep=\nsep](B) at (5,0) { |
|
459 |
\begin{tikzpicture} |
|
460 |
\draw (0,0) coordinate (p1); |
|
461 |
\draw (4,0) coordinate (p2); |
|
462 |
\draw (2.4,0) coordinate (p2a); |
|
463 |
\draw (2,1.2) coordinate (pu); |
|
464 |
\draw (2,-1.2) coordinate (pd); |
|
465 |
||
466 |
\begin{scope} |
|
467 |
\clip (-.1,3)--($(p2a) + (-.6,3)$)--(p2a)--($(p2a) + (-.6,-3)$)--(-.1,-3)--cycle; |
|
468 |
||
469 |
\begin{scope} |
|
470 |
\clip (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
471 |
\foreach \t in {0,.065,...,1} { |
|
472 |
\draw[green!50!brown] ($(p1)!\t!(p2a)$) -- +(90 - \t*90 + \t*6 : 4); |
|
473 |
\draw[green!50!brown] ($(p1)!\t!(p2a)$) -- +(-90 + \t*90 - \t*6 : 4); |
|
474 |
} |
|
475 |
\draw ($(p2a) + (-.6,3)$)--(p2a)--($(p2a) + (-.6,-3)$); |
|
476 |
\end{scope} |
|
477 |
||
478 |
||
479 |
\draw (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
480 |
%\draw (p1)--(p2); |
|
481 |
\end{scope} |
|
482 |
||
483 |
\begin{scope} |
|
484 |
\clip (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
485 |
\draw ($(p2a) + (-.6,3)$)--(p2a)--($(p2a) + (-.6,-3)$); |
|
486 |
\end{scope} |
|
487 |
||
488 |
\draw (p1) \vertex; |
|
489 |
\draw (p2a) \vertex; |
|
490 |
\end{tikzpicture} |
|
491 |
}; |
|
492 |
||
493 |
\node[outer sep=\nsep](C) at (9,0) { |
|
494 |
\begin{tikzpicture} |
|
495 |
\draw (0,0) coordinate (p1); |
|
496 |
\draw (4,0) coordinate (p2); |
|
497 |
\draw (2,1.2) coordinate (pu); |
|
498 |
\draw (2,-1.2) coordinate (pd); |
|
499 |
||
500 |
\begin{scope} |
|
501 |
\clip (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
502 |
\foreach \t in {0,.045,...,1} { |
|
503 |
\draw[green!50!brown] ($(p1)!\t!(p2) + (0,2)$) -- +(0,-4); |
|
504 |
} |
|
505 |
\end{scope} |
|
506 |
||
507 |
\draw (p1) .. controls (pu) .. (p2) .. controls (pd) .. (p1); |
|
508 |
||
509 |
\draw (p1) \vertex; |
|
510 |
\draw (p2) \vertex; |
|
511 |
\end{tikzpicture} |
|
512 |
}; |
|
513 |
||
514 |
\draw[->, thick, blue!50!green] (A) -- (B); |
|
515 |
\draw[->, thick, blue!50!green] ($(B) + (1,0)$) -- node[black, above] {$=$} (C); |
|
516 |
||
517 |
\end{tikzpicture} |
|
498
b98790f0282e
diagram for producing weak identities
Scott Morrison <scott@tqft.net>
parents:
481
diff
changeset
|
518 |
\caption{Composition of weak identities, 2} |
126 | 519 |
\label{fzo4} |
520 |
\end{figure} |
|
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
521 |
We identify a product region and remove it. |
124 | 522 |
|
510 | 523 |
We define horizontal composition $f *_h g$ of 2-morphisms $f$ and $g$ as shown in Figure \ref{fzo5}. |
345 | 524 |
It is not hard to show that this is independent of the arbitrary (left/right) |
525 |
choice made in the definition, and that it is associative. |
|
127 | 526 |
\begin{figure}[t] |
527 |
\begin{equation*} |
|
510 | 528 |
\raisebox{-.9cm}{ |
529 |
\begin{tikzpicture} |
|
530 |
\draw (0,0) .. controls +(1,.8) and +(-1,.8) .. node[above] {$b$} (2.9,0) |
|
531 |
.. controls +(-1,-.8) and +(1,-.8) .. node[below] {$a$} (0,0); |
|
532 |
\draw[->, thick, orange!50!brown] (1.45,-.4)-- node[left, black] {$f$} +(0,.8); |
|
533 |
\end{tikzpicture}} |
|
534 |
\;\;\;*_h\;\; |
|
535 |
\raisebox{-.9cm}{ |
|
536 |
\begin{tikzpicture} |
|
537 |
\draw (0,0) .. controls +(1,.8) and +(-1,.8) .. node[above] {$d$} (2.9,0) |
|
538 |
.. controls +(-1,-.8) and +(1,-.8) .. node[below] {$c$} (0,0); |
|
539 |
\draw[->, thick, orange!50!brown] (1.45,-.4)-- node[left, black] {$g$} +(0,.8); |
|
540 |
\end{tikzpicture}} |
|
541 |
\;=\; |
|
542 |
\raisebox{-1.9cm}{ |
|
543 |
\begin{tikzpicture} |
|
544 |
\draw (0,0) coordinate (p1); |
|
545 |
\draw (5.8,0) coordinate (p2); |
|
546 |
\draw (2.9,.3) coordinate (pu); |
|
547 |
\draw (2.9,-.3) coordinate (pd); |
|
548 |
\begin{scope} |
|
549 |
\clip (p1) .. controls +(.6,.3) and +(-.5,0) .. (pu) |
|
550 |
.. controls +(.5,0) and +(-.6,.3) .. (p2) |
|
551 |
.. controls +(-.6,-.3) and +(.5,0) .. (pd) |
|
552 |
.. controls +(-.5,0) and +(.6,-.3) .. (p1); |
|
553 |
\foreach \t in {0,.03,...,1} { |
|
554 |
\draw[green!50!brown] ($(p1)!\t!(p2) + (0,2)$) -- +(0,-4); |
|
555 |
} |
|
556 |
\end{scope} |
|
557 |
\draw (p1) .. controls +(.6,.3) and +(-.5,0) .. (pu) |
|
558 |
.. controls +(.5,0) and +(-.6,.3) .. (p2) |
|
559 |
.. controls +(-.6,-.3) and +(.5,0) .. (pd) |
|
560 |
.. controls +(-.5,0) and +(.6,-.3) .. (p1); |
|
561 |
\draw (p1) .. controls +(1,-2) and +(-1,-1) .. (pd); |
|
562 |
\draw (p2) .. controls +(-1,2) and +(1,1) .. (pu); |
|
563 |
\draw[->, thick, orange!50!brown] (1.45,-1.1)-- node[left, black] {$f$} +(0,.7); |
|
564 |
\draw[->, thick, orange!50!brown] (4.35,.4)-- node[left, black] {$g$} +(0,.7); |
|
565 |
\draw[->, thick, blue!75!yellow] (1.5,.78) node[black, above] {$(b\cdot c)\times I$} -- (2.5,0); |
|
566 |
\end{tikzpicture}} |
|
127 | 567 |
\end{equation*} |
568 |
\caption{Horizontal composition of 2-morphisms} |
|
569 |
\label{fzo5} |
|
570 |
\end{figure} |
|
125 | 571 |
|
457
54328be726e7
comparing_defs.tex 2-cat section
Kevin Walker <kevin@canyon23.net>
parents:
451
diff
changeset
|
572 |
%\nn{need to find a list of axioms for pivotal 2-cats to check} |
114 | 573 |
|
194 | 574 |
|
512
050dba5e7bdd
fixing some (but not all!?) of the hyperref warnings; start on revision of evmap
Kevin Walker <kevin@canyon23.net>
parents:
510
diff
changeset
|
575 |
\subsection{\texorpdfstring{$A_\infty$}{A-infinity} 1-categories} |
194 | 576 |
\label{sec:comparing-A-infty} |
431 | 577 |
In this section, we make contact between the usual definition of an $A_\infty$ category |
865
7abe7642265e
relentless adding 'disk-like' everywhere it could possibly go
Scott Morrison <scott@tqft.net>
parents:
854
diff
changeset
|
578 |
and our definition of an $A_\infty$ disk-like $1$-category, from \S \ref{ss:n-cat-def}. |
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
579 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
580 |
\medskip |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
581 |
|
865
7abe7642265e
relentless adding 'disk-like' everywhere it could possibly go
Scott Morrison <scott@tqft.net>
parents:
854
diff
changeset
|
582 |
Given an $A_\infty$ disk-like $1$-category $\cC$, we define an ``$m_k$-style" |
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
583 |
$A_\infty$ $1$-category $A$ as follows. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
584 |
The objects of $A$ are $\cC(pt)$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
585 |
The morphisms of $A$, from $x$ to $y$, are $\cC(I; x, y)$ |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
586 |
($\cC$ applied to the standard interval with boundary labeled by $x$ and $y$). |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
587 |
For simplicity we will now assume there is only one object and suppress it from the notation. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
588 |
|
854 | 589 |
A choice of homeomorphism $I\cup I \to I$ induces a chain map $m_2: A\otimes A\to A$. |
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
590 |
We now have two different homeomorphisms $I\cup I\cup I \to I$, but they are isotopic. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
591 |
Choose a specific 1-parameter family of homeomorphisms connecting them; this induces |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
592 |
a degree 1 chain homotopy $m_3:A\ot A\ot A\to A$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
593 |
Proceeding in this way we define the rest of the $m_i$'s. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
594 |
It is straightforward to verify that they satisfy the necessary identities. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
595 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
596 |
\medskip |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
597 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
598 |
In the other direction, we start with an alternative conventional definition of an $A_\infty$ algebra: |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
599 |
an algebra $A$ for the $A_\infty$ operad. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
600 |
(For simplicity, we are assuming our $A_\infty$ 1-category has only one object.) |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
601 |
We are free to choose any operad with contractible spaces, so we choose the operad |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
602 |
whose $k$-th space is the space of decompositions of the standard interval $I$ into $k$ |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
603 |
parameterized copies of $I$. |
480 | 604 |
Note in particular that when $k=1$ this implies a $C_*(\Homeo(I))$ action on $A$. |
605 |
(Compare with Example \ref{ex:e-n-alg} and the discussion which precedes it.) |
|
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
606 |
Given a non-standard interval $J$, we define $\cC(J)$ to be |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
607 |
$(\Homeo(I\to J) \times A)/\Homeo(I\to I)$, |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
608 |
where $\beta \in \Homeo(I\to I)$ acts via $(f, a) \mapsto (f\circ \beta\inv, \beta_*(a))$. |
480 | 609 |
Note that $\cC(J) \cong A$ (non-canonically) for all intervals $J$. |
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
610 |
We define a $\Homeo(J)$ action on $\cC(J)$ via $g_*(f, a) = (g\circ f, a)$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
611 |
The $C_*(\Homeo(J))$ action is defined similarly. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
612 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
613 |
Let $J_1$ and $J_2$ be intervals. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
614 |
We must define a map $\cC(J_1)\ot\cC(J_2)\to\cC(J_1\cup J_2)$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
615 |
Choose a homeomorphism $g:I\to J_1\cup J_2$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
616 |
Let $(f_i, a_i)\in \cC(J_i)$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
617 |
We have a parameterized decomposition of $I$ into two intervals given by |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
618 |
$g\inv \circ f_i$, $i=1,2$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
619 |
Corresponding to this decomposition the operad action gives a map $\mu: A\ot A\to A$. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
620 |
Define the gluing map to send $(f_1, a_1)\ot (f_2, a_2)$ to $(g, \mu(a_1\ot a_2))$. |
480 | 621 |
Operad associativity for $A$ implies that this gluing map is independent of the choice of |
622 |
$g$ and the choice of representative $(f_i, a_i)$. |
|
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
623 |
|
865
7abe7642265e
relentless adding 'disk-like' everywhere it could possibly go
Scott Morrison <scott@tqft.net>
parents:
854
diff
changeset
|
624 |
It is straightforward to verify the remaining axioms for a $A_\infty$ disk-like 1-category. |
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
625 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
626 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
627 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
628 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
629 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
630 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
631 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
632 |
\noop { %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
194 | 633 |
|
431 | 634 |
That definition associates a chain complex to every interval, and we begin by giving an alternative definition that is entirely in terms of the chain complex associated to the standard interval $[0,1]$. |
194 | 635 |
\begin{defn} |
345 | 636 |
A \emph{topological $A_\infty$ category on $[0,1]$} $\cC$ has a set of objects $\Obj(\cC)$, |
637 |
and for each $a,b \in \Obj(\cC)$, a chain complex $\cC_{a,b}$, along with |
|
194 | 638 |
\begin{itemize} |
639 |
\item an action of the operad of $\Obj(\cC)$-labeled cell decompositions |
|
640 |
\item and a compatible action of $\CD{[0,1]}$. |
|
641 |
\end{itemize} |
|
642 |
\end{defn} |
|
345 | 643 |
Here the operad of cell decompositions of $[0,1]$ has operations indexed by a finite set of |
644 |
points $0 < x_1< \cdots < x_k < 1$, cutting $[0,1]$ into subintervals. |
|
645 |
An $X$-labeled cell decomposition labels $\{0, x_1, \ldots, x_k, 1\}$ by $X$. |
|
646 |
Given two cell decompositions $\cJ^{(1)}$ and $\cJ^{(2)}$, and an index $m$, we can compose |
|
647 |
them to form a new cell decomposition $\cJ^{(1)} \circ_m \cJ^{(2)}$ by inserting the points |
|
648 |
of $\cJ^{(2)}$ linearly into the $m$-th interval of $\cJ^{(1)}$. |
|
649 |
In the $X$-labeled case, we insist that the appropriate labels match up. |
|
650 |
Saying we have an action of this operad means that for each labeled cell decomposition |
|
651 |
$0 < x_1< \cdots < x_k < 1$, $a_0, \ldots, a_{k+1} \subset \Obj(\cC)$, there is a chain |
|
431 | 652 |
map $$\cC_{a_0,a_1} \tensor \cdots \tensor \cC_{a_k,a_{k+1}} \to \cC_{a_0,a_{k+1}}$$ and these |
345 | 653 |
chain maps compose exactly as the cell decompositions. |
654 |
An action of $\CD{[0,1]}$ is compatible with an action of the cell decomposition operad |
|
655 |
if given a decomposition $\pi$, and a family of diffeomorphisms $f \in \CD{[0,1]}$ which |
|
656 |
is supported on the subintervals determined by $\pi$, then the two possible operations |
|
657 |
(glue intervals together, then apply the diffeomorphisms, or apply the diffeormorphisms |
|
658 |
separately to the subintervals, then glue) commute (as usual, up to a weakly unique homotopy). |
|
194 | 659 |
|
345 | 660 |
Translating between this notion and the usual definition of an $A_\infty$ category is now straightforward. |
661 |
To restrict to the standard interval, define $\cC_{a,b} = \cC([0,1];a,b)$. |
|
662 |
Given a cell decomposition $0 < x_1< \cdots < x_k < 1$, we use the map (suppressing labels) |
|
194 | 663 |
$$\cC([0,1])^{\tensor k+1} \to \cC([0,x_1]) \tensor \cdots \tensor \cC[x_k,1] \to \cC([0,1])$$ |
345 | 664 |
where the factors of the first map are induced by the linear isometries $[0,1] \to [x_i, x_{i+1}]$, and the second map is just gluing. |
665 |
The action of $\CD{[0,1]}$ carries across, and is automatically compatible. |
|
666 |
Going the other way, we just declare $\cC(J;a,b) = \cC_{a,b}$, pick a diffeomorphism |
|
667 |
$\phi_J : J \isoto [0,1]$ for every interval $J$, define the gluing map |
|
668 |
$\cC(J_1) \tensor \cC(J_2) \to \cC(J_1 \cup J_2)$ by the first applying |
|
669 |
the cell decomposition map for $0 < \frac{1}{2} < 1$, then the self-diffeomorphism of $[0,1]$ |
|
670 |
given by $\frac{1}{2} (\phi_{J_1} \cup (1+ \phi_{J_2})) \circ \phi_{J_1 \cup J_2}^{-1}$. |
|
671 |
You can readily check that this gluing map is associative on the nose. \todo{really?} |
|
194 | 672 |
|
673 |
%First recall the \emph{coloured little intervals operad}. Given a set of labels $\cL$, the operations are indexed by \emph{decompositions of the interval}, each of which is a collection of disjoint subintervals $\{(a_i,b_i)\}_{i=1}^k$ of $[0,1]$, along with a labeling of the complementary regions by $\cL$, $\{l_0, \ldots, l_k\}$. Given two decompositions $\cJ^{(1)}$ and $\cJ^{(2)}$, and an index $m$ such that $l^{(1)}_{m-1} = l^{(2)}_0$ and $l^{(1)}_{m} = l^{(2)}_{k^{(2)}}$, we can form a new decomposition by inserting the intervals of $\cJ^{(2)}$ linearly inside the $m$-th interval of $\cJ^{(1)}$. We call the resulting decomposition $\cJ^{(1)} \circ_m \cJ^{(2)}$. |
|
674 |
||
675 |
%\begin{defn} |
|
676 |
%A \emph{topological $A_\infty$ category} $\cC$ has a set of objects $\Obj(\cC)$ and for each $a,b \in \Obj(\cC)$ a chain complex $\cC_{a,b}$, along with a compatible `composition map' and an `action of families of diffeomorphisms'. |
|
677 |
||
678 |
%A \emph{composition map} $f$ is a family of chain maps, one for each decomposition of the interval, $f_\cJ : A^{\tensor k} \to A$, making $\cC$ into a category over the coloured little intervals operad, with labels $\cL = \Obj(\cC)$. Thus the chain maps satisfy the identity |
|
679 |
%\begin{equation*} |
|
680 |
%f_{\cJ^{(1)} \circ_m \cJ^{(2)}} = f_{\cJ^{(1)}} \circ (\id^{\tensor m-1} \tensor f_{\cJ^{(2)}} \tensor \id^{\tensor k^{(1)} - m}). |
|
681 |
%\end{equation*} |
|
682 |
||
683 |
%An \emph{action of families of diffeomorphisms} is a chain map $ev: \CD{[0,1]} \tensor A \to A$, such that |
|
684 |
%\begin{enumerate} |
|
685 |
%\item The diagram |
|
686 |
%\begin{equation*} |
|
687 |
%\xymatrix{ |
|
688 |
%\CD{[0,1]} \tensor \CD{[0,1]} \tensor A \ar[r]^{\id \tensor ev} \ar[d]^{\circ \tensor \id} & \CD{[0,1]} \tensor A \ar[d]^{ev} \\ |
|
689 |
%\CD{[0,1]} \tensor A \ar[r]^{ev} & A |
|
690 |
%} |
|
691 |
%\end{equation*} |
|
692 |
%commutes up to weakly unique homotopy. |
|
693 |
%\item If $\phi \in \Diff([0,1])$ and $\cJ$ is a decomposition of the interval, we obtain a new decomposition $\phi(\cJ)$ and a collection $\phi_m \in \Diff([0,1])$ of diffeomorphisms obtained by taking the restrictions $\restrict{\phi}{[a_m,b_m]} : [a_m,b_m] \to [\phi(a_m),\phi(b_m)]$ and pre- and post-composing these with the linear diffeomorphisms $[0,1] \to [a_m,b_m]$ and $[\phi(a_m),\phi(b_m)] \to [0,1]$. We require that |
|
694 |
%\begin{equation*} |
|
695 |
%\phi(f_\cJ(a_1, \cdots, a_k)) = f_{\phi(\cJ)}(\phi_1(a_1), \cdots, \phi_k(a_k)). |
|
696 |
%\end{equation*} |
|
697 |
%\end{enumerate} |
|
698 |
%\end{defn} |
|
699 |
||
345 | 700 |
From a topological $A_\infty$ category on $[0,1]$ $\cC$ we can produce a `conventional' |
701 |
$A_\infty$ category $(A, \{m_k\})$ as defined in, for example, \cite{MR1854636}. |
|
702 |
We'll just describe the algebra case (that is, a category with only one object), |
|
703 |
as the modifications required to deal with multiple objects are trivial. |
|
704 |
Define $A = \cC$ as a chain complex (so $m_1 = d$). |
|
705 |
Define $m_2 : A\tensor A \to A$ by $f_{\{(0,\frac{1}{2}),(\frac{1}{2},1)\}}$. |
|
706 |
To define $m_3$, we begin by taking the one parameter family $\phi_3$ of diffeomorphisms |
|
707 |
of $[0,1]$ that interpolates linearly between the identity and the piecewise linear |
|
708 |
diffeomorphism taking $\frac{1}{4}$ to $\frac{1}{2}$ and $\frac{1}{2}$ to $\frac{3}{4}$, and then define |
|
194 | 709 |
\begin{equation*} |
710 |
m_3(a,b,c) = ev(\phi_3, m_2(m_2(a,b), c)). |
|
711 |
\end{equation*} |
|
712 |
||
713 |
It's then easy to calculate that |
|
714 |
\begin{align*} |
|
715 |
d(m_3(a,b,c)) & = ev(d \phi_3, m_2(m_2(a,b),c)) - ev(\phi_3 d m_2(m_2(a,b), c)) \\ |
|
716 |
& = ev( \phi_3(1), m_2(m_2(a,b),c)) - ev(\phi_3(0), m_2 (m_2(a,b),c)) - \\ & \qquad - ev(\phi_3, m_2(m_2(da, b), c) + (-1)^{\deg a} m_2(m_2(a, db), c) + \\ & \qquad \quad + (-1)^{\deg a+\deg b} m_2(m_2(a, b), dc) \\ |
|
717 |
& = m_2(a , m_2(b,c)) - m_2(m_2(a,b),c) - \\ & \qquad - m_3(da,b,c) + (-1)^{\deg a + 1} m_3(a,db,c) + \\ & \qquad \quad + (-1)^{\deg a + \deg b + 1} m_3(a,b,dc), \\ |
|
718 |
\intertext{and thus that} |
|
719 |
m_1 \circ m_3 & = m_2 \circ (\id \tensor m_2) - m_2 \circ (m_2 \tensor \id) - \\ & \qquad - m_3 \circ (m_1 \tensor \id \tensor \id) - m_3 \circ (\id \tensor m_1 \tensor \id) - m_3 \circ (\id \tensor \id \tensor m_1) |
|
720 |
\end{align*} |
|
721 |
as required (c.f. \cite[p. 6]{MR1854636}). |
|
722 |
\todo{then the general case.} |
|
345 | 723 |
We won't describe a reverse construction (producing a topological $A_\infty$ category |
477
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
724 |
from a ``conventional" $A_\infty$ category), but we presume that this will be easy for the experts. |
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
725 |
|
86c8e2129355
radically shorter a-inf appendix
Kevin Walker <kevin@canyon23.net>
parents:
457
diff
changeset
|
726 |
} %%%%% end \noop %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |