Overview

A representable functor converts a mathematical classification problem into a question about maps involving one object. Rather than list solutions separately for every test object, it identifies all solution sets with hom-sets in a way compatible with changing the test object.

This is useful for universal constructions and for moduli problems. Representability is an actual existence claim: not every set-valued assignment is representable, even if it is already a functor.

Prerequisites

Use locally small categories, covariant and contravariant functors, and natural isomorphisms. Products and universal properties provide concrete examples. Familiarity with the Yoneda lemma explains why the representing object is essentially unique.

Definition and conventions

For a locally small category C\mathcal C, a functor F:Cop→SetF:\mathcal C^{\mathrm{op}}\to\mathbf{Set} is representable if there is an object RR and a natural isomorphism

Hom⁡C(−,R)≅F.\operatorname{Hom}_{\mathcal C}(-,R)\cong F.

A covariant functor G:C→SetG:\mathcal C\to\mathbf{Set} is representable when G≅Hom⁡C(R,−)G\cong\operatorname{Hom}_{\mathcal C}(R,-). Some authors call this second variance corepresentable. Always check the stated direction instead of inferring it from the word alone.

For the contravariant case, naturality means that if a:Y→Xa:Y\to X and f:X→Rf:X\to R, the datum associated with fafa is obtained by applying F(a)F(a) to the datum associated with ff. The family of bijections must satisfy this identity for every arrow.

Intuition

A representing object is a container for a universal example. Every example over a test object is obtained by mapping that test object into the container, or mapping out of the container in the covariant case. Naturality ensures that this description works consistently rather than depending on unrelated choices of bijections.

This viewpoint separates building a moduli object from merely defining a moduli functor. The latter records the classification problem; the former requires proving that one object actually solves it.

Examples and non-examples

For sets and a fixed AA, the covariant functor X↦XAX\mapsto X^A is represented by AA, because XAX^A is exactly the set of functions A→XA\to X. A map X→YX\to Y acts by postcomposition.

For fixed objects A,BA,B in a category with their product, the contravariant functor

X⟼Hom⁡(X,A)×Hom⁡(X,B)X\longmapsto\operatorname{Hom}(X,A)\times\operatorname{Hom}(X,B)

is represented by A×BA\times B. The representing natural bijection is the product universal property, not an independent theorem about cardinalities.

In commutative unital rings, R↦RR\mapsto R as a set is represented covariantly by Z[t]\mathbb Z[t]: a unital homomorphism is determined by the image of tt. Evaluation at r∈Rr\in R supplies the inverse correspondence. More specifically, homomorphisms from Z[t]/(t2)\mathbb Z[t]/(t^2) classify elements rr with r2=0r^2=0.

For a nonrepresentable example, the constant empty functor on a nonempty locally small category cannot be represented in either variance. At a proposed representing object RR, its identity would belong to Hom⁡(R,R)\operatorname{Hom}(R,R), contradicting emptiness.

Important properties

A representation includes the natural isomorphism, not just its object. The Yoneda lemma implies that two representations of the same functor admit a unique isomorphism respecting these chosen identifications. Different identifications on the same object can encode different universal elements.

Representable contravariant functors send colimits that exist in C\mathcal C to limits of sets: mapping out of a colimit means giving compatible maps from all its pieces. Covariant representables preserve limits. These statements do not assert that the ambient category possesses every limit or colimit.

Connections and further reading

The Yoneda lemma makes the relationship between universal elements and representing natural transformations precise. Adjunctions can be expressed as representability varying with a parameter. Riehl, §§2.1–2.3, develops these viewpoints before their applications to limits and more elaborate constructions.