Proof Sketch of Gabriel's Theorem
We outline the proof that finite type quivers are precisely the Dynkin quivers, establishing a deep connection between representation theory and root systems.
Let be a connected quiver without oriented cycles. Then has finite representation type if and only if the underlying undirected graph is a Dynkin diagram ().
Moreover, indecomposable representations are in bijection with positive roots of the corresponding root system.
Step 1: Dimension vectors and the Euler form
For representations , define the Euler form:
This is a bilinear form on determined by the quiver structure. The associated quadratic form is:
Step 2: Positive definiteness criterion
Key Lemma: has finite representation type if and only if the quadratic form is positive definite.
Proof idea (): If is positive definite, there are finitely many dimension vectors with (finitely many integral points in a bounded region). For each such , there are finitely many indecomposables with that dimension vector, giving finite representation type overall.
Proof idea (): If is not positive definite, construct infinitely many indecomposables using preprojective representations or other techniques, contradicting finite representation type.
Step 3: Classification of positive definite forms
The quadratic forms corresponding to connected graphs are positive definite precisely for the Dynkin diagrams .
This is a classical result from the classification of root systems and Cartan matrices. The Cartan matrix of the quiver satisfies:
Positive definiteness of characterizes finite Dynkin type.
Step 4: Construct bijection with roots
For a Dynkin quiver, define a map: by sending an indecomposable to its dimension vector (viewed as a root).
Injectivity: Two indecomposables with the same dimension vector have or , and for Dynkin quivers, this forces (by analyzing the Euler form).
Surjectivity: For each positive root , construct an indecomposable with dimension vector using reflection functors or explicit construction.
Conclusion: This establishes the bijection .
The proof uses deep results from:
- Quadratic forms: Classification via Cartan matrices and Dynkin diagrams
- Homological algebra: Ext computations and Euler characteristics
- Reflection functors: Coxeter functors and BGP reflection
- Root systems: Structure theory of simple Lie algebras
Extensions of Gabriel's theorem:
- Tame type: Extended Dynkin diagrams correspond to affine Lie algebras
- Wild type: All other quivers are representation-wild (classification impossible)
- Kac's theorem: For general quivers, dimension vectors of indecomposables are positive roots of the associated Kac-Moody algebra
Gabriel's theorem is a cornerstone result showing how abstract representation-theoretic problems reduce to explicit combinatorial-geometric data (Dynkin diagrams, root systems), providing a complete solution for a large class of quivers.