# A general pattern to find the roots of the classical lie algebras

+ 6 like - 0 dislike
712 views

Is there any general pattern for the roots of each of the classical lie algebras? So, can I tell all the roots of each of the $nth$ rank classical lie algebras $A_n, B_n, C_n, D_n$, as a linear combination of the simple roots. So I am looking for a pattern for the roots at each level given a classical lie algebra. So, if I am given $C_6$ for e.g., is there any general formula for the roots at say the $kth$ level in terms of $k$, e.g. $f(k,n)a_1+g(k,n)a_2+...$ are the roots, where $a_1,a_2,...$ are the simple roots.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user ramanujan_dirac
retagged Jun 18, 2015

+ 2 like - 0 dislike

Yes, you can find all the roots of a Lie algebra as integer linear combinations of simple roots. That's because the generators corresponding to simple roots are enough to generate the whole group via commutators and their commutators etc. and the root associated with a commutator $[u,v]$ is simply the sum of the roots corresponding to the generators $u,v$ themselves.

In fact, with the usual definitions of simple roots – positive roots that can't be written as a sum of others – one may restrict the analysis to non-negative integer linear combinations of the simple roots when he reconstructs the whole root system.

For simply laced algebras $A_k$, $D_k$, $E_k$, all the (nonzero) roots are equally long. So given the metric on the Cartan subalgebra, the (nonzero) roots are simply all the integer linear combinations of the simple roots that have the same length as the simple roots (which are equally long, too). The algebras $B_k$, $C_k$, $F_4$, and $G_2$ are not simply laced so one must also include roots that are $\sqrt{2}$ times longer than a simple root (or $\sqrt{3}$ times longer in the $G_2$ case).

One shouldn't forget that $k$ (the rank) of the generators of a Lie algebra correspond to roots equal to zero – which are usually not counted among the roots at all and they are surely not considered simple roots.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user Luboš Motl
answered May 23, 2012 by (10,278 points)
Sir, Please could you elaborate. I want all the roots of given algebra (e.g. $B_5$), without the use of a algorithmic procedure, but I am wondering if there is some pattern that I can use to directly tell the roots from the algebra. I have edited my question, to make it clearer.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user user23238
Sorry, your updated question got very confusing. I was answering your original question. The new question talks about "levels" etc. There aren't levels in ordinary Lie algebras. The roots are very simple objects and be sure I could easily enumerate all of them for all 7 classes of the Lie algebras, A,B,C,D,E,F,G. They're just the non-negative integral combinations of the simple roots that have the right length (either the same as simple roots or, in non-simply-laced groups, sqrt2 or sqrt3 times longer). ... If you have an algebra, the roots are just defined as the eigenvalues under the Cartan.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user Luboš Motl
Are you sure that all the integer combination with the right roots are valid roots. For e.g. consider David's comment below..$α_3+α_4+α_5$ is a root but $α_3+α_4+α_6$ is not a root for $A_n$, though both are of same length (Are the not?).

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user user23238
@ramanujan, those two are not of the same length. For type $A_n$ the answer is simple: The positive roots at level $k$ are sums of $k$ consecutive simple roots, i.e. sums of the form $$\sum_{j=i}^{i+k-1}\alpha_j$$ for some $i$ in the range $1\le i<n-k$. Here the level parameter $k$ ranges from $1$ to $n$. Is this what you are looking for?

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user Jyrki Lahtonen
@ramanujan: There are simiar rules for root systems of types $B,C,D$. Certain strings of twos are allowed. The details vary a bit case by case, but are not hard to remember, if you play with them a lot.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user Jyrki Lahtonen
@JyrkiLahtonen: Firstly I don't understand how the roots are not of equal lengths. Ain't the lengths of both the roots mentioned above $\sqrt{3} α_k$, where $α_k$ is one of the simple roots, and all simple roots are of equal lengths.That us what I am exactly looking for. The thing is could you help me with the pattern, or tell me so reference where I can find all the roots worked out using the algorithm mentioned below, so I can quickly figure it out.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user user23238
@ramanujan: the simple roots are not always orthogonal (they are orthogonal, iff they are not connected in the Dynkin diagram). The root $\alpha_3+\alpha_4+\alpha_5$ is of the same length as all the roots. The vector $\alpha_3+\alpha_4+\alpha_6$ is $\sqrt{2}$ times as long, because the vectors $\alpha_6$ and $\alpha_3+\alpha_4$ are orthogonal. The latter vector is not a root of $A_n$, because $\{3,4,6\}$ is not a list of consequtive integers. The vector $\alpha_3+\alpha_4+\alpha_5+\alpha_6$ OTOH is a root.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user Jyrki Lahtonen
+ 2 like - 0 dislike

I'll describe to you in the following a procedure to construct all the roots of a simple Lie algebra. This procedure is based on Slansky's review article. It is different from the method described in the Wikipedia page.

I think that it needs as little as possible input data.

Actually, the only inputs you need is the Dynkin diagram (Given in table 5 of Slansky), the highest weights of the adjoint representation (Given in table 8) and a few rules described in the sequel to make the construction.

1. Construction of the Cartan matrix from the Dynkin diagram.The elements of the cartan matrix are the scalar product of the roots divided by the second root squared length.

