Proposition 13
Tag 06CJ, permanent. Cite it as [Bourbaki, Tag 06CJ].
Algebra, chapter IV, § 4. Formal power series
— In Q[[X,Y]] we have eX+Y=eXeY.
For the binomial formula gives
n!(X+Y)n=i+j=n∑i!Xij!Yj
Hence
eXeY=(i≥0∑i!Xi)(j≥0∑j!Yj)=i,j≥0∑i!Xij!Yj=n≥0∑i+j=n∑i!Xij!Yj
=n≥0∑n!(X+Y)n=eX+Y.
We shall define two elements e(X), I(X) of Q[[X]] by
e(X)=eX−1=n≥1∑n!Xn
(34)
l(X)=n≥1∑(−1)n−1nXn.
We have (35)
e(X+Y)=e(X)+e(Y)+e(X)e(Y) (36)
D(eX)=D(e(X))=eX (37)
D(l(X))=n≥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.