Ribbon category

From testwiki
Jump to navigation Jump to search

In mathematics, a ribbon category, also called a tortile category, is a particular type of braided monoidal category.

Definition

A monoidal category π’ž is, loosely speaking, a category equipped with a notion resembling the tensor product (of vector spaces, say). That is, for any two objects C1,C2π’ž, there is an object C1C2π’ž. The assignment C1,C2C1C2 is supposed to be functorial and needs to require a number of further properties such as a unit object 1 and an associativity isomorphism. Such a category is called braided if there are isomorphisms

cC1,C2:C1C2C2C1.

A braided monoidal category is called a ribbon category if the category is left rigid and has a family of twists. The former means that for each object C there is another object (called the left dual), C*, with maps

1CC*,C*C1

such that the compositions

C*C*1C*(CC*)(C*C)C*1C*C*

equals the identity of C*, and similarly with C. The twists are maps

Cπ’ž, θC:CC

such that

θC1C2=cC2,C1cC1,C2(θC1θC2)θ1=idθC*=(θC)*.

To be a ribbon category, the duals have to be thus compatible with the braiding and the twists.

Concrete Example

Consider the category π…ππ•πžπœπ­(β„‚) of finite-dimensional vector spaces over β„‚. Suppose that C is such a vector space, spanned by the basis vectors e1^,e2^,,en^. We assign to C the dual object C spanned by the basis vectors e^1,e^2,,e^n. Then let us define

: CC1e^iej^{1i=j0ij

and its dual

kIn:1CCkki=1nei^e^i=(k000k0k)

(which largely amounts to assigning a given ei^ the dual e^i).

Then indeed we find that (for example)

e^ie^i1Ine^ij=1nej^e^jj=1n(e^iej^)e^jj=1n{1e^ji=j0e^jij=1e^ie^i

and similarly for ei^. Since this proof applies to any finite-dimensional vector space, we have shown that our structure over π…ππ•πžπœπ­ defines a (left) rigid monoidal category.

Then, we must define braids and twists in such a way that they are compatible. In this case, this largely makes one determined given the other on the reals. For example, if we take the trivial braiding

cC1,C2:C1C2C2C1cC1,C2(a,b)(b,a)

then cC1,C2cC2,C1=idC1C2, so our twist must obey θC1C2=θC1θC2. In other words it must operate elementwise across tensor products. But any object Cπ…ππ•πžπœπ­ can be written in the form C=i=1n1 for some n, θC=i=1nθ1=i=1nid=idC, so our twists must also be trivial.

On the other hand, we can introduce any nonzero multiplicative factor into the above braiding rule without breaking isomorphism (at least in β„‚). Let us for example take the braiding

cC1,C2:C1C2C2C1cC1,C2(a,b)i(b,a)

Then cC1,C2cC2,C1=idC1C2. Since θ1=id, then θ11=id11; by induction, if C is n-dimensional, then θC=(1)n+1idC.

Other Examples

The name ribbon category is motivated by a graphical depiction of morphisms.[2]

Variant

A strongly ribbon category is a ribbon category C equipped with a dagger structure such that the functor †: Cop β†’ C coherently preserves the ribbon structure.

References

Template:Reflist Template:Refbegin

Template:Refend