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).
Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.