The Unapologetic Mathematician

Mathematics for the interested outsider

Limits are Adjoints

When considering limits, we started by talking about the diagonal functor \Delta:\mathcal{C}\rightarrow\mathcal{C}^\mathcal{J}. This assigns to an object C\in\mathcal{C} the “constant” functor \Delta(C):\mathcal{J}\rightarrow\mathcal{C} that sends each object of \mathcal{J} to C and each morphism of \mathcal{J} to 1_C.

Then towards the end of our treatment of limits we showed that taking limits is a functor. That is, if each functor F from \mathcal{J} to \mathcal{C} has a limit \varprojlim_\mathcal{J}F, then \varprojlim_\mathcal{J} is a functor from \mathcal{C}^\mathcal{J} to \mathcal{C}. Dually, if every such functor has a colimit \varinjlim_\mathcal{J}F, then \varinjlim_\mathcal{J}:\mathcal{C}^\mathcal{J}\rightarrow\mathcal{C} is also a functor.

And now we can fit these into the language of adjoints: when it exists, the limit functor is right adjoint to the diagonal functor. Dually, the colimit functor is left adjoint to the diagonal functor when it exists. I’ll handle directly the case of colimits, but the limit statements and proofs are straightforward dualizations.

So we definitely have a well-defined functor \Delta:\mathcal{C}\rightarrow\mathcal{C}^\mathcal{J}. By assumption we have for each functor F\in\mathcal{C}^\mathcal{J} an object \varinjlim_\mathcal{J}F\in\mathcal{C}. If we look at the third entry in our list of ways to specify an adjunction, all we need now is a universal arrow \eta_F:F\rightarrow\Delta(\varprojlim_\mathcal{J}F). But this is exactly how we defined limits! Now the machinery we set up yesterday takes over and promotes this collection of universal arrows into the unit of an adjunction \varinjlim_\mathcal{J}\dashv\Delta:\mathcal{C}^\mathcal{J}\rightarrow\mathcal{C}.

For thoroughness’ sake: the unit of this adjunction \eta_F:F\rightarrow\Delta(\varinjlim_\mathcal{J}F) is the colimiting cocone, considered as a natural transformation from F to the constant functor on the colimiting object. The counit of this adjunction \epsilon_C:\varinjlim_\mathcal{J}\Delta(C)\rightarrow C is just the identity arrow on C because the colimit of the constant functor is just the constant value. The “quasi-inverse” conditions state that \Delta(1_C)\circ\eta_{\Delta(C)} is the identity natural isomorphism on \Delta, and that 1_{\varinjlim_\mathcal{J}F}\circ\varinjlim_\mathcal{J}\eta_F is the identity natural isomorphism on \varinjlim_\mathcal{J}, both of which are readily checked.

And our original definition of an adjoint here reads that \hom_\mathcal{C}(\varinjlim_\mathcal{J}F,C)\cong\hom_{\mathcal{C}^\mathcal{J}}(F,\Delta(C)). That is, for each cocone to C on F (one of the natural transformations on the right) there is a unique arrow from the colimiting object of F to C.


July 20, 2007 Posted by | Category theory | 2 Comments

Adjoints and universality

Now we have the notion of an adjunction, along with its unit and counit. It’s time to start tying them back into universality.

The unit of an adjunction picks out, for each object C, an arrow \eta_C:C\rightarrow G(F(C)). This arrow is an object in the comma category (C\downarrow G). And, amazingly enough, it’s an initial object in that category. Given any other object D\in\mathcal{D} and arrow d:C\rightarrow G(D) we need to find an arrow f:F(C)\rightarrow D in \mathcal{D} so that d=G(f)\circ\eta_C. Since d\in\hom_\mathcal{C}(C,G(D)) the obvious guess is f=\Phi_{C,D}^{-1}(d)=\epsilon_D\circ F(d). Then we can calculate:
G(\epsilon_D\circ F(d))\circ\eta_C=G(\epsilon_D)\circ G(F(d))\circ\eta_C=G(\epsilon_D)\circ\eta_{G(D)}\circ d=d
where the second equality uses the naturality of \eta and the third uses the “quasi-inverse” condition we discussed yesterday.

So, an adjunction means that for each and every object C\in\mathcal{C} the component of the unit \eta_C gives a universal arrow from C to G. Dually, for every object D\in\mathcal{D} the component of the counit \epsilon_D gives a couniversal arrow from F to D.

