Gabriel's theorem
From HandWiki
Short description: Classifies quivers (multigraphs) of finite type in terms of Dynkin diagrams.
In mathematics, Gabriel's theorem, proved by Pierre Gabriel, classifies the quivers of finite type in terms of Dynkin diagrams.
Statement
A quiver is of finite type if it has only finitely many isomorphism classes of indecomposable representations. (Gabriel 1972) classified all quivers of finite type, and also their indecomposable representations. More precisely, Gabriel's theorem states that:
- 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: [math]\displaystyle{ A_n }[/math], [math]\displaystyle{ D_n }[/math], [math]\displaystyle{ E_6 }[/math], [math]\displaystyle{ E_7 }[/math], [math]\displaystyle{ E_8 }[/math].
- The indecomposable representations are in a one-to-one correspondence with the positive roots of the root system of the Dynkin diagram.
(Dlab Ringel) found a generalization of Gabriel's theorem in which all Dynkin diagrams of finite-dimensional semisimple Lie algebras occur.
References
- Bernšteĭn, I. N.; Gelfand, I. M.; Ponomarev, V. A. (1973), "Coxeter functors, and Gabriel's theorem", Russian Mathematical Surveys 28 (2): 17–32, doi:10.1070/RM1973v028n02ABEH001526, ISSN 0042-1316, Bibcode: 1973RuMaS..28...17B
- Dlab, Vlastimil; Ringel, Claus Michael (1973), On algebras of finite representation type, Carleton mathematical lecture notes, 2, Department of Mathematics, Carleton Univ., Ottawa, Ont., https://books.google.com/books?id=_JrnAAAAMAAJ
- Gabriel, Peter (1972), "Unzerlegbare Darstellungen. I", Manuscripta Mathematica 6: 71–103, doi:10.1007/BF01298413, ISSN 0025-2611
 |  |
