Quiver (mathematics) explained

In mathematics, especially representation theory, a quiver is another name for a multidigraph; that is, a directed graph where loops and multiple arrows between two vertices are allowed. Quivers are commonly used in representation theory: a representation  of a quiver assigns a vector space  to each vertex  of the quiver and a linear map  to each arrow .

In category theory, a quiver can be understood to be the underlying structure of a category, but without composition or a designation of identity morphisms. That is, there is a forgetful functor from (the category of categories) to (the category of multidigraphs). Its left adjoint is a free functor which, from a quiver, makes the corresponding free category.

Definition

A quiver consists of:

This definition is identical to that of a multidigraph.

A morphism of quivers is a mapping from vertices to vertices which takes directed edges to directed edges. Formally, if

\Gamma=(V,E,s,t)

and

\Gamma'=(V',E',s',t')

are two quivers, then a morphism

m=(mv,me)

of quivers consists of two functions

mv:V\toV'

and

me:E\toE'

such that the following diagrams commute:

That is,

mv\circs=s'\circme

and

mv\circt=t'\circme

Category-theoretic definition

The above definition is based in set theory; the category-theoretic definition generalizes this into a functor from the free quiver to the category of sets.

The free quiver (also called the walking quiver, Kronecker quiver, 2-Kronecker quiver or Kronecker category) is a category with two objects, and four morphisms: The objects are and . The four morphisms are and the identity morphisms and That is, the free quiver is the category

E\begin{matrix}s\\[-6pt]\rightrightarrows\\[-4pt]t\end{matrix}V

A quiver is then a functor . (That is to say,

\Gamma

specifies two sets

\Gamma(V)

and

\Gamma(E)

, and two functions

\Gamma(s),\Gamma(t)\colon\Gamma(E)\longrightarrow\Gamma(V)

; this is the full extent of what it means to be a functor from

Q

to

Set

.)

More generally, a quiver in a category is a functor The category of quivers in is the functor category where:

Note that is the category of presheaves on the opposite category .

Path algebra

If is a quiver, then a path in is a sequence of arrows

anan-1...a3a2a1

such that the head of is the tail of for, using the convention of concatenating paths from right to left. Note that a path in graph theory has a stricter definition, and that this concept instead coincides with what in graph theory is called a walk.

If is a field then the quiver algebra or path algebra is defined as a vector space having all the paths (of length ≥ 0) in the quiver as basis (including, for each vertex of the quiver, a trivial path of length 0; these paths are not assumed to be equal for different), and multiplication given by concatenation of paths. If two paths cannot be concatenated because the end vertex of the first is not equal to the starting vertex of the second, their product is defined to be zero. This defines an associative algebra over . This algebra has a unit element if and only if the quiver has only finitely many vertices. In this case, the modules over are naturally identified with the representations of . If the quiver has infinitely many vertices, then has an approximate identity given by e_F:=\sum_ 1_v where ranges over finite subsets of the vertex set of .

If the quiver has finitely many vertices and arrows, and the end vertex and starting vertex of any path are always distinct (i.e. has no oriented cycles), then is a finite-dimensional hereditary algebra over . Conversely, if is algebraically closed, then any finite-dimensional, hereditary, associative algebra over is Morita equivalent to the path algebra of its Ext quiver (i.e., they have equivalent module categories).

Representations of quivers

A representation of a quiver is an association of an -module to each vertex of, and a morphism between each module for each arrow.

A representation of a quiver is said to be trivial if

V(x)=0

for all vertices in .

A morphism, between representations of the quiver, is a collection of linear maps such that for every arrow in from to,

V'(a)f(x)=f(y)V(a),

i.e. the squares that forms with the arrows of and all commute. A morphism,, is an isomorphism, if is invertible for all vertices in the quiver. With these definitions the representations of a quiver form a category.

If and are representations of a quiver, then the direct sum of these representations,

VW,

is defined by

(VW)(x)=V(x)W(x)

for all vertices in and

(VW)(a)

is the direct sum of the linear mappings and .

A representation is said to be decomposable if it is isomorphic to the direct sum of non-zero representations.

A categorical definition of a quiver representation can also be given. The quiver itself can be considered a category, where the vertices are objects and paths are morphisms. Then a representation of is just a covariant functor from this category to the category of finite dimensional vector spaces. Morphisms of representations of are precisely natural transformations between the corresponding functors.

For a finite quiver (a quiver with finitely many vertices and edges), let be its path algebra. Let denote the trivial path at vertex . Then we can associate to the vertex  the projective -module consisting of linear combinations of paths which have starting vertex . This corresponds to the representation of obtained by putting a copy of at each vertex which lies on a path starting at and 0 on each other vertex. To each edge joining two copies of we associate the identity map.

This theory was related to cluster algebras by Derksen, Weyman, and Zelevinsky.[1]

Quiver with relations

To enforce commutativity of some squares inside a quiver a generalization is the notion of quivers with relations (also named bound quivers).A relation on a quiver is a linear combination of paths from .A quiver with relation is a pair with a quiver and

I\subseteqK\Gamma

anideal of the path algebra. The quotient is the path algebra of .

Quiver Variety

Given the dimensions of the vector spaces assigned to every vertex, one can form a variety which characterizes all representations of that quiver with those specified dimensions, and consider stability conditions. These give quiver varieties, as constructed by .

Gabriel's theorem

See main article: Gabriel's theorem.

A quiver is of finite type if it has only finitely many isomorphism classes of indecomposable representations. classified all quivers of finite type, and also their indecomposable representations. More precisely, Gabriel's theorem states that:

  1. A (connected) quiver is of finite type if and only if its underlying graph (when the directions of the arrows are ignored) is one of the ADE Dynkin diagrams: .
  2. The indecomposable representations are in a one-to-one correspondence with the positive roots of the root system of the Dynkin diagram.

found a generalization of Gabriel's theorem in which all Dynkin diagrams of finite dimensional semisimple Lie algebras occur. This was generalized to all quivers and their corresponding Kac–Moody algebras by Victor Kac.

See also

References

Lecture Notes

Research

Sources

Notes and References

  1. . Published in J. Amer. Math. Soc. 23 (2010), p. 749-790.
  2. Book: Invariant theory: proceedings of the 1st 1982 Session of the Centro Internazionale Matematico Estivo (C.I.M.E.), held at Montecatini, Italy, June 10-18, 1982 . 1983 . Springer . 978-3-540-12319-4 . Gherardelli . Francesco . Lecture notes in mathematics . Berlin Heidelberg . Centro Internazionale Matematico Estivo.