Automorphism Created 2026-09-24 Updated 2026-10-14
An automorphism is an isomorphism : a structure-preserving self-map that can be undone by another structure-preserving self-map. Equivalently, it is an invertible endomorphism. Its inverse satisfies
where is the identity morphism. Both maps must be morphisms in the chosen category. For ordinary groups, rings, and vector spaces over a fixed field, a bijective morphism automatically has a compatible inverse. For topological spaces, an automorphism is a homeomorphism from the space to itself: a continuous bijection needs a continuous inverse as well. See Riehl, Category Theory in Context, Definition 1.1.10 and Example 1.1.11.
For example, is an automorphism of the vector space over the real numbers, with inverse . Both are linear maps. The linear endomorphism from endomorphism preserves addition and scalar multiplication too, but discards a coordinate and cannot be undone. Preserving the structure and preserving enough information for reversal are separate requirements.
The automorphisms of a fixed object in a locally small category form a group under composition in a category: the identity morphism is the identity element, and the inverse element of a composite reverses the order of its factors. This makes reversible internal changes calculable. For a group, the resulting automorphism group records which relabelings preserve all products; the examples in group automorphism show how restrictive that condition can be.
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.
Coseparator 2026-10-06
A coseparator in a category distinguishes parallel arrows by postcomposition: if , some satisfies . Equivalently, the contravariant functor is faithful. In a complete category that is a locally small category, the evaluation arrow is a monomorphism.
Covariant representables are projective Created 2026-10-06 Updated 2026-10-14
For a locally small category , every representable functor is a projective object in a category in . The Yoneda lemma identifies maps from this functor with elements at , and the pointwise epimorphism in a functor category criterion lets such an element be lifted through any epimorphism.
Endomorphism Created 2026-09-24 Updated 2026-10-14
An endomorphism is a morphism : its source and target are the same object, with the same specified structure. For a group it is an operation-preserving group homomorphism back into that group; for a vector space it is a linear endomorphism; for a ring it is a ring endomorphism. A self-map must satisfy the chosen compatibility conditions to qualify. The notation records the category in which these conditions are imposed. See Riehl, Category Theory in Context, Definition 1.1.10 and the following paragraph.
An endomorphism can lose information or miss part of its target. On the additive integers, preserves addition and is injective, but is not surjective: no integer maps to . On the vector space over the real numbers, the linear endomorphism loses the second coordinate, so it is neither injective nor surjective. Neither is an automorphism. The same doubling rule becomes a group isomorphism when its target is the additive even integers, as explained under isomorphism.
The finite cyclic group offers a small example of information loss that can be drawn completely. With addition in modular arithmetic, the endomorphism sends the inputs to . Its image of a group homomorphism is and its kernel of a group homomorphism is . Each reached output has two inputs; the other three outputs are missed.
Figure 1.
Two endomorphisms of the additive cyclic group modulo six
. Every arrow maps an input to its output, rather than taking one step of repeated addition. The endomorphism collapses pairs; the group automorphism is a bijection. Orange marks the kernel of a group homomorphism in each panel. Source. Details.
For an endomorphism of a group or ring with a finite underlying set, injectivity is equivalent to surjectivity by counting; either condition makes it an automorphism. The additive integers example shows why the finiteness assumption matters. A linear endomorphism of a finite-dimensional vector space also has equivalent injectivity and surjectivity, this time by the rank-nullity theorem even when its underlying set is infinite.
Self-maps can be iterated without changing the object: , , and so on. Composition in a category and the identity morphism make the endomorphisms of a fixed object in a locally small category into a monoid. This packages repeated compatible operations, including irreversible ones, into a single structure.
The general language has a documented historical milestone in the 1945 paper of Samuel Eilenberg and Saunders Mac Lane. They defined categories of objects and compatible maps, and distinguished maps admitting inverses within that category. Their examples included groups, vector spaces, and topological spaces. This gave a common framework for compatible self-maps and their invertible cases. See Eilenberg and Mac Lane, General Theory of Natural Equivalences, pp. 234 and 237–239.
In a complete category that is a locally small category with a coseparator , suppose every monomorphism is a regular monomorphism. The evaluation embedding , , is an equalizer of some pair into . Composing that pair with the evaluation embedding leaves the equalizer unchanged. Here powers mean products in a category indexed by sets, without assuming an exponential object exists.
For a small cogenerating family in a locally small category, the evaluation arrow is a monomorphism whenever that small product in a category exists. Equality after all its projections is equality after every map to a cogenerator, hence equality of the original parallel morphisms.
In a complete category that is a locally small category with a coseparator and all monomorphisms regular, an object is an exponentiable object exactly when is a representable functor. A representing object gives representations for maps into powers . An equalizer presentation by powers of a coseparator then constructs a representation for maps into every target. The Yoneda lemma makes these representations functorial and supplies the right adjoint.
Freyd general adjoint functor theorem Created 2026-10-06 Updated 2026-10-14
For a functor between locally small categories, with a complete category, has a left adjoint if and only if it preserves small categorical limits and satisfies the solution-set condition. The dual statement uses cocompleteness, small-colimit preservation and weakly terminal solution sets to characterize existence of a right adjoint.
Hom-set 2026-10-06
In a locally small category, the morphisms from to form the set . Postcomposition and precomposition give the corresponding covariant and contravariant representable functors.
A locally small category with all small categorical limits and a small weakly initial set has an initial object. Take the product of the weakly initial family, then the simultaneous equalizer of all endomorphisms of and its identity. For any parallel , their equalizer receives a map . The equation forces , so is invertible and . Weak initiality supplies existence of maps from . This is the smallness mechanism in the Freyd general adjoint functor theorem.
Morphism in a category 2026-10-14
A categorical morphism is an arrow with a specified source and target in a category. An arrow composes with to give . Composition is associative, and every object has an identity arrow acting as a unit. A functor preserves the sources, targets, identities and compositions of these arrows. In a locally small category, the arrows between fixed objects form a hom-set.
Let be a locally small category, let be a representable presheaf, and let . The Yoneda lemma gives a bijection, natural in and ,
For , define a natural transformation by
For , the functor composition law gives , proving naturality. Conversely, naturality of any along gives
Thus is determined by its displayed element, and proves that the constructions are inverse.
A natural transformation sends the element to , which corresponds to . A morphism induces ; precomposition by sends the element to . This proves naturality in both variables and completes the Yoneda lemma proof.
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.
For a small diagram in a locally small category, define its cone functor on by
where is the constant diagram. Precomposition acts on cone vertices. A categorical limit is a representation of this functor: an object with natural bijections . The image of is the universal cone, and the inverse bijection supplies the unique mediating arrow for every cone. Thus the representable functor formulation and the usual terminal-cone universal property coincide.
Let be the inclusion. Both categories are locally small categories. By the Tychonoff theorem, small products in a category of compact Hausdorff spaces are compact Hausdorff, with their ordinary product topology. The equalizer of two continuous maps between compact Hausdorff spaces is closed in the source: it is the inverse image of the closed diagonal of the target. Hence it is again compact Hausdorff. The usual construction of small categorical limits from products and equalizers proves that is a complete category, and that preserves its small limits as limits in .
We verify the solution-set condition for an arbitrary topological space . Put and . Given a continuous map with compact Hausdorff, let
This closed subspace is compact Hausdorff, and is dense in it. The allowed cardinal estimate therefore gives . The map factors through the continuous map and the subspace inclusion .
Choose a fixed set of cardinality . Consider all compact Hausdorff topologies on subsets of , together with all continuous maps from into the resulting spaces. There are only a set of such topologies and functions. Every above is homeomorphic to one of these spaces after relabelling its underlying set. Consequently every factors through a member of this set of maps. This proves the solution-set condition, including .
The general adjoint functor theorem now gives the compact Hausdorff reflection
Its unit is universal for continuous maps from to compact Hausdorff spaces. For arbitrary , this is a reflection, and the unit is not required to be a topological embedding.