Bourbaki

Lemma 1

Tag 0A49, permanent. Cite it as [Bourbaki, Tag 0A49].

Lie Groups and Lie Algebras, chapter II, § 3. Enveloping algebra of the free Lie algebra

Let n be an integer > 0, T1,…,TnT_1, \ldots, T_n indeterminates and u1,…,unu_1, \ldots, u_n elements of Z\mathbf{Z}. Let (c(α))α∈Nn−{0}(c(\alpha))_{\alpha \in \mathbf{N}^n - \{0\}} be a family of elements of Z\mathbf{Z} such that

1−∑i=1nuiTi=∏α≠0(1−Tα)c(α). 1 - \sum_{i=1}^n u_i T_i = \prod_{\alpha \neq 0} (1 - T^\alpha)^{c(\alpha)}.

For all α∈Nn−{0}\alpha \in \mathbf{N}^n - \{0\},

c(α)=1∣α∣∑d∣αμ(d)(∣α∣/d)!(α/d)!uα/d c(\alpha) = \frac{1}{|\alpha|} \sum_{d|\alpha} \mu(d) \frac{(|\alpha|/d)!}{(\alpha/d)!} u^{\alpha/d}

where μ\mu 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=1nuiTi)=∑α≠0c(α)log⁡(1−Tα). \log \left( 1 - \sum_{i=1}^n u_i T_i \right) = \sum_{\alpha \neq 0} c(\alpha) \log (1 - T^\alpha).

Now

−log⁡(1−∑i=1nuiTi)=∑j≥11j(∑i=1nuiTi)j -\log \left( 1 - \sum_{i=1}^n u_i T_i \right) = \sum_{j \geq 1} \frac{1}{j} \left( \sum_{i=1}^n u_i T_i \right)^j
=∑j≥11j∑∣β∣=j∣β∣!β!uβTβ = \sum_{j \geq 1} \frac{1}{j} \sum_{|\beta|=j} \frac{|\beta|!}{\beta!} u^\beta T^\beta
=∑∣β∣>01∣β∣∣β∣!β!uβTβ. = \sum_{|\beta|>0} \frac{1}{|\beta|} \frac{|\beta|!}{\beta!} u^\beta T^\beta.

On the other hand

−∑α≠0c(α)log⁡(1−Tα)=∑∣α∣>0,k≥11kc(α)Tkα -\sum_{\alpha \neq 0} c(\alpha) \log (1 - T^\alpha) = \sum_{|\alpha|>0, k \geq 1} \frac{1}{k} c(\alpha) T^{k\alpha}
=∑∣β∣>0,k∣β1kc(βk)Tβ. = \sum_{|\beta|>0, k|\beta} \frac{1}{k} c\left( \frac{\beta}{k} \right) T^\beta.

Hence (7) is equivalent to

∑k∣β∣βk∣c(βk)=∣β∣!β!uβfor all β∈Nn−{0}. \sum_{k|\beta} \left| \frac{\beta}{k} \right| c\left( \frac{\beta}{k} \right) = \frac{|\beta|!}{\beta!} u^\beta \quad \text{for all } \beta \in \mathbf{N}^n - \{0\}.

Let Λ\Lambda be the set of (λ1,λ2,…,λn)∈Nn−{0}(\lambda_1, \lambda_2, \ldots, \lambda_n) \in \mathbf{N}^n - \{0\} such that the g.c.d. of λ1,λ2,…,λn\lambda_1, \lambda_2, \ldots, \lambda_n is equal to 1. Every element of Nn−{0}\mathbf{N}^n - \{0\} can be written uniquely in the form mλm\lambda, where mm is an integer ⩾1\geqslant 1 and λ∈Λ\lambda \in \Lambda. Condition (12) is equivalent to

∑k∣m∣mλk∣c(mλk)=(m∣λ∣)!(mλ)!umλfor all λ∈Λ and all m⩾1. \sum_{k|m} \left| \frac{m\lambda}{k} \right| c\left( \frac{m\lambda}{k} \right) = \frac{(m|\lambda|)!}{(m\lambda)!} u^{m\lambda} \quad \text{for all } \lambda \in \Lambda \text{ and all } m \geqslant 1.

By the Möbius inversion formula (Appendix), condition (13) is equivalent to

∣mλ∣c(mλ)=∑d∣mμ(d)∣mλd∣!(mλd)!umλd |m\lambda| c(m\lambda) = \sum_{d|m} \mu(d) \frac{\left| \frac{m\lambda}{d} \right|!}{\left( \frac{m\lambda}{d} \right)!} u^{\frac{m\lambda}{d}}

for all λ∈Λ\lambda \in \Lambda and all m⩾1m \geqslant 1.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed volume. Not translated.