On the other hand, let’s say we start out with a functor G:\mathcal{D}\rightarrow\mathcal{C} and for each C\in\mathcal{C} an object F_O(C) and an arrow \eta_C:C\rightarrow G(F_O(C)) that is universal from C to G. Then given an arrow c:C\rightarrow C' we can build an arrow \eta_{C'}\circ c:C\rightarrow G(F_O(C')). By the universality of \eta_C there is then a unique arrow F_M(c):F_O(C)\rightarrow F_O(C') so that \eta_{C'}\circ c=G(F_M(c))\circ\eta_C. It’s straightforward now to show that F_O and F_M are the object and morphism functions of a functor F:\mathcal{C}\rightarrow\mathcal{D}, and that \eta:1_\mathcal{C}\rightarrow G\circ F is a natural transformation.

Now, say we have functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and a natural transformation \eta:1_\mathcal{C}\rightarrow G\circ F so that each \eta_C:C\rightarrow G(F(C)) is universal from C to G. Given an arrow f:C\rightarrow G(D), there is (by universality of \eta_C) a unique arrow g:F(C)\rightarrow D so that f=G(g)\circ\eta_C. This sets up a bijection \Phi_{C,D}:\hom_\mathcal{D}(F(C),D)\rightarrow\hom_\mathcal{C}(C,G(D)) defined by \Phi_{C,D}(g)=G(g)\circ\eta_C. This construction is natural in C because \eta_C is, and it’s natural in D because G is a functor. And so this data is enough to define an adjunction F\dashv G:\mathcal{C}\rightarrow\mathcal{D}.

Dually, we can start with a functor F:\mathcal{C}\rightarrow\mathcal{D} and for each D\in\mathcal{D} an object G_O(D)\in\mathcal{C} and an arrow \epsilon_D:F(G_O(D))\rightarrow D universal from F to D. Then we can build G_O up into a functor G:\mathcal{D}\rightarrow\mathcal{C} and \epsilon up into a natural transformation with each component a couniversal arrow. And this is enough to define an adjunction F\dashv G:\mathcal{C}\rightarrow\mathcal{D}.

And, of course, we know that giving a universal arrow \eta_C from C to G is equivalent to giving a representation of the functor \hom_\mathcal{C}(C,G(\underline{\hphantom{X}})):\mathcal{D}\rightarrow\mathbf{Set}, and dually.

So we have quite a long list of ways to specify an adjunction

  • Functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and a natural isomorphism \Phi_{C,D}:\hom_\mathcal{D}(F(C),D)\rightarrow\hom_\mathcal{C}(C,G(D))
  • Functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and natural transformations \eta_C:C\rightarrow G(F(C)) and \epsilon_D:F(G(D))\rightarrow D satisfying (1_G\circ\epsilon)\cdot(\eta\circ1_G)=1_G and (\epsilon\circ1_F)\cdot(1_F\circ\eta)=1_F
  • A functor G:\mathcal{D}\rightarrow\mathcal{C} and for each C\in\mathcal{C} an object F_O(C)\in\mathcal{D} and a universal arrow \eta_C:C\rightarrow G(F_O(C))
  • A functor F:\mathcal{C}\rightarrow\mathcal{D} and for each D\in\mathcal{D} an object G_O(D)\in\mathcal{C} and a couniversal arrow \epsilon_D:F(G_O(D))\rightarrow D
  • A functor G:\mathcal{D}\rightarrow\mathcal{C} and for each C\in\mathcal{C} a representation \phi_C of the functor \hom_\mathcal{C}(C,G(\underline{\hphantom{X}})):\mathcal{D}\rightarrow\mathbf{Set}
  • A functor F:\mathcal{C}\rightarrow\mathcal{D} and for each D\in\mathcal{D} a representation \phi_D of the functor \hom_\mathcal{D}(F(\underline{\hphantom{X}}),D):\mathcal{C}\rightarrow\mathbf{Set}
  • Functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and a natural transformation \eta:1_\mathcal{C}\rightarrow G\circ F so that each component \eta_C is universal from C to G
  • Functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and a natural transformation \epsilon:F\circ G\rightarrow1_\mathcal{D} so that each component \epsilon_D is universal from F to D

July 19, 2007 Posted by | Category theory | 2 Comments

More on units and counits

Last time we took an adjunction and came up with two natural transformations, weakened versions of the natural isomorphisms defining an equivalence. Today we’ll see how to go back the other way.

So let’s say we have an adjunction F\dashv G:\mathcal{C}\rightarrow\mathcal{D} given by natural isomorphism \Phi_{C,D}:\hom_\mathcal{D}(F(C),D)\rightarrow\hom_\mathcal{C}(C,G(D)). Remember that we defined the unit and counit by \eta_C:\Phi_{C,F(C)}(1_{F(C)}) and \epsilon_D=\Phi_{G(D),D}^{-1}(1_{G(D)}). We can take either one of these and reverse-engineer it. For instance, given an arrow f:F(C)\rightarrow D in \mathcal{D} we can calculate
so once we know the unit of the adjunction we can calculate \Phi from it. Notice how we use the naturality of \Phi in the second equality.

Dually, we can determine \Phi^{-1} in terms of the counit. Given g:C\rightarrow G(D) in \mathcal{C}, we calculate:
\Phi_{C,D}^{-1}(g)=\Phi_{C,D}^{-1}(1_{G(D)}\circ g)=\Phi_{G(D),D}^{-1}(1_{G(D)})\circ F(g)=\epsilon_D\circ F(g)
so we can also determine the natural isomorphism of hom-sets in terms of the counit.

Of course, since we can determine the same isomorphism (technically the isomorphism and its inverse) from either the unit or the counit, they must be related. So what do these equations really tell us?

For this we have to go back to the way we compose natural transformations. The obvious way is where we have natural transformations \phi:F\rightarrow G and \theta:G\rightarrow H between three functors from \mathcal{C} to \mathcal{D}. We put them together to get (\theta\cdot\phi)_C=\theta_C\circ\phi_C:F\rightarrow H.

Less obviously, we can consider functors F_1 and F_2 from \mathcal{C} to \mathcal{D}, functors G_1 and G_2 from \mathcal{D} to \mathcal{E}, and natural transformations \phi:F_1\rightarrow F_2 and \theta:G_1\rightarrow G_2. We can put these together to get \theta\circ\phi:F_1\circ G_1\rightarrow F_2\circ G_2, defined by \theta_{F_2(C)}\circ G_1(\phi_C) or G_2(\phi_C)\circ\theta_{F_1(C)} (exercise: show that these two composites are equal).

Now what we need here is this “horizontal” composite. Let’s go back to the adjunction and take the natural transformations \eta:1_\mathcal{C}\rightarrow G\circ F and 1_G:G\rightarrow G. The components of their horizontal composite \eta\circ1_G:G\rightarrow G\circ F\circ G is then given by \eta_{G(D)}. Similarly, if we take the natural transformations 1_G and \epsilon:F\circ G\rightarrow1_\mathcal{D}, their horizontal composite has components given by G(\epsilon_D). Now the “vertical” composite of these two (1_G\circ\epsilon)\cdot(\eta\circ1_G) has components G(\epsilon_D)\circ\eta_{G(D)}. And the above formula for the adjunction isomorphism in terms of the unit tells us that this is \Phi_{G(D),D}(\epsilon_D)=\Phi_{G(D),D}(\Phi_{G(D),D}^{-1}(1_{G(D)}))=1_{G(D)}.

To put it at a bit of a higher level, if we start with the functor G, use the unit to turn it into the functor G\circ F\circ G, then use the counit to move back to G, the composite natural transformation is just the identity transformation on G. Similarly, we can show that the composite (\epsilon\circ1_F)\cdot(1_F\circ\eta) taking F to F\circ G\circ F and back to F is the identity transformation on F.

Inherent in this is also the converse statement. If we have natural transformations \eta:1_\mathcal{C}\rightarrow G\circ F and \epsilon:F\circ G\rightarrow1_\mathcal{D} satisfying these two identities, then we can use the above formulae to define a natural isomorphism \phi in terms of \eta and its inverse in terms of \epsilon. Thus an adjunction is determined by a unit and a counit satisfying these “quasi-inverse” relations.

If you’re up to it, try to see where we’ve seen these quasi-inverse relations before in a completely different context. I’ll be coming back to this later.

July 18, 2007 Posted by | Category theory | 1 Comment

The Unit and Counit of an Adjunction

Let’s say we have an adjunction F\dashv G:\mathcal{C}\rightarrow\mathcal{D}. That is, functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and a natural isomorphism \Phi_{C,D}:\hom_\mathcal{D}(F(C),D)\rightarrow\hom_\mathcal{C}(C,G(D)).

Last time I drew an analogy between equivalences and adjunctions. In the case of an equivalence, we have natural isomorphisms \eta:1_\mathcal{C}\rightarrow G\circ F and \epsilon:F\circ G\rightarrow1_\mathcal{D}. This presentation seems oddly asymmetric, and now we’ll see why by moving these structures to the case of an adjunction.

So let’s set D=F(C') like we did to show that an equivalence is an adjunction. The natural isomorphism is now \Phi_{C,F(C')}:\hom_\mathcal{D}(F(C),F(C'))\rightarrow\hom_\mathcal{C}(C,G(F(C')). Now usually this doesn’t give us much, but there’s one of these hom-sets that we know has a morphism in it: if C'=C then 1_{F(C)}\in\hom_\mathcal{D}(F(C),F(C)). Then \Phi_{C,F(C)}(1_{F(C)}) is an arrow in \mathcal{C} from C to \left[G\circ F\right](C).

We’ll call this arrow \eta_C. Doing this for every object C\in\mathcal{C} gives us all the components of a natural transformation \eta:1_\mathcal{C}\rightarrow G\circ F. For this, we need to show the naturality condition G(F(f))\circ\eta_C=\eta_{C'}\circ f for each arrow f:C\rightarrow C'. This is a straightforward calculation:
\Phi_{C,F(C')}(1_{F(C')}\circ F(f))=\Phi_{C',F(C')}(1_{F(C')})\circ f=\eta_{C'}\circ f
using the definition of \eta_C and the naturality of \Phi.

This natural isomorphism \eta is called the “unit” of the adjunction F\dashv G. Dually we can set C=G(D) and extract an arrow \eta_D=\Phi_{G(D),D}^{-1}(1_{G(D)}) for each object D\in\mathcal{D} and assemble them into a natural transformation \eta:F\circ G\rightarrow1_\mathcal{D} called the “counit”. If both of these natural transformations are natural isomorphisms, then we have an equivalence.

For a particular example, let’s look at this in the case of the free-monoid functor M as the left adjoint to the underlying-set monoid U. The unit will give an arrow \eta_S:S\rightarrow U(M(S)), which here is just the inclusion of the generators (elements of S) as elements of the underlying set of the free monoid. The counit, on the other hand, will give an arrow \epsilon_N:M(U(N))\rightarrow N. That is, we take all elements of the monoid N and use them as generators of a new free monoid — write out “words” where each “letter” is a whole element of N. Then to take such a word and send it to an element of N, we just take all the letters and multiply them together as elements of N. Since we gave a description of \Phi last time for this case, it’s instructive to sit down and work through the definitions of \eta_S=\Phi_{S,M(S)} and \epsilon=\Phi_{U(N),N}^{-1} to show that they do indeed give these arrows.

July 17, 2007 Posted by | Category theory | 11 Comments

Adjoint functors

Today I return to the discussion of universals, limits, representability, and related topics. The last piece of this puzzle is the notion of an adjunction. I’ll give a definition and examples today and work out properties later.

An adjunction between categories \mathcal{C} and \mathcal{D} consists of a pair of functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} and a natural isomorphism \Phi_{X,Y}:\hom_\mathcal{D}(F(X),Y)\rightarrow\hom_\mathcal{C}(X,G(Y)). Notice that the functors on either side of \Phi go from \mathcal{C}^\mathrm{op}\times\mathcal{D} to \mathbf{Set}, so each component \Phi_{X,Y} is a bijection of sets. We say that F is “left adjoint” to G, and conversely that G is “right adjoint” to F, and we write F\dashv G.

Now, we have been seeing these things all along our trip so far, but without mentioning them as such. For instance, we have all the “free” constructions:

and maybe more that I’ve mentioned, but don’t recall.

These all have a very similar form in their definitions. For instance, the free monoid M(S) on a set S is characterized by the following universal property: every function f from S into the underlying set of a monoid N extends uniquely to a monoid homomorphism \bar{f}:M(S)\rightarrow N. If we write the underlying set of N as U(N), we easily see that U:\mathbf{Mon}\rightarrow\mathbf{Set} is a functor. The condition then is that every element of the hom-set \hom_\mathbf{Set}(S,U(N)) corresponds to exactly one element of the hom-set \hom_\mathbf{Mon}(M(S),N), and every monoid homomorphism restricts to a function on S. That is, for every set S and monoid N we have an isomorphism of sets \hom_\mathbf{Mon}(M(S),N)\cong\hom_\mathbf{Set}(S,U(N)).

Now, given a function from a set S_1 to a set S_2 we can consider S_2 to be a subset of the free monoid on itself, giving a function f:S_1\rightarrow U(M(S_2)). This extends to a unique monoid homomorphism M(f):M(S_1)\rightarrow M(S_2). This construction preserves identities and compositions, making M into a functor from \mathbf{Set} to \mathbf{Mon}.

If we have a function f:S_1\rightarrow S_2 and a monoid homomorphism m:N_1\rightarrow N_2 then we can build functions \hom_\mathbf{Mon}(M(f),m):\hom_\mathbf{Mon}(M(S_2),N_1)\rightarrow\hom_\mathbf{Mon}(M(S_1),N_2) and \hom_\mathbf{Set}(f,U(m)):\hom_\mathbf{Set}(S_2,U(N_1))\rightarrow\hom_\mathbf{Set}(S_1,U(N_2)). The isomorphisms \hom_\mathbf{Mon}(M(S_2),N_1)\cong\hom_\mathbf{Set}(S_2,U(N_1)) and \hom_\mathbf{Mon}(M(S_1),N_2)\cong\hom_\mathbf{Set}(S_1,U(N_2)) commute with these arrows, so they form the components of a natural isomorphism between the two functors. This proves that the free monoid functor M:\mathbf{Set}\rightarrow\mathbf{Mon} is a left adjoint to the forgetful functor U:\mathbf{Mon}\rightarrow\mathbf{Set}.

All the other examples listed above go exactly the same way, giving left adjoints to all the forgetful functors.

As a slightly different example, we have a forgetful functor U:\mathbf{Ab}\rightarrow\mathbf{Grp} that takes an abelian group and “forgets” that it’s abelian, leaving just a group. Conversely, we can take any group G and take the quotient by its commutator subgroup \left[G,G\right] to get an abelian group. This satisfies the property that for any group homomorphism f:G\rightarrow U(A) from G to an abelian group A (considered as just a group) there is a unique homomorphism of abelian groups \bar{f}:G/[G,G]\rightarrow A. Thus it turns out that “abelianization” of a group is left adjoint to the forgetful functor from abelian groups to groups.

There are more explicit examples we’ve seen, but I’ll leave them to illustrate some particular properties of adjoints. Take note, though, that not all adjunctions involve forgetful functors like these examples have.

An adjunction between two categories can be seen as a weaker version of an equivalence. An equivalence given by functors F:\mathcal{C}\rightarrow\mathcal{D} and G:\mathcal{D}\rightarrow\mathcal{C} tells us that both F and G are fully faithful, so \hom_\mathcal{C}(C',C)\cong\hom_\mathcal{D}(F(C'),F(C)). Now let’s put C'=G(D) to find that \hom_\mathcal{C}(G(D),C)\cong\hom_\mathcal{D}(F(G(D)),F(C))\cong\hom_\mathcal{D}(D,F(C)), where the last isomorphism uses the natural isomorphism F\circ G\rightarrow1_\mathcal{D}. So every equivalence is an adjunction.

