Isomorphism of categories

In category theory, two categories C and D are isomorphic if there exist functors F : C → D and G : D → C that are mutually inverse to each other, i.e. FG = 1D (the identity functor on D) and GF = 1C. This means that both the objects and the morphisms of C and D stand in a one-to-one correspondence with each other. Two isomorphic categories share all properties defined solely in category theory; for all practical purposes, they are identical and differ only in the notation of their objects and morphisms.

Isomorphism of categories is a strong condition and is rarely satisfied in practice. Much more important is the notion of equivalence of categories; roughly speaking, for an equivalence of categories, we don't require that FG be equal to 1D, but only naturally isomorphic to 1D, and likewise that GF be naturally isomorphic to 1C.

Properties

As is true for any notion of isomorphism, we have the following general properties formally similar to an equivalence relation:

A functor F : C → D yields an isomorphism of categories if and only if it is bijective on objects and morphism sets. This criterion can be convenient as it avoids constructing the inverse functor G.

Examples

References

  1. 1 2 Mac Lane, Saunders (1998). Categories for the Working Mathematician. Graduate Texts in Mathematics. Vol. 5 (2nd ed.). Springer-Verlag. p. 14. ISBN 0-387-98403-8. MR 1712872.