By studying the structure of a reduced root system, we may choose a base/fundamental system to get a Cartan matrix

two equivalent definitions of root system

Definition.1. A root system is a pair where is a finite dimensional Euclidean space and is a finite set spanning and satisfying the conditions:

  • for each , ;
  • for , is an integer multiple of .

Definition.1.’ A root system is a pair where is a finite dimensional real vector space and is a finite set spanning and satisfying

  • for each , there is a symmetry with vector s.t. , where a symmetry with vector is a linear isomorphism s.t. and fixes a hyperplane;
  • for , is an integer multiple of .

Remark. Definition 1 and Definition 1’ are equivalent. For Definition 1’, we can put an inner product on by

where is a permutation group of . Then each preserves . For any in the fixed point of , since

we have . So is a root system according to Definition 1, where is a Euclidean space with .

In fact, the inner product defined above is unique up to scalar. See exercise Q1.

Observation. For a root system with , if the angle between and are acute, then .

\begin{proof} Recall local picture, for any with the angle between them acute, there is

Then one of and so one of . Whence . \end{proof}

the global picture

Let be a root system. Define where are connected components and they are called the Weyl chambers. Let be a Weyl chamber. Then for each , does not change the sign on . Define and . Define . Then:

  • is linearly independent
  • each is a linear combination of elements in with non-negative coefficients

\begin{proof} i) Choose s.t. . Then is indecomposable.

ii) Claim that for any . Otherwise, . One of them would be positive, which contradicts the assumption that are indecomposable.

Note that a finite set of vectors in with pairwise angles must be linear independent. Otherwise there are such that . Then and

Whence . However, and yields .

iii) Otherwise, we call a bad root if it cannot expressed as a linear combination of elements in with non-negative coefficients. Let be such a root with . Then is indecomposable and so , contradiction. \end{proof}

Definition

Let be a root system. A base, or a fundamental system of this root system is a subset such that

  • is a basis of ;
  • each is a linear combination of elements in with coefficients either all in or all in .

And roots in a bases are called simple roots w.r.t. this base.

Proposition

Let be a root system. Then there is a one-to-one correspondence

\begin{proof} One direction is done before. Now for any given base , choose such that . Let be a Weyl chamber containing . Then according equals

It is easy to show that and hence is the base associated to . \end{proof}

Remark. A base together with the number would determine the root system, that is why we define Cartan matrix.

Explanation of the remark. The set of numbers first determines the simple reflections , since the action on a basis vector is given by . The inner product is therefore determined up to a scalar factor. Furthermore, one can show that the Weyl Group and hence is determined. One can further show that for any root , there exists and such that . Thus, the entire root system is determined.

Theorem

Let be a reduced root system and be the Weyl group. Choose a Weyl chamber and an according base . Then:

  • for any there is a such that ;
  • if is a Weyl chamber, then there exists a such that ;
  • for any , there is a such that ;
  • is generated by .

\begin{proof} Firstly, we have the following observations.

Observation. Let be a reduced system and be a base. Then:

i) for , leaves invariant. Proof: For , with not all . Then . Since some is positive, is still in .

ii) Put . Then for , . It is easy to prove by i).

Now we can prove the theorem.

i) The Weyl chamber according to is . So we need to find such that . Note that

Let be an element such that . Then for any ,

Thus and would send to .

ii) By i), choose and . Then .

iii) WLOG we may assume . (Otherwise that .) Write , where . We may do induction on

When , we have done. When , there are at least two . The idea is applying some to such that decreases.

Note that there exists some such that , because for any , the angle between them is obtuse. Then is of smaller height and still belongs to . Apply the induction hypothesis, for some . So meets the purpose. In fact, we have actually proved that for any , there is such that .

iv) It suffices to show for each . By previous observation, there is such that for some . Then . \end{proof}

Remark. Textbook gives us a more natural proof. See page 61.

Theorem

Let be a reduced root system and a base. Then:

  • the group generated by subject to the relations where is the smallest positive integer satisfying ;

  • for , let be the smallest number such that . Then

l(w)=#{\beta\in R_+:w\beta\in R_{-}}.

Remark. The proof of this theorem can be found in the textbook (pages 63 and 66).