July 16, 2007 Posted by | Category theory | 17 Comments

Diagrammatics for braided monoidal categories with duals

I’m exhausted from spending all morning and much of the afternoon purchasing a new (to me) car. As a result, I’ll just forward you to the excellent notes that Miguel Carrión Alvarez took in John Baez’ seminar on quantum gravity back in fall and winter of 2000-1.

Specifically, pay attention to the diagrammatics. He’s talking mostly about finite-dimensional vector spaces over the field of complex numbers, but most everything applies to a general (braided) monoidal category (with duals). Also, he draws his diagrams from top to bottom, while (as I keep reminding you) I write mine from bottom to top to make it easier to read off the algebraic notation.

We’ve already seen some of the basic pieces as braid, Temperley-Lieb, and tangle diagrams, but here each arc in the diagram carries a label from the objects of a category, and usually an arrow. We can move to a dual object by reversing the arrow or changing the label.

Morphisms can be put in boxes, with the incoming object in the bottom and the outgoing one at the top. The naturality for the dual morphisms basically says we can slide a morphism up over a cup or down under a cap to get its dual. Also, often a morphism will have a number of incoming or outgoing strands, which means that the incoming object is the tensor product of the objects on the incoming strands.

A braiding is written as a crossing (lower-left over upper-right), and the inverse of the braiding is written as the other kind of crossing. Naturality means that we can pull a morphism along a strand through a crossing.

