ScalingStacks

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 TT between 2-functors β„±,𝒒:π’žβ†’π’Ÿ\mathcal{F},\mathcal{G}\colon\mathcal{C}\to\mathcal{D} assigns to each object Aβˆˆπ’žA\in\mathcal{C} a morphism TA:ℱ⁑(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, TT also assigns to each morphism f:Aβ†’Bf\colon A\to B in π’ž\mathcal{C} a 2-isomorphism TfT_{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)}TA\scriptstyle{\lx@inpgf@ignorespaces T_{A}}⇓Tf{\lx@inpgf@ignorespaces\Downarrow T_{f}}TB\scriptstyle{\lx@inpgf@ignorespaces T_{B}}𝒒⁑(f)\scriptstyle{\lx@inpgf@ignorespaces\mathcal{G}(f)}

These 2-morphisms TfT_{f} must in turn satisfy some equational laws of their own. First, for any identity morphism 1A:Aβ†’A1_{A}\colon A\to A, we require T1A=1TAT_{1_{A}}=1_{T_{A}}. Second, given a composable pair of morphisms f:Aβ†’Bf\colon A\to B, g:Bβ†’Cg\colon B\to C, the 2-morphism Tf​gT_{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)}⇓Tf{\lx@inpgf@ignorespaces\Downarrow T_{f}}⇓Tg{\lx@inpgf@ignorespaces\Downarrow T_{g}}

Third, given morphisms f,f′:A→Bf,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)}⇓Tfβ€²{\lx@inpgf@ignorespaces\Downarrow T_{f^{\prime}}}⇓Tf{\lx@inpgf@ignorespaces\Downarrow T_{f}}

Given two pseudonatural transformations S,T:ℱ⇒𝒒S,T\colon\mathcal{F}\Rightarrow\mathcal{G}, a modification Ξ±\alpha from SS to TT assigns to each object Aβˆˆπ’žA\in\mathcal{C} a 2-morphism Ξ±A:SAβ‡’TA\alpha_{A}\colon S_{A}\Rightarrow T_{A}. Moreover, for any morphism F:Aβ†’BF\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)}⇑Tf{\lx@inpgf@ignorespaces\Uparrow T_{f}}⇑Sf{\lx@inpgf@ignorespaces\Uparrow S_{f}}

