Functors and equivalence are key concepts in category theory, linking different mathematical structures. They help us understand how categories relate to each other, with essentially surjective functors "reaching" all objects and fully faithful functors preserving morphism structures.
Equivalence of categories is a powerful tool, combining essential surjectivity and full faithfulness. It allows us to view seemingly different categories as essentially the same, preserving both objects and morphisms. This concept is crucial for understanding deep connections in mathematics.
Functors and Equivalence
Definition of essentially surjective functors
- A functor is essentially surjective if for every object in the codomain category , there exists an object in the domain category such that is isomorphic to
- Intuitively means every object in the codomain category is "essentially" reached by the functor, up to isomorphism
- The forgetful functor is essentially surjective
- For any set in , there exists a group in such that
- The functor that includes abelian groups into groups is essentially surjective
- Every group is isomorphic to an abelian group, so the functor "essentially" reaches all objects in

Definition of fully faithful functors
- A functor is fully faithful if for any two objects in the domain category , the map is bijective
- Intuitively means the functor induces a bijection between the hom-sets of the source and target categories, preserving the morphism structure
- The inclusion functor is fully faithful
- For any two abelian groups , the group homomorphisms between and are exactly the same as the group homomorphisms between and
- The forgetful functor is not fully faithful
- There exist functions between the underlying sets of two vector spaces that are not linear transformations, so the functor does not induce a bijection on hom-sets

Equivalence of functors
- A functor is an equivalence if and only if it is both fully faithful and essentially surjective
- If is an equivalence, then:
- By definition, has a quasi-inverse such that and
- Essential surjectivity follows from , as every object in is isomorphic to an object in the image of
- Full faithfulness follows from the isomorphisms and , which induce bijections on hom-sets
- If is fully faithful and essentially surjective, then:
- Essential surjectivity allows choosing, for each , an object and an isomorphism
- Define a functor by and for
- The natural isomorphisms and (induced by full faithfulness) make a quasi-inverse of , proving is an equivalence
Natural isomorphisms in surjective functors
- Natural isomorphisms play a crucial role in defining essential surjectivity
- A functor is essentially surjective if for every , there exists and an isomorphism
- The collection of these isomorphisms forms a natural isomorphism , where is a quasi-inverse of
- The natural isomorphism encodes the idea that every object in is "essentially" reached by , up to isomorphism
- Naturality of ensures the isomorphisms are compatible with the morphisms in and
- For any morphism in , the following diagram commutes: F(G(D)) @>F(G(f))>> F(G(D')) \\\\ @V\alpha_DVV @VV\alpha_{D'}V \\\\ D @>>f> D' \end{CD}$$