## Properties of Irreducible Root Systems III

Today we conclude with our series of lemmas on irreducible root systems.

If is irreducible, then roots in have at most two different lengths. Here I mean actual geometric lengths, as measured by the inner product, not the “length” of a Weyl group element. Further, any two roots of the same length can be sent to each other by the action of the Weyl group.

Let and be two roots. We just saw that the -orbit of spans , and so not all the can be perpendicular to . From what we discovered about pairs of roots, we know that if , then the possible ratios of squared lengths are limited. Indeed, this ratio must be one of , , , , or .

If there are three distinct root-lengths, let , , and be samples of each length in increasing order. We must then have and , and so , which clearly violates our conditions. Thus there can be at most two root lengths, as asserted. We call those of the smaller length “short roots”, and the others “long roots”. If there is only one length, we call all the roots long, by convention.

Now let and have the same length. By using the Weyl group as above, we may assume that these roots are non-orthogonal. We may also assume that they’re distinct, or else we’re already done! By the same data as before, we conclude that . We can replace one root by its negative, if need be, and assume that . Then we may calculate:

.

We may note, in passing, that the unique maximal root is long. Indeed, it suffices to show that for all . We may, without loss of generality, assume is in the fundamental doman . Since , we must have for any other . In particular, we have and . Putting these together, we conclude

and so must be a long root.

Typo: gamma squared over alpha squared should be three not two.

Comment by Gilbert Bernstein | February 14, 2010 |

thanks, fixed

Comment by John Armstrong | February 14, 2010 |

[…] in each of the irreducible cases we see that there are at most two distinct root lengths. And, in each case, the unique maximal root is the long root within the fundamental […]

Pingback by Some Root Systems and Weyl Orbits « The Unapologetic Mathematician | February 15, 2010 |

[…] to be the collection of vectors in the lattice of either one or two specified lengths (since there can be at most two root lengths). That is, we’re considering the intersection of a discrete collection of points with one or […]

Pingback by Construction of Root Systems (setup) « The Unapologetic Mathematician | March 1, 2010 |