There’s a lot more to the notes than just the diagrammatics, though. If you’re up to it, I highly recommend giving it all a look. If not, just look for the pictures and read the sections around them for the explanations. I’ll be back on Monday with more exposition.

July 14, 2007 Posted by | Category theory | Leave a comment

Braided Monoidal Categories with Duals

As one last example along these lines, let’s throw all these structures in together. We start with a monoidal category, and we want it to have both a braiding and duals. Naturally, they’ll have to play well together.

Now I’ll want to go back and tweak one of the things I said about duals. I insisted that the duality functor satisfy (M^*)^*\cong M, but we can actually weaken it slightly. What I defined before we can call a “right dual”, since it provides a pairing M\otimes M^*\rightarrow\mathbf{1}. Instead of insisting that (M^*)^*\cong M, we can put in “left duals” by hand. This will be another contravariant functor M\rightarrow {}^*M, and arrows \overline{\epsilon_M}:{}^*M\otimes M\rightarrow\mathbf{1} and \overline{\eta_M}:\mathbf{1}\rightarrow M\otimes{}^*M satisfying the “mirror images” of the identities for \eta and \epsilon.

What does this all have to do with a braiding? Well we can use a braiding to turn a left dual into a right dual and vice versa. Let’s say we’ve got (right) dual maps \eta_M:\mathbf{1}\rightarrow M^*\otimes M and \epsilon_M:M\otimes M^*\rightarrow\mathbf{1}, along with braiding maps \beta_{M,N}:M\otimes N\rightarrow N\otimes M. Now we can define left dual maps by \overline{\eta_M}[\beta_{M,M^*}^{-1}\circ\eta_M]:\mathbf{1}\rightarrow M\otimes M^* and \overline{\epsilon_M}[\epsilon_M\circ\beta_{M^*,M}]:M^*\otimes M\rightarrow\mathbf{1}. This will automatically satisfy the left dual axioms. You can either try to show this now using the algebra or hold off a bit until we have a better tool to attack such identities.

