Cogenerating set 2026-10-06
A cogenerating set is a set-indexed family such that whenever , there is a morphism with . It generalizes a single coseparator. In a locally small category with the needed products in a category, it gives an evaluation embedding into cogenerator products.
Under the hypotheses of the limit form of the special adjoint functor theorem, intersect all subobjects of supporting . Limit preservation gives a smallest supporting . If for maps , their equalizer supports , so minimality makes it invertible and . Thus the indicated map of hom-sets is injective. The evaluation embedding into cogenerator products embeds in a product of cogenerators indexed by the realized subsets of the fixed sets . There are only a set of such products, a set of their subobjects, and a set of maps from into their images under . These data give a weakly initial set in . Using realized subsets avoids assuming maps into every cogenerator exist.
For the general alternative, let be a functor between locally small categories, with a complete category. The Freyd general adjoint functor theorem says that has a left adjoint if and only if it preserves small categorical limits and satisfies the solution-set condition. Explicitly, for every , there must be a set of morphisms such that every has the form for some and . Equivalently, each comma category has a weakly initial set.
We prove the initial-object lemma for complete categories with a weakly initial set. Let be a locally small category which is complete and has a weakly initial set . Its product in a category is weakly initial: for each , choose a morphism and compose with the projection . The hom-set is a set. Form equalizing every endomorphism of with , by taking the equalizer of the two morphisms
whose -coordinates are and . Then for every endomorphism , and is monic. There is a morphism for every , by composing with a weakly initial morphism out of .
To prove uniqueness, let and take their equalizer . Weak initiality of gives . The composite is an endomorphism, so . Cancel the monomorphism to obtain . Thus is both monic and split epic, hence an isomorphism: if , cancellation from gives . Since , it follows that . Therefore is an initial object, proving the lemma fully.
Now assume categorical limit preservation and the solution-set condition. The comma category is locally small. It is complete: for a small diagram in a category , take its underlying categorical limit in . Since preserves this categorical limit, the compatible give a unique . The same universal property shows that is the categorical limit in the comma category. Its weakly initial set and the proved lemma therefore supply an initial object . For , its universal property defines a unique with . Uniqueness proves the identity morphism and composition in a category laws and the naturality of . The same universal property gives the natural bijection , so .
For necessity, an adjunction supplies the singleton weakly initial set at . It also proves that preserves categorical limits: maps correspond to maps , and compatible families of the latter factor uniquely through any categorical limit in . Hence the image categorical cone under has the required universal property. This proves both directions of the general alternative.
For the special alternative, the limit form of the special adjoint functor theorem says: if is complete, locally small and well-powered, with a small cogenerating family , and is locally small, then has a left adjoint exactly when it preserves small categorical limits. A cogenerating set means that unequal parallel morphisms are distinguished by some morphism . We prove the needed solution-set condition, so that the general theorem applies.
Fix . A supporting subobject of is a monomorphism through whose image under the morphism factors. There is at least one, namely . Because is well-powered, choose a set of representatives of all these supporting subobjects. A limit-preserving functor preserves monomorphisms: a map is monic exactly when its diagonal into its self-pullback in a category is an isomorphism, and both the pullback in a category and this isomorphism are preserved. Consequently each factorization of through is unique. Form the intersection of subobjects of the supporting representatives, as a wide pullback in a category over . The unique lifts of are compatible and, since preserves that categorical limit, they give a factorization
This is a minimal supported subobject. More explicitly, if also supports , then is one of the supporting subobjects of . The intersection therefore factors through , giving with . Monicity of gives ; monicity of then makes invertible.
For any , if , the equalizer of supports , because preserves that equalizer. Minimality makes it invertible, so . We have therefore obtained injective functions
Let be the realized image subset of the fixed set . Use the unique morphism corresponding to each to form the evaluation embedding into cogenerator products
This morphism is monic: if two morphisms into have identical product composites, every morphism from to every gives identical composites, and the cogenerating property makes the two morphisms equal. There is only a set of possible families of subsets , and hence a set of possible products . Each has only a set of subobjects by well-poweredness, and each chosen subobject has only a set of morphisms by local smallness. Take all these pairs as a weakly initial set. Every original receives a morphism from a pair representing its , through . Thus the set is weakly initial in .
The general theorem now supplies a left adjoint. Necessity again follows from preservation of categorical limits by a right adjoint. This proves the special alternative, including its size argument. Using only the realized subsets avoids assuming that an arbitrary object admits a morphism into every cogenerator. Both adjoint functor theorem alternatives are proved.
The general adjoint functor theorem says that, for a functor between locally small categories, with a complete category, has a left adjoint if and only if it preserves small limits and satisfies the solution-set condition. The solution-set condition means that for each there is a set of arrows such that every factors as for some and some .
Here is the smallness argument behind the theorem. A complete category that is locally small and has a weakly initial set has an initial object. Form the product in a category . It is weakly initial, since a projection followed by a chosen arrow gives an arrow . Take the simultaneous equalizer of all endomorphisms of with ; the family is a set by local smallness. The object is also weakly initial. For parallel arrows , take their equalizer and a map . Since is an endomorphism of , the defining property of gives . Cancellation of the monomorphism gives . Thus the monomorphism has a right inverse and is an isomorphism, so . Existence of arrows out of was already established, proving the initial-object lemma for complete categories with a weakly initial set.
If preserves small categorical limits, the comma category is complete: take the limiting object in , and use preservation to assemble the arrows from . It is locally small, and the solution-set condition provides a weakly initial set. Its initial object is an arrow with a natural bijection
For a morphism , define by . Uniqueness proves functoriality and naturality, giving a left adjoint . Conversely, a right adjoint preserves categorical limits, because applying the adjunction converts a limiting cone over a diagram into the corresponding limiting cone of hom-sets. Its adjunction unit at is a singleton solution set. This proves both directions of the general adjoint functor theorem.
Apply it to the inclusion , where is the full subcategory of compact Hausdorff spaces. A small product in a category of compact Hausdorff spaces is again compact Hausdorff by the Tychonoff theorem. An equalizer of two continuous functions into a Hausdorff space is closed, hence compact Hausdorff. Products and equalizers construct all small categorical limits, and the inclusion preserves these constructions. Both categories are locally small.
Fix a topological space and a continuous function into a compact Hausdorff space. The closure is compact Hausdorff and has a dense subset of cardinality at most . The permitted cardinal estimate gives
For , use . Choose a set of representatives of all compact Hausdorff topologies on underlying sets of cardinality at most this bound, and all continuous functions from to those representatives. Every factors through one of them, using the inclusion . This is the solution-set condition. Consequently the inclusion of compact Hausdorff spaces has a left adjoint, the compact Hausdorff reflection:
The universal arrow has dense image: factoring it through its closed image and applying uniqueness supplies an inverse to that image inclusion. It need not be an embedding when is not sufficiently separated; the assertion is a compact Hausdorff reflection, rather than a claim that every topological space embeds in a compact Hausdorff space.
For completeness, the alternative Special adjoint functor theorem can be proved from the same initial-object argument. Its limit form assumes that is complete, locally small and well-powered, with a small cogenerating family ; then , with locally small, has a left adjoint precisely when it preserves small limits. To prove sufficiency, start with and intersect all subobjects through which factors after applying . Well-poweredness makes this a small intersection of subobjects, and preservation of limits gives a smallest supporting object . For maps , equality makes their equalizer another supporting subobject. Minimality forces that equalizer to be invertible, so . Therefore
is an injective function. The evaluation embedding into cogenerator products embeds in , where is the realized subset of the fixed set . There are only a set of choices of these subsets, only a set of subobjects of each resulting product, and only a set of arrows from to each -image. They give a solution set, so the already proved general adjoint functor theorem applies. Necessity is again preservation of limits by a right adjoint. For , monomorphisms are embeddings onto closed subspaces, and is a coseparator because continuous functions to it separate points. Thus the Special adjoint functor theorem gives the same reflection directly.
The limit form of the Special adjoint functor theorem is as follows. Let be a locally small category, a complete category, and a well-powered category, and suppose it has a small cogenerating family . Let be a locally small category. Then a functor has a left adjoint if and only if it preserves all small categorical limits. The dual exchanges completeness, well-poweredness and cogenerators for cocompleteness, well-copoweredness and generators, and characterizes functors with a right adjoint.
Here a cogenerating set distinguishes unequal parallel maps by postcomposition into one of the . A well-powered category has a set of subobjects of each fixed object. Completeness means existence of all small categorical limits. We use the initial-object lemma for complete categories with a weakly initial set: a complete category that is locally small has an initial object exactly when it has a weakly initial set. A proof is given in Question 5(c). We also use the fact that when preserves small categorical limits, the comma category is complete, with its limits constructed in ; local smallness is inherited from . Finally, having an initial object in for each is the universal arrow from an object to a functor characterization of a left adjoint.
Assume preserves small categorical limits, and fix . We will construct a weakly initial set in , rather than assume a solution set. Start with an arbitrary object , where . Call a subobject supporting if for some . There is at least one, namely . Because preserves pullbacks in a category, it preserves monomorphisms: the self-pullback characterization of a monic map is preserved. Consequently each is unique.
There is a set of supporting subobjects by well-poweredness. Their intersection of subobjects exists by completeness; write it . Applying to this intersection categorical limit gives a unique lifting all the , and hence . Minimality says that any subobject supporting is invertible: supports , so factors through , giving a right inverse to the monic .
If satisfy , their equalizer supports , since preserves that equalizer. It is therefore an isomorphism, and . We have obtained an injective function
Let be its image, a subset of the fixed set . The evaluation embedding into cogenerator products is a monomorphism
Indeed each corresponds to a unique map , and the cogenerating set property makes the resulting family jointly monic. Notice that we use the realized subsets , not all of : there need not be a map available for an unused index.
There is a set of tuples , since and every are sets. For each resulting , choose representatives of its subobjects; these form a set by well-poweredness. For every representative , include every map , a set by local smallness of . All resulting pairs form a set. Our given receives a map from such a pair: transport along the isomorphism between and the chosen representative, then compose its inverse with . Thus these pairs form a weakly initial set in . This is the cogenerator bound for comma-category solution sets.
The initial-object lemma for complete categories with a weakly initial set gives an initial object . For , define by the unique equation
Uniqueness proves the functor laws and gives the natural bijections
Thus . Conversely, a right adjoint preserves small categorical limits: its adjunction identifies maps into the proposed limiting object with compatible families of maps into the diagram. This proves both directions of the limit form of the special adjoint functor theorem. Applying the argument to the opposite categories proves the dual statement. Choices of representatives and adjoint objects are understood in the usual ambient-universe convention for large categories.
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.