Equivalence of categories

A functor that is invertible up to natural isomorphism.
Equivalence of categories

Let C,D\mathcal C,\mathcal D be .

Definition

A F:CDF:\mathcal C\to\mathcal D is an equivalence of categories if there exists a functor G:DCG:\mathcal D\to\mathcal C and

η:IdCGF,ε:FGIdD. \eta:\mathrm{Id}_{\mathcal C}\Rightarrow G\circ F, \qquad \varepsilon:F\circ G\Rightarrow \mathrm{Id}_{\mathcal D}.

In this case GG is called a quasi-inverse (or weak inverse) of FF, and we say C\mathcal C and D\mathcal D are equivalent.

Equivalently, FF is an equivalence iff:

  1. (Fully faithful) for all objects X,YCX,Y\in\mathcal C, the induced map on hom-sets HomC(X,Y)HomD(F(X),F(Y)) \mathrm{Hom}_{\mathcal C}(X,Y)\longrightarrow \mathrm{Hom}_{\mathcal D}(F(X),F(Y)) is a bijection, and
  2. (Essentially surjective) every object DDD\in\mathcal D is to some F(C)F(C).

(These conditions make precise that FF preserves and reflects all morphism data, and hits every object up to isomorphism.)

Examples

  1. Finite sets vs. standard finite sets (FinSet).
    Let FinSet\mathbf{FinSet} be the category of finite sets. Let FinStd\mathbf{FinStd} be the full subcategory whose objects are the standard sets [n]={1,2,,n}[n]=\{1,2,\dots,n\} (including [0]=[0]=\varnothing).
    The inclusion FinStdFinSet\mathbf{FinStd}\hookrightarrow \mathbf{FinSet} is an equivalence: every finite set is bijective to exactly one [n][n] up to isomorphism, and morphisms are just set functions.

  2. Finite-dimensional vector spaces vs. matrices.
    Let FinVectk\mathbf{FinVect}_k be finite-dimensional kk-vector spaces. Let Matk\mathbf{Mat}_k be the category with:

    • objects natural numbers nn,
    • morphisms nmn\to m given by m×nm\times n matrices over kk,
    • composition given by matrix multiplication.
      The functor F:MatkFinVectkF:\mathbf{Mat}_k\to \mathbf{FinVect}_k sending nknn\mapsto k^n and a matrix to the corresponding linear map is an equivalence (choosing a basis identifies any finite-dimensional space with some knk^n).
  3. A category is equivalent to its skeleton.
    A skeleton of C\mathcal C is a full containing exactly one object from each isomorphism class of objects in C\mathcal C.
    The inclusion of a skeleton Sk(C)C\mathrm{Sk}(\mathcal C)\hookrightarrow \mathcal C is an equivalence: it is fully faithful (being full) and essentially surjective by construction.