The comma category has objects with and a function . Its morphisms are maps in satisfying . The identity morphism and composition in a category are inherited from ; the functor laws make the defining equations stable under both.
For a singleton , its map is just an element . Thus is the covariant category of elements of , with arrows satisfying .
Suppose is a representable functor, with a natural isomorphism . Put . For any in the comma category , the representing bijection gives a unique with . By naturality, , exactly the condition for . Hence is an initial object.
Conversely, if is an initial object, thenis a bijection for each : existence and uniqueness are precisely initiality applied to every . For , , proving naturality. Thus is a universal element and is a representation of a functor. Being representable is equivalent to the singleton comma category having an initial object.
A weakly initial set is a set of objects such that every object receives at least one map from some . An initial object is itself a singleton weakly initial set. We prove the converse without replacing uniqueness by weak initiality.
Let be a complete category that is locally small. Form . For every object , choose and compose with the projection , so is weakly initial. Completeness supplies a terminal object, so the given weakly initial set cannot be empty.
The endomorphisms of form a set. Take a simultaneous equalizer of all of them with ; equivalently, equalize the two maps from into with components and . Thus for every endomorphism . The object is weakly initial, since exists for every . Weak initiality of gives a map . Applying the equalizing identity to yields , so monicity of gives .
For any endomorphism , the map is an endomorphism of . Therefore . Since , this becomes , giving . Now let and form their equalizer . Weak initiality of gives . The composite is an endomorphism of , hence the identity. Consequently .
There is at least one map from to every object, and the argument proves that there is at most one. The object is an initial object. This establishes the initial-object lemma for complete categories with a weakly initial set using only small products in a category and equalizers.
If is a representable functor, it preserves small categorical limits. Part (b) makes have an initial object, which gives a weakly initial set.
Conversely, assume limit preservation and a weakly initial set in . The needed comma-limit fact is explicit: for a small diagram in a category , form in . The elements form a compatible family, hence determine a unique under . The projections from are a categorical limit in the comma category. This includes the empty diagram, since carries the terminal object to a singleton. Each comma hom-set is a subset of a hom-set in , so the comma category is also locally small.
Part (c) now gives an initial object of , and part (b) supplies a representation of a functor. ThereforeThe size requirement is a genuine solution-set condition; limit preservation alone does not produce it in an arbitrary complete category.
Articles by others on the same topic
There are currently no matching articles.