Let X be a set and n an integer ≥1. (a) Ln+1(X)=[L1(X),Ln(X)]. (b) The module Ln(X) is generated by the elements [x1,[x2,…,[xn−1,xn]…]] where (x1,…,xn) runs through the set of sequences of n elements of X. (c) The lower central series of L(X) is given by Cn(L(X))=∑p≥nLp(X).
(a) We apply Proposition 5 with g=L(X) and P=L1(X). By induction on n, we deduce from (12) (no. 6) and (19) the equality Pn=Ln(X). The desired relation is then equivalent to the definition [P,Pn]=Pn+1. (b) This follows from (a) by induction on n. (c) Let g=L(X) and gn=∑p≥nLp(X). Then g=g1 and formula (13) of no. 6 implies [gn,gm]⊂gn+m and in particular [g,gn]⊂gn+1. By induction on n, Cng⊂gn. On the other hand, from (a) we deduce that Ln(X)⊂Cng by induction on n. As Cng is an ideal of g, the relation Lp(X)⊂Cng implies that
Lp+1(X)=[L1(X),Lp(X)]⊂Cng by (a). Hence
Lp(X)⊂Cng for
p≥n, whence
gn⊂Cng.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.