In category theory, two categories C and D are isomorphic if there exist functors F : CD and G : DC that are mutually inverse to each other, i.e. FG = 1D (the identity functor on D) and GF = 1C.[1] This means that both the objects and the morphisms of C and D stand in a one-to-one correspondence to each other. Two isomorphic categories share all properties that are defined solely in terms of 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 very strong condition and 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 be equal to , but only naturally isomorphic to , and likewise that be naturally isomorphic to .

Properties

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

A functor F : CD yields an isomorphism of categories if and only if it is bijective on objects and on morphism sets.[1] This criterion can be convenient as it avoids the need to construct the inverse functor G.

Examples

See also

References

  1. ^ a b 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.