The SpinRepresentations roadmap as a dependency graph. Gray dashed edges are the dependency spine; each goal draws its route as a subgraph of colored edges toward its summit, and where routes share an edge the edge splits into one tight lane per goal, each in its own color; branches meet at the summit instead of zigzagging. Add a goal by appending one entry to the GOALS array in the source.
Goals
The map (all spinrep)
Collected as PRs labelled roadmap/RepresentationTheory whose changed files touch the spinrep directories, plus the lane's goal PRs.
The SpinRepresentations roadmap as a dependency graph · node states: merged / in review / unstarted / next up · goal colors follow the legend · rows follow the dependency spine (topological order), not the roadmap's layer numbering: Layer 1's structure theorem sits below the spin module because it is proved forward from it, so every dependency edge points downward and routes never travel upward.
E₈: a scale-specific consumer of the bivector/Lie bridge (route γ), not a target — Zulip thread · msg 580290449
median = running median over a consistent random sample of 50 merged RepresentationTheory PRs in this time range, excluding mine (search frame 200) · dots/diamonds sit at the actual merge/close time