## More on tensor products and direct sums

We’ve defined the tensor product and the direct sum of two abelian groups. It turns out they interact very nicely.

One thing we need is another fact about the tensor product of abelian groups. If we take three abelian groups , , and , we can form the tensor product , and then use that to make . On the other hand, we could have started with and then built . If we look at the construction we used to show that tensor products actually exist we see that these two groups are not the same. However, they *are* isomorphic.

To see this, let’s make a bilinear function from to . By our construction, any element of can be represented as a sum , so linearity says we just need to consider elements of the form . Define . This induces a unique *linear* function given by and extending to sums of such elements. Similarly we get a linear function , so we have an isomorphism of abelian groups. We can thus (somewhat) unambiguously talk about “the” tensor product .

Now let’s take a collection of abelian groups with running over an index set , and let be any other abelian group. We want to consider the tensor product

Since the direct sum is a direct product of groups, it comes with projections . Since the free product is in general a subgroup of the direct sum (a proper subgroup when the index set is infinite), we also have injections coming from the free product. We can use these to build homomorphisms

applying to and the identity to . By the universal property of direct sums (the one it gets from free products of groups) this gives us a homomorphism

On the other hand, for each we have a bilinear function sending in to in . By the universal properties of tensor products this gives a linear function . The universal property of direct sums (the one it gets from direct products of groups) gives us a linear function

Now there’s a lot of juggling of functions and injections and projections here that I really don’t think is very illuminating. The upshot is that and are inverses of each other, giving us an isomorphism of the two abelian groups. There’s nothing really special about the left side of the tensor product either. A similar result holds if the direct sum is the right tensorand. We can even put them together to get the really nice isomorphism:

Neat!

## Direct sums of Abelian groups

Let’s go back to direct products and free products of groups and consider them just in the context of abelian groups.

The direct product of abelian groups and works as we expect it to, because the elements coming from and already commute inside . The free product of and as groups gives as before, but now this is *not* an abelian group. Let’s consider the property that defined free products a little more closely. Here’s the diagram.

We want to read it slightly differently now. The new condition is that for any *abelian* group and homomorphisms and there is a unique homomorphism of *abelian* groups from the free product to making the diagram commute. We know that there’s a unique homomorphism from already, but we need to “abelianize” this group. How do we do that?

We just move to the quotient of by its commutator subgroup of course! Recall that any homomorphism to an abelian group factors uniquely through this quotient: . So now is an abelian group with a unique homomorphism to making the diagram commute, it works for a free product *in the context of abelian groups*. This sort of thing feels odd at first, but you get used to it: when you change the context of a property (here from all groups to abelian groups) the implications change too.

Okay, so is like the free product , but we’ve thrown in relations making everything commute. We started with abelian groups and , so all we’ve really added is that elements coming from the two different groups commute with each other. And that gives us back (wait for it..) the direct product! When we restrict our attention to abelian groups, direct products and free products are the same thing. Since this is such a nice thing to happen and because we change all our notation when we look at abelian groups anyhow, we call this group the “direct sum” of the abelian groups and , and write it .

Now I didn’t really talk about this much before in the context of groups, but I’m going to need it shortly. We can take the direct sum of more than two groups at a time. I’ll leave it to you to verify that the groups and are isomorphic (use the universal property), so we can more or less unambiguously talk about the direct sum of any finite collection of groups. Infinite collections (which we’ll need soon) are a bit weirder.

Let’s say we have an infinite set and for each of its elements an abelian group . We can define the infinite direct sum as the collection of all “-tuples” where for all , and where all but a finite number of the are the zero element in their respective groups. This satisfies something like the free product’s universal property — each has a homomorphism , and so on — but with an *infinite* number of groups on the top of the diagram: one for every element of .

The direct product , on the other hand, satisfies something like the product condition but with an infinite number of groups down on the bottom of the diagram. Each of the comes with a homomorphism , and so on. We can realize this property with the collection of *all* -tuples, whether there are a finite number of nonzero entries or not.

