ScalingStacks

3.1. 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) as a 2-Category

As noted in SectionΒ 1.1, the center construction applied to a monoid yields its usual center, because a certain square must commute. However, as one would expect from the weakening principle, when π’ž\mathcal{C} is a monoidal category the corresponding square need only commute up to a specified natural isomorphism. An object of 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) thus turns out to be an object Aβˆˆπ’žA\in\mathcal{C} equipped with a natural isomorphism RA,βˆ’:AβŠ—βˆ’β‡’βˆ’βŠ—AR_{A,-}\colon A\otimes-\Rightarrow-\otimes A satisfying various coherence laws, such as the commutativity of following diagram:

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}}

for any objects X,Yβˆˆπ’žX,Y\in\mathcal{C}. Of course, this diagram is part of the definition of a braided monoidal category. Similarly, the morphisms in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) also work out to have properties that form part of the definition of a braided monoidal category.

Heuristic 4-categorical computations suggest how these patterns should continue when π’ž\mathcal{C} is a monoidal 2-category. We thus define 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) as follows.

Objects in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}):

An object of 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) is a triple (A,RA,βˆ’,R~(A|βˆ’,βˆ’))(A,R_{A,-},\tilde{R}_{(A|-,-)}) consisting of:

  1. (1)

    an object Aβˆˆπ’žA\in\mathcal{C}

  2. (2)

    a pseudonatural equivalence RA,βˆ’:AβŠ—βˆ’β‡’βˆ’βŠ—AR_{A,-}\colon A\otimes-\Rightarrow-\otimes A

  3. (3)

    an invertible modification R~(A|βˆ’,βˆ’)\tilde{R}_{(A|-,-)}, giving for any objects X,Yβˆˆπ’žX,Y\in\mathcal{C} a 2-isomorphism

    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}}⇑R~(A|X,Y){\lx@inpgf@ignorespaces\Uparrow\tilde{R}_{(A|X,Y)}}

such that for any objects X,Y,Zβˆˆπ’žX,Y,Z\in\mathcal{C}, the tetrahedron (βˆ™βŠ—(βˆ™βŠ—βˆ™βŠ—βˆ™))(\bullet\otimes(\bullet\otimes\bullet\otimes\bullet)) commutes.

Here we mean that the diagram (βˆ™βŠ—(βˆ™βŠ—βˆ™βŠ—βˆ™))(\bullet\otimes(\bullet\otimes\bullet\otimes\bullet)) commutes with objects A,X,Y,ZA,X,Y,Z, and with the modification R~(βˆ’|βˆ’,βˆ’)\tilde{R}_{(-|-,-)} in the definition of a braided monoidal 2-category replaced by the above R~(A|βˆ’,βˆ’)\tilde{R}_{(A|-,-)}. Throughout the following we use the hieroglyphical notation in this way. Also, we use letters near the beginning of the alphabet to denote objects of π’ž\mathcal{C} underlying objects in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}), and letters near the end to denote objects of π’ž\mathcal{C} being used as such.

0N87

Remark 9. The fact that RA,βˆ’R_{A,-} is a pseudonatural equivalence can be expressed equivalently as follows: for any object Xβˆˆπ’žX\in\mathcal{C}, there exists an equivalence RA,X:AβŠ—Xβ†’XβŠ—AR_{A,X}\colon A\otimes X\to X\otimes A, and for any morphism f:Xβ†’Yf\colon X\to Y in π’ž\mathcal{C}, there exists a 2-isomorphism RA,f:(AβŠ—f)∘RA,Yβ‡’RA,X∘(fβŠ—A)R_{A,f}\colon(A\otimes f)\circ R_{A,Y}\Rightarrow R_{A,X}\circ(f\otimes A):

AβŠ—X{\lx@inpgf@ignorespaces A\otimes X}XβŠ—A{\lx@inpgf@ignorespaces X\otimes A}AβŠ—Y{\lx@inpgf@ignorespaces A\otimes Y}YβŠ—A{\lx@inpgf@ignorespaces Y\otimes A}RA,X\scriptstyle{\lx@inpgf@ignorespaces R_{A,X}}AβŠ—f\scriptstyle{\lx@inpgf@ignorespaces A\otimes f}⇑RA,f{\lx@inpgf@ignorespaces\Uparrow R_{A,f}}fβŠ—A\scriptstyle{\lx@inpgf@ignorespaces f\otimes A}RA,Y\scriptstyle{\lx@inpgf@ignorespaces R_{A,Y}}

such that (βˆ™βŠ—β†’β†’)(\bullet\otimes{\to}\to) and (βˆ™βŠ—β‡“)(\bullet\otimes{\Downarrow}) commute.

Similarly, the fact that R~(A|βˆ’,βˆ’)\>\tilde{R}_{(A|-,-)} is a modification means that the diagrams (βˆ™βŠ—(β†’βŠ—βˆ™))(\bullet\otimes({\to}\otimes\bullet)) and (βˆ™βŠ—(βˆ™βŠ—β†’))(\bullet\otimes(\bullet\otimes{\to})) commute.

Morphisms in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}):

