A functor F: C → Set (or C^op → Set) is representable if it is naturally isomorphic to the hom-functor Hom_C(A,-) (or Hom_C(-,A)) for some object A of C; equivalently, there exists a universal element of F that induces the natural isomorphism and thus identifies F with maps out of or into A.

Principle

Existence of a universal element (a point of F(A)) yields a natural bijection between Hom(A,X) and F(X) for every X, turning an abstract functor into a parametrization of morphisms from or to a fixed object.

Demonstration

In the category of R-modules, the functor Hom_R(R^n,-) is representable and naturally isomorphic to the functor sending M to M^n; concretely, R^n represents n‑tuples by maps from R^n into M.

Misapplication

Confusing pointwise representability with natural representability: having for each object X a bijection between F(X) and some Hom(A_X,X) does not yield a single representing object unless these bijections are natural in X and come from one A.

Consequence

Representable functors are easy to manipulate: they preserve limits (when covariant) and their properties reduce to properties of the representing object; they also sit inside the Yoneda embedding as the image of objects, giving concrete control over natural transformations.

Reversal

Non-representable functors—such as many moduli problems—cannot be described by a single object; one may instead get prorepresentability or stacky replacements which weaken strict representability to limits or equivalence classes.

Boundary

Representation is about natural isomorphism to a hom-functor and depends on the ambient category and codomain Set; size issues, variance (covariant vs contravariant), and requiring naturality exclude naive pointwise identifications.

Semantic Tension

Between 'there exists A representing F' and 'F has elements at each object': the tension is that elementwise descriptions suggest representability but fail unless a universal element and naturality tie the data to a single representing object.

Synthesis

A representable functor reveals that an abstract parameter assignment is actually parameterization by maps from or to a single object A: the existence of a universal element produces natural bijections Hom(A,−) ≅ F(−), converting functorial data into morphism families governed by one representing object.