Reading paths

Every result in this book is proved from results that came earlier, and the build records which. Following those records backwards from a theorem gives the sections a reader actually needs in order to reach it, and nothing else. The paths below are computed that way, from the proofs themselves, each time the book is built.

A path is aimed at a handful of sections, listed on its own page. It contains every section those proofs rest on, and it is closed: nothing on it cites anything off it in a proof. Read it in order and no step is missing.

Each path comes in two lengths. The reading column counts what the proofs need. The with exercises column also counts what the written solutions need, since a solution is the proof of its exercise; it is the longer figure, and the difference is the price of working the problems rather than reading past them.

Out of 28 sections that carry a result. None of these lists is a syllabus: it is the smallest set that leaves no proof unfinished. To aim at something else, see the dependency graph, which will compute the same closure for any single section.