For the purpose of this question, you may assume that we are working over the complex numbers.

Given a connected reductive group $G$, one can choose a maximal torus $T$, and then let $T$ act on the Lie algebra $\mathfrak{g}$ of $G$. One can use this action to define the root datum, which in turn is invariant of the choice of $T$, and use it to classify connected reductive groups.

The action of $T$ on $\mathfrak{g}$ is nice in that it has more information than just the action of $T$ on the Lie algebra $\mathfrak{t}$ of $T$, and yet is simple enough so as to decompose into one dimensional weight spaces. But that is a far cry from saying that this is a natural action to consider when trying to classify connected reductive groups!

Is there a deep reason that root data, or more generally the action of a maximal torus on the Lie algebra of $G$, is a natural thing to consider? Does it correspond to some cohomological invariant? Does it arise naturally? Or is this entire theory a fluke?

The proof does not seem to bring much insight into this story, in that it boils down to a series of reductions, which reinforces for me the suspicion that root data are not in and of themselves natural, but rather that this was a guess for a way to classify connected reductive groups that just happened to work out...

  • 1
    $\begingroup$ Are you happy with the theory of weights itself, and the question is more about why this particular action? $\endgroup$ Aug 30, 2020 at 23:17
  • 1
    $\begingroup$ I might need convincing on the theory of weights itself... I did not delve deep into representation theory, and learned it for the sole purpose of understanding the classification of connected reductive groups. What type of motivation are you thinking of? $\endgroup$ Aug 31, 2020 at 0:47
  • 4
    $\begingroup$ One of the most basic intuitions you can get about weights is: not every matrix in $\mathrm{GL}_n(\mathbb{C})$ is diagonalizable, of course, but the subset of diagonalizable matrices is dense, so one has the feeling that understanding how the diagonal matrices behave in a given representation should tell you a lot about the whole representation; and then the weights are really just the eigenvalues for these diagonal matrices. $\endgroup$ Aug 31, 2020 at 1:23
  • 2
    $\begingroup$ From a Tannakian perspective, a reductive group is determined by its representations. If you want to understand a $G$ representation $V$, it makes sense to restrict to a large subgroup whose representation theory you understand (i.e. $T/\mathfrak t$) whose rep theory is governed by weights. After decomposing $V$ into weights, you might wonder how the action other elements of $\mathfrak g$ is related to this weight decomp. The Jacobi identity tells you that if you decompose the adjoint representation into roots, then these roots permute the weight decomp nicely. $\endgroup$ Aug 31, 2020 at 3:44
  • 1
    $\begingroup$ Terry Gannon has suggested that the deepest “moonshine” in mathematics is not the moonshine of the monster sporadic group, or the modern moonshines of K3 surfaces, but rather the overwhelming prevalence of root data, and particularly ADE root data. This was perhaps first observed in the classification of Lie groups, but it seems to be much primitive: it seems that there is some class of “groups” over the absolute base F_1, which really are “the same” as root data, and the complex reductive groups are merely their C-points. $\endgroup$ Sep 1, 2020 at 12:38

1 Answer 1


I can't give you a very deep reason for why root data appear in this context (because, let's face it, root systems spring out everywhere), but there are some very elementary reasons to why the action in question is very natural with regard to the classification.

Let me start with the following two considerations:

  • When one tries to distinguish between the two objects, one usually looks for some simple properties which differ between them. For example, to show that two abstract groups are not isomorphic, one starts by comparing their orders, and procede by comparing the number of elements of a given order in each of them or which subgroups are there and how they fit together.
  • In a semisimple Lie algebra $L$ there is a Jordan decomposition, which tells that every elements $x$ is the sum of an $\operatorname{ad}$-semisimple element $x_s$ and an $\operatorname{ad}$-nilpotent part $x_n$. And there is a subalgebra consisting of semisimple elements (otherwise $L$ itself is nilpotent by Engel theorem). Such subalgebras are called toric, and it turns out they are always abelian. Thus when considered in their adjoint repesentation, the elements of a toric subalgebra form a commuting family of semisimple endomorphisms of $L$, hence are simultaneously diagonalizable, which is equivalent to $L$ decomposing into the direct sum of its weight subspaces, which gives rise to the root system.

So combining these two considerations, to distinguish (and ultimately classify) semisimple Lie algebras we essentially take the simplest type of elements of $L$ (the semisimple ones) and look at how we can fit them together in $L$ (so that they from a subalgebra, and a maximal such).

This looks somewhat abstract, but really just mimics what can be easily seen in the examples, namely, in the classical semisimple Lie algebras. The standard constructions in their minimal representations are equipped with some very simple bases (for example, what comes first to mind for $\mathfrak{sl}_n$?), and there is a very natural maximal toric subalgebra $H$, namely, the diagonal matrices. The non-zero-weight subspaces are the spans of individual off-diagonal basis elements, and the root system captures their configuration.

Now getting back to algebraic groups, they can be roughly classified by the isomorphism classes of the corresponding Lie algebras, but additional information is needed to account for the center. The center sits inside the torus, so to incorporate this missing data into the rough classification one translates the adjoint action of the corresponding toric subalgebra to the adjoint action of the torus.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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