The general adjoint functor theorem has the following limit form. Let be a functor, where is a complete category and both categories are locally small. Then has a left adjoint exactly when it preserves small limits and satisfies the solution-set condition.
The solution-set condition requires that, for each , there be a set of pairs such that every factors as
Equivalently, each comma category has a weakly initial set. All completeness and preservation requirements here concern small categorical limits. Dually, a small-colimit-preserving functor from a cocomplete category has a right adjoint precisely when each has a weakly terminal set.
A small cogenerating family , with a set, distinguishes unequal parallel morphisms by postcomposition: for , some has . Being well-powered means that the subobjects of each object form a set up to the usual equivalence of monomorphisms. These hypotheses make the solution-set condition automatic.
The dual formulation uses a cocomplete category, being a well-copowered category and having a small generating family, and concludes that every small-colimit-preserving functor has a right adjoint.
It is enough to prove the solution-set condition and then apply the general adjoint functor theorem. Fix and a morphism . We will factor it through one object in a set depending only on .
First construct a minimal supported subobject. Among the subobjects for which for some , include and take their intersection . This is a small intersection, by well-poweredness. It exists by completeness as the categorical limit of the diagram consisting of these monomorphisms into . Its map to is a monomorphism: two maps with the same composite to have equal projections to every , since each is monic, and are then equal by the categorical limit property. One can equivalently construct these intersections by pullbacks in a category and small products in a category, using stability of monomorphisms under pullback in a category.
Choose the factorizations . They form a compatible categorical cone into the image diagram under , all with common composite to . Preservation of small categorical limits yields with . If is another subobject through which factors after applying , then is among the original supported subobjects. The intersection property gives with . Since is monic, ; since is monic, also . Thus every supported subobject of is invertible.
For each member of the small cogenerating family, consider
This map is injective. If , preservation of the equalizer of makes factor through the image of that equalizer. Minimality makes its inclusion an isomorphism, so .
Write ; it is a set by local smallness of . Let be the image of . For each , there is exactly one corresponding . These maps define the evaluation embedding into cogenerator products
It is a monomorphism: if and , cogeneration supplies some distinguishing ; that is one of the projections of , a contradiction. The product is small. It is important to use the subfamilies , since some missing coordinate in need not correspond to a morphism out of .
There are only a set of possible families . For each such family form , choose a set of representatives of its subobjects, and take all pairs . Local smallness of and well-poweredness make their union a set. In the case just constructed, identifies with one chosen representative . Transporting to and composing the inverse identification with gives a factorization of the original through that pair. Therefore these pairs form a weakly initial set in .
The general adjoint functor theorem now supplies a left adjoint to . Conversely, a right adjoint preserves small categorical limits, either by the adjunction hom-set bijections and the hom-set detection of categorical limits, or directly from their universal properties. Hence the stated special theorem is proved in both directions.

Articles by others on the same topic (0)

There are currently no matching articles.