Let f be an element of the dual E∗ of E. There exists one and only one linear mapping if of T(E) into itself such that
if(1)=0(4) if∘ex+ex∘if=f(x).I(5) for every
x∈E (where I denotes the identity mapping). The mapping
f→if of
E∗ into
L(T(E)) is linear. We have
if(Tn)⊂Tn−1,
(if)2=0, and
if∘ig+ig∘if=0 for
f,g in
E∗. The mapping
if is zero on the subalgebra of
T(E) generated by the kernel of f. The ideal I(Q) is stable under if; passing to the quotient, if therefore defines a linear mapping (still denoted by if) of C(Q) into itself.
Indeed formula (5) can be written
if(x⊗u)=−x⊗if(u)+f(x)⋅u(x∈E, u∈T(E)).
As (4) completely determines if on T0, and since (6) determines if on Tn if its values on Tn−1 are known, the uniqueness of if is proved. On the other hand, for x∈E and u∈Tn−1, the right-hand side of (6) is bilinear on E×Tn−1; this proves the existence of if by induction on n (Chap. III, § 1, No. 2) and also proves, by induction on n, that if(Tn)⊂Tn−1. If f=ag+bh (a, b in A, g, h in E*) it is clear that aig+bih satisfies (4) and (5), hence is equal to if. We have
(if)2∘ex=−if∘ex∘if+f(x)if=ex∘(if)2
and, since (if)2(1)=0, it follows by induction on n that (if)2 is zero on Tn. Replacing f by f+g, the relation (if)2=0 gives if∘ig+ig∘if=0. An analogous reasoning by induction to the preceding ones shows that if is zero on the subalgebra generated by the kernel of f. Finally (6) entails that the set of elements u of I(Q) such that if(u)∈I(Q) is a left ideal of T(E); moreover, if u=(x⊗x−Q(x)⋅1)⊗ν (x∈E, ν∈T(E)), we have
if(u)=f(x)x⊗ν−x⊗if(x⊗ν)−Q(x)if(ν)=f(x)x⊗ν−f(x)x⊗ν+x⊗x⊗if(ν)−Q(x)if(ν)=(x⊗x−Q(x)⋅1)⊗if(ν);
therefore I(Q) is stable under if, and the last assertion follows. QED.
Let F be a bilinear form on E; in the remainder of this paragraph we shall denote by ixF (x∈E) the mapping if corresponding to the linear form f:y→F(x,y) on E.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Nothing.
Nothing.