Misplaced Pages

Gabriel's theorem

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
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:

  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: A n {\displaystyle A_{n}} , D n {\displaystyle D_{n}} , E 6 {\displaystyle E_{6}} , E 7 {\displaystyle E_{7}} , E 8 {\displaystyle E_{8}} .
  2. The indecomposable representations are in a one-to-one correspondence with the positive roots of the root system of the Dynkin diagram.

Dlab & Ringel (1973) found a generalization of Gabriel's theorem in which all Dynkin diagrams of finite-dimensional semisimple Lie algebras occur. Victor Kac extended these results to all quivers, not only of Dynkin type, relating their indecomposable representations to the roots of Kac–Moody algebras.

References

  1. Gherardelli, Francesco; Centro Internazionale Matematico Estivo, eds. (1983). 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. Lecture notes in mathematics. Berlin Heidelberg: Springer. ISBN 978-3-540-12319-4.
Category: