What a category packages
All through Volume I you studied structures together with the maps that respect them: groups with group homomorphisms, rings with ring homomorphisms, vector spaces with linear maps. Each time, the maps composed associatively and each object had an identity map. A category is exactly this pattern, named and studied in its own right — we stop staring at the internals of a group and start watching how the arrows between things behave.
A category C consists of a collection of objects, and for each ordered pair of objects (A, B) a collection of morphisms Hom(A, B), drawn as arrows f : A → B. There is a composition law sending f : A → B and g : B → C to g∘f : A → C, and for each object A an identity morphism id_A. Two axioms govern everything: composition is associative, h∘(g∘f) = (h∘g)∘f, and identities are units, f∘id_A = f = id_B∘f.
Examples you already live in
- Set: objects are sets, morphisms are functions. The plain home category — everything else maps into it.
- Grp, Ring, Vect_k, Mod_R: objects are groups / rings / k-vector spaces / R-modules; morphisms are the structure-preserving maps. These are the workhorses of algebra.
- A single group G as a category: one object •, with one morphism for each g ∈ G, composition = the group operation. Identities and associativity are exactly the group axioms. A group is a one-object category in which every arrow is invertible.
- A poset (P, ≤) as a category: objects are elements; there is exactly one arrow x → y when x ≤ y, none otherwise. Composition is transitivity. Order theory becomes category theory with at most one arrow between any two objects.
Notice how wide the net is: the same axioms cover an entire universe of groups and a single group, the category of sets and a humble poset. That breadth is the point — a theorem proved about categories applies to all of them at once.
Diagrams and isomorphisms
A diagram commutes when every directed path between the same two objects gives equal composites. This is how category theory states equations pictorially. A morphism f : A → B is an [[isomorphism|isomorphism]] if there is g : B → A with g∘f = id_A and f∘g = id_B. In Grp this recovers group isomorphism; in Set, bijection; in the poset category, isomorphism forces x ≤ y and y ≤ x, i.e. x = y — only identities are iso.
An iso defined purely by arrows (no elements):
f : A -> B is iso iff exists g : B -> A with
g o f = id_A and f o g = id_B.
The two triangles that must commute:
f g
A ------> B B ------> A
\ | \ |
id_A\ |g id_B\ |f
\ v \ v
----> A ----> B
Contrast with Set: 'bijective' is stated with elements
(injective + surjective). The categorical 'has a two-sided
inverse arrow' needs NO elements -- it works in Grp, Top,
any category. Same notion, element-free.