Let be categories.

We say and are equivalent, written

if there exists a functor that is:

Remarks

This is weaker than isomorphism of categories.

A common slogan is that category theory studies structure only up to equivalence, rather than up to isomorphism.

One can also define equivalence by asking for functors

together with natural isomorphisms

This is equivalent to the full, faithful, essentially surjective characterization above.

Some examples of equivalences use the Axiom of Choice. In particular, identifying each set with a chosen ordinal of the same cardinality depends on choice.

Example

Let Set be the category of sets and functions, and let Ord be the full subcategory on ordinals, with arbitrary functions as morphisms.

Assuming the Axiom of Choice, there is an equivalence

More precisely, one chooses for each set an ordinal together with a bijection

Define a functor

by

Full

Given a function

define

Then

Faithful

Suppose satisfy . Then

Composing on the left with and on the right with gives

Essentially Surjective

Let be an object of . Since is itself a set, , and by construction there is a bijection

Hence every object of is isomorphic to one in the image of .

Resources