As explained in the introduction, in an nn-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 SS to the pseudonatural transformation TT is β€˜invertible’ if there is a modification Ξ±βˆ’1\alpha^{-1} from TT to SS such that Ξ±β€‹Ξ±βˆ’1=1S\alpha\alpha^{-1}=1_{S} and Ξ±βˆ’1​α=1T\alpha^{-1}\alpha=1_{T}. A pseudonatural transformation TT 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:βŠ—β‡’βŠ—opR\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}RA,XβŠ—Y\scriptstyle{\lx@inpgf@ignorespaces R_{A,X\otimes Y}}RA,XβŠ—Y\scriptstyle{\lx@inpgf@ignorespaces R_{A,X}\otimes Y}XβŠ—RA,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}RXβŠ—Y,A\scriptstyle{\lx@inpgf@ignorespaces R_{X\otimes Y,A}}XβŠ—RY,A\scriptstyle{\lx@inpgf@ignorespaces X\otimes R_{Y,A}}RX,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. (1)

    A semistrict monoidal 2-category (π’ž,βŠ—,1)(\mathcal{C},\otimes,1)

  2. (2)

    A pseudonatural equivalence R:βŠ—β‡’βŠ—opR\colon\otimes\Rightarrow\otimes^{\rm op}

  3. (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}RA,BβŠ—C\scriptstyle{\lx@inpgf@ignorespaces R_{A,B\otimes C}}RA,BβŠ—C\scriptstyle{\lx@inpgf@ignorespaces R_{A,B}\otimes C}BβŠ—RA,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}RAβŠ—B,C\scriptstyle{\lx@inpgf@ignorespaces R_{A\otimes B,C}}AβŠ—RB,C\scriptstyle{\lx@inpgf@ignorespaces A\otimes R_{B,C}}RA,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)βŠ—C3.=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)βŠ—D4.=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)βŠ—D2.=CβŠ—R~(A,B|D)3.=AβŠ—R~(B|C,D)4.=R~(A|C,D)βŠ—B5.=R~(A,B|CβŠ—D)6.=βŠ—(RA,C,RB,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,RB,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(RA,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 SA,B,C+S^{+}_{A,B,C} and SA,B,Cβˆ’S^{-}_{A,B,C}, respectively. We require them to be equal:

(S+=Sβˆ’)(S^{+}=S^{-}):

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. (1)

    A semistrict monoidal 2-category (π’ž,βŠ—,1)(\mathcal{C},\otimes,1)

  2. (2)

    (βˆ™βŠ—βˆ™)(\bullet\otimes\bullet) For any two objects A,Bβˆˆπ’žA,B\in\mathcal{C} an equivalence RA,B:AβŠ—Bβ†’BβŠ—AR_{A,B}\colon A\otimes B\to B\otimes A

  3. (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}RA,B\scriptstyle{\lx@inpgf@ignorespaces R_{A,B}}⇓Rf,B{\lx@inpgf@ignorespaces\Downarrow R_{f,B}}RAβ€²,B\scriptstyle{\lx@inpgf@ignorespaces R_{A^{\prime},B}}BβŠ—f\scriptstyle{\lx@inpgf@ignorespaces B\otimes f}
  4. (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}RA,B\scriptstyle{\lx@inpgf@ignorespaces R_{A,B}}⇓RA,g{\lx@inpgf@ignorespaces\Downarrow R_{A,g}}RA,Bβ€²\scriptstyle{\lx@inpgf@ignorespaces R_{A,B^{\prime}}}gβŠ—A\scriptstyle{\lx@inpgf@ignorespaces g\otimes A}
  5. (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}RA,BβŠ—C\scriptstyle{\lx@inpgf@ignorespaces R_{A,B\otimes C}}RA,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βŠ—RA,C\scriptstyle{\lx@inpgf@ignorespaces B\otimes R_{A,C}}
  6. (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}RAβŠ—B,C\scriptstyle{\lx@inpgf@ignorespaces R_{A\otimes B,C}}AβŠ—RB,C\scriptstyle{\lx@inpgf@ignorespaces A\otimes R_{B,C}}⇑R~(A,B|C){\lx@inpgf@ignorespaces\Uparrow\tilde{R}_{(A,B|C)}}RA,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,g2.=βŠ—g,f3.=RA,g4.=RAβ€²,g5.=Rf,Bβ€²6.=Rf,B1.\>=\>\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}RA,fβ€²{\lx@inpgf@ignorespaces R_{A,f^{\prime}}}RA,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β†’fAβ€²β†’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 Rf​fβ€²,BR_{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}}⇓Rf,B{\lx@inpgf@ignorespaces\Downarrow R_{f,B}}⇓Rfβ€²,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} RA​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βŠ—RB,f2.=RA,fβŠ—B3.=R~(A,B|C)4.=R~(A,B|Cβ€²)5.=RA​B,f1.\>=\>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} RA​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,RB,C)2.=Rf,CβŠ—B3.=R~(A,B|C)4.=R~(Aβ€²,B|C)5.=RfβŠ—B,C1.\>=\>\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 RA,BR_{A,B} and 2-isomorphisms Rf,BR_{f,B} and RA,gR_{A,g} comprise the pseudonatural equivalence R:βŠ—β†’βŠ—opR\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 RA,1B=1RA,BR_{A,1_{B}}=1_{R_{A,B}} and R1A,B=1RA,BR_{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. (1)

    Invertibility of the braiding. Our definition implies that the 1-morphisms RA,BR_{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:βŠ—β†’βŠ—opR\colon\otimes\to\otimes^{\rm op} to be merely a pseudonatural transformation, rather than a pseudonatural equivalence.

  2. (2)

    S+=Sβˆ’S^{+}=S^{-}. As already noted, Kapranov and Voevodsky omit this condition.

  3. (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βŠ—Rf,C2.=Rf,CβŠ—A3.=RA,RBβ€²,C4.=RA,RB,C5.=RA,CβŠ—f6.=RA,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).

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

John C. Baez, Martin Neuchl

Original source: arXiv:q-alg/9511013v2