Okay, so a braided monoidal category with duals has a braiding and has right duals. Since we define left duals in terms of these structures they’ll automatically play well together. From these we can further build a morphism for each object called the “balancing”. It’s defined by \theta_M=(1_M\otimes\epsilon_M)\circ(\beta_{M,M}\otimes1_M)\circ(1_M\otimes\overline{\eta_M}). We call an object M “unframed” if \theta_M=1_M.

I know that there’s a lot of stuff here and it’s hard to remember it all. We need a better way to think about these things. Just like we had for braided categories and categories with duals, we have a diagrammatic rendering of the free braided monoidal category with duals on one object.

First I’ll deal with the free braided monoidal category with duals on one self-dual, unframed object. That is, we start with one object and say it’s its own (left and right) dual and for whom the balancing is the identity. Then we build all the other objects as tensor powers of this one. Then we throw in the braiding morphisms and the duality morphisms and insist they satisfy all the relevant relations. And what we get is the category \mathcal{T}ang of tangles. Here’s an example:
Sample Tangle

As usual we read this from bottom to top. Notice that this means we can read off the algebraic notation just by going top to bottom, left to right, to get (\beta_{1,1}\otimes\epsilon_1)\circ(1_1\otimes\beta_1\otimes1_1)\circ(\beta_1\otimes\eta_1):2\rightarrow2. The unframed condition tells us that we can untwist that loop to the right and still have the same tangle.

