S. D. V. Stephens

notes / Studies in Algebra and Group Theory / chapter 4: Categories, Bilinear Forms and Inner Products / From my book

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 consists of:

  1. A collection of objects, denoted .
  2. For every pair of objects , a collection of morphisms from to , denoted or .
  3. A composition rule: for every triple , a map sending to .

These must satisfy two axioms:

  1. Associativity: For any , , ,
  2. Identity: For every object , there exists such that for any ,

Note. The identity morphism is unique: if also satisfies the identity axiom, then .

We write to indicate , and call the domain (or source) and the codomain (or target) of . When several categories are in play we write to record the category.

Example 8.1.2 (The category of sets). The category has:

  • 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 has:

  • Objects: all groups.
  • Morphisms: group homomorphisms.
  • Composition: composition of homomorphisms.

The identity axiom holds because is a homomorphism, and a composition of homomorphisms is a homomorphism. Variants:

  • : abelian groups and group homomorphisms.
  • : finite groups and homomorphisms.

Similarly, we have categories (rings and ring homomorphisms) and (commutative rings and ring homomorphisms).

Example 8.1.4 (The category of vector spaces). Fix a field . The category has:

  • Objects: vector spaces over .
  • Morphisms: -linear maps.
  • Composition: composition of linear maps.

The category has the finite-dimensional vector spaces over as objects, again with linear maps as morphisms. We’ve been studying all along: is exactly in this category.

Example 8.1.5 (The category of topological spaces). The category has:

  • Objects: topological spaces.
  • Morphisms: continuous maps.
  • Composition: composition of continuous maps.

The pointed variant has objects (a space with a basepoint) and morphisms the continuous maps preserving basepoints. This category is fundamental in algebraic topology.

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 be a partially ordered set. Define a category by:

  • .
  • Composition: if and , the unique element of is sent to the unique element of , which is nonempty by transitivity.

The identity axiom uses reflexivity (), and associativity is automatic since each has at most one element.

8.1.2 Isomorphisms

The notion of “sameness” in a category is captured by isomorphisms.

Definition 8.1.7 (Isomorphism). Let be a category and . A morphism is an isomorphism if there exists such that We write if such an isomorphism exists, and say and are isomorphic.

Proposition 8.1.8 (Uniqueness of inverses). If is an isomorphism, then the morphism in the definition is unique. We denote it and call it the inverse of .

Proof. Suppose both satisfy the conditions. Then ∎

Proposition 8.1.9 (Properties of isomorphisms). Let be a category.

  1. For any object , is an isomorphism with .
  2. If is an isomorphism, then is an isomorphism with .
  3. If and are isomorphisms, then is an isomorphism with .

Proof. (i) .

(ii) By definition, and . This says exactly that is an inverse of .

(iii) Compute: Similarly, . ∎

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 , two objects are isomorphic iff they have the same dimension. In , two objects are isomorphic iff they have the same cardinality.

Note. In , a bijective continuous map need not be an isomorphism: the inverse may fail to be continuous. For example, is a continuous bijection but not a homeomorphism. So “isomorphism” in a category can mean more than “bijection on underlying sets.”

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 in a category , the automorphism group of is

Theorem 8.1.12 (Automorphisms form a group). , equipped with composition, is 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 be an isomorphism in a category . Show that the map is a group isomorphism.

Show solution

Well-defined: If , then is a composition of isomorphisms, hence an isomorphism .

Homomorphism: For :

Bijective: The map is an inverse: Similarly, .

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 , the cyclic groups and both have automorphism group (generated by inversion in the first case and by in the second), but .

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.