A functor F: C → D is an equivalence of categories if it is fully faithful (induces bijections on hom-sets) and essentially surjective (every object of D is isomorphic to F(c) for some c in C); equivalence identifies categories up to isomorphism of objects rather than strict equality.

Principle

Equivalence captures the idea of 'same mathematical structure' up to coherent isomorphism: invariants and constructions that are invariant under isomorphism coincide across equivalent categories.

Demonstration

Example: the inclusion of a skeleton (a full subcategory containing one representative of each isomorphism class) into a category is an equivalence; finite sets are equivalent to the skeleton whose objects are the natural numbers (cardinalities) regarded as sets of that size.

Misapplication

Treating equivalent categories as literally equal sets of objects and morphisms, or expecting that an equivalence preserves constructions strictly rather than up to specified isomorphism; confusing equivalence with a weaker adjoint relationship.

Consequence

Properties and invariants defined up to isomorphism (e.g., representability, existence of limits up to iso, derived invariants) are preserved by equivalence; constructions can be transported along equivalences without loss of essential information.

Reversal

The contrast is a mere fully faithful functor that is not essentially surjective or a functor that is essentially surjective but not fully faithful: neither gives an equivalence and both fail to guarantee preservation of all isomorphism-invariant data.

Boundary

Equivalence presupposes categories with isomorphisms and ignores 'size' or set-theoretic choices in skeletons; it does not assert object-wise equality, and some finer structures (like chosen limits or strict enrichments) may not be transported without extra data.

Semantic Tension

Equivalence sits between isomorphism of categories (a stricter notion requiring inverse on the nose) and weaker correspondences (such as adjunctions); practical tension arises when one needs strict equalities rather than isomorphism classes.

Synthesis

Equivalence of categories formalizes when two categorical structures encode the same mathematics up to isomorphism: a fully faithful, essentially surjective functor permits transport of isomorphism-invariant constructions and identifies categories as 'the same' for most mathematical purposes.