§ 12. Chevalley orders
1. Lattices and orders
Let V be a Q-vector space. A lattice in V is a free Z-submodule V of V such that the Q-linear map αV,V:V⊗ZQ→V induced by the injection of V into V is bijective. When V is finite dimensional, this is the same as saying that V is a Z-submodule of finite type which generates the Q-vector space V (recall that a torsion-free Z-module of finite type is free by Algebra, Chap. VII, §4, no. 4, Cor. 2); moreover, in this case our definition is a special case of that of Commutative Algebra, Chap. VII, §4, no. 1, Def. 1 (loc. cit., Example 3). If W is a vector subspace of V, and V is a lattice in V, then V∩W is a lattice in W.
If V is a Q-algebra, an order in V is a lattice V in the underlying vector space that is a Z-subalgebra of V; the map αV,V is then an isomorphism of Q-algebras. If V is a unital Q-algebra, a unital order in V is an order in V containing the unit element.
Assume that V is a Q-bigebra, with coproduct c and counit γ. If V is a lattice in the vector space V, the canonical map i:V⊗ZV→V⊗QV is injective; a biorder in V is a unital order V in the unital algebra V such that γ(V)⊂Z and c(V)⊂i(V⊗ZV); the maps
γV:V→Z and cV:V→V⊗ZV
induced by γ and c give V the structure of a Z-bigebra, and the map αV,V is then an isomorphism of Q-bigebras.
2. Divided powers in a bigebra
Let A be a unital k-algebra, x∈A,d∈k,n∈N. Put
x(x−d)...(x−d(n−1))n−1
x(n,d)==∏(x−id)/(i+1)(1)
n!
i=0
In particular, x(0,d)=1,x(1,d)=x. We agree that x(n,d)=0 for n an integer <0. Put
x(n)=x(n,0)=xnn! (2)
(nx)=x(n,1)=x(x−1)...n(!x−n+1). (3)
Proposition 1 017V
Let A be a bigebra, with coproduct c, and x a primitive element (Chap. II, §1, no. 2) of A. Then
c(x(n,d))=∑x(p,d)⊗x(q,d)(4)
p∈N,q∈N,p+q=n
The proposition is trivial for n≤0. We argue by induction on n. If formula (4) is true for n, then
(n+1)c(x(n+1,d))=c(x−dn)c(x(n,d))
=(x⊗1+1⊗x−dn1⊗1)c(x(n,d))
=p+q=n∑[xx(p,d)⊗x(q,d)+x(p,d)⊗xx(q,d)−(p+q)dx(p,d)⊗x(q,d)]
=p+q=n∑(x−pd)x(p,d)⊗x(q,d)+p+q=n∑x(p,d)⊗(x−qd)x(q,d)
=p+q=n∑(p+1)x(p+1,d)⊗x(q,d)+p+q=n∑(q+1)x(p,d)⊗x(q+1,d)
=r+s=n+1∑rx(r,d)⊗x(s,d)+r+s=n+1∑sx(r,d)⊗x(s,d)
=(n+1)r+s=n+1∑x(r,d)⊗x(s,d)
hence formula (4) for n+1.
3. Integral variant of the poincaré-birkhoff-witt theorem
Let g be a finite dimensional Q-Lie algebra, U(g) its enveloping bigebra. If I is a totally ordered set, x=(xi)i∈I a family of elements of g, and n= (ni)i∈I∈N(I) a multi-index, put
x(n)=∏xnini!i, (5)
i∈I
the product being calculated in U(g) in accordance with the ordered set I.
Theorem 1 017W
Let U be a biorder in the bigebra U(g). Let G=U∩g, which is an order in the Lie algebra g. Let (xi)i∈I be a basis of G. Give I a total order, and assume that we are given, for all n∈NI, an element [n] of U such that [n]−x(n) has filtration <∣n∣ in U(g). Then, the family of the [n] for n∈NI is a basis of the Z-module U.
For p∈N, let Up(g) be the set of elements of U(g) of filtration ≤p; then the images in Up(g)/Up−1(g) of the x(n) such that ∣n∣=p form a basis of this Q-vector space (Chap. I, §2, no. 7, Th. 1); hence the [n] form a basis of the Q-vector space U(g). It remains to prove the following assertion (in which we put M=NI):
(*) if u∈U,(an)∈Z(M), and d∈ N --{0} are such that
du=n∈M∑an[n](6)
then d divides each an.
For each integer r≥0, introduce the iterated coproduct
ci:U→Tr(U)=U⊗U⊗⋯⊗U
by definition, c0 is the counit of U,c1= IdU,c2=c (the coproduct of U), and, for r≥2,cr+1 is defined as the composite p∘(cr⊗1)∘c:
U⟶cU⊗ZUc⟶r⊗1Tr(U)⊗ZU⟶pTr+1(U)
where p is defined by using the multiplication in the algebra T(U). Further, consider the canonical projection π of U onto U+= Ker c0, and the composite
cr+=Tr(π)∘cr:U→Tr(U+)
Let n∈NI. If ∣n∣<r, then cr+([n])=0. If ∣n∣=r, then
cr+([n])=φ∑xφ(1)⊗xφ(2)⊗⋯⊗xφ(r)(7)
where φ belongs to the set of maps from {1,2,...,r} to I which take each value i∈Ini times.
By Prop. 1,
cr(x(n))=∑x(p1)⊗⋯⊗x(pr)
where the summation extends over the set of sequences (p1,...,pr) of r elements of M such that p1+⋯+pr=n. In view of Chap. II, §1, no. 3, Prop. 6, the map cr+, extended by linearity to a map from U(g) to Tr(U+(g)), vanishes on Ur−1(g). It follows that, for r≥∣n∣,
cr+([n])=cr+(x(n))=∑π(x(p1))⊗⋯⊗π(x(pr))(8)
For r>∣n∣, the relation p1+⋯+pr=n implies that at least one of the pi is zero, so cr+([n])=0. For r=∣n∣, the only non-zero terms of the third member of (8) are those for which ∣p1∣=⋯=∣pr∣=1, hence (7).
We return to the proof of Th. 1. We retain the notations of (*) and prove, by descending induction on ∣n∣, that d divides an, which is clear when ∣n∣ is sufficiently large. If d divides an for ∣n∣>r then, putting
u′=u−∣n∣>r∑(an/d)[n]∈U
we have
du′=∣n∣≤r∑an[n](9)
For any map φ from {1,2,...,r} to I, put
eφ=xφ(1)⊗⋯⊗xφ(r)
and aφ=an where n= (Cardφ−1(i))i∈I. By Lemma 1, (9) implies that
dcr+(u′)=φ∈Ir∑aφeφ(10)
so cr+(u′)∈Tr(U+)∩QTr(G). But the submodule G of U+ is a direct factor (Algebra, Chap. VII, §4, no. 3, Cor. of Th. 1), so the submodule Tr(G) is a direct factor of Tr(U+), and hence cr+(u′)∈Tr(G). On the other hand, the xi form a basis of G by hypothesis, so the eφ form a basis of Tr(G). Then (10) proves that d divides the aφ, that is, the an for ∣n∣=r. This proves (*).
4. Example: polynomials with integer values
Let V be a finite dimensional Q-vector space, V∗ its dual, V a lattice in V, V∗ the dual Z-module of V, which can be identified canonically with a lattice in V∗,S(V) the symmetric algebra of V, and
λ:S(V)→A(V∗)
the canonical bijection from S(V) to the algebra of polynomial functions on V∗(Algebra, Chap. IV, §5, no. 11, Remark 1). If we identify A(V∗×V∗) with A(V∗)⊗QA(V∗), then λ transforms the coproduct of S(V) into the map A(V∗)→A(V∗×V∗) which associates to the polynomial function φ on V∗ the polynomial function
(x,y)→φ(x+y)
on V∗×V∗(Algebra, Chap. IV, §5, no. 11, Remark 2).
Denote by (ZV) the subset of S(V) consisting of the elements which correspond to polynomial maps from V∗ to Q that take integer values on V∗.
Proposition 2 017Y
(i) (ZV) is a biorder in the bigebra S(V), and (ZV)∩V=V.
(ii) The Z-algebra (ZV) is generated by the (nh) for h∈V,n∈N.
(iii) If (h1,...,hr) is a basis of V, the elements
(h)(h1)(hr)
= ⋯,
nn1nr
where n=(n1,...,nr) belongs to Nr, form a basis of the Z-module (ZV).
For m∈N, put Sm(V)=∑i≤mSi(V), Sm(V)=∑i≤mSi(V). By Algebra, Chap. IV, §5, no. 9, Prop. 15 and Remark,
Sm(V)⊂Sm(V)∩(VZ)⊂m1!Sm(V)
so (ZV)∩V=V. Since Sm(V) is a lattice in Sm(V), Sm(V)∩(ZV) is also a lattice in Sm(V). On the other hand, Sm(V)∩(ZV) is a direct factor of Sm+1(V)∩(ZV) (since the quotient is torsion-free), hence it admits a complement which is a free Z-module. It follows that (ZV) is a free Z-module. It is clear that this is a unital order in the algebra S(V). Let (un)n∈N be a basis of the Z-module (ZV). This is also a basis of the Q-module S(V) and, for all
φ∈S(V×V)=S(V)⊗QS(V)
there exists a unique sequence (vn) of elements of S(V) such that φ=∑un⊗vn. As above, identify S(V) with A(V∗) and S(V)⊗S(V) with A(V∗×V∗). If φ∈(ZV×V), the polynomial function x→φ(x,y) belongs to (ZV) for all y∈V∗. It follows that vn(y)∈Z for all n and all y∈V∗, in other words that vn∈(ZV). This proves that the coproduct maps (ZV) to (ZV)⊗Z(ZV). If h∈V and n∈N, then (nh) maps u∈V∗ to the integer (nu(h)), so (nh)∈(ZV). Assertion (iii) is now obtained by applying Th. 1 to the commutative Lie algebra V, and (ii) follows.
Corollary 017Z
Let X be an indeterminate. The polynomials (nX), where n∈N, form a basis of the Z-module consisting of the polynomials P∈k[X] such that P(Z)⊂Z.
If P(Z)⊂Z, the Lagrange interpolation formula (Algebra, Chap. IV, §2, no. 1, Prop. 6) shows that the coefficients of P belong to Q; thus, we can assume that k=Q and apply Prop. 2 with V=Q,V=Z.
5. Some formulas
In this number, A denotes a unital associative algebra. If x∈A, we write ad x instead of adAx.
If x,y∈A and n∈N,
(adnx! )ny=∑(−1)qxpp! yxqq! = ∑(−1)qx(p)yx(q). (11)
p+q=np+q=n
Indeed, if we denote by Lx and Rx the maps z→xz and z→zx from A to A, we have, since Lx and Rx commute,
n1!(ad x)n=n1!(Lx−Rx)n=∑p+q=n(−1)qp1! Lxpq1! Rxq.
Let x,h∈A and λ∈k be such that (ad h)x=λx. For all n∈N, and all P∈k[X], we have
P(h)x(n)=x(n)P(h+nλ)(12)
Since ad h is a derivation of A and since (ad h)x commutes with x, we have
(ad h)xn=nxn−1((ad h)x) =nλxn, (13) so
(ad h)x(n)=nλx(n).
Thus, formula (12) follows from the special case
P(h)x=xP(h+λ)(14)
by replacing x by x(n) and λ by nλ. It suffices to prove (14) when P=Xm, by induction on m. It is clear when m=0,1. If (14) is true for P=Xm, then
hm+1x=h.hmx=hx(h+λ)m=x(h+λ)m+1
which proves (12).
Let x,y,h∈A be such that
[y,x]=h,[h,x]=2x,[h,y]=−2y(15)
(i) For m,n∈N, we have
(n)(m)(m−p)∑(m+n−p−1−h)(n−p)
xy = yx. (16)
p≥0
(ii) Let A′ be the Z-subalgebra of A generated by the x(m) and the y(m) for m∈N. Then (nh)∈A′ for all n∈N.
Formula (16) can be written in the equivalent form
(n)(m)(m−p)∑(m+n−p−1−h)(n−p)
(ad x)y = yx.(17m)
p≥1
This is trivial for m=0. We argue by induction on m. From (17m), we obtain
(m+ 1)(ad x(n))y(m+1)= (ad x(n))y(m).y+y(m).(ad x(n))y (18)
(m−p)(m+n−p−1−h)(n−p)(m)−
=∑yxy+y(n−1−h)x(n1)
p≥1
(§1, no. 1, Lemma 1). Now, applying the same lemma, and then Lemma 3,
we have
(m+n−p−1−h)(n−p)
(m+n−p−1−h)(n−p)−−
= (yx+(n−p−1−h)x(np1))
(m+n−p+1−h)(n−p)
(m+n−p−1−h)−−
+ (n−p−1−h)x(np1).
Inserting this into (18), we obtain
(m+ 1)(ad x(n))y(m+1)
−(m+n−p+1−h)−
=∑(m−p+1)y(mp+1)x(np)
p≥1
−(m+n−p−1−h)−−
+∑y(mp)(n−p−1−h)x(np1)
p≥1
+y(m)(n−1−h)x(n−1)
−(m+n−p+1−h)−
=∑(m−p+1)y(mp+1)x(np)
p≥1
(m−p)(m+n−p−1−h)−−
+∑y(n−p−1−h)x(np1).
p≥0 Changing p to p−1 in the second sum, and regrouping the terms, we obtain
(m+ 1)(ad x(n))y(m+1)=∑p≥1y(m−p+1)Apx(n−p) (19)
with
(m+n−p+1−h)(m+n−p−h)
Ap=(m−p+1)+(n−p−h).
Putting z=m+n−p−h, this can also be written as
Ap=p1!(m−p+1)(z+1)z(z−1)...(z−p+2)
+ 1 (z−m)z(z−1)...(z−p+2)
(p− 1)!
=p1! z(z−1)...(z−p+2)[(m−p+1)(z+1)+p(z−m)]
(z)((m+1)+n−p−1−h)
=(m+1)=(m+1)
Inserting this into (19), we obtain (17m+1), hence (i).
Assume that (ph)∈A′ for p<n. Then, for all P∈Q[T] of degree <n such that P(Z)⊂Z, we have P(h)∈A′ (no. 4, Cor. of Prop. 2). Hence, in view of (16) with m=n,
(h)(n−1−h)
(−1)n =
−n−1(2n−p−1−h)−′
=−x(n)y(n)+∑y(np)x(np)∈A ;
p=0
hence (ii) by induction on n.
6. Biorders in the enveloping algebra of a split reductive Lie algebra
Let g be a reductive Lie algebra over Q,h a splitting Cartan subalgebra of g, and R=R(g,h)(§2, no. 1, Remark 5).
Definition 1 0183
A lattice H in h is said to be permissible (relative to g) if, for all α∈R, we have Hα∈H and α(H)⊂Z.
(i) U+ is a lattice in the vector space U(n+).
(ii) For all α∈B, we have U+∩U(gα)=⨁n∈NZxα(n).
By definition, U+ is generated as a Z-module by the elements
x(φn) = 1≤∏i≤rx(φn((ii)))
where r∈N,φ=(φ(i))∈Br, and n=(n(i))∈Nr. Give the algebra U(n+) the graduation of type Q(R) for which each gα(α∈R+) is homogeneous of degree α. A monomial xφ(n) of the preceding type is homogeneous of degree
1≤i≤r∑n(i)φ(i)∈Q(R)
The monomials of this kind having a given degree q are finite in number, and generate over Q the homogeneous component of U(n+) of degree q. This proves (i).
If α∈B,U+∩U(gα) is contained in the sum of the homogeneous components of degrees which are multiples of α; thus, by the preceding, U+∩U(gα) is generated by the xφ(n) such that ∑n(i)φ(i)∈Nα, which forces φ(i)=α for all i (since B is a basis of R), so
xφ(n)=xα(n(1))...xα(n(r))=(n(1)+n(1)!⋯...n+(nr)!(r))! xα(n(1)+⋅⋅⋅+n(r)).
Thus, U+∩U(gα)⊂⨁nZxα(n), hence (ii). Q.E.D.
In the remainder of this paragraph, if E and F are Z-submodules of U(g), we denote by E.F the Z-submodule of U(g) generated by the products ab, where a∈E,b∈F.
Proposition 3 0188
Let H be a permissible lattice in h. Let U+,U−,U0 be the Z-subalgebras of U(g) generated respectively by the elements xα(n) (α∈B,n∈N),yα(n)(α∈B,n∈N),(nh)(h∈H,n∈N). Let U be the Z-subalgebra of U(g) generated by U+,U−,U0.
(i) U is a biorder in the bigebra U(g).
(ii) We have U=U−.U0.U+,U∩h=H and, for all α∈B,
U∩gα=Zxα,V∩g−α=Zyα
By Lemma 5 and Prop. 2,U+,U−,U0 are orders in the Q-algebras U(n+),U(n−),U(h), respectively, and
∈U0 for h∈H,q∈Z,p∈N. (23)
Put L=U−.U0.U+⊂U(g). By (22), L is a lattice in U(g). By construction,
U−.L⊂L(24)
L.U+⊂L(25)
while Lemma 3 and (23) imply that
U0.L⊂L(26)
L.U0⊂L(27)
Let α∈B,n∈N,r∈N,φ=(φ(i))∈Br, and
(m(1),...,m(r))∈Nr
We show that
xα(n)yφ(1)(m(1))...yφ(r)(m(r))∈L(28)
or equivalently, in view of (25), that
[xα(n),yφ(1)(m(1))...yφ(r)(m(r))]∈L(29)
We argue by induction on r. The bracket to be studied is the sum of the terms
(m(1))(m(k))(n)(m(k+1))(m(k+2))(m(r))
yφ(1)...yφ(k)[xα,yφ(k+1)]yφ(k+2)...yφ(r). (30) For α=φ(k+1),xα and yφ(k+1) commute, so [xα(n),yφ(k+1)(m(k+1))]=0. If α=φ(k+1), the expression (30) is, by (17), the sum of expressions of the form
(m(1))(m(k))(m(k+1)−p)(q−h)(n−p)(m(k+2))(m(r))
yφ(1)...yφ(k)yφ(k+1)xαyφ(k+2)...yφ(r)(31)
where q∈Z,p∈ N -- {0},h∈H. The induction hypothesis, together with (24) and (26), proves that the expression (31) belongs to L. We have thus proved (28).
By (28), xα(n)U−⊂L; thus, by (25) and (27), xα(n)L⊂L, so U+.L⊂L and
L.L⊂U−.U0.L⊂U−.L⊂L
Thus, L is a Z-subalgebra of U(g), so U=L. If c is the coproduct of U(g),c(U)⊂U⊗ZU (no. 2, Prop. 1). Let γ be the counit of U(g). Since γ(xα(n))=γ(yα(n))=γ((nh))=0 for n>0, we have γ(U)⊂Z. This proves (i). On the other hand,
U∩h=L∩h=U0∩h=H
by Prop. 2 of no. 4; similarly,
U∩gα=U+∩gα=Zxα
by Lemma 5. This proves (ii).
Corollary 1 018A
Put G=U∩g. Then G is an order in the Lie algebra g, stable under θ. We have G=H+∑α∈R(G∩gα). For all α∈B and all n∈N, the maps (ad xα)n/n!, (ad yα)n/n! leave U and G stable.
The first assertion is clear. The second follows by considering the graduation of type Q(R) on U(g) and U. The third follows from Lemma 2 of no. 5.
Corollary 2 018B
Let w∈W. There exists an elementary automorphism φ of g that commutes with θ, leaves G and U stable, and extends w.
It suffices to treat the case in which w is of the form sα(α∈B). Note first of all that ad xα and ad yα are locally nilpotent on U(g), in other words that for all u∈U(g) there exists an integer n such that (ad xα)nu= (ad yα)nu=0.
This enables us to define the automorphisms eadxα=∑n=0∞n!1(ad xα)n and eadyα of U(g); we verify immediately that these automorphisms of U(g) leave U stable. Put φ1=eadxαeadyαeadxα,φ2=eadyαeadxαeadyα. We have φ1∣g= φ2∣g(§2, no. 2, formula (1)), so φ1=φ2. Put φ1=φ2=φ. We have θφθ−1=φ, so θ and φ commute. On the other hand, φ∣h=w by §2, no. 2, Lemma 1.
Corollary 3 018C
Let α∈R. If x∈G∩gα and n∈N, we have x(n)∈U, and (ad x)n/n! leaves G and U stable.
This is clear if α∈B, by construction of U and Cor. 1. In the general case, there exists w∈W such that w(α)∈B (Chap. VI, §1, no. 5, Prop. 15). By Cor. 2, there exists an automorphism φ of g that leaves G and U stable and takes gα to gw(α), hence the corollary by transport of structure.
Corollary 4 018D
There exists a Chevalley system (Xα)α∈R in (g,h)(§2, no. 4, Def. 3) such that Xα=xα and X−α=yα for α∈B. For every Chevalley system (Xα′)α∈R having these properties, and for all α∈R,Xα′ is a basis of G∩gα.
For α∈B, put Xα=xα,X−α=yα. For α∈R+ -- B, choose a w∈W such that w(α)∈B and an automorphism φ of g such that θφ=φθ,φ(G)=G and φ(h)=w−1(h) for h∈h (Cor. 2); put Xα=φ(xw(α)),X−α=φ(yw(α)). Then
[X−α,Xα]=φ([yw(α),xw(α)])=φ(Hw(α))=w−1(Hw(α))=Hα
θ(Xα)=θφ(xw(α))=φθ(xw(α))=φ(yw(α))=X−α
so (Xα)α∈R is a Chevalley system. Moreover,
G∩gα=φ(G∩gw(α))=φ(Zxw(α))=ZXα(32)
G∩g−α=φ(G∩g−w(α))=φ(Zyw(α))=ZX−α(33)
Let (Xα′)α∈R be a Chevalley system such that Xα′=xα,X−α′=yα for α∈B. Let S be the set of α∈R such that Xα′=±Xα. By §2, no. 4, Prop. 7, S is a closed set of roots. Since S⊃B∪(−B), we have S = R (Chap. VI, §1, no. 6, Prop. 19). Thus, by (32) and (33), we have G∩gα=ZXα′ for all α∈R.
7. Chevalley orders
Let (g,h) be a split reductive Lie algebra over Q,R its root system. Choose:
a) a permissible lattice H in h (no. 6, Def. 1);
b) for all α∈R, a lattice Gα in gα.
Put G=H⊕∑α∈RGα. This is a lattice in g. Denote by U the Z-subalgebra
of U(g) generated by the (nh)(h∈H,n∈N) and the x(n)(x∈Gα,α∈R, n∈N). Finally, for α∈R and x∈gα -- {0}, put
wα(x)= (exp ad x)(exp ad y)(exp ad x),
where y is the unique element of g−α such that [y,x]=Hα. With these notations:
Theorem 2 018G
The following conditions are equivalent:
(i) There exists a Chevalley system (Xα)α∈R of (g,h) such that Gα=ZXα for all α∈R.
(ii) U∩g=G and [Gα,G−α]=ZHα for all α∈R.
(iii) For all α∈R,x∈Gα,n∈N, the endomorphism (ad x)n/n! of g maps G to G, and [Gα,G−α]=ZHα.
(iv) For all α∈R and every basis x of Gα,wα(x) maps G to G(that is, maps Gβ to Gsα(β) for all β∈R).
(i) =⇒ (ii): let (Xα)α∈R be a Chevalley system in (g,h) such that Gα= ZXα for all α∈R, and let B be a basis of R. For α∈B, put xα=Xα,yα= X−α. Let U′ be the biorder associated by Prop. 3 of no. 6 to H, the xα and the yα. It is clear that U′⊂U. By Cor. 3 and 4 of Prop. 3,x(n)∈U′ for all α∈R,x∈Gα and n∈N. Thus U=U′, which proves (ii).
(ii) =⇒ (iii): this is clear by Lemma 2 of no. 5.
(iii) =⇒ (iv): let α∈R and let x be a basis of Gα. Since [Gα,G−α]=ZHα, the unique y∈g−α such that [y,x]=Hα belongs to G−α. Since exp ad x and exp ad y leave G stable by (iii), so does wα(x).
(iv) =⇒ (i): let B be a basis of R. Choose a basis xα of Gα for all α∈B. Let yα∈G−α be such that [yα,xα]=Hα. By §1, no. 5, formulas (5), we have yα=wα(xα).xα so yα is a basis of G−α by (iv). Let G′ be the order in g defined by H, the xα and the yα (no. 6, Cor. 1 of Prop. 3). Then G′ is stable under the (ad xα)n/n!, (ad yα)n/n! (loc. cit.), and hence under the wα(xα).
Now let β∈R. There exist α0,α1,...,αr∈B such that
β=sαrsαr−1...sα1(α0)
(Chap. VI, §1, no. 5, Prop. 15). Then wαr(xαr).wαr−1(xαr−1)...wα1(xα1) maps Gα0 to Gβ by (iv), and maps G′∩gα0 to G′∩gβ by the preceding. Since G′∩gα0=Gα0 (Prop. 3 (ii)), we have G′∩gβ=Gβ. Thus
G′=H⊕β∈R∑(G′∩gβ)=H⊕β∈R∑Gβ=G
and Cor. 4 of Prop. 3 concludes the proof.
Definition 2 018H
When conditions (i) to (iv) of Th. 2 are satisfied, G is said to be a Chevalley order in (g,h).
Theorem 3 018J
We retain the notations at the beginning of no. 7, and assume that G is a Chevalley order in (g,h).
(i) U is a biorder in U(g).
(ii) Let B be a basis of R, and (Xα)α∈B∪(−B) a family of elements of g such that Gα=ZXα for α∈B∪(−B). The Z-algebra U is generated by the (nh) and the Xα(n)(h∈H,α∈B∪(−B),n∈N). If g is semi-simple and H=Q(R∨), the Z-algebra U is generated by the Xα(n)(α∈B∪(−B),n∈N).
(iii) Let B be a basis of R, R+ the corresponding set of positive roots, R−=−R+,n+=∑α∈R+gα,n−=∑α∈R−gα. Then,
U=(U∩U(n−)).(U∩U(h)).(U∩U(n+))
Let (hi)i∈I be a basis of H. For all α∈R, let Xα be a basis of Gα. Give the set I∪R a total order (we assume that I∩R=∅ ). For λ∈I∪R and n∈N, put eλ⟨n⟩=(nhλ) if λ∈I,eλ⟨n⟩=Xλ(n) if λ∈R. Then the products ∏λ∈I∪Reλ⟨nλ⟩, where (nλ) belongs to NI∪R, form a basis of the Z-module U. The
products ∏λ∈I(nλhλ), where (nλ) belongs to NI, form a basis of the Z-module U∩U(h). The products ∏λ∈R+Xλ(nλ), where (nλ) belongs to NR+, form a basis of the Z-module U∩U(n+).
Let B and (Xα)α∈B∪(−B) be as in (ii), and such that [X−α,Xα]=Hα. Let U′ be the Z-subalgebra of U(g) generated by the (nh) and the Xα(n) (h∈H,α∈B∪(−B),n∈N). We have seen in the proof of Th. 2, (i) =⇒ (ii), that U′ is equal to U and is a biorder in U(g). This proves (i) and the first assertion of (ii); the second follows from Lemma 4 (ii). Assertion (iii) follows from Th. 1 (no. 3) and Prop. 3 (no. 6).
8. Admissible lattices
Generalizing the terminology adopted for vector spaces, an endomorphism u of a module M is said to be diagonalizable if there exists a basis of M such that the matrix of u relative to this basis is diagonal.
Let M be a free Z-module of finite type, u an endomorphism of M, and v the endomorphism u⊗1 of M⊗ZQ. Assume that (nv)(M)⊂M for all n∈N. Then u is diagonalizable.
a) For any polynomial P∈Q[T] such that P(Z)⊂Z, we have P(v)(M)⊂M (no. 4, Cor. of Prop. 2), so det P(v)∈Z.
b) Denote by χv(t)=td+α1td−1+⋯ the characteristic polynomial of v. Let k∈Z,n∈N. Applying a) to the polynomial (nT−k), we see that the number
an= det (v−k)=1d det(v−k) det(v−k−1)... det(v−k−n+1)
n(n!)
=4(−1)nχv(k)χv(k+1)...χv(k+n−1)
(n!)
is an integer. Take k−1<−α1/d. Then
χv(k+n−1)=nd+(α1+(k−1)d)nd−1+⋯
and
∣an∣=d∣χv(k+n−1)∣∣an−1∣
hence, if an=0 for all n∈N, the sequence of the ∣an∣ is strictly decreasing for n sufficiently large, which is absurd. It follows that v has an integer eigenvalue λ. Put M′= Ker(u−λ.1) and M′′=M/M′. Then M′ is the intersection with M of a vector subspace of M⊗ZQ, so the Z-module M′′ is torsion-free of finite type, and consequently free of rank <d. Arguing by induction on d and applying the induction hypothesis to the endomorphism of M′′ induced by u, we conclude that all the eigenvalues of v in an algebraically closed extension of Q are integers.
c) We show that v is diagonalizable. Let λ be an eigenvalue of v and let x∈M⊗ZQ be such that (v−λ)2x=0. We have v(vx−λx)=λ(vx−λx), so
n1!(v−λ−n+1)(v−λ−n+2)...(v−λ−1)(v−λ)x
=n(−1)n−1(vx−λx)
By a), this implies that vx−λx∈nM for all n∈N, so (v−λ)x=0.
d) Let λ be an eigenvalue of v and let λ−a,λ+b be an interval in Z containing all the eigenvalues of v. Consider the polynomial
(T−λ−1)(T−λ−2)...(T−λ−b)
P(T)=(−1)b
b!
(T−λ+1)(T−λ+2)...(T−λ+a)
a!
We have P(Z)⊂Z,P(λ)=1,P(μ)=0 for μ∈Z∩(λ−a,λ+b) and μ=λ. By a),P(v)(M)⊂M. By c),P(v) is a projection of M⊗ZQ onto the eigenspace corresponding to λ. Q.E.D.
Definition 3 018M
Let E be a g-module. A lattice E in E is said to be admissible (relative to G) if the following conditions are satisfied:
(i) U maps E to E;
(ii) E is stable under (nh) and x(n) for all α∈R,x∈Gα,n∈N,h∈H.
Theorem 4 018R
Let E be a finite dimensional g-module. The following conditions are equivalent:
(i) E has an admissible lattice;
(ii) every element of H defines a diagonalizable endomorphism of E with integer eigenvalues.
(i) =⇒ (ii): this follows from Remark 3.
(ii) =⇒ (i): we assume that condition (ii) is satisfied and prove (i). By Th. 4 of Chap. I, §6, no. 5, we can assume that the elements of c define homotheties of E, and that E is a simple Dg-module. Let B be a basis of R, and g=n−⊕h⊕n+ the corresponding decomposition of g. Let λ be the highest weight of the Dg-module E, and let e∈Eλ -- {0}. Put E=U.e. It is clear that U.E⊂E. Since E is simple, U(g).e=E and hence E generates E as a Q-vector space. For h∈H and n∈N, we have (nh)e=(nλ(h))e∈Ze, so
(U∩U(h)).e=Ze
Since U(n+).e=0, we have E=(U∩U(n−)).e by Prop. 3. It now follows from Th. 3 (iii) that E is a Z-module of finite type.
Corollary 018S
If g is semi-simple and H=Q(R∨), every finite dimensional g-module has an admissible lattice.