## Coalgebras

Okay, back to business. We’re about to need a little more algebraic structure floating around. This is something that’s always present, but many approaches don’t explicitly mention it until much later. Since I’m taking a categorical view of things, it’s easier to show what’s really going on right away.

Remember that an -algebra is a monoid object in the category of vector spaces over . Dually, an –*co*algebra is a *co*monoid object in the category of vector spaces over . That’s all well and good, but what’s a comonoid object? We’ve mentioned them before, but let’s be more explicit this time around.

Remember that a monoid object was a functor from a certain category we cooked up to mirror the axioms of a monoid. We gave the category objects corresponding to the natural numbers, corresponding to lists of monoid elements. We have a map corresponding to multiplication, and a map picking out the unit in the monoid.

So a *co*monoid object will be a functor from the *dual* of this category! That is, we’ve still got all the same objects, but now we have a “*co*multiplication” arrow , and a “*co*unit” arrow .

Now, the model category describing monoid objects isn’t just objects and arrows. We also have the relations that make a monoid a monoid: the associative law , and the left and right unit laws .

Dually, we must have dual relations for comonoid objects. We have a *co*associative law , and left and right *co*unit laws .

We could write these down in terms of commuting diagrams, but it’s even more instructive to look at “string diagrams” like we did before. This makes the sense of what’s going on all the clearer.

So a coalgebra is a comonoid object in the category of vector spaces over . That is, it’s an vector space , equipped with a linear comultiplication and a linear counit , which satisfy the coassociative and counit laws. I’ll admit that this seems an extremely quirky structure to discuss, so an example is in order. The one we care most about right now is the group algebra. Yes, it turns out to also be a coalgebra!

To really wrap our heads around it, let’s start with a finite group . Then we get a finite-dimensional vector space , with a basis indexed by elements of . Let’s forget, for the moment, that we have a multiplication and a unit. Instead, we define the comultiplication by for each basis element. We also define the counit by for each element . Both of these maps extend by linearity.

Now, let’s check the coassociative property. It suffices to check it on basis elements, because the extensions by linearity have to agree. In this case we have

Similarly, we can check the right counit law:

and the left counit law is similar. Thus these maps do indeed describe the structure of a coalgebra.

[…] In yesterday’s post I used the group algebra of a group as an example of a coalgebra. In fact, more is […]

Pingback by Bialgebras « The Unapologetic Mathematician | November 6, 2008 |

[…] As we work with coalgebras, we’ll need a nice way to write out the comultiplication of an element. In the group algebra […]

Pingback by Sweedler notation « The Unapologetic Mathematician | November 10, 2008 |

[…] this concept, we say that a coalgebra is cocommutative if we can swap the outputs from the comultiplication. That is, if . Similarly, […]

Pingback by Cocommutativity « The Unapologetic Mathematician | November 19, 2008 |