Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

The Dynkin diagrams An, Dn, E6, E7, E8 can be characterized among finite simple connected graphs by the property that their eigenvalues (that is, the eigenvalues of their adjacency matrices) all have absolute value strictly less than 2. What does this condition have to do with the ADE classification, quiver representations, and so forth?

share|improve this question

3 Answers 3

up vote 11 down vote accepted

Yes. For example, with quiver representations, we have a formula

$\chi(M,N)=\dim Hom(M,N)-\dim Ext^1(M,N) = \sum d_i(M)d_i(N) - \sum_{i \to j} d_i(M)d_j(N).$

where $d_i(M)$ is the dimension of M at node i. The proof is to check that it's true for simples, and then note that the category of representations of the path algebra of a quiver has global dimension 1.

So, what you've noted above is that this is positive definite if and only if the graph is Dynkin. Well, what's good about being positive definite? For one thing, if an object has trivial Ext^1 with itself, then it is rigid, it has no deformations. On the other hand, it also must have $\chi(M,M)>0$, since Hom always has positive dimension, and $Ext_1(M,M)=0$.

Thus, if our quiver is not Dynkin, it has dimension vectors where no module can be rigid. On the other hand, if you work a bit harder, you can show Gabriel's theorem:

if the graph is Dynkin, every dimension vector has a unique rigid module and this is indecomposible if and only if $\chi(M,M)=1$, that is if $M$ is a positive root of the root system.

share|improve this answer

The inner product which Ben describes (2-the adjacency matrix) also shows up in the classification of simple Lie groups/algebras. It is the matrix of inner products between the simple roots. For any n vectors v_1, ..., v_n in R^n, the matrix < v_i, v_j > is positive semi-definite.

share|improve this answer

For those who are interested, the paper arXiv:0805.1018 is somewhat related.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.