This is part 14 of Categories for Programmers. Previously: Free Monoids. See the Table of Contents.

It’s about time we had a little talk about sets. Mathematicians have a love/hate relationship with set theory. It’s the assembly language of mathematics — at least it used to be. Category theory tries to step away from set theory, to some extent. For instance, it’s a known fact that the set of all sets doesn’t exist, but the category of all sets, **Set**, does. So that’s good. On the other hand, we assume that morphisms between any two objects in a category form a set. We even called it a hom-set. To be fair, there is a branch of category theory where morphisms don’t form sets. Instead they are objects in another category. Those categories that use hom-objects rather than hom-sets, are called *enriched* categories. In what follows, though, we’ll stick to categories with good old-fashioned hom-sets.

A set is the closest thing to a featureless blob you can get outside of categorical objects. A set has elements, but you can’t say much about these elements. If you have a finite set, you can count the elements. You can kind of count the elements of an inifinite set using cardinal numbers. The set of natural numbers, for instance, is smaller than the set of real numbers, even though both are infinite. But, maybe surprisingly, a set of rational numbers is the same size as the set of natural numbers.

Other than that, all the information about sets can be encoded in functions between them — especially the invertible ones called isomorphisms. For all intents and purposes isomorphic sets are identical. Before I summon the wrath of foundational mathematicians, let me explain that the distinction between equality and isomorphism is of fundamental importance. In fact it is one of the main concerns of the latest branch of mathematics, the Homotopy Type Theory (HoTT). I’m mentioning HoTT because it’s a pure mathematical theory that takes inspiration from computation, and one of its main proponents, Vladimir Voevodsky, had a major epiphany while studying the Coq theorem prover. The interaction between mathematics and programming goes both ways.

The important lesson about sets is that it’s okay to compare sets of unlike elements. For instance, we can say that a given set of natural transformations is isomorphic to some set of morphisms, because a set is just a set. Isomorphism in this case just means that for every natural transformation from one set there is a unique morphism from the other set and vice versa. They can be paired against each other. You can’t compare apples with oranges, if they are objects from different categories, but you can compare sets of apples against sets of oranges. Often transforming a categorical problem into a set-theoretical problem gives us the necessary insight or even lets us prove valuable theorems.

## The Hom Functor

Every category comes equipped with a canonical family of mappings to **Set**. Those mappings are in fact functors, so they preserve the structure of the category. Let’s build one such mapping.

Let’s fix one object `a`

in *C* and pick another object `x`

also in *C*. The hom-set `C(a, x)`

is a set, an object in **Set**. When we vary `x`

, keeping `a`

fixed, `C(a, x)`

will also vary in **Set**. Thus we have a mapping from `x`

to **Set**.

If we want to stress the fact that we are considering the hom-set as a mapping in its second argument, we use the notation:

C(a, -)

with the dash serving as the placeholder for the argument.

This mapping of objects is easily extended to the mapping of morphisms. Let’s take a morphism `f`

in *C* between two arbitrary objects `x`

and `y`

. The object `x`

is mapped to the set `C(a, x)`

, and the object `y`

is mapped to `C(a, y)`

, under the mapping we have just defined. If this mapping is to be a functor, `f`

must be mapped to a function between the two sets:

C(a, x) -> C(a, y)

Let’s define this function point-wise, that is for each argument separately. For the argument we should pick an arbitrary element of `C(a, x)`

— let’s call it `h`

. Morphisms are composable, if they match end to end. It so happens that the target of `h`

matches the source of `f`

, so their composition:

f ∘ h :: a -> y

is a morphism going from `a`

to `y`

. It is therefore a member of `C(a, y)`

.

We have just found our function from `C(a, x)`

to `C(a, y)`

, which can serve as the image of `f`

. If there is no danger of confusion, we’ll write this lifted function as:

C(a, f)

and its action on a morphism `h`

as:

C(a, f) h = f ∘ h

Since this construction works in any category, it must also work in the category of Haskell types. In Haskell, the hom-functor is better known as the `Reader`

functor:

type Reader a x = a -> x

instance Functor (Reader a) where fmap f h = f . h

Now let’s consider what happens if, instead of fixing the source of the hom-set, we fix the target. In other words, we’re asking the question if the mapping

C(-, a)

is also a functor. It is, but instead of being covariant, it’s contravariant. That’s because the same kind of matching of morphisms end to end results in postcomposition by `f`

; rather than precomposition, as was the case with `C(a, -)`

.

We have already seen this contravariant functor in Haskell. We called it `Op`

:

type Op a x = x -> a

instance Contravariant (Op a) where contramap f h = h . f

