The S(ep) for p∈P∩C form a basis of the A-module A[P]W.
ei0=xi0−j<i0∑ai0jej,
from which (b) follows. Hence J′∈S, a contradiction. Thus, J=I and the lemma is proved.
We now prove Prop. 3. We apply Lemma 4 with I=P∩C. Let q∈I, and let Iq be the set of p∈I such that p≤q. If p∈Iq, the relations
q−p≥0,p∈C,q∈C
imply that
(q−p∣p)≥0and(q−p∣q)≥0,
and hence that
(p∣p)≤(p∣q)≤(q∣q).
The set Iq is thus bounded. Since I is discrete, it follows that Iq is finite, and it is clear that I satisfies the condition (MIN). On the other hand, for all p∈I,
xp=ep+q<p∑cpqeq
so by (6).
xp=S(ep)+q<p,q∈I∑cpqS(eq).
The proposition now follows from Lemmas 3 and 4.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.