2.2. Semistrict Braided Monoidal 2-Categories
To efficiently define braided monoidal 2-categories it is
useful to exploit the fact that ( 2 π’πΊπ , β G , β ) (2\mathsf{Cat},\otimes_{\rm G},\mathcal{I}) is closed, i.e.,
enriched over itself [17 ] . Put more explicitly,
what this means is that 2 β π’πΊπ 2\mathsf{Cat}
can be regarded as a semistrict 3-category having small
2-categories as objects, 2-functors as morphisms,
βpseudonatural transformationsβ as 2-morphisms, and
βmodificationsβ as 3-morphisms [3 , 23 ] . A pseudonatural
transformation T T
between 2-functors β± , π’ : π β π \mathcal{F},\mathcal{G}\colon\mathcal{C}\to\mathcal{D} assigns to each
object A β π A\in\mathcal{C} a morphism T A : β± β‘ ( A ) β π’ β‘ ( A ) T_{A}\colon\mathcal{F}(A)\to\mathcal{G}(A)
which satisfies the definition of a natural transformation only up
to a specified isomorphism .
Thus, T T also assigns to each morphism f : A β B f\colon A\to B in
π \mathcal{C} a 2-isomorphism T f T_{f} as follows:
β± β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{F}(A)} β± β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{F}(B)} π’ β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{G}(A)} π’ β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{G}(B)} β± β‘ ( f ) \scriptstyle{\lx@inpgf@ignorespaces\mathcal{F}(f)} T A \scriptstyle{\lx@inpgf@ignorespaces T_{A}} β T f {\lx@inpgf@ignorespaces\Downarrow T_{f}} T B \scriptstyle{\lx@inpgf@ignorespaces T_{B}} π’ β‘ ( f ) \scriptstyle{\lx@inpgf@ignorespaces\mathcal{G}(f)}
These 2-morphisms T f T_{f} must in turn satisfy some
equational laws of their own. First, for any identity morphism
1 A : A β A 1_{A}\colon A\to A , we require T 1 A = 1 T A T_{1_{A}}=1_{T_{A}} . Second,
given a composable pair of morphisms f : A β B f\colon A\to B , g : B β C g\colon B\to C ,
the 2-morphism T f β g T_{fg} is given by the following pasting:
β± β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{F}(A)} β± β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{F}(B)} β± β‘ ( C ) {\lx@inpgf@ignorespaces\mathcal{F}(C)} π’ β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{G}(A)} π’ β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{G}(B)} π’ β‘ ( C ) {\lx@inpgf@ignorespaces\mathcal{G}(C)} β T f {\lx@inpgf@ignorespaces\Downarrow T_{f}} β T g {\lx@inpgf@ignorespaces\Downarrow T_{g}}
Third, given morphisms f , f β² : A β B f,f^{\prime}\colon A\to B and a
2-morphism Ξ± : f β f β² \alpha\colon f\Rightarrow f^{\prime} , the following diagram commutes:
β± β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{F}(A)} β± β‘ ( Ξ± ) {\lx@inpgf@ignorespaces\mathcal{F}(\alpha)} β± β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{F}(B)} π’ β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{G}(A)} π’ β‘ ( Ξ± ) {\lx@inpgf@ignorespaces\mathcal{G}(\alpha)} π’ β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{G}(B)} β T f β² {\lx@inpgf@ignorespaces\Downarrow T_{f^{\prime}}} β T f {\lx@inpgf@ignorespaces\Downarrow T_{f}}
Given two pseudonatural transformations S , T : β± β π’ S,T\colon\mathcal{F}\Rightarrow\mathcal{G} ,
a modification Ξ± \alpha from S S to T T assigns to each object A β π A\in\mathcal{C} a 2-morphism Ξ± A : S A β T A \alpha_{A}\colon S_{A}\Rightarrow T_{A} .
Moreover, for any morphism F : A β B F\colon A\to B , the following
diagram is required to commute:
β± β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{F}(A)} β Ξ± A {\lx@inpgf@ignorespaces\Downarrow\alpha_{A}} π’ β‘ ( A ) {\lx@inpgf@ignorespaces\mathcal{G}(A)} β± β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{F}(B)} β Ξ± B {\lx@inpgf@ignorespaces\Downarrow\alpha_{B}} π’ β‘ ( B ) {\lx@inpgf@ignorespaces\mathcal{G}(B)} β T f {\lx@inpgf@ignorespaces\Uparrow T_{f}} β S f {\lx@inpgf@ignorespaces\Uparrow S_{f}}
As explained in the introduction, in an n n -category
the notion of βisomorphismβ can
be weakened to a recursively defined notion of βequivalenceβ.
In the case of 2 β π’πΊπ 2\mathsf{Cat} this gives the following concepts.
A modification Ξ± \alpha from the pseudonatural transformation
S S to the pseudonatural transformation T T is βinvertibleβ if
there is a modification Ξ± β 1 \alpha^{-1} from T T to S S such
that Ξ± β Ξ± β 1 = 1 S \alpha\alpha^{-1}=1_{S} and Ξ± β 1 β Ξ± = 1 T \alpha^{-1}\alpha=1_{T} .
A pseudonatural transformation T T from β± \mathcal{F} to π’ \mathcal{G} is a
βpseudonatural equivalenceβ if there is a pseudonatural transformation
T Β― : π’ β F \overline{T}\colon\mathcal{G}\to F and invertible modifications
Ξ± 1 : T β T Β― β 1 β± , Ξ± 2 : T Β― β T β 1 π’ . \alpha_{1}\colon T\overline{T}\to 1_{\mathcal{F}},\qquad\alpha_{2}\colon\overline{T}T\to 1_{\mathcal{G}}.
There is a similar notion at the level of 2-functors, but we will
not need it.
Every semistrict monoidal 2-category has a second, βoppositeβ tensor product:
0N80
Lemma 5 . Suppose ( π , β , I ) (\mathcal{C},\otimes,I) is a semistrict monoidal 2-category. Then
( π , β op , I ) (\mathcal{C},\otimes^{\rm op},I) is also a semistrict monoidal 2-category, where
β op = S π , π β β \otimes^{\rm op}=S_{\mathcal{C},\mathcal{C}}\circ\otimes .
0N81
Proof. Straightforward. β
There is an analogous opposite tensor product for
strict monoidal categories, and a strict braided monoidal category
is just a strict monoidal category equipped with a natural isomorphism
R : β β β op R\colon\otimes\Rightarrow\otimes^{\rm op} , the βbraidingβ,
such that the following triangles commute:
A β X β Y {\lx@inpgf@ignorespaces A\otimes X\otimes Y} X β Y β A {\lx@inpgf@ignorespaces X\otimes Y\otimes A} X β A β Y {\lx@inpgf@ignorespaces X\otimes A\otimes Y} R A , X β Y \scriptstyle{\lx@inpgf@ignorespaces R_{A,X\otimes Y}} R A , X β Y \scriptstyle{\lx@inpgf@ignorespaces R_{A,X}\otimes Y} X β R A , Y \scriptstyle{\lx@inpgf@ignorespaces X\otimes R_{A,Y}}
X β Y β A {\lx@inpgf@ignorespaces X\otimes Y\otimes A} A β X β Y {\lx@inpgf@ignorespaces A\otimes X\otimes Y} X β A β Y {\lx@inpgf@ignorespaces X\otimes A\otimes Y} R X β Y , A \scriptstyle{\lx@inpgf@ignorespaces R_{X\otimes Y,A}} X β R Y , A \scriptstyle{\lx@inpgf@ignorespaces X\otimes R_{Y,A}} R X , A β Y \scriptstyle{\lx@inpgf@ignorespaces R_{X,A}\otimes Y}
The definition of a semistrict braided monoidal 2-category is very similar.
However, instead of a strict monoidal category, one starts with a semistrict
monoidal 2-category. Instead of the braiding being a natural
transformation, it is a pseudonatural equivalence. Instead of
the equations above holding βon the noseβ, they hold up
to specified invertible modifications. Finally, these modifications
must satisfy 3 new coherence laws discovered by Kapranov and Voevodsky,
together with the equation S + = S β S^{+}=S^{-} discussed in SectionΒ 1.3 .
In all that follows, in diagrams we sometimes denote the tensor product of
objects simply by juxtaposition. We also label some clauses in the definition
using the βhieroglyphicβ notation invented by Kapranov and Voevodsky.
0N82
Definition 6 . A braided monoidal 2-category ( π , β , I , R , R ~ ( β | β , β ) , R ~ ( β , β | β ) ) (\mathcal{C},\otimes,I,R,\tilde{R}_{(-|-,-)},\tilde{R}_{(-,-|-)}) consists of:
(1)
A semistrict monoidal 2-category ( π , β , 1 ) (\mathcal{C},\otimes,1)
(2)
A pseudonatural equivalence
R : β β β op R\colon\otimes\Rightarrow\otimes^{\rm op}
(3)
Two invertible modifications R ~ ( β | β , β ) \tilde{R}_{(-|-,-)} and
R ~ ( β , β | β ) \tilde{R}_{(-,-|-)} , giving for any objects A , B , C β π A,B,C\in\mathcal{C}
the 2-isomorphisms
A β B β C {\lx@inpgf@ignorespaces A\otimes B\otimes C} β B β C β A {\lx@inpgf@ignorespaces B\otimes C\otimes A} B β A β C {\lx@inpgf@ignorespaces B\otimes A\otimes C} R A , B β C \scriptstyle{\lx@inpgf@ignorespaces R_{A,B\otimes C}} R A , B β C \scriptstyle{\lx@inpgf@ignorespaces R_{A,B}\otimes C} B β R A , C \scriptstyle{\lx@inpgf@ignorespaces B\otimes R_{A,C}} β R ~ ( A | B , C ) {\lx@inpgf@ignorespaces\Uparrow\tilde{R}_{(A|B,C)}} ββ A β B β C {\lx@inpgf@ignorespaces A\otimes B\otimes C} β C β A β B {\lx@inpgf@ignorespaces C\otimes A\otimes B} A β C β B {\lx@inpgf@ignorespaces A\otimes C\otimes B} R A β B , C \scriptstyle{\lx@inpgf@ignorespaces R_{A\otimes B,C}} A β R B , C \scriptstyle{\lx@inpgf@ignorespaces A\otimes R_{B,C}} R A , C β B \scriptstyle{\lx@inpgf@ignorespaces R_{A,C}\otimes B} β R ~ ( A , B | C ) {\lx@inpgf@ignorespaces\Uparrow\tilde{R}_{(A,B|C)}}
These data must satisfy the following conditions. First,
for all objects A , B , C , D β π A,B,C,D\in\mathcal{C} the following diagrams commute:
( ( β β β β β ) β β ) ((\bullet\otimes\bullet\otimes\bullet)\otimes\bullet)
D β A β B β C {\lx@inpgf@ignorespaces DABC} β A β B β C β D {\lx@inpgf@ignorespaces ABCD} A β D β B β C {\lx@inpgf@ignorespaces ADBC} β A β B β D β C {\lx@inpgf@ignorespaces ABDC} β 1 . {\lx@inpgf@ignorespaces 1.} 2 . {\lx@inpgf@ignorespaces 2.} 4 . {\lx@inpgf@ignorespaces 4.} 3 . {\lx@inpgf@ignorespaces 3.}
1 . R ~ ( A β B , C | D ) 2 . = R ~ ( A , B | D ) β C 3 . = A β R ~ ( B , C | D ) 4 . = R ~ ( A , B β C | D ) \begin{array}[]{ll}1.\>\tilde{R}_{(A\otimes B,C|D)}&2.\>=\>\tilde{R}_{(A,B|D)}\otimes C\\
3.\>=\>A\otimes\tilde{R}_{(B,C|D)}&4.\>=\>\tilde{R}_{(A,B\otimes C|D)}\end{array}
( β β ( β β β β β ) ) (\bullet\otimes(\bullet\otimes\bullet\otimes\bullet))
B β C β D β A {\lx@inpgf@ignorespaces BCDA} β A β B β C β D {\lx@inpgf@ignorespaces ABCD} B β C β A β D {\lx@inpgf@ignorespaces BCAD} β B β A β C β D {\lx@inpgf@ignorespaces BACD} β 1 . {\lx@inpgf@ignorespaces 1.} 2 . {\lx@inpgf@ignorespaces 2.} 4 . {\lx@inpgf@ignorespaces 4.} 3 . {\lx@inpgf@ignorespaces 3.}
1 . = R ~ ( A | B , C β D ) 2 . = B β R ~ ( A | C , D ) 3 . = R ~ ( A | B , C ) β D 4 . = R ~ ( A | B β C , D ) \begin{array}[]{ll}1.\>=\>\tilde{R}_{(A|B,C\otimes D)}&2.\>=\>B\otimes\tilde{R}_{(A|C,D)}\\
3.\>=\>\tilde{R}_{(A|B,C)}\otimes D&4.\>=\>\tilde{R}_{(A|B\otimes C,D)}\end{array}
( ( β β β ) β ( β β β ) ) ((\bullet\otimes\bullet)\otimes(\bullet\otimes\bullet))
A β B β C β D {\lx@inpgf@ignorespaces ABCD} C β D β A β B {\lx@inpgf@ignorespaces CDAB} A β C β D β B {\lx@inpgf@ignorespaces ACDB} A β C β B β D {\lx@inpgf@ignorespaces ACBD\phantom{MMMM}} C β A β D β B {\lx@inpgf@ignorespaces\phantom{MMMM}CADB} C β A β B β D {\lx@inpgf@ignorespaces CABD} 3 . {\lx@inpgf@ignorespaces 3.} 4 . {\lx@inpgf@ignorespaces 4.} 5 . {\lx@inpgf@ignorespaces 5.} 6 . {\lx@inpgf@ignorespaces 6.} 1 . {\lx@inpgf@ignorespaces 1.} 2 . {\lx@inpgf@ignorespaces 2.} 7 . {\lx@inpgf@ignorespaces 7.}
1 . = R ~ ( A , B | C ) β D 2 . = C β R ~ ( A , B | D ) 3 . = A β R ~ ( B | C , D ) 4 . = R ~ ( A | C , D ) β B 5 . = R ~ ( A , B | C β D ) 6 . = β ( R A , C , R B , D ) 7 . = R ~ ( A β B | C , D ) \begin{array}[]{lll}1.\>=\>\tilde{R}_{(A,B|C)}\otimes D&2.\>=\>C\otimes\tilde{R}_{(A,B|D)}&3.\>=\>A\otimes\tilde{R}_{(B|C,D)}\\
4.\>=\>\tilde{R}_{(A|C,D)}\otimes B&5.\>=\>\tilde{R}_{(A,B|C\otimes D)}&6.\>=\>\otimes_{(R_{A,C},R_{B,D})}\\
7.\>=\>\tilde{R}_{(A\otimes B|C,D)}&\end{array}
Second, for any objects A , B , C β π A,B,C\in\mathcal{C} , we define two 2-isomorphisms
corresponding
to two proofs of the YangβBaxter hexagon in a braided monoidal
category:
B β A β C {\lx@inpgf@ignorespaces BAC} B β C β A {\lx@inpgf@ignorespaces BCA} A β B β C {\lx@inpgf@ignorespaces ABC} C β B β A {\lx@inpgf@ignorespaces CBA} A β C β B {\lx@inpgf@ignorespaces ACB} C β A β B {\lx@inpgf@ignorespaces CAB} β R ~ ( A | B , C ) β 1 {\lx@inpgf@ignorespaces\scriptstyle{\Downarrow\tilde{R}_{(A|B,C)}^{-1}}} β R ( A , R B , C ) β 1 {\lx@inpgf@ignorespaces\scriptstyle{\Downarrow R_{(A,R_{B,C})}^{-1}}} β R ~ ( A | B , C ) {\lx@inpgf@ignorespaces\scriptstyle{\Downarrow\tilde{R}_{(A|B,C)}}} ββ B β A β C {\lx@inpgf@ignorespaces BAC} B β C β A {\lx@inpgf@ignorespaces BCA} A β B β C {\lx@inpgf@ignorespaces ABC} C β B β A {\lx@inpgf@ignorespaces CBA} A β C β B {\lx@inpgf@ignorespaces ACB} C β A β B {\lx@inpgf@ignorespaces CAB} β R ~ ( A , B | C ) β 1 {\lx@inpgf@ignorespaces\scriptstyle{\Downarrow\tilde{R}_{(A,B|C)}^{-1}}} β R ( R A , B , C ) {\lx@inpgf@ignorespaces\scriptstyle{\Downarrow R_{(R_{A,B},C)}}} β R ~ ( A , B | C ) {\lx@inpgf@ignorespaces\scriptstyle{\Downarrow\tilde{R}_{(A,B|C)}}}
We refer to these 2-morphisms as S A , B , C + S^{+}_{A,B,C} and S A , B , C β S^{-}_{A,B,C} , respectively.
We require them to be equal:
B β A β C {\lx@inpgf@ignorespaces BAC} B β C β A {\lx@inpgf@ignorespaces BCA} A β B β C {\lx@inpgf@ignorespaces ABC} C β B β A {\lx@inpgf@ignorespaces CBA} A β C β B {\lx@inpgf@ignorespaces ACB} C β A β B {\lx@inpgf@ignorespaces CAB}
We can unpack this definition to obtain an explicit list of operations
and laws. In this form the definition is essentially due to Kapranov and
Voevodsky, though with certain differences, which we list at the end of
this section.
0N83
Lemma 7 . A braided monoidal 2-category ( π , β , 1 , R , R ~ ( β | β , β ) , R ~ ( β , β | β ) ) (\mathcal{C},\otimes,1,R,\tilde{R}_{(-|-,-)},\tilde{R}_{(-,-|-)}) consists of the following data:
(1)
A semistrict monoidal 2-category ( π , β , 1 ) (\mathcal{C},\otimes,1)
(2)
( β β β ) (\bullet\otimes\bullet) For any two objects
A , B β π A,B\in\mathcal{C} an equivalence R A , B : A β B β B β A R_{A,B}\colon A\otimes B\to B\otimes A
(3)
( β β β ) ({\to}\otimes\bullet) For any 1-morphism
f : A β A β² f:A\to A^{\prime} and any object B β π B\in\mathcal{C} a 2-isomorphism
A β B {\lx@inpgf@ignorespaces A\otimes B} A β² β B {\lx@inpgf@ignorespaces A^{\prime}\otimes B} B β A {\lx@inpgf@ignorespaces B\otimes A} B β A β² {\lx@inpgf@ignorespaces B\otimes A^{\prime}} f β B \scriptstyle{\lx@inpgf@ignorespaces f\otimes B} R A , B \scriptstyle{\lx@inpgf@ignorespaces R_{A,B}} β R f , B {\lx@inpgf@ignorespaces\Downarrow R_{f,B}} R A β² , B \scriptstyle{\lx@inpgf@ignorespaces R_{A^{\prime},B}} B β f \scriptstyle{\lx@inpgf@ignorespaces B\otimes f}
(4)
( β β β ) (\bullet\otimes{\to}) For any object A β π A\in\mathcal{C} and any 1-morphism
g : B β B β² g\colon B\to B^{\prime} a 2-isomorphism
A β B {\lx@inpgf@ignorespaces A\otimes B} A β B β² {\lx@inpgf@ignorespaces A\otimes B^{\prime}} B β A {\lx@inpgf@ignorespaces B\otimes A} B β² β A {\lx@inpgf@ignorespaces B^{\prime}\otimes A} A β g \scriptstyle{\lx@inpgf@ignorespaces A\otimes g} R A , B \scriptstyle{\lx@inpgf@ignorespaces R_{A,B}} β R A , g {\lx@inpgf@ignorespaces\Downarrow R_{A,g}} R A , B β² \scriptstyle{\lx@inpgf@ignorespaces R_{A,B^{\prime}}} g β A \scriptstyle{\lx@inpgf@ignorespaces g\otimes A}
(5)
( ( β β β ) β β ) ((\bullet\otimes\bullet)\otimes\bullet)
For any objects A , B , C β π A,B,C\in\mathcal{C} a 2-iso
A β B β C {\lx@inpgf@ignorespaces A\otimes B\otimes C} βββ B β C β A {\lx@inpgf@ignorespaces B\otimes C\otimes A} B β A β C {\lx@inpgf@ignorespaces B\otimes A\otimes C} R A , B β C \scriptstyle{\lx@inpgf@ignorespaces R_{A,B\otimes C}} R A , B β C \scriptstyle{\lx@inpgf@ignorespaces R_{A,B}\otimes C} β R ~ ( A | B , C ) {\lx@inpgf@ignorespaces\Uparrow\tilde{R}_{(A|B,C)}} B β R A , C \scriptstyle{\lx@inpgf@ignorespaces B\otimes R_{A,C}}
(6)
( β β ( β β β ) ) (\bullet\otimes(\bullet\otimes\bullet))
For any objects A , B , C β π A,B,C\in\mathcal{C} a 2-isomorphism
A β B β C {\lx@inpgf@ignorespaces A\otimes B\otimes C} βββ C β A β B {\lx@inpgf@ignorespaces C\otimes A\otimes B} A β C β B {\lx@inpgf@ignorespaces A\otimes C\otimes B} R A β B , C \scriptstyle{\lx@inpgf@ignorespaces R_{A\otimes B,C}} A β R B , C \scriptstyle{\lx@inpgf@ignorespaces A\otimes R_{B,C}} β R ~ ( A , B | C ) {\lx@inpgf@ignorespaces\Uparrow\tilde{R}_{(A,B|C)}} R A , C β B \scriptstyle{\lx@inpgf@ignorespaces R_{A,C}\otimes B}
Moreover, these data must satisfy the following conditions:
( β β β ) ({\to}\otimes{\to})
For any 1-morphisms f : A β A β² f\colon A\to A^{\prime} and g : B β B β² g\colon B\to B^{\prime} the following
cube commutes:
A β B {\lx@inpgf@ignorespaces AB} β β A β² β B {\lx@inpgf@ignorespaces A^{\prime}B} A β B β² {\lx@inpgf@ignorespaces AB^{\prime}} A β² β B β² {\lx@inpgf@ignorespaces A^{\prime}B^{\prime}} B β A {\lx@inpgf@ignorespaces BA} β B β A β² {\lx@inpgf@ignorespaces BA^{\prime}} B β² β A {\lx@inpgf@ignorespaces B^{\prime}A} β B β² β A β² {\lx@inpgf@ignorespaces B^{\prime}A^{\prime}} 1 . {\lx@inpgf@ignorespaces 1.} 5 . {\lx@inpgf@ignorespaces 5.} 2 . {\lx@inpgf@ignorespaces 2.} 6 . {\lx@inpgf@ignorespaces 6.} 3 . {\lx@inpgf@ignorespaces 3.} 4 . {\lx@inpgf@ignorespaces 4.}
1 . = β f , g 2 . = β g , f 3 . = R A , g 4 . = R A β² , g 5 . = R f , B β² 6 . = R f , B 1.\>=\>\otimes_{f,g}\qquad 2.\>=\>\otimes_{g,f}\qquad 3.\>=\>R_{A,g}\qquad 4.\>=\>R_{A^{\prime},g}\qquad 5.\>=\>R_{f,B^{\prime}}\qquad 6.\>=\>R_{f,B}
( β β β ) (\bullet\otimes{\Downarrow}) For any object A β π A\in\mathcal{C} , any 1-morphisms
f , f β² : B β B β² f,f^{\prime}\colon B\to B^{\prime} , and any 2-morphism
Ξ² : f β f β² \beta\colon f\Rightarrow f^{\prime} , the following prism commutes:
A β B {\lx@inpgf@ignorespaces AB} β A β Ξ² {\lx@inpgf@ignorespaces\Downarrow A\otimes\beta} A β B β² {\lx@inpgf@ignorespaces AB^{\prime}} B β A {\lx@inpgf@ignorespaces BA} β Ξ² β A {\lx@inpgf@ignorespaces\Downarrow\beta\otimes A} B β² β A {\lx@inpgf@ignorespaces B^{\prime}A} R A , f β² {\lx@inpgf@ignorespaces R_{A,f^{\prime}}} R A , f {\lx@inpgf@ignorespaces R_{A,f}}
( β β β ) ({\Downarrow}\otimes\bullet)
A similar prism, left to the reader.
( β β β β ) (\to{\to}\otimes\bullet) For any pair of 1-morphisms
A β f A β² β f β² A β²β² A\stackrel{{\scriptstyle f}}{{\to}}A^{\prime}\stackrel{{\scriptstyle f^{\prime}}}{{\to}}A^{\prime\prime} and any object B β π B\in\mathcal{C} ,
the 2-isomorphism R f β f β² , B R_{ff^{\prime},B} coincides with the pasting
A β B {\lx@inpgf@ignorespaces A\otimes B} A β² β B {\lx@inpgf@ignorespaces A^{\prime}\otimes B} A β²β² β B {\lx@inpgf@ignorespaces A^{\prime\prime}\otimes B} B β A {\lx@inpgf@ignorespaces B\otimes A} B β A β² {\lx@inpgf@ignorespaces B\otimes A^{\prime}} B β A β²β² {\lx@inpgf@ignorespaces B\otimes A^{\prime\prime}} β R f , B {\lx@inpgf@ignorespaces\Downarrow R_{f,B}} β R f β² , B {\lx@inpgf@ignorespaces\Downarrow R_{f^{\prime},B}}
( β β β β ) (\bullet\otimes{\to}\to) A similar pasting law, left to the reader.
( ( β β β ) β β ) ((\bullet\otimes\bullet)\otimes{\to})
For any objects A , B , C β π A,B,C\in\mathcal{C} and any 1-morphism f : C β C β² f\colon C\to C^{\prime} , the
following triangular prism commutes:
A β B β C {\lx@inpgf@ignorespaces ABC} C β A β B {\lx@inpgf@ignorespaces CAB} A β C β B {\lx@inpgf@ignorespaces ACB} β A β B β C β² {\lx@inpgf@ignorespaces ABC^{\prime}} C β² β A β B {\lx@inpgf@ignorespaces C^{\prime}AB} A β C β² β B {\lx@inpgf@ignorespaces AC^{\prime}B} β R A β B , C \scriptstyle{\lx@inpgf@ignorespaces R_{AB,C}} A β B β f \scriptstyle{\lx@inpgf@ignorespaces AB\otimes f} β 1 . {\lx@inpgf@ignorespaces\Uparrow 1.} β 3 . {\lx@inpgf@ignorespaces\Uparrow 3.} f β A β B \scriptstyle{\lx@inpgf@ignorespaces f\otimes AB} β 2 . {\lx@inpgf@ignorespaces\Uparrow 2.} β 4 . {\lx@inpgf@ignorespaces\Uparrow 4.} β 5 . {\lx@inpgf@ignorespaces\Uparrow 5.}
1 . = A β R B , f 2 . = R A , f β B 3 . = R ~ ( A , B | C ) 4 . = R ~ ( A , B | C β² ) 5 . = R A β B , f 1.\>=\>A\otimes R_{B,f}\qquad 2.\>=\>R_{A,f}\otimes B\qquad 3.\>=\>\tilde{R}_{(A,B|C)}\qquad 4.\>=\>\tilde{R}_{(A,B|C^{\prime})}\qquad 5.\>=\>R_{AB,f}
( β β ( β β β ) ) ({\to}\otimes(\bullet\otimes\bullet))
A similar prism, left to the reader.
( ( β β β ) β β ) (({\to}\otimes\bullet)\otimes\bullet)
For any objects A , B , C β π A,B,C\in\mathcal{C} and any 1-morphism f : A β A β² f\colon A\to A^{\prime} , the
following triangular prism commutes:
A β B β C {\lx@inpgf@ignorespaces ABC} C β A β B {\lx@inpgf@ignorespaces CAB} A β C β B {\lx@inpgf@ignorespaces ACB} β A β² β B β C {\lx@inpgf@ignorespaces A^{\prime}BC} C β A β² β B {\lx@inpgf@ignorespaces CA^{\prime}B} A β² β C β B {\lx@inpgf@ignorespaces A^{\prime}CB} β R A β B , C \scriptstyle{\lx@inpgf@ignorespaces R_{AB,C}} f β B β C \scriptstyle{\lx@inpgf@ignorespaces f\otimes BC} β 1 . {\lx@inpgf@ignorespaces\Uparrow 1.} β 3 . {\lx@inpgf@ignorespaces\Uparrow 3.} C β f β B \scriptstyle{\lx@inpgf@ignorespaces C\otimes f\otimes B} β 2 . {\lx@inpgf@ignorespaces\Uparrow 2.} β 4 . {\lx@inpgf@ignorespaces\Uparrow 4.} β 5 . {\lx@inpgf@ignorespaces\Uparrow 5.}
1 . = β ( f , R B , C ) 2 . = R f , C β B 3 . = R ~ ( A , B | C ) 4 . = R ~ ( A β² , B | C ) 5 . = R f β B , C 1.\>=\>\otimes_{(f,R_{B,C})}\qquad 2.\>=\>R_{f,C}\otimes B\qquad 3.\>=\>\tilde{R}_{(A,B|C)}\qquad 4.\>=\>\tilde{R}_{(A^{\prime},B|C)}\qquad 5.\>=\>R_{f\otimes B,C}
( ( β β β ) β β ) ((\bullet\otimes{\to})\otimes\bullet) ,
( β β ( β β β ) ) (\bullet\otimes({\to}\otimes\bullet)) and
( β β ( β β β ) ) (\bullet\otimes(\bullet\otimes{\to}))
Similar prisms, left to the reader.
( ( β β β β β ) β β ) ((\bullet\otimes\bullet\otimes\bullet)\otimes\bullet) ,
( β β ( β β β β β ) ) (\bullet\otimes(\bullet\otimes\bullet\otimes\bullet)) ,
( ( β β β ) β ( β β β ) ) ((\bullet\otimes\bullet)\otimes(\bullet\otimes\bullet))
As in Definition 6 .
S + = S β S^{+}=S^{-} As in Definition 6 .
0N84
Proof. The 1-equivalences R A , B R_{A,B} and 2-isomorphisms R f , B R_{f,B} and
R A , g R_{A,g} comprise the pseudonatural equivalence R : β β β op R\colon\otimes\to\otimes^{\rm op} , and conditions ( β β β ) ({\to}\otimes{\to}) , ( β β β ) ({\bullet}\otimes{\Downarrow}) , ( β β β ) ({\Downarrow}\otimes{\bullet}) , ( β β β β ) (\to{\to}\otimes{\bullet}) and
( β β β β ) ({\bullet}\otimes{\to}\to) state that it is indeed a pseudonatural
transformation. The 2-morphisms R ~ ( A | B , C ) \tilde{R}_{(A|B,C)} and R ~ ( A , B | C ) \tilde{R}_{(A,B|C)}
comprise the invertible modifications R ~ ( β | β , β ) \tilde{R}_{(-|-,-)} and
R ~ ( β , β | β ) \tilde{R}_{(-,-|-)} , and the commuting triangular prisms state
that these are indeed modifications, expressing naturality in each
argument. The remaining 4 conditions come from Definition 6 .
β
Note that by ( β β β β ) (\to{\to}\otimes\bullet) resp. ( β β β β ) (\bullet\otimes{\to}\to)
and by the invertibility of the respective 2-morphisms,
for any
objects A , B β π A,B\in\mathcal{C} we have R A , 1 B = 1 R A , B R_{A,1_{B}}=1_{R_{A,B}} and R 1 A , B = 1 R A , B R_{1_{A},B}=1_{R_{A,B}} .
The above lemma makes it clear that our definition of braided monoidal
2-category differs from that of Kapranov and Voevodsky in precisely the
following points:
(1)
Invertibility of the braiding. Our definition
implies that the 1-morphisms R A , B R_{A,B} are
equivalences. Kapranov and Voevodsky make no invertibility assumptions
on these 1-morphisms. Our definition would agree with theirs on this
point, and otherwise stay the same, if we required R : β β β op R\colon\otimes\to\otimes^{\rm op} to be merely a pseudonatural transformation, rather than
a pseudonatural equivalence.
(2)
S + = S β S^{+}=S^{-} . As already noted, Kapranov and Voevodsky omit
this condition.
(3)
Naturality of R ~ ( β | β , β ) \tilde{R}_{(-|-,-)} and R ~ ( β , β | β ) \tilde{R}_{(-,-|-)} .
Our definition implies the commutativity of 6 triangular prisms
expressing the naturality in each argument of these modifications.
Kapranov and Voevodsky substitute cubes for 4 of these prisms, namely
( β β ( β β β ) ) (\bullet\otimes({\to}\otimes\bullet)) , ( β β ( β β β ) ) (\bullet\otimes(\bullet\otimes{\to})) ,
( ( β β β ) β β ) ((\bullet\otimes{\to})\otimes\bullet) and ( ( β β β ) β β ) (({\to}\otimes\bullet)\otimes\bullet) .
By the following lemma one can deduce these cubes from
the remaining data
β but not, it appears, vice versa. In personal communication,
Kapranov agreed that all these prisms should hold.
0N85
Lemma 8 . For any three objects A , B , C β π A,B,C\in\mathcal{C} and any morphism f : B β B β² f\colon B\to B^{\prime} ,
the following cube commutes.
A β B β C {\lx@inpgf@ignorespaces ABC} β β A β B β² β C {\lx@inpgf@ignorespaces AB^{\prime}C} A β C β B {\lx@inpgf@ignorespaces ACB} A β C β B β² {\lx@inpgf@ignorespaces ACB^{\prime}} B β C β A {\lx@inpgf@ignorespaces BCA} β B β² β C β A {\lx@inpgf@ignorespaces B^{\prime}CA} C β B β A {\lx@inpgf@ignorespaces CBA} β C β B β² β A {\lx@inpgf@ignorespaces CB^{\prime}A} 1 . {\lx@inpgf@ignorespaces\scriptstyle{1.}} 5 . {\lx@inpgf@ignorespaces\scriptstyle{5.}} 2 . {\lx@inpgf@ignorespaces\scriptstyle{2.}} 6 . {\lx@inpgf@ignorespaces\scriptstyle{6.}} 4 . {\lx@inpgf@ignorespaces\scriptstyle{4.}} 3 . {\lx@inpgf@ignorespaces\scriptstyle{3.}}
1 . = A β R f , C 2 . = R f , C β A 3 . = R A , R B β² , C 4 . = R A , R B , C 5 . = R A , C β f 6 . = R A , f β C \begin{array}[]{lll}1.\>=\>A\otimes R_{f,C}&2.\>=\>R_{f,C}\otimes A&3.\>=\>R_{A,R_{B^{\prime},C}}\\
4.\>=\>R_{A,R_{B,C}}&5.\>=\>R_{A,C\otimes f}&6.\>=\>R_{A,f\otimes C}\end{array}
0N86
Proof. This is an special case of the axiom ( β β β ) (\bullet\otimes{\Downarrow}) together with ( β β β β ) (\bullet\otimes{\to}\to) .
β
We refer to this cube with the hieroglyph
( β β ( β β β ) ) β² (\bullet\otimes({\to}\otimes\bullet))^{\prime} . One can similarly
prove the analogous cube corresponding to the hieroglyph
( β β ( β β β ) ) β² (\bullet\otimes(\bullet\otimes{\to}))^{\prime} commutes.
Moreover, we can prove the commutativity of cubes
corresponding to the hieroglyphs
( ( β β β ) β β ) β² ((\bullet\otimes{\to})\otimes\bullet)^{\prime} and
( ( β β β ) β β ) β² (({\to}\otimes\bullet)\otimes\bullet)^{\prime} using
( β β β ) ({\Downarrow}\otimes\bullet) and ( β β β β ) (\to{\to}\otimes\bullet) .