Finally, if we let both objects vary, we get a profunctor `C(-, =)`

, which is contravariant in the first argument and covariant in the second (to underline the fact that the two arguments may vary independently, we use a double dash as the second placeholder). We have seen this profunctor before, when we talked about functoriality:

instance Profunctor (->) where dimap ab cd bc = cd . bc . ab lmap = flip (.) rmap = (.)

The important lesson is that this observation holds in any category: the mapping of objects to hom-sets is functorial. Since contravariance is equivalent to a mapping from the opposite category, we can state this fact succintly as:

C(-, =) :: C^{op}× C -> Set

## Representable Functors

We’ve seen that, for every choice of an object `a`

in *C*, we get a functor from *C* to **Set**. This kind of structure-preserving mapping to **Set** is often called a *representation*. We are representing objects and morphisms of *C* as sets and functions in **Set**.

The functor `C(a, -)`

itself is sometimes called representable. More generally, any functor `F`

that is naturally isomorphic to the hom-functor, for some choice of `a`

, is called *representable*. Such functor must necessarily be **Set**-valued, since `C(a, -)`

is.

I said before that we often think of isomorphic sets as identical. More generally, we think of isomorphic *objects* in a category as identical. That’s because objects have no structure other than their relation to other objects (and themselves) through morphisms.

For instance, we’ve previously talked about the category of monoids, **Mon**, that was initially modeled with sets. But we were careful to pick as morphisms only those functions that preserved the monoidal structure of those sets. So if two objects in **Mon** are isomorphic, meaning there is an invertible morphism between them, they have exactly the same structure. If we peeked at the sets and functions that they were based upon, we’d see that the unit element of one monoid was mapped to the unit element of another, and that a product of two elements was mapped to the product of their mappings.

The same reasoning can be applied to functors. Functors between two categories form a category in which natural transformations play the role of morphisms. So two functors are isomorphic, and can be thought of as identical, if there is an invertible natural transformation between them.

Let’s analyze the definition of the representable functor from this perspective. For `F`

to be representable we require that: There be an object `a`

in *C*; one natural transformation α from `C(a, -)`

to `F`

; another natural transformation, β, in the opposite direction; and that their composition be the identity natural transformation.

Let’s look at the component of α at some object `x`

. It’s a function in **Set**:

α_{x}:: C(a, x) -> F x

The naturality condition for this transformation tells us that, for any morphism `f`

from `x`

to `y`

, the following diagram commutes:

F f ∘ α_{x}= α_{y}∘ C(a, f)

In Haskell, we would replace natural transformations with polymorphic functions:

alpha :: forall x. (a -> x) -> F x

with the optional `forall`

quantifier. The naturality condition

fmap f . alpha = alpha . fmap f

is automatically satisfied due to parametricity (it’s one of those theorems for free I mentioned earlier), with the understanding that `fmap`

on the left is defined by the functor `F`

, whereas the one on the right is defined by the reader functor. Since `fmap`

for reader is just function precomposition, we can be even more explicit. Acting on `h`

, an element of `C(a, x)`

, the naturality condition simplifies to:

fmap f (alpha h) = alpha (f . h)

The other transformation, `beta`

, goes the opposite way:

beta :: forall x. F x -> (a -> x)

It must respect naturality conditions, and it must be the inverse of α:

α ∘ β = id = β ∘ α

We will see later that a natural transformation from `C(a, -)`

to any **Set**-valued functor always exists (Yoneda’s lemma) but it is not necessarily invertible.

Let me give you an example in Haskell with the list functor and `Int`

as `a`

. Here’s a natural transformation that does the job:

alpha :: forall x. (Int -> x) -> [x] alpha h = map h [12]

I have arbitrarily picked the number 12 and created a singleton list with it. I can then `fmap`

the function `h`

over this list and get a list of the type returned by `h`

. (There are actually as many such transformations as there are list of integers.)

The naturality condition is equivalent to the composability of `map`

(the list version of `fmap`

):

map f (map h [12]) = map (f . h) [12]

But if we tried to find the inverse transformation, we would have to go from a list of arbitrary type `x`

to a function returning `x`

:

beta :: forall x. [x] -> (Int -> x)

You might think of retrieving an `x`

from the list, e.g., using `head`

, but that won’t work for an empty list. Notice that there is no choice for the type `a`

(in place of `Int`

) that would work here. So the list functor is not representable.

Remember when we talked about Haskell (endo-) functors being a little like containers? In the same vein we can think of representable functors as containers for storing memoized results of function calls (the members of hom-sets in Haskell are just functions). The representing object, the type `a`

in `C(a, -)`