A morphism in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) from (A,RA,βˆ’,R~(A|βˆ’,βˆ’))(A,R_{A,-},\tilde{R}_{(A|-,-)}) to (B,RB,βˆ’,R~(B|βˆ’,βˆ’))(B,R_{B,-},\tilde{R}_{(B|-,-)}) is a pair (f,Rf,βˆ’)(f,R_{f,-}) consisting of:

  1. (1)

    a morphism f:A→Bf\colon A\to B

  2. (2)

    an invertible modification Rf,βˆ’R_{f,-}, giving for any object Xβˆˆπ’žX\in\mathcal{C} a 2-isomorphism

    AβŠ—X{\lx@inpgf@ignorespaces A\otimes X}BβŠ—X{\lx@inpgf@ignorespaces B\otimes X}XβŠ—A{\lx@inpgf@ignorespaces X\otimes A}XβŠ—B{\lx@inpgf@ignorespaces X\otimes B}fβŠ—X\scriptstyle{\lx@inpgf@ignorespaces f\otimes X}RA,X\scriptstyle{\lx@inpgf@ignorespaces R_{A,X}}⇓Rf,X{\lx@inpgf@ignorespaces\Downarrow R_{f,X}}RB,X\scriptstyle{\lx@inpgf@ignorespaces R_{B,X}}XβŠ—f\scriptstyle{\lx@inpgf@ignorespaces X\otimes f}

such that the prism (β†’βŠ—(βˆ™βŠ—βˆ™))({\to}\otimes(\bullet\otimes\bullet)) commutes.

0N88

Remark 10. The fact that Rf,βˆ’R_{f,-} is a modification can be expressed equivalently by saying that (β†’βŠ—β†’)({\to}\otimes{\to}) commutes. (Note that (fβŠ—βˆ’)RB,βˆ’(f\otimes-)R_{B,-} and RA,βˆ’(βˆ’βŠ—f)R_{A,-}(-\otimes f) are pseudonatural transformations in an obvious way.)

2-Morphisms in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}):

A 2-morphism Ξ±\alpha in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) from (f,Rf,βˆ’)(f,R_{f,-}) to (g,Rg,βˆ’)(g,R_{g,-}) is

  1. (1)

    a 2-morphism Ξ±:fβ‡’g\alpha\colon f\Rightarrow g in π’ž\mathcal{C}

such that (β‡“βŠ—βˆ™)({\Downarrow}\otimes\bullet) commutes.

We define the composition operations in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) as follows. Composition of morphisms is defined by:

(f,Rf,βˆ’)∘(g,Rg,βˆ’):=(f∘g,((fβŠ—βˆ’)∘Rg,βˆ’)β‹…(Rf,βˆ’βˆ˜(βˆ’βŠ—g)))(f,R_{f,-})\circ(g,R_{g,-}):=(f\circ g,((f\otimes-)\circ R_{g,-})\cdot(R_{f,-}\circ(-\otimes g)))

where f:Aβ†’Bf\colon A\to B and g:Bβ†’Cg\colon B\to C are the underlying 1-morphisms in π’ž\mathcal{C}. Note that for any object Xβˆˆπ’žX\in\mathcal{C}, the 2-morphism ((fβŠ—X)∘Rg,X)β‹…(Rf,X∘(XβŠ—g))((f\otimes X)\circ R_{g,X})\cdot(R_{f,X}\circ(X\otimes g)) equals the back of the following diagram:

A​X{\lx@inpgf@ignorespaces AX}C​X{\lx@inpgf@ignorespaces CX}B​X{\lx@inpgf@ignorespaces BX} X​A{\lx@inpgf@ignorespaces XA}X​C{\lx@inpgf@ignorespaces XC}X​B{\lx@inpgf@ignorespaces XB} (f∘g)βŠ—X\scriptstyle{\lx@inpgf@ignorespaces(f\circ g)\otimes X}RA,X\scriptstyle{\lx@inpgf@ignorespaces R_{A,X}}fβŠ—X\scriptstyle{\lx@inpgf@ignorespaces f\otimes X}⇓Rf,X{\lx@inpgf@ignorespaces\Downarrow R_{f,X}}⇑id{\lx@inpgf@ignorespaces\Uparrow\textrm{id}}RC,X\scriptstyle{\lx@inpgf@ignorespaces R_{C,X}}gβŠ—X\scriptstyle{\lx@inpgf@ignorespaces g\otimes X}⇓Rg,X{\lx@inpgf@ignorespaces\Downarrow R_{g,X}}XβŠ—f\scriptstyle{\lx@inpgf@ignorespaces X\otimes f}⇑id{\lx@inpgf@ignorespaces\Uparrow\textrm{id}}XβŠ—g\scriptstyle{\lx@inpgf@ignorespaces X\otimes g}
0N89

Remark 11. Eventually this will imply that the braiding in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) satisfies (β†’β†’βŠ—βˆ™)(\to{\to}\otimes\bullet).

To show that the composite of morphisms in 𝒡⁑(π’ž)\mathcal{Z}(\mathcal{C}) is again a morphism, we have to check that (β†’βŠ—β†’)({\to}\otimes{\to}) and (β†’βŠ—(βˆ™βŠ—βˆ™))({\to}\otimes(\bullet\otimes\bullet)) commute. These can be seen by pasting together two diagrams of the form (β†’βŠ—β†’)({\to}\otimes{\to}) and (β†’βŠ—(βˆ™βŠ—βˆ™))({\to}\otimes(\bullet\otimes\bullet)), respectively.

Vertical and horizontal composition of 2-morphisms is defined the same as in π’ž\mathcal{C}; one can check that these composites again satisfy (β‡“βŠ—βˆ™)({\Downarrow}\otimes\bullet) by pasting together two diagrams of this form.

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