Braided monoidal category

In mathematics, a commutativity constraint Ξ³ on a monoidal category π’ž is a choice of isomorphism Ξ³A,B:AβŠ—Bβ†’BβŠ—A for each pair of objects A and B which form a natural family. In particular, to have a commutativity constraint, one must have AβŠ—Bβ‰…BβŠ—A for all pairs of objects A,Bβˆˆπ’ž.

A braided monoidal category is a monoidal category π’ž equipped with a braidingβ€”that is, a commutativity constraint Ξ³ that satisfies axioms including the hexagon identities defined below. The term braided references the fact that the braid group plays an important role in the theory of braided monoidal categories. Partly for this reason, braided monoidal categories and other topics are related in the theory of knot invariants.

Alternatively, a braided monoidal category can be seen as a tricategory with one 0-cell and one 1-cell.

Braided monoidal categories were introduced by AndrΓ© Joyal and Ross Street in a 1986 preprint. A modified version of this paper was published in 1993.

The hexagon identities

For π’ž along with the commutativity constraint Ξ³ to be called a braided monoidal category, the following hexagonal diagrams must commute for all objects A,B,Cβˆˆπ’ž. Here Ξ± is the associativity isomorphism coming from the monoidal structure on π’ž:

,

Properties

Coherence

It can be shown that the natural isomorphism Ξ³ along with the maps Ξ±,Ξ»,ρ coming from the monoidal structure on the category π’ž, satisfy various coherence conditions, which state that various compositions of structure maps are equal. In particular:

  • The braiding commutes with the units. That is, the following diagram commutes:
  • The action of Ξ³ on an N-fold tensor product factors through the braid group. In particular,

(Ξ³B,CβŠ—Id)∘(IdβŠ—Ξ³A,C)∘(Ξ³A,BβŠ—Id)=(IdβŠ—Ξ³A,B)∘(Ξ³A,CβŠ—Id)∘(IdβŠ—Ξ³B,C)

as maps AβŠ—BβŠ—Cβ†’CβŠ—BβŠ—A. Here we have left out the associator maps.

Variations

There are several variants of braided monoidal categories that are used in various contexts. See, for example, the expository paper of Savage (2009) for an explanation of symmetric and coboundary monoidal categories, and the book by Chari and Pressley (1995) for ribbon categories.

Symmetric monoidal categories

A braided monoidal category is called symmetric if γ also satisfies γB,A∘γA,B=Id for all pairs of objects A and B. In this case the action of γ on an N-fold tensor product factors through the symmetric group.

Ribbon categories

A braided monoidal category is a ribbon category if it is rigid, and it may preserve quantum trace and co-quantum trace. Ribbon categories are particularly useful in constructing knot invariants.

Coboundary monoidal categories

A coboundary or β€œcactus” monoidal category is a monoidal category (C,βŠ—,Id) together with a family of natural isomorphisms Ξ³A,B:AβŠ—Bβ†’BβŠ—A with the following properties:

  • Ξ³B,A∘γA,B=Id for all pairs of objects A and B.
  • Ξ³BβŠ—A,C∘(Ξ³A,BβŠ—Id)=Ξ³A,CβŠ—B∘(IdβŠ—Ξ³B,C)

The first property shows us that Ξ³A,Bβˆ’1=Ξ³B,A, thus allowing us to omit the analog to the second defining diagram of a braided monoidal category and ignore the associator maps as implied.

Examples

Applications