ProofComplete

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.

TheoremGabriel's Theorem

Let QQ be a connected quiver without oriented cycles. Then QQ has finite representation type if and only if the underlying undirected graph is a Dynkin diagram (An,Dn,E6,E7,E8A_n, D_n, E_6, E_7, E_8).

Moreover, indecomposable representations are in bijection with positive roots of the corresponding root system.

ProofOutline

Step 1: Dimension vectors and the Euler form

For representations V,WV, W, define the Euler form: ⟨dim⁑‾(V),dim⁑‾(W)⟩=βˆ‘i∈Q0dim⁑Vidim⁑Wiβˆ’βˆ‘Ξ±βˆˆQ1dim⁑Vs(Ξ±)dim⁑Wt(Ξ±)\langle \underline{\dim}(V), \underline{\dim}(W) \rangle = \sum_{i \in Q_0} \dim V_i \dim W_i - \sum_{\alpha \in Q_1} \dim V_{s(\alpha)} \dim W_{t(\alpha)}

This is a bilinear form on ZQ0\mathbb{Z}^{Q_0} determined by the quiver structure. The associated quadratic form is: q(d)=⟨d,d⟩=βˆ‘idi2βˆ’βˆ‘Ξ±:iβ†’jdidjq(\mathbf{d}) = \langle \mathbf{d}, \mathbf{d} \rangle = \sum_{i} d_i^2 - \sum_{\alpha: i \to j} d_i d_j

Step 2: Positive definiteness criterion

Key Lemma: QQ has finite representation type if and only if the quadratic form qq is positive definite.

Proof idea (⇐\Leftarrow): If qq is positive definite, there are finitely many dimension vectors d\mathbf{d} with q(d)=1q(\mathbf{d}) = 1 (finitely many integral points in a bounded region). For each such d\mathbf{d}, there are finitely many indecomposables with that dimension vector, giving finite representation type overall.

Proof idea (β‡’\Rightarrow): If qq 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 An,Dn,E6,E7,E8A_n, D_n, E_6, E_7, E_8.

This is a classical result from the classification of root systems and Cartan matrices. The Cartan matrix CC of the quiver satisfies: q(d)=dTCdq(\mathbf{d}) = \mathbf{d}^T C \mathbf{d}

Positive definiteness of CC characterizes finite Dynkin type.

Step 4: Construct bijection with roots

For a Dynkin quiver, define a map: Ξ¦:{indecomposables}β†’Ξ¦+Β (positiveΒ roots)\Phi: \{\text{indecomposables}\} \to \Phi^+ \text{ (positive roots)} by sending an indecomposable VV to its dimension vector (viewed as a root).

Injectivity: Two indecomposables with the same dimension vector have Hom(V,W)≠0\text{Hom}(V, W) \neq 0 or Ext1(V,W)≠0\text{Ext}^1(V, W) \neq 0, and for Dynkin quivers, this forces V≅WV \cong W (by analyzing the Euler form).

Surjectivity: For each positive root Ξ±\alpha, construct an indecomposable with dimension vector Ξ±\alpha using reflection functors or explicit construction.

Conclusion: This establishes the bijection {indecomposables}↔Φ+\{\text{indecomposables}\} \leftrightarrow \Phi^+.

β– 
Remark

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.