Hom-Functors and Representables
Fixing an object A of a locally small category produces a set-valued functor, the hom-functor A(A,-), that records every map out of A. A functor is representable when it is naturally isomorphic to such a hom-functor.
╌╌╌╌
A category records objects by the maps between them, so the natural way to study one object is to collect every map into or out of it. Fix an object of a category . For each object there is a set of maps , and this assignment is functorial in : a map turns a map into a map by composition. The resulting functor records how maps into the rest of the category.1
Different objects give different records, and an object whose record matches a given functor is said to represent . Representable functors are the second route to universal properties, after adjunctions: a representation of is a single object that captures everything does. The Yoneda lemma computes exactly how much information a hom-functor carries.
The covariant hom-functor
Fix a locally small category and an object , so that each class is a genuine set. Local smallness is what makes the following construction land in .
The value is post-composition with ; it is also written or . Functoriality is immediate: post-composes with an identity and so is the identity function, and post-composes with , which by associativity is post-composing with then with , i.e. .
The name is fixed but many books write it , , or ; all denote the same functor.
The contravariant hom-functor
Fixing the second argument instead of the first gives the dual construction. Now a map turns a map into a map by pre-composition, and pre-composition reverses direction, so the functor is contravariant.
The value is also written or . The reversal is essential: a map downstairs induces a map upstairs, going the other way, exactly as a linear map of vector spaces induces a map of dual spaces in the reverse direction.
A functor is called a presheaf on ; the contravariant hom-functors are the representable presheaves, and they are the objects the Yoneda lemma is built around. The two variances are summarized below.
| Covariant | Contravariant | |
|---|---|---|
| Notation | ||
| Type | ||
| Value at | maps | maps |
| Action on | post-compose | pre-compose |
| Records | maps out of | maps into |
Representability
Only set-valued functors can be compared to a hom-functor, and the comparison is natural isomorphism.
A representation reduces a functor to a single representing
object. Most functors into are not representable; the ones that
are tend to be the functors that pick out structure by a single generator.
Standard representables. The recurring examples share a pattern: the representing object is a free structure on one generator.2
- Identity on . A map from the one-point set is an element of , so naturally. The identity functor is represented by .
- Forgetful . A continuous map from the one-point space is a point, so the underlying-set functor is .
- Forgetful . For each there is a unique homomorphism sending , so the underlying-set functor is , since is the free group on one generator.
- Forgetful . A linear map is determined by the image of , any vector at all, so and .
- Powerset . A subset of is a map into the two-element set, so as a presheaf, with .
- Open sets . Continuous maps into the Sierpiński space (two points, one open singleton) correspond to open subsets, so .
| Functor | Type | Representing object | Generator identity |
|---|---|---|---|
| element map from | |||
| covariant | point map from | ||
| covariant | element hom from | ||
| covariant | vector map from | ||
| presheaf | subset map into | ||
| presheaf | open set map into |
Representables from adjunctions
Each forgetful functor above has a left adjoint (the free functor), and a left adjoint forces representability.
For the left adjoint is the discrete-space functor with , recovering ; for it is the free-vector-space functor with , recovering ; for it is the polynomial-ring functor with , so the forgetful functor is , matching the fact that ring maps are the same as elements of .
Generalized elements
An object of an abstract category has no elements in any set-theoretic sense, but
maps into it play the role of elements once a shape
is chosen.
The term is only a synonym for map,
but it reorganizes the covariant
hom-functor: sends each object to its set of
generalized elements of shape , and functoriality says a map
transports -shaped elements of to -shaped elements of .
In a shape- element is an ordinary element and a shape- element is a sequence. In the shape- elements are points and the shape- elements are loops, so a continuous map carries loops to loops. In algebra, a solution of in a ring is the same thing as a generalized element of shape , because a pair with is a ring map from that quotient into . Fixing a shape and reading off its generalized elements recovers a functor's values; representability tests whether those values match a hom-functor.
Assembling the hom-functors
The families and are not independent: a map between objects induces a map between their hom-functors, so each family is itself functorial. A map induces a natural transformation , whose -component sends to ; note the reversal, producing . Dually induces by .
Packaging these gives four functors, dual in pairs.
| Family | Assembled functor | Type |
|---|---|---|
| covariant reps, contravariantly assembled | ||
| contravariant reps, covariantly assembled |
The functor , sending each object to its representable presheaf , is the Yoneda embedding. Both packaged functors involve one contravariance that cannot be avoided. A single bifunctor unifies them:
acting on a pair by . Contravariant in the first variable, covariant in the second, it carries the same data as and presented at once.
The reversal in the first argument is what makes contravariant there: a map pre-composes to send an element of to one of . This bifunctor also explains the naturality clauses in the definition of adjunction: holds exactly when the functors and from to are naturally isomorphic.3
The Yoneda lemma computes the natural transformations out of a representable presheaf, and its consequences show that embeds faithfully into its presheaf category, so that an object is determined by the maps into it.
Footnotes
- Leinster, Basic Category Theory, §4.1 — Definitions and examples: the covariant hom-functor , its action on maps by post-composition, and representability of set-valued functors. ↩
- Leinster, Basic Category Theory, §4.1, Examples 4.1.4–4.1.20 — the identity, forgetful, powerset and open-set functors as representables, each represented by a free structure on one generator. Barr & Wells, §4.5.1 gives the same catalogue with the graph node/arrow functors. ↩
- Leinster, Basic Category Theory, §4.1, Definition 4.1.22 and Remark 4.1.24 — the two-variable hom-functor , and the reformulation of adjointness as a natural isomorphism of the composite hom-functors . ↩
╌╌ END ╌╌