Opposite categories flip the direction of morphisms while keeping objects the same. This concept introduces duality, a powerful tool in category theory that reveals symmetries and simplifies proofs.

The duality principle states that every concept has a dual counterpart. By reversing arrows and swapping domains with codomains, we can derive dual statements and concepts, like monomorphisms and epimorphisms.

Opposite Categories

Definition of opposite categories

• Constructs the opposite category $\mathcal{C}^{op}$ from a given category $\mathcal{C}$
  • Retains the same objects as $\mathcal{C}$
  • Reverses the direction of each morphism $f: A \to B$ in $\mathcal{C}$ to obtain a corresponding morphism $f^{op}: B \to A$ in $\mathcal{C}^{op}$
  • Defines composition in $\mathcal{C}^{op}$ by reversing the order of composition in $\mathcal{C}$, i.e., $g^{op} \circ f^{op} = (f \circ g)^{op}$
• Illustrates the concept with concrete examples
  • $\mathbf{Set}^{op}$ represents the opposite category of the category of sets ($\mathbf{Set}$)
    • Consists of sets as objects
    • Contains functions between sets as morphisms, but with the direction reversed
  • $\mathbf{Grp}^{op}$ represents the opposite category of the category of groups ($\mathbf{Grp}$)
    • Comprises groups as objects
    • Includes group homomorphisms as morphisms, but with the direction reversed

Duality principle in category theory

• States that every categorical concept, theorem, or proof has a dual counterpart
  • Obtained by reversing the direction of arrows
  • Interchanges the roles of domains and codomains
• Highlights the significance of duality in category theory
  • Enables the automatic derivation of dual concepts and results
  • Reveals the inherent symmetry and structure within the theory
  • Simplifies proofs by reducing the number of cases to consider ($\mathbf{Set}$ vs. $\mathbf{Set}^{op}$)

Duality and Opposite Categories

Dual statements through arrow reversal

• Demonstrates the process of obtaining dual statements
  • Reverses the direction of arrows
  • Interchanges the roles of domains and codomains
• Provides examples of dual concepts
  1. Monomorphism and epimorphism
     • A morphism $f: A \to B$ is a monomorphism if $f \circ g_1 = f \circ g_2$ implies $g_1 = g_2$ for any pair of morphisms $g_1, g_2: C \to A$
     • Dual statement: A morphism $f: A \to B$ is an epimorphism if $h_1 \circ f = h_2 \circ f$ implies $h_1 = h_2$ for any pair of morphisms $h_1, h_2: B \to D$
  2. Terminal object and initial object
     • An object $T$ is terminal if there exists a unique morphism $!_A: A \to T$ for every object $A$
     • Dual statement: An object $I$ is initial if there exists a unique morphism $!_A: I \to A$ for every object $A$

Double opposite category isomorphism

• Proves that taking the opposite of the opposite category yields the original category up to isomorphism
  • Theorem: For any category $\mathcal{C}$, $(\mathcal{C}^{op})^{op} \cong \mathcal{C}$
• Outlines the proof steps
  1. Defines a functor $F: \mathcal{C} \to (\mathcal{C}^{op})^{op}$
     • Maps each object $A$ in $\mathcal{C}$ to itself, i.e., $F(A) = A$
     • Maps each morphism $f: A \to B$ in $\mathcal{C}$ to $F(f) = f^{op}: B \to A$ in $(\mathcal{C}^{op})^{op}$
  2. Shows that $F$ is an isomorphism of categories
     • Establishes that $F$ is bijective on objects
     • Proves that $F$ is bijective on morphisms since $(f^{op})^{op} = f$
     • Verifies that $F$ preserves composition, i.e., $F(g \circ f) = F(f) \circ F(g)$
  3. Concludes that $(\mathcal{C}^{op})^{op} \cong \mathcal{C}$