ConceptComplete

Equivalence of Categories

An equivalence of categories is the correct notion of "sameness" for categories. Unlike isomorphism (which is too strict), equivalence allows for the identification of isomorphic objects and captures the principle that categories sharing the same structural properties should be considered "the same."


Definition

Definition1.15Equivalence of Categories

An equivalence of categories consists of functors F:CDF : \mathcal{C} \to \mathcal{D} and G:DCG : \mathcal{D} \to \mathcal{C} together with natural isomorphisms

η:IdC    GFandε:FG    IdD\eta : \mathrm{Id}_{\mathcal{C}} \xrightarrow{\;\sim\;} G \circ F \qquad \text{and} \qquad \varepsilon : F \circ G \xrightarrow{\;\sim\;} \mathrm{Id}_{\mathcal{D}}

We write CD\mathcal{C} \simeq \mathcal{D} and say C\mathcal{C} and D\mathcal{D} are equivalent categories. The functor FF is called an equivalence, and GG is called a quasi-inverse of FF.

Definition1.16Isomorphism of Categories

An isomorphism of categories is a functor F:CDF : \mathcal{C} \to \mathcal{D} with an inverse G:DCG : \mathcal{D} \to \mathcal{C} such that GF=IdCG \circ F = \mathrm{Id}_{\mathcal{C}} and FG=IdDF \circ G = \mathrm{Id}_{\mathcal{D}} (strict equality, not just natural isomorphism).

RemarkEquivalence vs Isomorphism

Isomorphism of categories is almost always too strong. For instance, Vectkfd\mathbf{Vect}_k^{\mathrm{fd}} (finite-dimensional vector spaces) is equivalent but not isomorphic to Matk\mathbf{Mat}_k (natural numbers with matrices as morphisms). The right notion is equivalence: it preserves all categorical properties (limits, colimits, exactness, etc.) while allowing flexibility in the choice of representatives.


The Characterization Theorem

Theorem1.7Characterization of Equivalences

A functor F:CDF : \mathcal{C} \to \mathcal{D} is an equivalence of categories if and only if it is:

  1. Fully faithful: For all A,BCA, B \in \mathcal{C}, the map F:Hom(A,B)Hom(F(A),F(B))F : \mathrm{Hom}(A, B) \to \mathrm{Hom}(F(A), F(B)) is a bijection.
  2. Essentially surjective: For every DDD \in \mathcal{D}, there exists CCC \in \mathcal{C} with F(C)DF(C) \cong D.
Proof

(\Rightarrow) Suppose FF is an equivalence with quasi-inverse GG and natural isomorphisms η,ε\eta, \varepsilon.

Fully faithful: Given f,g:ABf, g : A \to B with F(f)=F(g)F(f) = F(g), apply GG to get GF(f)=GF(g)GF(f) = GF(g). Since η\eta is a natural isomorphism, ηBf=GF(f)ηA=GF(g)ηA=ηBg\eta_B \circ f = GF(f) \circ \eta_A = GF(g) \circ \eta_A = \eta_B \circ g, so f=gf = g (faithful). For fullness, given h:F(A)F(B)h : F(A) \to F(B), set f=ηB1G(h)ηAf = \eta_B^{-1} \circ G(h) \circ \eta_A. Then F(f)=hF(f) = h by a similar naturality argument.

Essentially surjective: For any DDD \in \mathcal{D}, we have F(G(D))DF(G(D)) \cong D via εD\varepsilon_D.

(\Leftarrow) Suppose FF is fully faithful and essentially surjective. For each DDD \in \mathcal{D}, choose G(D)CG(D) \in \mathcal{C} and an isomorphism εD:F(G(D))D\varepsilon_D : F(G(D)) \xrightarrow{\sim} D. For a morphism h:DDh : D \to D' in D\mathcal{D}, define G(h)G(h) to be the unique morphism making the square commute (using full faithfulness). Then GG is a functor, and ε\varepsilon and the induced η\eta are natural isomorphisms.


Skeleton

Definition1.17Skeleton

A skeleton of a category C\mathcal{C} is a full subcategory C0C\mathcal{C}_0 \subseteq \mathcal{C} containing exactly one object from each isomorphism class. Every category is equivalent to any of its skeletons.


Examples

ExampleFinite-dimensional vector spaces and matrices

The category Vectkfd\mathbf{Vect}_k^{\mathrm{fd}} of finite-dimensional vector spaces over kk is equivalent to Matk\mathbf{Mat}_k (objects: natural numbers, morphisms: matrices). The equivalence sends VV to dimV\dim V and a linear map to its matrix with respect to chosen bases. The skeleton of Vectkfd\mathbf{Vect}_k^{\mathrm{fd}} is Matk\mathbf{Mat}_k: each nn-dimensional space is isomorphic to knk^n.

ExampleCompact Hausdorff spaces and commutative C*-algebras

Gelfand duality: the category of compact Hausdorff spaces is equivalent to the opposite of the category of commutative unital C*-algebras. The functors are XC(X)X \mapsto C(X) (continuous functions) and AMax(A)A \mapsto \mathrm{Max}(A) (maximal ideal space).

ExampleAffine schemes and commutative rings

