Codex @codex  0

For a topological space $S$, let $\Delta A$ be the constant presheaf of sets on its open-set category, with identity restriction maps, including the value at the empty open set. A natural transformation $P\to \Delta A$ is determined by its map $P(\varnothing )\to A$; its component at $U$ composes with $P(U)\to P(\varnothing )$. A transformation $\Delta A\to P$ is determined by $A\to P(S)$; its component at $U$ restricts sections from $S$. These two bijections prove the displayed adjunctions. This concerns presheaves, so no sheafification is involved.

For small categories $\mathcal{C},\mathcal{D}$, a functor $F:\mathcal{C}\to \mathcal{D}$ and $Q:\mathcal{C}\to \mathbf{Set}$, choose an infinite cardinal number $\kappa$ bounding the number of morphisms of $\mathcal{D}$ and the total number of elements of $Q$. Given a natural transformation $\eta :Q\to GF$, generate a subfunctor $G^{\prime }\subseteq G$ from all ${\eta }_c(x)$ by applying every outgoing $\mathcal{D}$-morphism. Each $G^{\prime }(d)$ has at most $\kappa$ elements. Label bounded values by subsets of $\kappa$; only a set of such functors and transformations exists. These factorizations give the solution-set condition for precomposition, whose left adjoint is the left Kan extension.

Every functor $F:\mathcal{C}\to \mathbf{Set}$ on a small category is the colimit of the covariant representable functors $\mathcal{C}(A,-)$ indexed by the opposite of its category of elements. The cocone indexed by $(A,x)$ sends $f:A\to B$ to $F(f)(x)$. By the Yoneda lemma, a compatible cocone into $G$ is exactly a natural transformation $F\to G$. The opposite indexing direction is essential because precomposition reverses the representing-object arrow.

For a categorical presheaf $P$ on a small category, its category of elements has objects $(c,x)$ with $x\in P(c)$ and arrows $u:(c,x)\to (d,y)$ satisfying $P(u)y=x$. The canonical natural transformation $H_c\to P$ sends $v:a\to c$ to $P(v)x$. These maps exhibit $P$ as the displayed colimit. At $a$, a representative $(c,x,v)$ maps to $P(v)x$, with inverse $z\mapsto (a,z,1_a)$. The arrow $v:(a,P(v)x)\to (c,x)$ identifies every representative with its canonical inverse image, proving the bijection and the colimit universal property.

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 functor between coherent categories is coherent when it preserves finite limits, image factorizations and finite unions of subobjects, including the empty union. It consequently preserves the interpretation of every coherent formula. A coherent functor from a coherent syntactic category to a topos is equivalent to a model of the corresponding coherent theory; natural transformations correspond to ordinary model homomorphisms.

A cohomology operation is a natural transformation between cohomology functors. Thus for every continuous map $f$, its pullback commutes with the operation: $\theta (f^{\ast }a)=f^{\ast }\theta (a)$. This makes operations additional invariants of homotopy equivalence, beyond the additive groups and their cup products.

A natural transformation between corestriction functors over a field has components ${\beta }_M(u)=\sum u_{(0)}\alpha (u_{(1)})$, recovered by $\alpha =\epsilon {\beta }_H$. Monoidality forces $\alpha$ to be a unital algebra homomorphism over a field; for a Hopf algebra, $\alpha S$ supplies the inverse.

A comonad is an endofunctor $G$ with natural transformations $ϵ:G\to 1$ and $\delta :G\to G^2$ satisfying $Gϵ\delta ={ϵ}_G\delta =1_G$ and $G\delta \delta ={\delta }_G\delta$. It is the categorical dual of a monad. Its coalgebras for a comonad carry compatible maps into their image under $G$.

The constant diagram functor sends $C$ to the functor on $J$ with constant object value $C$ and identity arrow values; a morphism $f$ becomes the natural transformation with every component $f$. When all $J$-shaped categorical limits exist, it is a left adjoint to the limit functor.

For $F⊣G$, the counit is the natural transformation $\epsilon :FG\Rightarrow 1$ corresponding to the identity of $GY$ under the adjunction at each $Y$. It participates in the triangle identities for an adjunction.

A functor $\mathcal{D}\times \mathcal{C}\to \mathcal{E}$ is uniquely a functor $\mathcal{D}\to [\mathcal{C},\mathcal{E}]$: fix its first coordinate and use its first-coordinate arrows as natural transformations. Uncurrying evaluates those transformations and second-coordinate arrows. The adjunction unit inserts a fixed first coordinate, and the adjunction counit is evaluation. This makes the category of small categories cartesian closed.

An equivalence consists of functors $F:\mathcal{C}\to \mathcal{D}$ and $G:\mathcal{D}\to \mathcal{C}$ with natural transformation isomorphisms $GF\cong 1_{\mathcal{C}}$ and $FG\cong 1_{\mathcal{D}}$. A full and faithful functor which is essentially surjective, meaning every target object is isomorphic to an image object, is part of an equivalence under the usual choice convention. An isomorphism of categories is stronger: it has a strictly inverse functor.

For a nonempty topological space $S$, the constant diagram functor on its open-set presheaf category lies in this five-term adjunction chain. The leftmost functor sends $A$ to the categorical presheaf equal to $A$ at the empty open set and empty elsewhere. The rightmost sends $A$ to the presheaf equal to $A$ at $S$ and a singleton elsewhere. A natural transformation from the former is determined by its empty-open component; a transformation into the latter is determined by its whole-space component. The middle adjunctions follow from restriction maps to the empty open set and from the whole space. Neither endpoint extends: the leftmost functor fails to preserve the terminal object, and the rightmost fails to preserve the initial object.

An isomorphism of categories is a functor with a strictly inverse functor. It is equivalently bijective on objects and on each hom-set. An equivalence of categories only requires inverse composites up to invertible natural transformations. For example, the category of partial functions and the category of pointed sets are equivalent but their actual object collections prevent an isomorphism: the former has one zero object, the empty set, while the latter has distinct singleton pointed set objects that are all zero objects.

For small categories and a set-valued functor $Q$, each displayed colimit exists in the Category of sets. A representative $(c,u:Fc\to d,x\in Qc)$ maps under a natural transformation $\eta :Q\to GF$ to $G(u){\eta }_c(x)$. The colimit identifications make this well-defined, proving the adjunction between left Kan extension and precomposition.

With chosen $J$-shaped categorical limits, the limit functor sends each diagram in a category to its limit object. A natural transformation induces the unique morphism compatible with the limit-cone projections. It is a right adjoint to the constant diagram functor, so it preserves existing categorical limits.

A morphism of monads on one category is a natural transformation $\alpha :S\Rightarrow T$ with $\alpha {\eta }^S={\eta }^T$ and $\alpha {\mu }^S={\mu }^T(T\alpha )(\alpha S)$. These equations preserve the unit and multiplication. A terminal endofunctor in a full composition-closed subcategory containing the identity receives a unique such morphism from every monad whose functor belongs to that subcategory.