# Functors

January 18, 2012 5 Comments

As we mentioned before, we can’t have “the set of all sets,” even though it might sound cool.

Similarly, even though it would be awesome, we can’t have the “category of all categories.” We can get away with something slightly smaller though: The category of all small categories. Let’s call it . There are lots and lots of small categories. So many that in fact is a large category.

So you know what the objects are in (they are the small categories). What is a morphism in this category? If and are small categories, it’s something . We call it a **functor**, and it’s a way to converting one category into another.

All of this being careful business about small and large categories was just to motivate functors (and to teach you a little set theory), but in fact, we can define them for large categories as well. So here we go:

Let and be categories. A **(covariant) functor** is a map in the following sense

- For each object , there is a corresponding object .
- For each morphism in , there is a corresponding in .

We also have some conditions on how functors work.

- For every , Then
- If in , then .

Functors probably seem scary when they’re described like this. They aren’t. They are a wonderful tool, and a beautiful construction. You see them all over the place and probably don’t even realize it. Anytime you take an object of one type, and turn it into an object of a different type in a way that “respects morphisms,” you’re applying a functor. Next time we’ll see a lot of examples of functors. Try first to come up with one or two of your own. Without seeing any examples, this should prove quite challenging, but it’s a good exercise.

Pingback: Examples of (covariant) functors « Andy Soffer

Pingback: Back to functors « Andy Soffer

Pingback: Naturality (part 2) « Andy Soffer

Pingback: Yoneda’s Lemma (part 1) « Andy Soffer

Pingback: Applying Yoneda’s Lemma « Andy Soffer