Principles and heuristics
The recurring patterns of the book, collected: each principle and heuristic is linked to the block where it is stated.
Chapter 1. Free Constructions and Comma Categories
Principles
- Principle 1.3.13 (Maps out of free objects). A map out of a free object is determined by where it sends the generators, and the generators may be sent anywhere.
Heuristics
- Try initial or terminal objects. A good first guess, when a category is in play and we want some distinguished object, is an initial or terminal object.
- The universal solution is the most compact. \(\mathbf{0}_{X \downarrow U^{\mathsf{Vect}}_{}}\) carries every other solution’s information inside it in the most compact fashion.
- Functions on a set. To build something with more structure out of a bare set, look at functions defined on the set.
- Borrow the target’s structure. When the structure we want already lives somewhere, map into that place and let it do the work.
- Make no arbitrary choices. A universal construction should be built only from what the data hands us, with no arbitrary choices. (This is intuition, not a theorem: what we will actually prove is initiality.)