Equivalence of categories
Let be categories .
Definition
A functor is an equivalence of categories if there exists a functor and natural isomorphisms
In this case is called a quasi-inverse (or weak inverse) of , and we say and are equivalent.
Equivalently, is an equivalence iff:
- (Fully faithful) for all objects , the induced map on hom-sets is a bijection, and
- (Essentially surjective) every object is isomorphic to some .
(These conditions make precise that preserves and reflects all morphism data, and hits every object up to isomorphism.)
Examples
Finite sets vs. standard finite sets (FinSet).
Let be the category of finite sets. Let be the full subcategory whose objects are the standard sets (including ).
The inclusion is an equivalence: every finite set is bijective to exactly one up to isomorphism, and morphisms are just set functions.Finite-dimensional vector spaces vs. matrices.
Let be finite-dimensional -vector spaces. Let be the category with:- objects natural numbers ,
- morphisms given by matrices over ,
- composition given by matrix multiplication.
The functor sending and a matrix to the corresponding linear map is an equivalence (choosing a basis identifies any finite-dimensional space with some ).
A category is equivalent to its skeleton.
A skeleton of is a full full subcategory containing exactly one object from each isomorphism class of objects in .
The inclusion of a skeleton is an equivalence: it is fully faithful (being full) and essentially surjective by construction.