What if we didn’t ask that our generator be unframed? Then we get the category \mathcal{F}r\mathcal{T}ang of framed tangles, which differs only in that we can’t untwist loops like the one above. It’s like working with knot diagrams where all we can use are Reidemeister moves 2 and 3.

What if our generator is unframed, but isn’t self-dual? Then we get the category \mathcal{OT}ang of oriented tangles. All we do now is label each strand of our tangle diagram with an orientation, like we did in the case of oriented Temperley-Lieb diagrams.

What if our generator is neither unframed nor self-dual? Then we get the category \mathcal{F}r\mathcal{OT}ang of framed, oriented tangles.

Each of these leads to a diagrammatic way of looking at the respective sorts of categories. For example, go back and take the definition of left duals in terms of right duals and write it out as a diagram of framed, oriented tangles. Then write down the condition it must satisfy as an equation between framed oriented tangles. Finally, verify that it satisfies the equation by finding a sequence of Reidemeister moves 2 and 3 from one side to the other (and invoke the definition of right duals at some point).

The category of tangles is very simply described in combinatorial and algebraic terms, but you might not yet have noticed how general it is. To illustrate this, I give with no further comment an example of a tangle from {}0 to {}0:
Tangle from 0 to 0

July 13, 2007 Posted by | Category theory, Knot theory | 2 Comments