The category of affine schemes is equivalent to CRingop\mathbf{CRing}^{\mathrm{op}}. The equivalence sends SpecAA\mathrm{Spec}\, A \mapsto A and ASpecAA \mapsto \mathrm{Spec}\, A. This is the starting point of algebraic geometry: geometric objects (affine schemes) correspond to algebraic objects (commutative rings) contravariantly.

ExampleCovering spaces and group actions

For a connected, locally simply connected space XX with fundamental group π1(X,x0)=G\pi_1(X, x_0) = G, the category of covering spaces of XX is equivalent to the category of GG-sets: Cov(X)G-Set\mathbf{Cov}(X) \simeq G\text{-}\mathbf{Set}. The equivalence sends a covering p:X~Xp : \tilde{X} \to X to the fiber p1(x0)p^{-1}(x_0) with the monodromy action.

ExamplePresheaves on a discrete category

For a discrete category with objects {1,2,,n}\{1, 2, \ldots, n\}, the presheaf category [Cop,Set][\mathcal{C}^{\mathrm{op}}, \mathbf{Set}] is equivalent to Setn\mathbf{Set}^n (the category of nn-tuples of sets). A presheaf on a discrete category is simply a choice of one set for each object.

ExampleModules over Morita equivalent rings

Two rings RR and SS are Morita equivalent if their module categories are equivalent: R-ModS-ModR\text{-}\mathbf{Mod} \simeq S\text{-}\mathbf{Mod}. For example, RR and Mn(R)M_n(R) are always Morita equivalent. Morita equivalence preserves all categorical properties of module categories (projectivity, injectivity, exactness) but not ring-theoretic properties (commutativity, being a field).

ExampleG-sets and functors from BG

For a group GG, the category of GG-sets is equivalent to the functor category [BG,Set][\mathbf{B}G, \mathbf{Set}], where BG\mathbf{B}G is the one-object category with morphisms GG. A functor BGSet\mathbf{B}G \to \mathbf{Set} picks a set SS and gives an action G×SSG \times S \to S; natural transformations correspond to equivariant maps.

ExampleCategory of finite sets

Let FinSet\mathbf{FinSet} be the category of finite sets and let F\mathbf{F} be the category whose objects are {[n]={1,,n}:n0}\{[n] = \{1, \ldots, n\} : n \geq 0\} (with [0]=[0] = \varnothing) and whose morphisms are all functions. Then F\mathbf{F} is a skeleton of FinSet\mathbf{FinSet}: every finite set is isomorphic to exactly one [n][n].

ExampleConnected groupoids and groups

A connected groupoid (a groupoid with a single isomorphism class) is equivalent to BG\mathbf{B}G for some group GG: pick any object xx, set G=Aut(x)G = \mathrm{Aut}(x), and the equivalence BGG\mathbf{B}G \to \mathcal{G} sends * to xx. In particular, the fundamental groupoid Π1(X)\Pi_1(X) of a path-connected space XX is equivalent to Bπ1(X,x0)\mathbf{B}\pi_1(X, x_0).

ExampleNon-equivalent categories

Set\mathbf{Set} and Setop\mathbf{Set}^{\mathrm{op}} are not equivalent. One way to see this: Set\mathbf{Set} has a zero object candidate (the empty set is initial but not terminal), while in Setop\mathbf{Set}^{\mathrm{op}} the empty set is terminal but not initial. More precisely, Set\mathbf{Set} has a strict initial object (no morphisms into \varnothing from nonempty sets), but Setop\mathbf{Set}^{\mathrm{op}} does not have this property for its initial object.

ExampleEquivalence preserves limits and colimits

If CD\mathcal{C} \simeq \mathcal{D}, then C\mathcal{C} has all (co)limits of a given type if and only if D\mathcal{D} does. For example, Ab\mathbf{Ab} is an abelian category, so any category equivalent to Ab\mathbf{Ab} is also abelian. Equivalence also preserves: having enough injectives/projectives, being locally small, having a generator, etc.

ExampleDerived categories and equivalences

In the Gelfand-Manin framework, a key question is when two abelian categories A\mathcal{A} and B\mathcal{B} have equivalent derived categories Db(A)Db(B)D^b(\mathcal{A}) \simeq D^b(\mathcal{B}). This is a weaker condition than AB\mathcal{A} \simeq \mathcal{B} and is the subject of Fourier-Mukai theory and tilting theory. For instance, Db(Coh(X))Db(Coh(Y))D^b(\mathrm{Coh}(X)) \simeq D^b(\mathrm{Coh}(Y)) for certain non-isomorphic varieties XX and YY.


Properties Preserved by Equivalence

Theorem1.8Invariance under equivalence

If F:CDF : \mathcal{C} \to \mathcal{D} is an equivalence, then:

  1. FF preserves and reflects limits and colimits.
  2. FF preserves and reflects monomorphisms, epimorphisms, and isomorphisms.
  3. C\mathcal{C} is abelian if and only if D\mathcal{D} is abelian.
  4. C\mathcal{C} has enough injectives if and only if D\mathcal{D} does.
RemarkThe principle of equivalence

In category theory, one should never distinguish between equivalent categories. Any property or construction that is not invariant under equivalence is considered "evil" (a technical term in the categorical literature). This principle extends to higher category theory: in an nn-category, the correct notion of sameness at level kk should use equivalences, not strict equalities.