(i) If x∈M, the pth power of x, calculated in TS(M), is equal to p!γp(x). (ii) Let x1,…,xn∈M; then
γp(x1+x2+⋯+xn)=p1+p2+⋯+pn=p∑γp1(x1)γp2(x2)…γpn(xn). (iii)
Let x1,…,xn∈M,
let p1,…,pn be integers ⩾0 and p=p1+…+pn.
Let E be the set of mappings φ of {1,…,p} into (1,…,n) such that Cardφ−1(1)=p1,…,Cardφ−1(n)=pn. Then γp1(x1)γp2(x2)…γpn(xn)=φ∈E∑xφ(1)⊗xφ(2)⊗…⊗xφ(p). (iv)
Let x∈M and let q,r be integers ⩾0.
Then γq(x)γr(x)=q!r!(q+r)!γq+r(x). (v)
Let x1,…,x,∈M,
and for H⊂(1,…,n) put xH=∑i∈Hxi,
then (−1)nx1x2…xn=H⊂{1,…,n}∑(−1)CardHγn(xH).
The assertion (i) follows at once from Prop. 2 (ii).
Let us prove (ii); by an induction on n we see that it is enough to consider the case n=2. Then we have
γp(x1+x2)=(x1+x2)⊗(x1+x2)⊗...⊗(x1+x2)@factors)
=p1+p2=p∑σ∈Sp1,p2∑σ(x1⊗x1⊗...⊗x1⊗x2⊗x2⊗...⊗x2)
=p1+p2=p∑σ∈Sp1,p2∑σ(γp1(x1)⊗γp2(x2))
=p1+p2=p∑γp1(x1)γp2(x2).
To prove (iii), let Sp1,...,pn be the set of permutations of (1,p1+...+pn) whose restrictions to the intervals
(1,p1),(p1+1,p1+p2),...,(p1+...+pn−1+1,p1+...+pn) are increasing. By I, p. 60, example 2 and Prop. 2, (ii) we have
γp1(x1)γp2(x2)...γpn(xn)=ρ∈Sp1,p2,...,pn∑ρ(x1⊗x1⊗...⊗x1⊗x2⊗x2⊗...⊗x2⊗...⊗xn⊗xn⊗...⊗xn) (with
pi factors
xi) and this sum is equal to
φ∈E∑xφ(1)⊗xφ(2)⊗...⊗xφ(p).
In (iii) let us put n=2,x1=x2=x,p1=q and p2=r, then we obtain (iv) (I, loc. cit.).
Finally (v) follows from Prop. 2, (ii) and Prop. 2 of I, p. 100, applied to the elements xi of the ring T(M).
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.