The Temperley-Lieb Category

Okay, after last week’s shake-ups I’m ready to get back into the swing of things. I mentioned yesterday something called the “Temperley-Lieb Category”, and it just so happens we’re right on schedule to explain it properly.

We’ve seen the category of braids and how the braided coherence theorem makes it the “free braided monoidal category on one object”. That is, it has exactly the structure needed for a braided monoidal category — no more, no less — and if we pick any object in another such category \mathcal{C} we get a unique functor from \mathcal{B}raid to \mathcal{C}.

So of course we want the same sort of thing for monoidal categories with duals. We’ll even draw the same sorts of pictures. A point on a horizontal line will be our generating object, but we also need a dual object. So specifically we’ll think of the object as being “going up through the point” and the dual as “going down through the point”. Then we can draw cups and caps to connect an upward line and a downward line and interpret it as a duality map. Notice, though, that we can’t make any curves cross each other because we have no braiding! Here’s an example of such a Temperley-Lieb diagram:
Oriented Temperley-Lieb diagram

Again, we read this from bottom to top, and from left to right. On the bottom line we have a downward line followed by an upward line, which means we start at the object X^*\otimes X. Then we pass through a cap, which corresponds to the transformation \epsilon_{X^*}. Then we go through a cup (\eta_X^*) to get to X\otimes X^*, and another cup to get to X\otimes X^*\otimes X\otimes X^*. A cap in the middle (\epsilon_{X^*}) is followed by a cup (\eta_X), and then another pair of caps (\epsilon_X\otimes\epsilon_X). Then we have a cup \eta_{X^*} and another \eta_X to end up at X\otimes X^*\otimes X\otimes X^*.

We could simplify this a bit by cancelling two cup/cap pairs using the equations we imposed on the natural transformations \eta and \epsilon. In fact, this is probably a much easier way to remember what those equations mean. The equations tell us in algebraic terms that we can cancel off a neighboring cup and cap, while the topology of diagram says that we can straighten out a zig-zag.

Incidentally, one feature that’s missing from this diagram is that it’s entirely possible to have an arc (pointing either way) start at the bottom of the diagram and leave at the top.

Now if we have any category \mathcal{C} with duals and an object C we can build a unique functor from the category \mathcal{OTL} of oriented Temperley-Lieb diagrams to \mathcal{C} sending the upwards-oriented line to the object C. It sends the above diagram (for example) to the morphism

C^*\otimes C\rightarrow C\otimes C^*\otimes C\otimes C^*.

Another useful category is the free monoidal category with duals on a single self-dual object. This is the Temperley-Lieb category \mathcal{TL} which looks just the same as \mathcal{OTL} with one crucial difference: since the object X is its own dual, we can’t tell the difference between the two different directions a line could go. Up and down are the same thing. In the algebra this might seem a little odd, but in the diagram all it means is we get to drop the little arrows that tell us which way to go.

And now if we have any category \mathcal{C} with duals and any self-dual object C=C^* we have a unique functor from \mathcal{TL} to \mathcal{C} sending the strand to \mathcal{C}. This is how Temperley-Lieb diagrams are turned into (categorified) \mathfrak{sl}_2 representations in Khovanov homology.

July 12, 2007 Posted by | Category theory, Knot theory | 7 Comments

New Links

As part of today’s maintenance, I’m going through some weblogs I’d been wanting to catch up on and possibly add to the sidebar. Two for now: The Everything Seminar, which does for Cornell what Secret Blogging Seminar does for Berkeley, and Zero Divides, documenting the life of an aspiring mathematician from all the way back in undergrad life.

TES is very new, and has plunged in with series about graph theory and some homological algebra. On the other hand, ZD has been around for a while. Unfortunately, the author (“Zero”? “Divides”? “ZiDane”?) seems to have configured comments very restrictively, so you’ll just have to send your encouragement through the æther. Or maybe she’ll see this pingback and realize that nobody can comment but those she’s specifically authorized to do so.

July 11, 2007 Posted by | Uncategorized | Leave a comment

What is Knot Homology?