1.1. Unconnected roots are orthogonal, the angle betwen two roots connected by one line is 120 degrees, 2 lines 135 degrees and three lines 150 degrees.

1.2. Only the relative lengths matter, it is conventional to take the squared length of the short roots (empty dots) as 1 and of the long roots (full dots) as 2 except for $G_2$ which is taken as 3.

1.3 Now that you have constructed the Cartan matrix, you can read the primitive roots which are given by the rows of the cartan matrix.

Remarks: These are the primitive root components in the weight basis in which the primitive weights have only one nonvanishing unit component).One must remenber that the weight space is not Eucledian. It has a metric that must be used in scalar products. The metric tensor can be constructed from the inverse of the Cartan matrix according to equation 4.11 in Slansky.

1. Now that you have the primitive roots, one method to construct the whole root system is to find the weights of the adjoint representation. For this purpose, one can construct the weight diagram starting from the highest weight given in table 8 of Slansky using the method described on page 31, 32, the positive roots are just the positive weights of the adjoint representation.

2.1. The highest weight is picked from table 8.

2.2. From the highest weight and from any intermediate weight the n-th primitive root is subtracted a number of times equal to the n-th component of the weight if it is positive and not subtracted it it is zero or negative.

For example, in $A_3$ the roots $\alpha_1 = (2, -1, 0)$ and $\alpha_3 = (0, -1, 2)$ are subtracted each once from the highest weight $(1, 0, 1)$ in order to obtain the second level weights: $(-1 , 1, 1)$ and $(1, 1, -1)$.

Remark: This method allows you to construct the weight diagram but not to know the weight multiplicity, but in our case of the adjoint representation, we know that the multiplicity of all the weights is one because they are roots except for the zero weight whose multiplicity is equal to the rank of the Lie algebra.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user David Bar Moshe
answered May 23, 2012 by (4,355 points)
Sir, Thanks for the reply. But, what I want is not a systematic way for finding the roots. I am looking for a pattern for the roots at each level given a classical lie algebra. So, I am given $C_6$, is there any general formula for the roots at say the $kth$ level in terms of k, e.g. $f(k,n)a_1 + g(k,n)a_2 + ...$, where $a_1, a_2,...$ are the simple roots.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user user23238
I think that if one really tries to write formulas for the coefficients (e.g. $f(k,n)$), one will end up with very complex formulas which will look actually like computer programs. Please try to think about the simplest case of $A_n$ where the roots are sums of continuous strings of primitive roots (e.g. $\alpha_3+\alpha_4+\alpha_5$ is a root but $\alpha_3+\alpha_4+\alpha_6$ is not). Now, you can see that to write the coefficient of say $\alpha_1$ at a certain level is very complicated. (cont.)

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user David Bar Moshe
(cont.) This is the reason that representation theory uses algorithms (very frequently combinatorial ones) to perform the constructions rather than closed formulas.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user David Bar Moshe
+ 2 like - 0 dislike

A summary:

For any root $\alpha$, the set of basis vectors $\alpha_i$ occuring in the expansion of $\alpha$ (i.e. the ones with non-zero coefficients) must form a connected set of nodes in the Dynkin diagram. For types $A,B,C,D$ only 0, 1 and 2 occur as coefficients. The coefficient 2 is forbidden in type $A$.

For type $A_n$ the sequences of coefficients are of the form $0^a1^{1+b}0^c$. Here $0^a$ denotes a string (possibly empty) of $a$ zeros, and $1^b$ a string of $b$ ones. Obviously $a,b,c$ are all non-negative integers subject to the constraint $a+b+c=n-1$.

For type $B_n$, in addition to the sequences that occurred in type $A_n$, also sequences of the form $0^a1^{1+b}2^{1+c}$ with $a+b+c=n-2$ are ok. Observe that there has to be at least a single 1 between the zeros and the 2s. The 2s are at the end of the lone short basic root (check your source: conceivably some may have the short basic root at the other end).

For type $C_n$, in addition to the sequences that occurred in type $A_n$, the sequences of the form $0^a1^b2^{1+c}1$ are ok. Again $a+b+c=n-2$. The string of 2s thus does not include, but is connected to, the lone long (rem. this was wrongly written as "short" in the earlier version) basic root.

For type $D_n$, any combination of 0s and 1s such that the 1s form a connected set in the Dynkin diagram is ok. In addition to that, sequences of the form $0^a1^{1+b}2^c\vphantom{(}^{\displaystyle{1}}_{\displaystyle{1}}$ with $a+b+c=n-3$ are ok. IOW the string of 2s must end at the vertex connected to three other vertices, and it must also have a "buffer" of at least a single 1 in each three directions separating the 2s from 0s.

This post imported from StackExchange Mathematics at 2015-06-18 19:07 (UTC), posted by SE-user Jyrki Lahtonen
answered May 24, 2012 by (20 points)
 Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead. To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL. Please consult the FAQ for as to how to format your post. This is the answer box; if you want to write a comment instead, please use the 'add comment' button. Live preview (may slow down editor)   Preview Your name to display (optional): Email me at this address if my answer is selected or commented on: Privacy: Your email address will only be used for sending these notifications. Anti-spam verification: If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:p$\hbar$ysicsO$\varnothing$erflowThen drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds). To avoid this verification in future, please log in or register.