Bourbaki

Proposition 13

Tag 06CJ, permanent. Cite it as [Bourbaki, Tag 06CJ].

Algebra, chapter IV, § 4. Formal power series

— In Q[[X,Y]]Q[[X, Y]] we have eX+Y=eXeYe^{X+Y} = e^X e^Y.

For the binomial formula gives

(X+Y)nn!=∑i+j=nXii!Yjj! \frac{(X+Y)^n}{n!} = \sum_{i+j=n} \frac{X^i}{i!} \frac{Y^j}{j!}

Hence

eXeY=(∑i≥0Xii!)(∑j≥0Yjj!)=∑i,j≥0Xii!Yjj!=∑n≥0∑i+j=nXii!Yjj! e^X e^Y = \left( \sum_{i \geq 0} \frac{X^i}{i!} \right) \left( \sum_{j \geq 0} \frac{Y^j}{j!} \right) = \sum_{i,j \geq 0} \frac{X^i}{i!} \frac{Y^j}{j!} = \sum_{n \geq 0} \sum_{i+j=n} \frac{X^i}{i!} \frac{Y^j}{j!}
=∑n≥0(X+Y)nn!=eX+Y. = \sum_{n \geq 0} \frac{(X+Y)^n}{n!} = e^{X+Y}.

We shall define two elements e(X)e(X), I(X) of Q[[X]]Q[[X]] by

e(X)=eX−1=∑n≥1Xnn! e(X) = e^X - 1 = \sum_{n \geq 1} \frac{X^n}{n!}

(34)

l(X)=∑n≥1(−1)n−1Xnn. l(X) = \sum_{n \geq 1} (-1)^{n-1} \frac{X^n}{n}.

We have (35)

e(X+Y)=e(X)+e(Y)+e(X)e(Y) e(X+Y) = e(X) + e(Y) + e(X)e(Y)
(36)
D(eX)=D(e(X))=eX D(e^X) = D(e(X)) = e^X
(37)
D(l(X))=∑n≥0(−X)n=(1+X)−1. D(l(X)) = \sum_{n \geq 0} (-X)^n = (1+X)^{-1}.

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

Cited by

Cites

Nothing.

Transcribed from the printed edition, 2003, Springer. Not translated.