Braided monoidal category explained

In mathematics, a commutativity constraint

\gamma

on a monoidal category

l{C}

is a choice of isomorphism

\gammaA,B:ABBA

for each pair of objects A and B which form a "natural family." In particular, to have a commutativity constraint, one must have

AB\congBA

for all pairs of objects

A,B\inl{C}

.

A braided monoidal category is a monoidal category

l{C}

equipped with a braiding—that is, a commutativity constraint

\gamma

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

l{C}

along with the commutativity constraint

\gamma

to be called a braided monoidal category, the following hexagonal diagrams must commute for all objects

A,B,C\inl{C}

. Here

\alpha

is the associativity isomorphism coming from the monoidal structure on

l{C}

:

Properties

Coherence

It can be shown that the natural isomorphism

\gamma

along with the maps

\alpha,λ,\rho

coming from the monoidal structure on the category

l{C}

, satisfy various coherence conditions, which state that various compositions of structure maps are equal. In particular:

\gamma

on an

N

-fold tensor product factors through the braid group. In particular,

(\gammaB,CId)\circ(Id\gammaA,)\circ(\gammaA,BId)= (Id\gammaA,B)\circ(\gammaA,CId)\circ(Id\gammaB,)

as maps

ABCCBA

. 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

See main article: Symmetric monoidal category.

A braided monoidal category is called symmetric if

\gamma

also satisfies

\gammaB,A\circ\gammaA,B=Id

for all pairs of objects

A

and

B

. In this case the action of

\gamma

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

\gammaA,B:AB\toBA

with the following properties:

\gammaB,A\circ\gammaA,B=Id

for all pairs of objects

A

and

B

.

\gammaB\circ(\gammaA,BId)=\gammaA,\circ(Id\gammaB,C)

The first property shows us that

-1
\gamma
A,B

=\gammaB,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

\gamma(vw)=wv

.

Uq(ak{g})

is a braided monoidal category, where

\gamma

is constructed using the universal R-matrix. In fact, this example is a ribbon category as well.

Applications

References

Pressley, Andrew. "A guide to quantum groups". Cambridge University Press. 1995.

External links