5. Conclusions
While we have made some progress in understanding monoidal 2-categories and braided monoidal 2-categories, it seems clear that a truly elegant, not to mention correct, treatment of these concepts requires a better understanding of 3-categories and 4-categories. In this spirit, we would like to conclude with a list of some issues that are not yet resolved.
1) We have not included in our definition of semistrict braided monoidal 2-category any axioms involving the unit object (other than those appearing in the definition of semistrict monoidal 2-category). In the case of a strict braided monoidal category, where for any object , there are theorems saying that . In the 2-categorical setting the proof for this theorem turns into an isomorphism: . If we assumed these isomorphisms were equations and in addition that for all 1-morphisms , then we could conclude that any braided monoidal category with one object gives a symmetric monoidal category, as expected.
2) In the center as we have defined it, the 2-morphisms are all identity 2-morphisms, while the 2-morphisms are not. This points to a curious assymetry in our definition of the center. One could equally well have defined the center so that was always the identity, and not , but the question is: why is any ‘symmetry-breaking’ required? It may be relevant that Gordon, Power and Street’s proof [17] that any tricategory is triequivalent to a semistrict 3-category involves a ‘symmetry-breaking’ maneuver. This occurs because the definition of semistrict 3-category has an inherent asymmetry, in that given and , the 2-morphism goes from to rather than vice versa. Perhaps, therefore, the center construction involves no asymmetries at the level of weak -categories, but an arbitrary symmetry breaking is needed to translate it into the framework of semistrict -categories.
Because the strong braided monoidal 2-functor of Theorem 18 is injective on objects, morphisms and 2-morphisms, this result thus serves as a strictification theorem asserting that any semistrict braided monoidal 2-category is equivalent (in a precise sense) to one for which is trivial. Indeed, one may prove this strictification in other ways as well. One can also, of course, show that any any semistrict braided monoidal 2-category is equivalent in the same sense to one for which is trivial.
Acknowledgements
Many of the basic ideas behind this paper were developed in collaboration with James Dolan. We would also like to thank Lawrence Breen, Misha Kapranov, John Power, James Stasheff and Ross Street for useful discussions and correspondence. J.B. is grateful to the Mathematical Institute of the University of Munich for their hospitality while some of this work was done. We thank Joe Moeller and especially Jason Erbele for typesetting this new version of the paper in 2019.
Original source: arXiv:q-alg/9511013v2