, is thought of as the key type, with which we can access the tabulated values of a function. The transformation we called α is called `tabulate`

, and its inverse, β, is called `index`

. Here’s a (slightly simplified) `Representable`

class definition:

class Representable f where type Rep f :: * tabulate :: (Rep f -> x) -> f x index :: f x -> Rep f -> x

Notice that the representing type, our `a`

, which is called `Rep f`

here, is part of the definition of `Representable`

. The star just means that `Rep f`

is a type (as opposed to a type constructor, or other more exotic kinds).

Infinite lists, or streams, which cannot be empty, are representable.

data Stream x = Cons x (Stream x)

You can think of them as memoized values of a function taking an `Integer`

as an argument. (Strictly speaking, I should be using non-negative natural numbers, but I didn’t want to complicate the code.)

To `tabulate`

such a function, you create an infinite stream of values. Of course, this is only possible because Haskell is lazy. The values are evaluated on demand. You access the memoized values using `index`

:

instance Representable Stream where type Rep Stream = Integer tabulate f = Cons (f 0) (tabulate (f . (+1))) index (Cons b bs) n = if n == 0 then b else index bs (n - 1)

It’s interesting that you can implement a single memoization scheme to cover a whole family of functions with arbitrary return types.

Representability for contravariant functors is similarly defined, except that we keep the second argument of `C(-, a)`

fixed. Or, equivalently, we may consider functors from *C*^{op} to **Set**, because `C`

is the same as ^{op}(a, -)`C(-, a)`

.

There is an interesting twist to representability. Remember that hom-sets can internally be treated as exponential objects, in cartesian closed categories. The hom-set `C(a, x)`

is equivalent to `x`

, and for a representable functor ^{a}`F`

we can write:

-^{a}= F

Let’s take the logarithm of both sides, just for kicks:

a = log F

Of course, this is a purely formal transformation, but if you know some of the properties of logarithms, it is quite helpful. In particular, it turns out that functors that are based on product types can be represented with sum types, and that sum-type functors are not in general representable (example: the list functor).

Finally, notice that a representable functor gives us two different implementations of the same thing — one a function, one a data structure. They have exactly the same content — the same values are retrieved using the same keys. That’s the sense of “sameness” I was talking about. Two naturally isomorphic functors are identical as far as their contents are involved. On the other hand, the two representations are often implemented differently and may have different performance characteristics. Memoization is used as a performance enhancement and may lead to substantially reduced run times. Being able to generate different representations of the same underlying computation is very valuable in practice. So, surprisingly, even though it’s not concerned with performance at all, category theory provides ample opportunities to explore alternative implementations that have practical value.

## Challenges

- Show that the hom-functors map identity morphisms in
*C*to corresponding identity functions in**Set**. - Show that
`Maybe`

is not representable. - Is the
`Reader`

functor representable? - Using
`Stream`

representation, memoize a function that squares its argument. - Show that
`tabulate`

and`index`

for`Stream`

are indeed the inverse of each other. (Hint: use induction.) - The functor:
Pair a = Pair a a

is representable. Can you guess the type that represents it? Implement

`tabulate`

and`index`

.

## Bibliography

- The Catsters video about representable functors.

Next: The Yoneda Lemma.

## Acknowledgments

I’d like to thank Gershom Bazerman for checking my math and logic, and André van Meulebrouck, who has been volunteering his editing help throughout this series of posts.

Follow @BartoszMilewski

July 29, 2015 at 11:48 pm

Where you say “It requires that there be an object a in C; one natural transformation α from C(a, _) to F;” F is any functor?

July 30, 2015 at 10:16 am

F is the functor from the definition: “any functor that is naturally isomorphic to the hom-functor, for some choice of a, is called representable.” I’ll edit it to make it clrearer.

September 13, 2015 at 6:37 pm

Hello! Suppose that for a fixed “a” in C(a,-) there are two objects, “x1” and “x2″, for which there are no arrow from ” a”. This means that Hom functor maps these object to empty sets. My question is: are these empty sets considered to be the same object in Set or are they distinct Set objects (albeit with the same internal structure)?

September 13, 2015 at 7:35 pm

@Leonid: There is only one empty set in

Set.September 9, 2017 at 12:40 am

I cannot compile the Representable class. I get the error:

• Illegal family declaration for ‘Rep’

Use TypeFamilies to allow indexed type families

• In the class declaration for ‘Representable’

Is that caused by a change in Haskell syntax since this blog post was written?

September 9, 2017 at 2:18 pm

Lots of Haskell features are optional, so you have to invoke them at the top of the file. In this case, the compiler tells you to use the

`TypeFamilies`

option. It means you should put this line at the top of your file: