## Bases for Root Systems

We don’t always want to deal with a whole root system . Indeed, that’s sort of like using a whole group when all the information is contained in some much smaller generating set. For a vector space we call such a small generating set a basis. For a root system, we call it a base. Specifically, a subset is called a base if first of all is a basis for , and if each vector can be written as a linear combination

where the coefficients are either all nonnegative integers or all nonpositive integers.

Some observations are immediate. Because is a basis, it contains exactly vectors of . It also tells us that the decomposition of each is unique. In fact, as for any basis, every vector in can be written uniquely as a linear combination of the vectors in . What we’re emphasizing here is that for vectors in , the coefficients are all integers, and they’re either all nonnegative or all nonpositive.

Another thing a choice of base gives us is a partial order on the root system . We say that is a “positive root” with respect to (and write ) if all of its coefficients are nonnegative integers. Similarly, we say that is a “negative root” with respect to (and write ) if all of its coefficients are nonpositive integers. We extend this to a partial order by defining if .

Every root is either positive or negative. We write for the collection of positive roots with respect to a base and for the collection of negative roots. It should be clear that , and also that — the negative roots are exactly the negatives of the positive roots.

We can also define a kind of size of a vector . Given the above (unique) decomposition, we define the “height” of relative to as

This will be useful when it comes to proving statements about all vectors in by induction on their heights.

If are two vectors in a base , then we know that and . Indeed, our lemma tells us that if then would be in . But this is impossible, because every vector in can only be written as a linear combination of vectors in in one way, and that way cannot have some positive signs and some negative signs like does.

What this tells us (among other things) is that must be one end of the root string through . The other end must be , and the root string must be unbroken between these two ends. Every vector with must be in .

Does every root system have a base (I’m guessing yes)? Is the answer to that question obvious?

Comment by Chad | February 1, 2010 |

Good eye, Chad. It’s not obvious, and that’s exactly the question I’m set to take up tomorrow.

Comment by John Armstrong | February 1, 2010 |

[…] Existence of Bases for Root Systems We’ve defined what a base for a root system is, but we haven’t provided any evidence yet that they even exist. Today […]

Pingback by The Existence of Bases for Root Systems « The Unapologetic Mathematician | February 2, 2010 |

[…] That is, and are either both positive or both negative. So this means that , and thus the induced bases are equal: . We see, then, that we have a natural bijection between the Weyl chambers of a root […]

Pingback by Weyl Chambers « The Unapologetic Mathematician | February 3, 2010 |

[…] Lemmas on Simple Roots If is some fixed base of a root system , we call the roots “simple”. Simple roots have a number of nice […]

Pingback by Some Lemmas on Simple Roots « The Unapologetic Mathematician | February 4, 2010 |

[…] and the group itself is generated by the reflections corresponding to the simple roots in any given base […]

Pingback by The Action of the Weyl Group on Weyl Chambers « The Unapologetic Mathematician | February 5, 2010 |

[…] all are simple roots for some choice of a base . In general we can do this in many ways, and some will have larger […]

Pingback by Lengths of Weyl Group Elements « The Unapologetic Mathematician | February 8, 2010 |

[…] When we first discussed Weyl chambers, we defined the fundamental Weyl chamber associated to a base as the collection of all the vectors satisfying for all simple roots . Today, I want to discuss […]

Pingback by The Fundamental Weyl Chamber « The Unapologetic Mathematician | February 9, 2010 |

[…] of roots so that each root in is perpendicular to each one in . I assert that, for any base , is reducible if and only if can itself be broken into two collections in just the same way. […]

Pingback by Properties of Irreducible Root Systems I « The Unapologetic Mathematician | February 10, 2010 |

[…] a base of the root system. Since is finite-dimensional and is a basis of , must be finite, and so […]

Pingback by Cartan Matrices « The Unapologetic Mathematician | February 16, 2010 |

[…] on the other hand, must all be negative or zero. Indeed, our simple roots must be part of a base , and any two vectors must satisfy . Even better, we have a lot of information about pairs of […]

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

[…] of this proof, we will call such a set of vectors “admissible”. The elements of a base for a root system , divided by their lengths, are an admissible […]

Pingback by Proving the Classification Theorem I « The Unapologetic Mathematician | February 22, 2010 |

[…] that forms a base for […]

Pingback by Construction of A-Series Root Systems « The Unapologetic Mathematician | March 2, 2010 |

[…] from this we can always build for . Then if we can write . This proves that is a base for […]

Pingback by Construction of D-Series Root Systems « The Unapologetic Mathematician | March 3, 2010 |

[…] any vector can be written as the sum of two of these vectors. And so is a base for […]

Pingback by Construction of B- and C-Series Root Systems « The Unapologetic Mathematician | March 4, 2010 |

[…] remember that and , as vertices, really stand for vectors in some base of a root system, and the number of edges connecting them encodes their Cartan integers. If we […]

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

[…] a basis of a vector space, a base of a vector space contains enough information to reconstruct the whole root system. Further, any […]

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