A quiver turns a directed graph into algebra. Freely generate its paths and a category appears, then represent that category in vector spaces.
A quiver
A representation of
Gabriel's Theorem
A connected quiver has finite representation type, meaning finitely many indecomposable representations up to isomorphism, iff its underlying undirected graph is a disjoint union of simply-laced ADE Dynkin diagrams
. Moreover the indecomposables then correspond bijectively to the positive roots of the associated root system, independent of how the arrows are oriented.
Remark on the free-generation ladder
Freely generating structure from a graph climbs a ladder of one-object-to-many analogues: a single binary generator gives a magma, imposing associativity a monoid, allowing several objects the free category (the paths of a quiver), adding directed 2-cells a 2-category, and collapsing objects into a tensor a strict monoidal category. A quiver representation then sits one rung further out, a functor out of the free category into
.
References
- Gabriel, “Unzerlegbare Darstellungen I,” Manuscripta Mathematica (1972)
- Assem, Simson & Skowronski, Elements of the Representation Theory of Associative Algebras, Vol. 1 (Cambridge, 2006)