## Sweedler notation

As we work with coalgebras, we’ll need a nice way to write out the comultiplication of an element. In the group algebra we’ve been using as an example, we just have , but not all elements are so cleanly sent to two copies of themselves. And other comltiplications in other coalgebras aren’t even defined so nicely on any basis. So we introduce the so-called “Sweedler notation”. If you didn’t like the summation convention, you’re going to hate this.

Okay, first of all, we know that the comultiplication of an element is an element of the tensor square . Thus it can be written as a finite sum

Now, this uses two whole new letters, and , which might be really awkward to come up with in practice. Instead, let’s call them and , to denote the first and second factors of the comultiplication. We’ll also move the indices to superscripts, just to get them out of the way.

The whole index-summing thing is a bit awkward, especially because the number of summands is different for each coalgebra element . Let’s just say we’re adding up all the terms we need to for a given :

Then if we’re really pressed for space we can just write . Since we don’t use a subscript in parentheses for anything else, we remember that this is implicitly a summation.

Let’s check out the counit laws in this notation. Now they read . Or, more expansively:

Similarly, the coassociativity condition now reads

In the Sweedler notation we’ll write both of these equal sums as

Or more simply as .

As a bit more practice, let’s write out the condition that a linear map between coalgebras is a coalgebra morphism. The answer is that must satisfy

Notice here that there are implied summations here. We are *not* asserting that all the summands are equal, and definitely not that (for instance). Sweedler notation hides a lot more than the summation convention ever did, but it’s still possible to expand it back out to a proper summation-heavy format when we need to.