Category theory has a reputation for being “all definitions and diagrams.” That reputation is deserved, but it can hide a deeper truth: in this subject, the definitions are often the theorems in disguise. One well-chosen counterexample can clarify what the definitions are really doing, why the hypotheses in standard criteria are not decorative, and how to test claims quickly without getting lost in generalities.
This post builds that clarity around one of the first big ideas you meet: equivalence of categories. Many newcomers try to import a set-theoretic picture (“same objects and arrows, just renamed”), and then wonder why category theory insists on the trio full, faithful, and essentially surjective. The counterexamples below show that if you drop any one of these conditions, you can land in situations that look correct from a distance but are fundamentally different from an equivalence. Each counterexample is small enough to hold in your head, and each teaches a reusable diagnostic.
Premium Audio PickWireless ANC Over-Ear HeadphonesBeats Studio Pro Premium Wireless Over-Ear Headphones
Beats Studio Pro Premium Wireless Over-Ear Headphones
A broad consumer-audio pick for music, travel, work, mobile-device, and entertainment pages where a premium wireless headphone recommendation fits naturally.
- Wireless over-ear design
- Active Noise Cancelling and Transparency mode
- USB-C lossless audio support
- Up to 40-hour battery life
- Apple and Android compatibility
Why it stands out
- Broad consumer appeal beyond gaming
- Easy fit for music, travel, and tech pages
- Strong feature hook with ANC and USB-C audio
Things to know
- Premium-price category
- Sound preferences are personal
The target: what “equivalence” is trying to capture
A functor $F : \mathcal{C} \to \mathcal{D}$ is an **equivalence of categories** if there exists a functor $G : \mathcal{D} \to \mathcal{C}$ and natural isomorphisms
Equivalence is weaker than isomorphism of categories, and that is deliberate: in most mathematical settings, objects have “the same structure” when they are isomorphic, not literally identical. Equivalence is the categorical notion of “same mathematical content up to isomorphism.”
There is a standard criterion:
- $F$ is an equivalence if and only if $F$ is fully faithful and essentially surjective.
Here:
- Faithful means distinct morphisms in $\mathcal{C}$ stay distinct after applying $F$.
- Full means every morphism in $\mathcal{D}$ between objects in the image of $F$ actually comes from some morphism in $\mathcal{C}$.
- Essentially surjective means every object of $\mathcal{D}$ is isomorphic to some object of the form $F(c)$.
It is tempting to treat these as technicalities. The counterexamples show they are the whole story.
A counterexample \to a common misconception
A natural first guess is:
- “If $F$ is faithful and essentially surjective, then it should be an equivalence.”
This is false. The counterexample also explains what fullness controls: it prevents the target category from having “extra morphisms” that $\mathcal{C}$ does not witness.
The tiny categories
Define $\mathcal{C}$ as the category with two objects $0$ and $1$, and morphisms:
- identities $\mathrm{id}_0, \mathrm{id}_1$,
- one additional morphism $f : 0 \to 1$,
- no morphism from $1$ \to $0$ other than “nothing,” and no other non-identity endomorphisms.
So the picture is:
text
0 --f--> 1Define $\mathcal{D}$ as the **terminal category** $\mathbf{1}$: one object $*$ and exactly one morphism $\mathrm{id}_*$.
Now define the functor $F : \mathcal{C} \to \mathcal{D}$ by sending both objects \to $*$ and sending every morphism \to $\mathrm{id}_*$. There is only one possible choice on morphisms because $\mathcal{D}$ has only one morphism.
Why this is faithful and essentially surjective
- Essentially surjective: $\mathcal{D}$ has exactly one object $__GCNKDDTOK_2__( = F(0)$. So every object of $\mathcal{D}$ is isomorphic to something in the image of $F$ (in fact, equal to it).
- Faithful: for each pair of objects $x,y$ in $\mathcal{C}$, the map
is injective. This is true because:
– if $\mathrm{Hom}_{\mathcal{C}}(x,y)$ is empty, the function from the empty set is automatically injective,
– if it has one element, any function out of a singleton is injective.
In $\mathcal{C}$, every hom-set has either 0 or 1 morphism. Therefore $F$ is faithful.
Why it is not full, and therefore not an equivalence
Look at the pair $(1,0)$. In $\mathcal{C}$, there is **no** morphism $1 \to 0$, so
But in $\mathcal{D}$, regardless of objects,
The induced map
cannot be surjective. So $F$ is not full.
And once fullness fails, equivalence fails: $\mathcal{D}$ contains a morphism between $F(1)$ and $F(0)$ that cannot be lifted \to a morphism between $1$ and $0$ in $\mathcal{C}$. Intuitively, $F$ collapses both objects \to $*$, and by doing so it also collapses the “absence of arrows” between them. The target category can no longer distinguish “there is no arrow from $1$ \to $0$” from “there is a unique arrow,” because in $\mathbf{1}$ there is always exactly one arrow.
That is precisely what fullness prevents.
What the counterexample teaches
This tiny example is useful because it teaches multiple lessons at once.
Fullness is not optional “coverage”; it controls what relations exist
In many categories, morphisms encode real structure: continuous maps, homomorphisms, linear maps, refinements, and so on. If a functor is not full, it may map objects correctly but still miss genuine structure in the target, because the target has morphisms between the images that do not originate upstairs.
In the counterexample, the missing structure is especially stark: the target has a morphism $* \to __GCNKDDTOK_1__(1__GCNKDDTOK_2__(0__GCNKDDTOK_3__(F(1)=F(0)=$, you also identify their hom-sets, and this can create “phantom morphisms” that are not shadows of any true morphisms in $\mathcal{C}$.
Faithful is about collapsing arrows, not collapsing objects
The functor in the counterexample collapses objects (two objects become one), but it remains faithful because there were no distinct parallel morphisms to collapse. That clarifies an important point:
- Faithfulness does not mean “injective on objects.”
- Faithfulness means “injective on each hom-set.”
If you want the target to see the same arrow-level distinctions the source sees, you ask for faithfulness.
Essential surjectivity is the right notion of “onto objects”
In category theory, “onto objects” is too strict because it ignores isomorphism. Even when two constructions look identical to working mathematicians, they may not literally be the same object. Essential surjectivity captures what matters: every object in $\mathcal{D}$ is represented up to isomorphism.
The counterexample shows essential surjectivity alone cannot prevent morphism-level mismatch.
Two more counterexamples: the other missing conditions
The first counterexample isolates fullness. For balance, it helps to see that each condition in the criterion is independent.
Full and essentially surjective does not imply equivalence (faithfulness can fail)
Let $\mathcal{C}$ be the category with one object $*$ and two endomorphisms: $\mathrm{id}_*$ and $u$, with composition defined by $u \circ u = u$ and $u \circ \mathrm{id} = \mathrm{id} \circ u = u$. This is a perfectly valid monoid-as-a-category.
Let $\mathcal{D} = \mathbf{1}$, the terminal category.
Define $F : \mathcal{C} \to \mathcal{D}$ by sending $__GCNKDDTOK_3__\to __GCNKDDTOK_4__) and both morphisms __GCNKDDTOK_5__\mathrm{id}_, u$ \to $\mathrm{id}_*$.
- Essentially surjective: trivially true (one object).
- Full: for the only hom-set, $\mathrm{Hom}_{\mathcal{D}}(*,*)$ is a singleton, and the image of $\mathrm{Hom}_{\mathcal{C}}(*,*)$ contains $\mathrm{id}_*$, so the map is surjective.
- Not faithful: because two distinct morphisms in $\mathcal{C}$ map to the same morphism in $\mathcal{D}$.
So full + essentially surjective is not enough. Without faithfulness, the functor can identify distinct morphisms, losing information in a way that no quasi-inverse can recover.
Full and faithful does not imply equivalence (essential surjectivity can fail)
Let $\mathcal{C}$ be the category with one object $*$ and only its identity morphism. Let $\mathcal{D}$ be the category with two objects $a,b$, only identity morphisms, and no morphisms between distinct objects. This is a discrete category on two objects.
Let $F : \mathcal{C} \to \mathcal{D}$ send $*$ \to $a$. Then:
- Full and faithful: because the only hom-set is a singleton mapping \to a singleton.
- Not essentially surjective: because $b$ is not isomorphic \to $a$ (in a discrete category, isomorphic means equal).
So even perfect behavior on all hom-sets is not enough if the functor does not hit all objects up to isomorphism.
The criterion, explained by the counterexamples
The counterexamples motivate why the standard criterion is exactly \right.
Why fully faithful + essentially surjective is sufficient
If $F$ is fully faithful, you can “lift” morphisms uniquely up to equality from $\mathcal{D}$ back \to $\mathcal{C}$ whenever the source and target objects are in the image. If $F$ is essentially surjective, every object in $\mathcal{D}$ is isomorphic to something in the image. Put those together and you can build a quasi-inverse:
- For each object $d$ in $\mathcal{D}$, choose an object $c_d$ in $\mathcal{C}$ and an isomorphism $\varphi_d : F(c_d) \to d$.
- Define $G(d)=c_d$.
- For a morphism $g : d \to d'$, use the chosen isomorphisms to transport it into a morphism between $F(c_d)$ and $F(c_{d'})$, then use fullness to lift it \to a morphism $G(g) : c_d \to c_{d'}$. Faithfulness ensures this lift is compatible with composition.
Different choices of $c_d$ and $\varphi_d$ lead to naturally isomorphic quasi-inverses, which is exactly the flexibility equivalence is designed to permit.
The counterexamples show what fails if you drop a condition:
- without fullness, the transported morphism may not lift,
- without faithfulness, the lift may not be well-defined,
- without essential surjectivity, you cannot assign a preimage object for every $d$.
A reusable diagnostic: test claims by “where could the missing data hide?”
Equivalence is not the only place this pattern appears. Many categorical statements have the form “if a functor has properties A and B, then it has property C.” Counterexamples are found by asking where the missing information could hide:
- Object-level mismatch: the functor behaves perfectly on arrows but misses objects up to isomorphism.
- Arrow-level surplus: the functor hits objects but the target has morphisms between images that do not come from upstairs.
- Arrow-level collapse: the functor hits objects and arrows but identifies distinct morphisms.
When you suspect a claim is false, build the smallest categories that isolate the failure mode. The examples above use:
- a terminal category to force “only one arrow” behavior,
- discrete categories to force “no nontrivial arrows” behavior,
- monoid categories to create parallel morphisms without adding objects.
These are standard building blocks for counterexamples in category theory because they let you tune object count, arrow count, and compositional constraints independently.
A brief extension: the same lesson appears in adjunction folklore
There is a parallel misconception that often appears early:
- “If a functor preserves colimits, then it must have a right adjoint.”
This is also false in general. What the misconception misses is that adjoint existence depends on size conditions, completeness properties, and representability constraints, not only on formal preservation properties. The equivalence counterexamples train the same reflex: preservation conditions are powerful, but you must check what data is required to reconstruct a universal property.
The practical lesson is not cynicism, but precision. Category theory rewards you for identifying exactly which kind of data a statement needs to be correct.
Closing: why this counterexample is better than a lecture
A lecture can tell you definitions and theorems. This counterexample teaches you the reasons behind them.
- It makes the criterion for equivalence feel inevitable rather than arbitrary.
- It separates object-level and arrow-level issues cleanly.
- It gives you a compact toolkit for building future counterexamples.
Most importantly, it shifts your default mental model from “objects with extra arrows attached” \to “mathematics encoded in how morphisms compose.” That is where category theory lives.
Books by Drew Higgins
Prophecy and Its Meaning for Today
New Testament Prophecies and Their Meaning for Today
A focused study of New Testament prophecy and why it still matters for believers now.
Leave a Reply