What’s really interesting here is that for finite collections of groups the free product comes with an epimorphism onto the direct product. Now for infinite collections of abelian groups, the free product (direct sum) comes with a monomorphism into the direct product. The free product was much bigger before, but now it’s much smaller. When all these weird little effects begin to confuse me, I find it’s best just to plug my ears and go back to the universal properties. They will never steer you wrong.

## Tensor products of abelian groups

Often enough we’re going to see the following situation. There are three abelian groups — , , and — and a function that is linear in each variable. What does this mean?

Well, “linear” just means “preserves addition” as in a homomorphism, but I don’t mean that is a homomorphism from to . That would mean the following equation held:

Instead, I want to say that if we fix one variable, the remaining function of the *other* variable is a homomorphism. That is

we call such a function “bilinear”.

The tensor product is a construction we use to replace bilinear functions by linear functions. It is defined by yet another universal property: a tensor product of and is an abelian group and a bilinear function so that for every other bilinear function there is a unique linear function so that . Like all objects defined by universal properties, the tensor product is automatically unique up to isomorphism if it exists.

So here’s how to construct one. I claim that has a presentation by generators and relations as an abelian group. For generators take *all* elements of , and for relations take all the elements and for all and in and and in .

By the properties of such presentations, any function of the generators — of — defines a linear function on if and only if it satisfies the relations. That is, if we apply a function to each relation and get every time, then defines a unique function on the presented group. So what does that look like here?

So a bilinear function gives rise to a linear function , just as we want.

Usually we’ll write the tensor product of and as , and the required bilinear function as .

Now, why am I throwing this out now? Because we’ve already seen one example. It’s a bit trivial now, but catching it while it’s small will help see the relation to other things later. The distributive law for a ring says that multiplication is a bilinear function of the underlying abelian group! That is, we can view a ring as an abelian group equipped with a *linear* map for multiplication.

## A few more groups

I want to throw out a few more examples of groups before I move deeper into the theory.

First up: Abelian groups. These are more a general class of groups than an example like permutation groups were. They are distinguished by the fact that the composition is “commutative” — it doesn’t matter what order the group elements come in. The composition is the same as the composition .

All the groups I’ve mentioned so far, except for permutations and rotations, are Abelian. It’s common when dealing with an abelian group to write the composition as “+”, the identity as “0″, and the inverse of as . Let’s recap the axioms for an Abelian group in this notation.

- For any , , and :
- There is an element 0 so that for any :
- For every there is an element so that:
- For any and :

Abelian groups are really fantastically important. Many later algebraic structures start with an Abelian group and add structure to it, just as a group starts with a set and adds structure to it. We’ll see many examples of these later.

The other thing I want to mention is a free group. As the name might imply, this is a group with absolutely no restrictions other than the group axioms. We start by picking some basic pieces, sometimes called “generators” or “letters”, and then just start writing out whatever “words” the rules of group theory allow.

Let’s start with the free group on one letter: . We definitely have the identity element — written “1″ — and we throw in our single letter . We can compose this with itself however many times we like by just writing letters next to each other: , , , and so on. We also need an inverse, . We can use and to build up long words like . But notice that whenever an and an sit next to each other they cancel. That collapses this long word down to . We see that in all words look like , where a positive means a string of s, a negative means a string of s, and for the identity. We compose just by adding the exponents.

The free group on two letters, gets a lot more complicated. We again start with the identity and throw in letters and . Now we can build up all sorts of words like . But now we can’t do anything to pull and past each other. Letters only cancel their inverses when they’re right next to each other, so this word only collapses to . That’s the best we can do. Free groups on more generators are pretty much the same, but with more basic symbols.

Composition of words and just writes them one after another, cancelling whatever possible in the middle. For example, in let’s say and . We write them together (in order!) as and cancel inverses where we can to get .

Free groups seem hideously complicated at first, but they aren’t so bad once you get used to them. They’re also tremendously useful, as we’ll soon see. They’re the primordial groups, with absolutely nothing extra beyond the bare minimum of what’s needed to make a group.

Some points to ponder

- What is the inverse of a word in a free group?
- What should the free
*Abelian*group on letters look like?