Mathematics.

foundations

Opposite Category and Duality

Category Theory45 minDifficulty7 out of 10

You should know: categories and morphisms, functors

Overview

Given any category C, its opposite category C^{op} is formed by reversing all the arrows: the objects are the same but every morphism f: A → B becomes a morphism f^{op}: B → A in C^{op}. This simple construction is the formal basis of the duality principle: any theorem proved in the language of category theory has a dual theorem obtained by replacing every concept by its categorical dual (limits ↔ colimits, monomorphisms ↔ epimorphisms, initial ↔ terminal objects).

Intuition

Imagine watching a film of arrows being drawn in a diagram, then rewinding the film: every arrow points the other way. The objects remain but all directionality is reversed. Any categorical concept that refers only to arrows and composition dualises automatically: cones become cocones, limits become colimits, and initial objects become terminal objects.

Formal Definition

Definition

Given a category C, the opposite (or dual) category C^{op} is defined by:

Ob(Cop)=Ob(C)\text{Ob}(\mathcal{C}^{\text{op}}) = \text{Ob}(\mathcal{C})
same-objects
HomCop(A,B)=HomC(B,A)\text{Hom}_{\mathcal{C}^{\text{op}}}(A, B) = \text{Hom}_{\mathcal{C}}(B, A)
reversed-homs
gop∘opfop=(f∘g)opg^{\text{op}} \circ_{\text{op}} f^{\text{op}} = (f \circ g)^{\text{op}}
reversed-composition
(Cop)op=C(\mathcal{C}^{\text{op}})^{\text{op}} = \mathcal{C}

Taking the opposite is an involution

involution

Properties

Involution

(Cop)op=C(\mathcal{C}^{\text{op}})^{\text{op}} = \mathcal{C}

Duality principle

Any theorem T provable in the language of category theory has a dual theorem Top obtained by replacing each concept with its categorical dual.\text{Any theorem } T \text{ provable in the language of category theory has a dual theorem } T^{\text{op}} \text{ obtained by replacing each concept with its categorical dual.}

Contravariant functors as covariant on the opposite

F:Cop→D is covariant iff it is contravariant C→D.F: \mathcal{C}^{\text{op}} \to \mathcal{D} \text{ is covariant iff it is contravariant } \mathcal{C} \to \mathcal{D}.

Hom functor

Hom(A,−):C→Set is covariant; Hom(−,A):Cop→Set is covariant.\text{Hom}(A,-): \mathcal{C} \to \text{Set} \text{ is covariant; } \text{Hom}(-,A): \mathcal{C}^{\text{op}} \to \text{Set} \text{ is covariant.}

Worked Examples

  1. Vect_k^{op} has the same objects (vector spaces) but all linear maps reversed.

  2. The dual space functor sends V ↦ V* = Hom_k(V,k) and f: V→W to f*: W*→V* (transpose), reversing directions.

    (−)∗:Vectk→Vectk (contravariant)(-)^*: \text{Vect}_k \to \text{Vect}_k \text{ (contravariant)}

  3. Equivalently, (−)* is a covariant functor Vect_k^{op} → Vect_k.

    (−)∗:Vectkop→Vectk (covariant)(-)^*: \text{Vect}_k^{\text{op}} \to \text{Vect}_k \text{ (covariant)}

Answer: The dual space functor is a contravariant endofunctor on Vect_k, equivalently a covariant functor Vect_k^{op} → Vect_k.

Practice Problems

Difficulty 5/10

In the divisibility poset (ℕ\{0}, |) viewed as a category, describe the opposite category.

Difficulty 6/10

State the dual of the following: 'A limit is a terminal object in the category of cones over a diagram.'

Difficulty 6/10

Prove that (C^{op})^{op} = C as categories.

Common Mistakes

Common Mistake

Thinking C and C^{op} are always isomorphic.

They are almost never isomorphic. In Set, initial = ∅ and terminal = {*} are not isomorphic, and Set ≇ Set^{op}.

Common Mistake

Confusing 'duality' (arrow reversal) with 'isomorphism' or 'equivalence'.

C^{op} is always defined but typically very different from C. Duality is a meta-principle (theorems dualize) not a claim that C and C^{op} are equivalent.

Quiz

In C^{op}, a morphism from A to B corresponds to what in C?
The duality principle in category theory states:
A contravariant functor F: C → D is the same as:

Historical Background

Duality in mathematics predates category theory — it appears in projective geometry and lattice theory. Eilenberg and Mac Lane formalised arrow-reversal as the opposite category in the 1940s, making duality a precise and automatic operation.

  1. 1847

    Poncelet's principle of duality in projective geometry

    Jean-Victor Poncelet

  2. 1945

    Eilenberg–Mac Lane formalise the opposite category

    Samuel Eilenberg, Saunders Mac Lane

  3. 1963

    Mac Lane systematises categorical duality

    Saunders Mac Lane

Summary

  • C^{op} reverses all arrows: Hom_{C^{op}}(A,B) = Hom_C(B,A), and composition is reversed.
  • Taking the opposite is an involution: (C^{op})^{op} = C.
  • The duality principle: any categorical theorem dualises by reversing all arrows (limits ↔ colimits, mono ↔ epi, initial ↔ terminal).
  • A contravariant functor C → D is equivalently a covariant functor C^{op} → D.
  • The Yoneda embedding uses both Hom(A,−): C → Set and Hom(−,A): C^{op} → Set.

References

  1. WebsiteWikipedia — Opposite category