## Cartan Matrices

As we move towards our goal of classifying root systems, we find new ways of encoding the information contained in a root system . First comes the Cartan matrix.

Pick a base of the root system. Since is finite-dimensional and is a basis of , must be finite, and so there’s no difficulty in picking some fixed order on the simple roots. That is, we write where . Now we can define the “Cartan matrix” as the matrix whose entry in the th row and th column is . These entries are called “Cartan integers”.

The matrix we get, depends on the particular ordering of the base we chose, of course, so the Cartan matrix isn’t *quite* uniquely determined by the root system. This is relatively unimportant, actually. More to the point is the other direction: the Cartan matrix determines the root system up to isomorphism!

That is, let’s say is another root system in another vector space with another identified base . Further, assume that for all we have , so the Cartan matrix determined by is equal to the Cartan matrix determined by . I say that the bijection extends to an isomorphism that sends onto and satisfies for all roots .

The unique extension to is trivial. Indeed, since is a basis for all we have to do is specify all the images and there is a unique linear transformation extending the mapping on basis vectors. And it’s an isomorphism, since the image of our basis of is itself a basis of , so we can turn around and reverse everything.

Now our hypothesis that the bases give rise to the same Cartan matrix allows us to calculate for simple roots :

That is, intertwines the actions of each of the simple reflections . But we know that the simple reflections with respect to any given base generate the Weyl group!

And so must intertwine the actions of the Weyl groups and . That is, the mapping is an isomorphism which sends to for all .

We can go further. Each root is in the -orbit of some simple root . Say for . Then we find

And so must send to . A straightforward calculation (unwinding the one before) shows that must then preserve the Cartan integers for any roots and .

So cool! I admit that I still cannot see the word “intertwine” without think of Ted “hypertext” Nelson’s mantra: “Everything is profoundly intertwingled!”

I just spent two delightful full days on the Caltech campus for the Western States Annual Mathematical Physics Meeting that Barry Simon hosts. I always enjoy being the weakest mathematican or physicist in the room, and seeing deep results from fascinating people.

Comment by Jonathan Vos Post | February 17, 2010 |

[…] Cartan Matrix to Root System Yesterday, we showed that a Cartan matrix determines its root system up to isomorphism. That is, in principle if we have […]

Pingback by From Cartan Matrix to Root System « The Unapologetic Mathematician | February 17, 2010 |

[…] Graphs and Dynkin Diagrams We’ve taken our root system and turned it into a Cartan matrix. Now we’re going to take our Cartan matrix and turn it into a pictorial form that we can […]

Pingback by Coxeter Graphs and Dynkin Diagrams « The Unapologetic Mathematician | February 18, 2010 |

[…] that for each such root system we can construct a connected Dynkin diagram, which determines a Cartan matrix, which determines the root system itself, up to isomorphism. So what he have to find now is a list […]

Pingback by The Classification of (Possible) Root Systems « The Unapologetic Mathematician | February 19, 2010 |

[…] for vectors in some base of a root system, and the number of edges connecting them encodes their Cartan integers. If we slightly abuse notation and write and for these bases, then the mapping defines images of […]

Pingback by Transformations of Dynkin Diagrams « The Unapologetic Mathematician | March 5, 2010 |

[…] of and will give us access to . Further, it should be orthogonal to both and , and should have a Cartan integer of with in either order. For this purpose, we pick , which then gives us the last vertex of the […]

Pingback by Construction of the F4 Root System « The Unapologetic Mathematician | March 9, 2010 |

[…] of the Dynkin diagram of the root system. And for to be an automorphism of , it must preserve the Cartan integers, and thus the numbers of edges between any pair of vertices in the Dynkin diagram. That is, must […]

Pingback by The Automorphism Group of a Root System « The Unapologetic Mathematician | March 11, 2010 |

[…] classify these, we defined Cartan matrices and verified that we can use it to reconstruct a root system. Then we turned Cartan matrices into […]

Pingback by Root Systems Recap « The Unapologetic Mathematician | March 12, 2010 |