## Representable Functors

Now that we have a handle on hom functors, we can use them to define other functors.

Since is a functor from the product category to sets, it is functorial in each variable separately. This means that we can take any object of and build the covariant functor and the contravariant functor . We call the representing object of these functors.

Now not every functor is exactly of this form, but a good many of them are *naturally isomorphic* to such a functor. We call such a functor “representable”. Representable functors turn out to be extremely useful, as we’ll see.

As an example, consider the “underlying set” functor . This takes a group to its underlying set, and a homomorphism of groups to its underlying function. You should check that it is, indeed, a covariant functor. I say that it is represented by the group . That is, .

Given an element of a group , there is a unique homomorphism so that . Conversely, every homomorphism sends to *some* element of , so this sets up a bijection between the set of elements of and the set of homomorphisms from to . These bijections are the components of the natural isomorphism we’re looking for. We need to check that for any group homomorphism we have naturality: .

Since is just the function (forgetting that it preserves a group structure), the left side of the naturality equation sends an element to the unique homomorphism with . On the right, we first send to the homomorphism , and then compose with . This also satisfies , so , and the naturality equation is satisfied.

Now, we have a bunch of other “forgetful” functors sitting around. All of the algebraic structures we’ve considered — semigroups, monoids, abelian groups, rings, -modules (left and right), and even quandles — they all have an “underlying set”. First you should be able to verify that each assignment of an underlying set is actually a covariant functor. Then, try to find a representing object for each functor.

This particular use of representable functors to describe forgetful functors to the category of sets is the first solid step towards moving *away* from viewing algebraic concepts as “sets with extra structure”. For instance, we now see that we don’t really need to describe a group as a set with a multiplication function, inverse function, and identity. A group is just an object in the category of groups, and within the category it has all sorts of interrelationships with all the other groups. We can reconstruct the older picture of a group from these relationships, and here we’ve seen how to recover the set of elements of as .