B8.1 The Language of Categories
Many otherwise disparate fields of mathematics share fundamental structures. The language of categories systematizes these common patterns. While category theory won’t answer questions specific to a particular area, it suggests useful ways to think about problems by analogy with other settings. We’ve already encountered categorical ideas implicitly: the universal property of quotient spaces, the behavior of dual maps, and the isomorphism theorems all fit naturally into this framework. In this chapter we set up the basic vocabulary: categories, functors between them, natural transformations between functors, and universal properties.
8.1.1 Objects and Morphisms
The basic data of a category consists of objects and arrows between them, subject to axioms that capture the essential features of function composition.
Definition 8.1.1 (Category). A category
- A collection of objects, denoted
. - For every pair of objects
, a collection of morphisms from to , denoted or . - A composition rule: for every triple
, a map sending to .
These must satisfy two axioms:
- Associativity: For any
, , , - Identity: For every object
, there exists such that for any ,
Note. The identity morphism
We write
Example 8.1.2 (The category of sets). The category
- Objects: all sets.
- Morphisms:
. - Composition: ordinary function composition.
Variants include:
: objects are finite sets, morphisms are functions. : pointed sets. Objects are pairs with a distinguished element. Morphisms are functions with .
Example 8.1.3 (The category of groups). The category
- Objects: all groups.
- Morphisms: group homomorphisms.
- Composition: composition of homomorphisms.
The identity axiom holds because
: abelian groups and group homomorphisms. : finite groups and homomorphisms.
Similarly, we have categories
Example 8.1.4 (The category of vector spaces). Fix a field
- Objects: vector spaces over
. - Morphisms:
-linear maps. - Composition: composition of linear maps.
The category
Example 8.1.5 (The category of topological spaces). The category
- Objects: topological spaces.
- Morphisms: continuous maps.
- Composition: composition of continuous maps.
The pointed variant
Note. In all these examples, objects are “decorated sets”—sets equipped with additional structure (a group operation, a topology, a vector space structure)—and morphisms are functions that respect this structure. This is typical of categories arising in practice, though the abstract definition permits more exotic examples, such as the following one, in which morphisms are not functions at all.
Example 8.1.6 (Posets as categories). Let
.- Composition: if
and , the unique element of is sent to the unique element of , which is nonempty by transitivity.
The identity axiom uses reflexivity (
8.1.2 Isomorphisms
The notion of “sameness” in a category is captured by isomorphisms.
Definition 8.1.7 (Isomorphism). Let
Proposition 8.1.8 (Uniqueness of inverses). If
Proof. Suppose
Proposition 8.1.9 (Properties of isomorphisms). Let
- For any object
, is an isomorphism with . - If
is an isomorphism, then is an isomorphism with . - If
and are isomorphisms, then is an isomorphism with .
Proof. (i)
(ii) By definition,
(iii) Compute:
Example 8.1.10 (Isomorphisms in familiar categories).
- In
: isomorphisms are bijections. - In
: isomorphisms are group isomorphisms (bijective homomorphisms; the inverse of a bijective homomorphism is automatically a homomorphism). - In
: isomorphisms are invertible linear maps. - In
: isomorphisms are homeomorphisms (continuous bijections with continuous inverse).
In
Note. In
8.1.3 Automorphism Groups
The self-isomorphisms of an object form a group, connecting category theory back to group theory.
Definition 8.1.11 (Automorphism group). For an object
Theorem 8.1.12 (Automorphisms form a group).
Proof.
- Closure: If
, then is an isomorphism by Proposition 8.1.9(iii). - Associativity: Inherited from the category axiom.
- Identity:
by Proposition 8.1.9(i), and it is an identity element for composition. - Inverses: If
, then by Proposition 8.1.9(ii).
∎
Example 8.1.13 (Automorphism groups in practice).
- In
: if , then is the group of permutations of , isomorphic to the symmetric group . - In
: if , then is the group of invertible linear operators on , isomorphic to by choosing a basis. - In
: is the group of group automorphisms of . For , we have : an endomorphism of is multiplication by some (it is determined by the image of ), and it is bijective iff generates , i.e., iff is a unit.
Exercise 8.1.14 (Isomorphic objects have isomorphic automorphism groups). Let
Show solution
Well-defined: If
Homomorphism: For
Bijective: The map
Note. This exercise shows that the automorphism group is an “isomorphism invariant”: isomorphic objects have isomorphic automorphism groups. The converse is false: non-isomorphic objects can have isomorphic automorphism groups. For instance, in
A category in which every morphism is an isomorphism has a special name.
Definition 8.1.15 (Groupoid). A groupoid is a category in which every morphism is an isomorphism.
Note. A groupoid generalizes the notion of a group: a group is the same thing as a groupoid with exactly one object (the group being the automorphism group of that object). In a groupoid, morphisms can be composed only when the target of one matches the source of the other, but when composition is defined, it is associative, has identities, and has inverses. The fundamental groupoid of a topological space, whose objects are the points of the space and whose morphisms are homotopy classes of paths, is a key example in algebraic topology.
Example 8.1.16 (Groupoids).
- The category whose objects are finite sets and whose morphisms are only the bijections (not all functions) is a groupoid.
- Any group
defines a groupoid with one object , with and composition given by the group law. - The category whose objects are groups and whose morphisms are only the group isomorphisms is a groupoid.