So I’m back from a week in Faro, Portugal, talking about various things surrounding the ideas of “knot homology”. So what is it? Well, this will be a bit of a loose treatment of the subject, and may not be completely on the mark. I like David Corfield’s idea that a mathematician is a sort of storyteller, and I’m not about to let mere history get in the way of a good história. Besides, I’ll get to most of the details in my main line sooner or later.

First I should mention the Bracket polynomial and the Jones polynomial. Jones was studying a certain kind of algebra when he realized that the defining relations for these algebras were very much like those of the braid groups. In fact, he was quickly able to use this similarity to assign a Laurent polynomial — one which allows negative powers of the variable — to every knot diagram that didn’t change when two diagrams differed by a Reidemeister move. That is, it was a new invariant of knots.

The Jones polynomial came out of nowhere, from the perspective of the day’s knot theorists. And it set the whole field on its ear. From my perspective looking back, there’s a huge schism in knot theory between those who primarily study the geometry and the “classical topology” of the situation and those who primarily study the algebra, combinatorics, and the rising field of “quantum topology”. To be sure there are bridges between the two, some of which I’ll mention later. But the upshot was that the Jones polynomial showed a whole new way of looking at knots and invariants.

Immediately in its aftermath a huge number of interpretations and generalizations poured forth. One of the most influential was Louis Kauffman’s “state-sum” model: the Bracket. This is an invariant of regular isotopy instead of ambient isotopy, which basically means we throw out Reidemeister I moves. Meanwhile, I glossed over above that the Jones polynomial actually applies to oriented links, where there’s a little arrow saying “go this way around the loop”. This is a subtle distinction between the Bracket and the Jones polynomial that many authors steamroll over, but I find it important for my own reasons.

Anyhow, the Bracket also assigns a Laurent polynomial to every diagram in a way that’s invariant under an apropriate collection of moves. It does this by taking each crossing and “splitting” it in two ways — turning an incoming strand to the left or the right rather than connecting straight across. For a link diagram with n crossings there are now 2^n “states” of the diagram. Now we assign each diagram a “weight” and just add up the weights for all the different states. Thus: “state-sum”. If we choose the rule for weighting states correctly we can make the resulting polynomial into an invariant.

So now we flash forward from the mid-’80s to the late ’90s. Mikhail Khovanov, as a student of Igor Frenkel at Yale, becomes interested in the nascent field of categorification. Particularly, he was interested in categorifying the Lie algebra \mathfrak{sl}_2. That is, he needed to find a category and functors from that category to itself that satisfied certain relations analogous to the defining relations of the Lie algebra structure. He did this using some techniques from a field called “homological algebra”. I’ll eventually talk about it, but for now ask Michi.

But as it happens, this Lie algebra has a very nice category of representations. It’s a monoidal category with duals. In fact, every object is its own dual, and we can (morally, at least) build them all from a single fundamental representation. That means that it’s deeply related to the category of so-called “unoriented Temperley-Lieb” diagrams, which is (roughly) to categories with duals as the category of braids is to braided monoidal categories.

A Temperley-Lieb diagram is just a bunch of loops and arcs on the plane. The arcs connect marked points at the top and bottom of the diagram (like braid strands) while the loops just sorta float there, and none of the strands cross each other at all. So if there are no arcs, there’s just a bunch of separate loops. And we care about this because the states of a link in the definition of the Bracket are just bunches of separate loops too!

So we can take each state and read it in terms of this homological categorification of \mathfrak{sl}_2. And we can read a combination of states — a state sum — in such homological terms as well. So the defining relations of the bracket become “chain homotopies” — natural isomorphisms — in the homological context of the \mathfrak{sl}_2 categorification. Thus we have a homological categorification of the Bracket model of the Jones polynomial.

And again, it just came out of nowhere and has immediately revolutionized the field. Homology theories are hot right now. This high-level approach has been broken down by Khovanov and Rozansky into a combinatorial formulation, which knot theory groups like those at George Washington University and the University of Iowa have latched onto. The field of “Heegaard Floer homology” has been nudged closer and closer to the combinatorial Khovanov framework from its origins in analytic problems. Other knot invariants are lining up to be categorified along the same lines. And all the while the incredibly rich structure of Khovanov homology itself is being spruced up and neatened, leading to a series of clear examples to act as guideposts for those probing higher categorical structures in general.

And that’s what we just spent the last week talking about in Faro.

July 11, 2007 Posted by | Knot theory | 6 Comments