Last update: 31 July 2013
We wish to study automorphisms of of the form where
The right side of the above expression is interpreted as follows. Since we have an action of on Thus, we get an action of on Since acts as zero for sufficiently large, we see that acts on and hence on Following this last action by the homomorphism of into given by we get an action of on
We will write for and for the group (clearly is additive in Our main object of study is the group generated by all We will call it a Chevalley group.
Exercise: Interpret
Lemma 14: Let be an associative algebra, and let be the derivation of where Suppose and have meaning and that the usual rules of exponentiation apply. Then conjugation by
Proof. | |
|
Lemma 15: Let be roots with Then in the ring of formal power series in two variables over we have the identity
where where the product on the right is taken over all roots arranged in some fixed order, and where the are integers depending on and the chosen ordering, but not on or Furthermore
Proof. | |
In set where We shall show that we may choose the in such that We note that Thus, using the product rule we get We bring the terms and to the front using, e.g., the relations (see Lemma 14) and We get an expression of the form with Because is homogeneous of degree 0 relative to the grading is also, and from formulas such as those above we see that is involved in the term above but otherwise only in terms of degree in and Thus with a polynomial in for which Now we may inductively determine values of using the lexicographic ordering of the such that Then implies To show that the are integers, we examine the coefficient of in the definition of This coefficient is (terms coming from exponentials of multiples of with Using induction, we see that Hence, by Theorem 2. If the coefficient is so that |
Examples: (a) If is not a root, the right side of the formula in Lemma 15 is (b) If is the only root of the form the right side is and with as in Theorem 1. (c) If all the roots have one length, the right side is 1 in case (a) and in case (b).
Corollary: If etc. in the formula in Lemma 15 are replaced by etc., then the resulting equation holds for all
We call a set of roots closed if implies The following are examples of closed sets of roots: (a) set of all positive roots. (b) a simple root. (c)
We shall call a subset of a closed set an ideal if implies We see that (a), (b) and (c) above are ideals in
Lemma 16: Let be an ideal in the closed set Let and denote the groups generated by all and respectively). If implies then is a normal subgroup of
Proof. | |
This follows immediately from Lemma 15. |
Lemma 17: Let be a closed set of roots such that implies then every element of can be written uniquely as where and the product is taken in any fixed order.
Proof. | |
We shall first prove the lemma in the case in which the ordering is consistent with heights; i.e., implies If is the first element of then is an ideal in Hence Using induction on the size of we see Now suppose Since there is a weight vector corresponding to a weight such that Now where and is a sum of terms from other weight spaces. Hence is uniquely determined by Since we may complete the proof of this case by induction. |
The proof Lemma 17 for an arbitrary ordering follows immediately from:
Lemma 18: Let be a group with subgroups such that:
(a) | with uniqueness of expression. |
(b) | is a normal subgroup of for |
Proof. | |
(Exercise) Consider and use induction. |
Corollary 1: The map is an isomorphism of the additive group of onto
Corollary 2: Let be the set of all positive roots and let Then with uniqueness of expression, where the product is taken over all arranged in any fixed order.
Corollary 3: is unipotent and is superdiagonal relative to an appropriate choice of a basis for Similarly, is unipotent and is subdiagonal relative to the same choice of basis.
Proof. | |
Choose a basis of weight vectors and order them in a manner consistent with the following partial ordering of the weights: precedes if is a sum of positive roots. |
Corollary 4: If let be the group generated by all with We have then:
(a) | is normal in |
(b) | in particular, |
(c) | is nilpotent. |
Corollary 5: If with and closed sets such that then and (e.g., if is a simple root, one can take and
Example: If we have seen that the roots correspond to pairs the positive roots to pairs and that we may take the usual matrix unit. Thus, We see that {all unipotent, superdiagonal matrices}, {all unipotent, subdiagonal matrices}, and that is the group of square matrices of determinant 1. The nontrivial commutator relations are: if are distinct.
Lemma 19: For any root and any define and Then:
(a) | where is independent of and the representation chosen, and |
(b) | If there exists independent of such that |
(c) | acts "diagonally" on as multiplication by |
Proof. | |
We prove this assuming The transfer of coefficients to an arbitrary field is almost immediate. We show first that for all By linearity it suffices to prove this for for if then commutes with so that both sides equal If the left side, because of Lemma 2 and the definitions of and is an element of the three dimensional algebra whose value depends on calculations within this algebra, not on the representation chosen. Taking the usual representation in we get so that the desired equation follows. We next prove (b). From the definitions of and it follows that if (the sum is actually finite since there are only finitely many weights). Then for Hence corresponds to the weight Thus the only nonzero term in the sum occurs for By (b) applied to the adjoint representation where and is independent of and of the representation chosen. Now is an automorphism of and is a primitive element of for all so Finally so which proves (a). Note that so that By (b) and Hence proving (c). |
Lemma 20: Write for Then:
(a) | an expression as a product of independent of the representation space. |
(b) | with as in Lemma 19(a). |
(c) |
Proof. | |
To prove (a) we apply both sides to (by Lemma 19 (c) applied to By Lemma 19(a) Exponentiating this gives (b). By Lemma 19(c) applied to the adjoint representation Exponentiating this gives (c). |
Denote by (R) the following set of relations:
(R1) | |
(R2) | with the as in Lemma 15. |
(R3) | |
(R4) | |
(R5) | |
(R6) | some expression as a product of (independent of the representation space). |
(R7) | as in Lemma 19(a). |
(R8) |
Since all the relations in (R) are independent of the representation space chosen, results proved using only the relations (R) will be independent of the representation space chosen. Such results will be labeled (E) (usually for existence). Results proved using other information will be labeled (U) (usually for uniqueness).
Lemma 21: Let be the group generated by all the group generated by all and the group generated by and Then:
(a) | is normal in and | (E) |
(b) | (U) |
Proof. | |
Since conjugation by preserves (by (R8)) is normal in and (a) holds. Relative to an appropriate basis of any element of is both diagonal and unipotent, hence |
Example: In {diagonal matrices}, {unipotent superdiagonal matrices}, {superdiagonal matrices}.
Lemma 22: Let be the group generated by all be the subgroup generated by all and the Weyl group. Then:
(a) | is normal in | (E) |
(b) | There exists a homomorphism of onto such that for all roots | (E) |
(c) | is an isomorphism. | (U) |
Proof. | |
Since by (R6) conjugation by preserves and by (R4) and (R5) (a) holds. Since is independent of Write Then since and Hence Also so But (by (R3)) (by (R7)) Thus By Appendix IV. 40 the relations form a defining set for Thus there exists a homomorphism such that is clearly onto. Suppose If a product of reflections, then Conjugating by we get and conjugating by we get Hence for all roots Since for all implies the proof is completed by: |
Lemma 23: If and are distinct roots then
Proof. | |
We know that is nontrivial. If and have the same sign, the result follows from Lemma 17. If they have opposite signs, then one is superdiagonal unipotent, the other subdiagonal (relative to an appropriate basis), and the result again follows. |
Convention: If represents (under we will write in place of
Lemma 24: If is a simple root then
is a group. | (E) |
Proof. | |
Let Since is a group and is closed under inversion, and since it suffices to show We first show that If then there exists such that Hence Now let be the collection of all positive roots. Then (since preserves by Appendix I.11) |
Lemma 25: If and is a simple root, then:
(a) | If (i.e. if (see Appendix II.17)) then | (E) |
(b) | In any case | (E) |
Proof. | |
(a) (for and (b) If (a) gives the result. If set Then and By (a) (by Lemma 24) |
Corollary: If and is an expression of minimal length of as a product of simple reflections then
Lemma 26: Let be the Chevalley group Then is generated by all for a simple root. (E)
Proof. | |
We have Since the simple reflections generate and every root is conjugate under to a simple root the result follows. |
Theorem 4: (Bruhat, Chevalley)
(a) | (E) | |
(b) | (U) |
Proof. | |
(a) By Lemma 26 contains a set of generators for Since is closed under multiplication by these generators (by Lemma 25) and reciprocation it is equal to (b) Suppose with We will show by induction on that (Here is as in the Appendix II.) If then so Then so and (see Appendix II.23). Assume and choose simple so that Then Hence by induction or But implies which is impossible. Hence so |
Remark: The groups form a pair in the sense of J. Tits (Annals of Math. 1964). We shall not axiomatize this concept but adapt certain arguments, such as the last one, to the present context.
Theorem 4': For a fixed choose representing in Set (as before denotes the set of positive roots). Write for Then:
(a) | (E) | |
(b) | Every element of has a unique expression in this form. | (U) |
Proof. | |
(a) by Lemma 17 and Lemma 21) (since (b) If then Relative to an appropriate basis this is both superdiagonal and subdiagonal unipotent and hence Thus |
Exercise: (a) Prove is the normalizer in of and also of (b) Prove is the normalizer in of if has more than 3 elements.
Examples: Let so that and are respectively the superdiagonal, diagonal, monomial subgroups, and may be identified with the group of permutations of the coordinates. Going to for convenience, we get from Theorem 4: the permutation matrices form a system of representatives for We shall give a simple direct proof of this. Here can be any division ring. Assume given Choose to maximize the total number of zeros at the beginnings of all of the rows of These beginnings must all be of different lengths since otherwise we could subtract a multiple of some row from an earlier one, i.e., modify and increase the total number of zeros. It follows that for some is superdiagonal, whence Now assume with Then is superdiagonal for some Since are permutation matrices and the matric positions where the identity is nonzero are included among those of we conclude that is superdiagonal, whence which proves Next we will give a geometric interpretation of the result just proved. Let be the underlying vector space, A flag in is an increasing sequence of subspaces where Associated with the chosen basis of there is a flag defined by called the standard flag. Now acts on and hence on flags. is the stabilizer of the standard flag, so is in one-to-one correspondence with the set of of pairs of flags. Define a simplex to be a set of points of such that A flag is said to be incident with this simplex if for some Hence there are flags incident with a given simplex.
It can be shown, by induction on (see Steinberg, T.A.M.S. 1951), that given any two flags there is a simplex incident with both. Thus associated to each pair of flags there is an element of the permutation which transforms one to the other. Hence corresponds to Thus is the geometric interpretation of the Bruhat decomposition.
(b) Consider where is fixed and nonsingular (i.e., consider the invariants of the automorphism If and is skew this gives an algebra of type if and is symmetric this gives an algebra of type and if and is symmetric this gives an algebra of type If we take
in the first case and
in the second and third cases an element is superdiagonal if and only if preserves (with the usual ordering of roots). Exponentiating we get the invariants of (that is In the first case we get in the second and third cases (relative to a form of maximal index). (For the proof that equality holds see Ree, T.A.M.S. 1957.) The automorphism above preserves the basic ingredients of the Bruhat decomposition of From this a Bruhat decomposition for and can be inferred. By a slight modification of the procedure, we can at the same time take care of unitary groups.
(c) If is of type it is the derivation algebra of a split Cayley algebra. The corresponding group is the group of automorphisms of this algebra.
Since the results labelled (E) depend only on the relations (R) (which are independent of the representation chosen) we may extract from the discussion so far the following result.
Proposition: Let be a group generated by elements labelled such that the relations (R) hold and let be defined as in
(1) | Every element of can be written in the form |
(2) | For each write a product of reflections. Define (where Then every element of can be written (where |
Corollary 1: Suppose is as above and is a homomorphism of onto such that for all and Then:
(a) | Uniqueness of expression holds in (1) and (2) above. |
(b) |
Proof. | |
(a) Suppose Applying we get and by Lemma 17 for all Hence is an isomorphism. Now if by applying we get By Theorem 4' and Lemma 21 and Hence and so so (b) Let Then so Hence so Then by (R8). Applying we see that Hence commutes with for all and so is in center of To complete the proof it is enough to show that center of (for we have shown If and then there exists such that Then which contradicts Theorem 4'. Hence so Let be the element of making all positive roots negative. Then is both superdiagonal and subdiagonal. Since is diagonal, is diagonal, and also unipotent. Hence and |
Corollary 2: Center
Corollary 3: The relations (R) and those in on the form a defining set of relations for
Proof. | |
If the relations in are imposed on then in Corollary 1 becomes an isomorphism by (b). |
Corollary 4: If is constructed as from but using a perhaps different representation space in place of then there exists a homomorphism of onto such that if and only if there exists a homomorphism such that for all and
Proof. | |
Clearly if exists then exists. Conversely assume exists. Matching up the generators of and we see that the relations in form a subset of those in By Corollary 3 and the fact that the relations (R) are the same for and the relations on in form a subset of those on in Thus exists. |
So far the structure of has played a minor role in the proceedings. To make the preceding results more precise we will now determine it.
We recall that is the group generated by all and acts on the weight space as multiplication by Also, we recall that by Theorem 3(e), a linear function on is the highest weight of some irreducible representation provided for all Clearly, it suffices that for all simple roots Define by We see that occurs as the highest weight of some irreducible representation, and we call a fundamental weight.
Lemma 27:
(a) | The additive group generated by all the weights of all representations forms a lattice having as a basis. |
(b) | The additive group generated by all roots is a sublattice of Moreover, is a relation matrix for which is thus finite. |
(c) | The additive group generated by all weights of a faithful representation on forms a lattice between and |
Proof. | |
Part (a) is immediate from the definition of the fundamental weights. (b) If is a simple root and then and (c) If is a root, then since there exists for some weight with Hence and |
Remark: All lattices between and can be realized as in Lemma 27 (c) by an appropriate choice of In particular, if corresponds to the adjoint representation, and if corresponds to the sum of the representations having the fundamental weights as highest weights.
Lemma 28 (Structure of
(a) | For each is multiplicative as a function of |
(b) | is an Abelian group generated by the (with |
(c) | if and only if for all |
(d) | The center of hence is finite. |
Proof. | |
(a), (b), and (c) follow from above. (a) and (c) are immediate and (b) results from if For (d), we note that commutes with if and only if by Lemma 19(c). |
Corollary:
(a) | If then every can be written uniquely as |
(b) | If then has center 1. |
Corollary 5 (To Theorem 4'): Let be a Chevalley group as usual and let be another Chevalley group constructed from the same and as but using in place of If then there exists a homomorphism such that for all and where corresponds to in If then is an isomorphism.
Proof. | |
There exists a homomorphism such that by Lemma 23(c). If is any root and then and similarly for Hence By Corollary 4 to Theorem 4', exists. By Corollary 1, If we have a homomorphism such that Hence, and is an isomorphism. |
We call the Chevalley groups and corresponding to the lattices and the adjoint group and the universal group respectively. If is a Chevalley group corresponding to the lattice then by Corollary 5, we have central homomorphisms and such that and We call the fundamental group of , and we see
Exercise: The center of the universal group, i.e., the fundamental group of the adjoint group is isomorphic to E.g., if the last group is isomorphic with Also in this case the Center of and the fundamental group of
In the following table, we list some information known about the lattices and Chevalley groups of the various Lie algebras
Here is a Chevalley group other than and is the cyclic group or order is the special orthogonal group, is the spin group, is the simplectic group, and denotes the projective group of
To obtain the column headed by one reduces the relation matrix to diagonal form. To show, for example, that is the universal group of of type we let be the weight Then if we have Hence the fundamental weights are in the lattice associated with this representation. Since the center of is generically cyclic of order it follows that is isomorphic to in this case.
Exercise: If is a Chevalley group, subgroups of corresponding to indecomposable components of then:
(a) | Each is normal in and |
(b) | is universal (respectively adjoint) if and only if each is. |
(c) | In each case in (b), the product in (a) is direct. |
Corollary 6: If is a root, then there exists a homomorphism such that and Moreover, or so that is isomorphic to either or
Proof. | |
Let be of rank 1 spanned by and with and Now has a representation as on a vector space and a representation on the same vector space as the original representation of Since is universal, the required homomorphism exists and has by Corollary 5. |
Exercise: If is universal, each is an isomorphism.
This is a typed excerpt of Lectures on Chevalley groups by Robert Steinberg, Yale University, 1967. Notes prepared by John Faulkner and Robert Wilson. This work was partially supported by Contract ARO-D-336-8230-31-43033.