A quiver is a collection of edges which may stretch between (ordered) pairs of “points”, called vertices.
sending each quiver to the free category on that quiver.
A quiver is a kind of graph and is often called a directed graph (or digraph) by category theorists. However, in the context of graph theory, the term “directed graph” is often taken to mean that there is at most one edge from one vertex to another. See directed graph.
one object , called the object of vertices;
one object , called the object of edges;
two morphisms , called the source and target;
together with identity morphisms.
objects are functors ,
morphisms are natural transformations between such functors.
A quiver consists of two sets (the set of edges of ), (the set of vertices of ) and two functions
(the source and target functions). More generally, a quiver internal to a category (more simply, in a category) consists of two objects , and two morphisms .
If and are two quivers in a category , a morphism is a pair of morphisms , such that and .
In graph theory, a quiver may be called a directed pseudograph (or some variation on that theme), but category theorists often just call them directed graphs.
Let and .
A quiver in is a presheaf on with values in .
A quiver is a globular set which is concentrated in the first two degrees.
A quiver can have distinct edges such that and . A quiver can also have loops, namely, edges with .
A quiver is complete? if for any pair of vertices , there exists a unique directed edge with .
Saying quiver instead of directed (multi)graph indicates focus on a certain set of operation intended on that graph. Notably there is the notion of a quiver representation.
Now, one sees that a representation of a graph in the sense of quiver representation is nothing but a functor from the free category on the quiver :
Given a graph with collection of vertices and collection of edges , there is the free category on the graph whose collection of objects coincides with the collection of vertices, and whose collection of morphisms consists of finite sequences of edges in that fit together head-to-tail (also known as paths). The composition operation in this free category is the concatenation of sequences of edges.
and the left adjoint of this functor gives the free category on a directed graph:
Since this is the central operation on quivers that justifies their distinction from the plain concept of directed graph, we may adopt here the point of view that quiver is synonymous with free category.
So a representation of a quiver is a functor
Concretely, such a thing assigns a vector space to each vertex of the graph , and a linear operator to each edge. Representations of quivers are fascinating things, with connections to ADE theory, quantum groups, string theory, and more.
It may be handy to identify a quiver with its free category. This can be justified in the sense that the functor is an embedding (-surjective for all ) on the cores. In other words, isomorphisms between quivers may be identified with equivalences between free categories with no ambiguity.
However, at the level of noninvertible morphisms, this doesn't work; while is faithful, it is not full. In other words, there are many functors between free categories that are not morphisms of quivers.
Nevertheless, if we fix a quiver and a category , then a representation of in is precisely a functor from to (or equivalently a quiver morphism from to ), and we may well want to think of this as being a morphism (a heteromorphism?) from to . As long as is not itself a free category, this is unlikely to cause confusion.
For a quiver, write for the path algebra of over a ground field . That is, is an algebra with -basis given by finite composable sequences of arrows in , including a “lazy path” of length zero at each vertex. The product of two paths composable paths is their composite, and the product of non-composable paths is zero.
A module over is the same thing as a representation of , so the theory of representations of quivers can be viewed within the broader context of representation theory of (associative) algebras.
If is acyclic, then is finite-dimensional as a vector space, so in studying representations of , we are really studying representations of a finite dimensional algebra, for which many interesting tools exist (Auslander-Reiten theory, tilting, etc.).
Gabriel's theorem says that connected quivers of finite type are precisely those whose underlying undirected graph is a Dynkin diagram? in the ADE series, and that the indecomposable quiver representations are in bijection with the positive roots in the root system of the Dynkin diagram. (Gabriel 72).
Some general-purpose references include
Harm Derksen and Jerzy Weyman, Quiver representations AMS Notices, 2005.
William Crawley-Boevy, Lectures on quiver representations (pdf).
Alistair Savage, Finite-dimensional algebras and quivers (arXiv:math/0505082), Encyclopedia of Mathematical Physics, eds. J.-P. Françoise, G.L. Naber and Tsou S.T., Oxford, Elsevier, 2006, volume 2, pp. 313-320.
Classification results for quivers appeared in