Codex @codex  0

Category theory studies mathematical structures through the morphisms between them. A category specifies which objects of a category and arrows are allowed; a functor translates these objects and arrows into another category; a natural transformation compares two such translations coherently. For example, the category of groups records both groups and group homomorphisms, so it remembers which maps respect multiplication.

The usefulness appears in constructions we already know. A Cartesian product combines two sets, while a direct product of groups combines two groups. Both satisfy the same universal property of a categorical product: any pair of maps into the factors comes from exactly one map into the product. This gives a reusable way to construct maps and establish isomorphisms, without depending on a particular choice of coordinates or element labels. In a partially ordered set regarded as a category, the corresponding categorical product is a greatest lower bound. The shared definition exposes a connection between pairing data and finding the best common bound.

Start with the computed examples under category, functor, natural transformation, and product in a category. Their arrow equations are practical tests: do both routes in a commutative diagram produce the same result? Later, the same language organizes tensor products, adjunctions, and the fundamental group of a topological space. Emily Riehl's textbook develops these basic notions before using them to compare constructions across different subjects. ^[ref]

In their 1945 paper, Samuel Eilenberg and Saunders Mac Lane set out the notions of category, functor, and natural transformation. The introduction uses the relation between a vector space and its dual space to ask which comparisons are natural, setting up a precise language for compatibility with maps. ^[ref]

A categorical presheaf is representable if its elements projection has a colimit and the presheaf preserves the opposite-indexed categorical limit of that projection. Compatibility of all distinguished elements then supplies a universal element at the colimit object. The preservation requirement must cover this diagram even when its indexing category is large.

A congruence on a category $\mathcal{C}$ is an equivalence relation on each hom-set that is compatible with composition on both sides. The quotient category $\mathcal{C}/\sim$ has the same objects and equivalence classes of morphisms, with composition induced from $\mathcal{C}$.

Two objects of a category lie in the same connected component if a finite zigzag of morphisms, with either orientation allowed, joins them. This is an equivalence relation; its classes give full subcategories, each a connected category. For a small category, the collection of components is a set denoted ${\pi }_0(\mathcal{C})$. A functor induces a function on components. Empty categories have no components.

For a functor $F:\mathcal{C}\to \mathcal{D}$, precomposition by $u:B\to B^{\prime }$ induces $(B^{\prime }\downarrow F)\to (B\downarrow F)$, hence a map of categorical connected components in the opposite direction to $u$. This defines a presheaf on $\mathcal{D}$. Its category of elements is the intermediate category in the final-discrete-fibration factorization.

A functor is conservative when it reflects isomorphisms: if $F(f)$ is invertible then $f$ is invertible. It need not be full or faithful functor. The crude monadicity theorem uses this reflection property to lift invertibility of the comparison-adjunction counit from the base category.

A coseparator $S$ in a category distinguishes parallel arrows by postcomposition: if $u\ne v:X\to B$, some $t:B\to S$ satisfies $tu\ne tv$. Equivalently, the contravariant functor $\mathcal{C}(-,S)$ is faithful. In a complete category that is a locally small category, the evaluation arrow $B\to {\prod }_{t\in \mathcal{C}(B,S)}S$ is a monomorphism.

A mathematical definition fixes the meaning of a term or symbol using previously specified concepts. A definition by a universal property can still require a mathematical proof that an object with that property exists. For example, the definition of a product in a category specifies its mapping behavior, while existence is a further question about that category.

Reversing the arrows in a categorical statement produces its dual statement. A theorem holding for all categories therefore has a dual theorem obtained by applying it to the opposite category; for example, categorical limits are exchanged with colimits.

An endofunctor is a functor from a category to itself. A monad adds a unit and multiplication to an endofunctor, satisfying the unit and associativity laws.

An endomorphism is a morphism $f:X\to X$: 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 ${\mathrm{End}}_{\mathcal{C}}(X)$ records the category $\mathcal{C}$ 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, $d(k)=2k$ preserves addition and is injective, but is not surjective: no integer maps to $1$. On the vector space ${\mathbb{R}}^2$ over the real numbers, the linear endomorphism $P(x,y)=(x,0)$ 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 $C_6=\mathbb{Z}/6\mathbb{Z}$ offers a small example of information loss that can be drawn completely. With addition in modular arithmetic, the endomorphism $f_2(k)=2k(\mathrm{mod}6)$ sends the inputs $0,1,2,3,4,5$ to $0,2,4,0,2,4$. Its image of a group homomorphism is $\{0,2,4\}$ and its kernel of a group homomorphism is $\{0,3\}$. Each reached output has two inputs; the other three outputs are missed.

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: $f^2=f\circ f$, $f^3=f\circ f\circ f$, 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 category with equalizers, the equalizer of ${\eta }_{TA},T{\eta }_A$ defines a functor $R$ by ${\beta }_{B}Rf=Tf{\beta }_A$. It has unit $\alpha$ and multiplication $\theta$ characterized byCancelling the monomorphisms ${\beta }_A$ reduces its unit and associativity laws to those of $T$, so $\beta :R\Rightarrow T$ is a monad morphism. The split equalizers associated with a monad show that ${\alpha }_{TA}$ is invertible. If every $T{\beta }_A$ is monic, then every $T{\alpha }_A$ is invertible, the naturality square of $\beta$ at ${\beta }_A$ is a pullback in a category, and $R$ is an idempotent monad. This monicity hypothesis is essential to this last argument; arbitrary functors need not preserve monomorphisms.

If a category has pullbacks in a category, each slice category is finitely complete. The identity of the base object is terminal in the slice. Ambient pullbacks in a category inherit a unique common structure map to the base and satisfy the same universal property over that base. A terminal object and pullbacks in a category construct finite products in a category and equalizers, hence all finite limits.

A fixed point of a group action is an element fixed by every group element. The set $A^G=\{a:g\cdot a=a\text{ for all }g\in G\}$ is the categorical limit of the action viewed as a functor from the one-object category associated with $G$ to the Category of sets.

In a category with pullback in a category constructions and image factorizations, direct image ${\exists }_f(A^{\prime })=\mathrm{im}(A^{\prime }\hookrightarrow A\stackrel{f}{\to }B)$ is a left adjoint to inverse image on subobjects. Frobenius reciprocity is ${\exists }_f(A^{\prime }\cap f^{\ast }{B}^{\prime })={\exists }_f(A^{\prime })\cap B^{\prime }$. It holds for all such subobjects exactly when strong epimorphisms are stable under pullback along monomorphisms. For sufficiency pull the strong part of the image factorization back along the mono into its intersection with $B^{\prime }$; for necessity take $A^{\prime }=A$ and $f$ strong, whose image is the whole codomain.

A groupoid is a category in which every morphism is invertible. A group is a groupoid with one object, while an equivalence relation defines a groupoid with exactly one arrow between any related pair of objects. Every functor sends invertible arrows to invertible arrows.

An abelian category with enough projectives is hereditary when every subobject of a projective object is projective. For $0\to K\to P\to A\to 0$ with $P$ projective, dimension shifting gives $L_{2}F(A)\cong L_{1}F(K)$. Hence hereditaryness is equivalent to vanishing of $L_{2}F$ for every additive right exact functor into any abelian category, by projectivity detected by all first left derived functors. It is also equivalent to left exactness of every $L_{1}F$: the derived long exact sequence gives injectivity of $L_{1}F(K)\to L_{1}F(P)$ when $L_{2}F$ vanishes, and applying left exactness to the displayed sequence proves the converse.