ScalingStacks

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}

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