You have proved in category C that every object with a product structure satisfies property P. You dualize the proof by reversing all arrows. What have you obtained?
AA proof that every object in C also satisfies the dual of property P, since C and C^op are the same category
BA proof that every object in C^op with a coproduct structure satisfies the dual of property P, giving a new theorem about C^op for free
CA verification that property P is self-dual, since reversing arrows in a proof must return the same statement
DA proof that only applies to Set, since duality theorems require concrete categories
This is duality as a free theorem generator. Reversing all arrows in a categorical proof about C yields a valid proof about C^op. Products (characterized by maps *into* A × B) dualize to coproducts (characterized by maps *out of* A ⊔ B), and property P dualizes to its mirror. If C^op is isomorphic to a familiar category, you get a theorem about that category at no additional cost. Option A is incorrect — C and C^op are generally different categories (unless C is self-dual). Option C would only be true if P happens to equal its own dual. Option D is incorrect — duality is a purely abstract categorical argument and applies to any category.
Question 2 Multiple Choice
Stone duality establishes a connection between Boolean algebras and compact Hausdorff totally disconnected spaces. Which categorical statement correctly describes this duality?
AEvery Boolean algebra is a compact Hausdorff space under a natural topology
BThe category of Boolean algebras is equivalent to the category of Stone spaces
CThe category of Boolean algebras is equivalent to the *opposite* of the category of Stone spaces
DBoolean algebras and Stone spaces are isomorphic as sets once the underlying elements are identified
Stone duality is an equivalence between the category of Boolean algebras and the *opposite* of the category of Stone spaces (compact Hausdorff totally disconnected spaces). The duality means that morphisms between Boolean algebras correspond to morphisms between Stone spaces but with arrows *reversed*. This is not a claim that Boolean algebras and Stone spaces are the same kind of object (option A), nor that they are equivalent as categories without reversal (option B — which would require a direct equivalence, not a dual one), nor an assertion about element-level isomorphism (option D). The reversal of arrows is essential: it expresses that logical operations and topological operations are mirror images of each other.
Question 3 True / False
In any category, the dual of a limit is a colimit, and every theorem about limits automatically yields a theorem about colimits by dualizing.
TTrue
FFalse
Answer: True
This is one of the most productive applications of categorical duality. A limit is defined by a universal property for maps *into* the limit cone; reversing all arrows gives a universal property for maps *out of* a cocone, which is the definition of a colimit. Since the dualization is purely formal (reverse all arrows, swap sources and targets), any proof about limits in C^op translates verbatim to a proof about colimits in C. This is why in category theory, theorems often come in limit/colimit pairs — completeness/cocompleteness, products/coproducts, equalizers/coequalizers — each pair arising from a single argument and its dual.
Question 4 True / False
Categorical duality means that C and C^op are typically equivalent as categories — any theorem true in C is equally true in C^op without needing additional verification.
TTrue
FFalse
Answer: False
C and C^op are generally *not* equivalent as categories — reversing arrows typically yields a genuinely different structure. A theorem about C dualizes to a theorem about C^op, but C^op may or may not be equivalent to C. For example, the opposite of the category of sets is very different from the category of sets itself (maps in Set^op correspond to reversed functions, which have no simple set-theoretic description). Duality is useful precisely because C^op can be a *different* familiar category — Stone duality works because Boolean algebras^op turns out to be equivalent to Stone spaces, a non-trivial identification. If C were always equivalent to C^op, duality would be trivial.
Question 5 Short Answer
What does it mean to say that categorical duality is a 'free theorem generator,' and give a concrete example of how it produces two theorems for the price of one?
Think about your answer, then reveal below.
Model answer: Categorical duality means that every proof involving categorical constructions has a dual proof obtained by mechanically reversing all arrows. If you prove a theorem about products in a category C (using maps *into* A × B), reversing all arrows produces a valid proof about coproducts in C (using maps *out of* A ⊔ B). For example: in any category with products, products are commutative up to isomorphism (A × B ≅ B × A). Dualizing this — replacing products with coproducts and reversing all morphisms — immediately yields: in any category with coproducts, coproducts are commutative up to isomorphism (A ⊔ B ≅ B ⊔ A). One proof, two theorems.
The power of duality is that it converts syntactic work (writing a proof) into two theorems by a mechanical transformation. This is especially potent when C^op is a familiar category with its own mathematical meaning — then you get a theorem about a completely different-looking area of mathematics for free. Pontryagin duality and Stone duality are the classic examples where the dual category is not just 'C with arrows reversed' but is actually a well-studied concrete category (topological spaces, groups of characters).