5.1 Definition and properties of cartesian closed categories

Cartesian closed categories (CCCs) are a powerful concept in category theory. They generalize function spaces, allowing us to work with morphisms between objects as if they were objects themselves. This abstraction is crucial for modeling computation and logic.

CCCs have special properties like finite products and exponential objects. These features enable us to manipulate functions in flexible ways, similar to currying in programming. Understanding CCCs helps us grasp the deep connections between category theory and functional programming.

Cartesian Closed Categories: Definition and Properties

Definition of cartesian closed categories

• Cartesian closed category (CCC) exhibits finite products, exponential objects, and natural isomorphism between hom-sets and exponential objects
• Key properties encompass closure under products and exponentials, terminal object existence, binary products, and exponential objects for any pair of objects
• Adjunction property manifests as $Hom(A \times B, C) \cong Hom(A, C^B)$ facilitating function manipulation
• Currying in CCCs establishes correspondence between multi-argument and single-argument functions enabling flexible function representation

Cartesian closed categories vs exponential objects

• Exponential objects function as internal hom-objects representing morphisms from $B$ to $C$ as $C^B$
• Evaluation morphism $ev: C^B \times B \to C$ applies functions to arguments within the category
• Exponential transpose yields unique $\bar{f}: A \to C^B$ for any $f: A \times B \to C$ enabling function transformation
• CCCs provide categorical framework for lambda calculus supporting functional programming concepts

Proof of cartesian closure

1. Verify terminal object existence ensuring universal property satisfaction
2. Confirm binary products presence with projection morphisms and universal property
3. Demonstrate exponential objects for all object pairs with evaluation morphism
4. Establish natural isomorphism $Hom(A \times B, C) \cong Hom(A, C^B)$ using universal property
5. Verify naturality in $A$, $B$, and $C$ through commutative diagrams

• Conclusion: Category $\mathcal{C}$ satisfies cartesian closure conditions

Generalization of function spaces

• CCC generalizes set theory function spaces extending $B^A$ concept to exponential object $C^B$
• Preserves evaluation $(f, x) \mapsto f(x)$ and currying $f: A \times B \to C$ to $\bar{f}: A \to C^B$
• Examples beyond Set include topological spaces and vector spaces categories
• Internal logic of CCCs provides semantic framework for typed lambda calculi supporting programming language theory