Let n be an integer > 0, T1,…,Tn indeterminates and u1,…,un elements of Z. Let (c(α))α∈Nn−{0} be a family of elements of Z such that
1−i=1∑nuiTi=α=0∏(1−Tα)c(α).
For all α∈Nn−{0},
c(α)=∣α∣1d∣α∑μ(d)(α/d)!(∣α∣/d)!uα/d
where μ is the Möbius function (Appendix).
Formula (7) is equivalent, on taking logarithms on both sides (Algebra, Chapter IV, § 6, no. 9) to:
log(1−i=1∑nuiTi)=α=0∑c(α)log(1−Tα).
Now
−log(1−i=1∑nuiTi)=j≥1∑j1(i=1∑nuiTi)j
=j≥1∑j1∣β∣=j∑β!∣β∣!uβTβ
=∣β∣>0∑∣β∣1β!∣β∣!uβTβ.
On the other hand
−α=0∑c(α)log(1−Tα)=∣α∣>0,k≥1∑k1c(α)Tkα
=∣β∣>0,k∣β∑k1c(kβ)Tβ.
Hence (7) is equivalent to
k∣β∑kβc(kβ)=β!∣β∣!uβfor all β∈Nn−{0}.
Let Λ be the set of (λ1,λ2,…,λn)∈Nn−{0} such that the g.c.d. of λ1,λ2,…,λn is equal to 1. Every element of Nn−{0} can be written uniquely in the form mλ, where m is an integer ⩾1 and λ∈Λ. Condition (12) is equivalent to
k∣m∑kmλc(kmλ)=(mλ)!(m∣λ∣)!umλfor all λ∈Λ and all m⩾1.
By the Möbius inversion formula (Appendix), condition (13) is equivalent to
∣mλ∣c(mλ)=d∣m∑μ(d)(dmλ)!dmλ!udmλ
for all λ∈Λ and all m⩾1.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.