Let a be a subalgebra of g stable under adh, and let h′⊂h, P⊂R be such that a=h′+gP.
(i) Let k be the set of x∈h′ such that α(x)=0 for all α∈P∩(−P). The radical of a is k+gQ, where Q is the set of α∈P such that −α∈/P. Moreover, gQ is a nilpotent ideal of a.
(ii) a is semi-simple if and only if P=−P and h′=hP.
(iii) a is solvable if and only if P∩(−P)=∅. In that case [a,a]=gS, where
S=((P+P)∩R)∪{α∈P∣α(h′)=0}
(iv) a is reductive in g if and only if P=−P.
(v) a consists of nilpotent elements if and only if h′=0. Then P∩(−P)= ∅, and a is nilpotent.
We prove (v). If a consists of nilpotent elements, a is clearly nilpotent, and h′=0 since the elements of h are semi-simple. Assume that h′=0. By Prop. 1 (i), P∩(−P)=∅. By Chap. VI, §1, no. 7, Prop. 22, there exists a chamber C of R such that P⊂R+(C). Hence, there exists an integer n>0 with the following properties: if α1,...,αn∈P and β∈R∪{0}, then
α1+⋯+αn+β∈/R∪{0}
This implies that every element of gP is nilpotent, hence (v).
We prove (iii). If P∩(−P)=∅,gP is a subalgebra of g (Prop. 1 (i)), and is nilpotent by (v). Now
[a,a]=[h′,gP]+[gP,gP]=[h′,gP]+g(P+P)∩R⊂gP
so a is solvable and [a,a] is given by the formula in the proposition. If P∩(−P)=∅, let α∈P be such that −α∈P. Then hα+gα+g−α is a simple subalgebra of a so a is not solvable.
We prove (i). Since P is closed, (P+Q)∩R⊂P. If α∈P,β∈Q and α+β∈R, we cannot have α+β∈−P, for, P being closed, this would imply that −β=−(α+β)+α∈P whereas β∈Q; thus, (P+Q)∩R⊂Q. This proves that gQ is an ideal of a, nilpotent by (v). We have P∩(−Q)=∅, and P∩(−P)=P∩∁Q, so hP∩(−Q)⊂k⊂⋂α∈P,α∈/Q Kerα. By Prop. 1 (ii),
k+gQ is an ideal of a. Since Q∩(−Q)=∅, this ideal is solvable by (iii). It is therefore contained in the radical r of a. Since r is stable under every derivation of a,r is stable under ad h. Hence there exists a subset S of P such that r=(r∩h)+gS. Suppose that α∈S and that −α∈P. Then hα=[gα,g−α]⊂r, so g−α=[hα,g−α]⊂r=0, so that −α∈S; by (iii), this contradicts the fact that r is solvable. Consequently, S⊂Q. Finally, if x∈r∩h and if α∈P∩(−P), then [x,gα]⊂gα∩r=0, so α(x)=0; this shows that x∈k. Hence r⊂k+gQ and the proof of (i) is complete.
We prove (iv). By (i), the adjoint representation of a on g is semi-simple if and only if adgx is semi-simple for all x∈k+gQ (Chap. I, §6, no. 5, Th. 4); by (v), this is the case if and only if Q=∅, in other words P=−P.
We prove (ii). If a is semi-simple, P=−P by (i), so hP⊂h′; further, a=[a,a]⊂hP+gP and consequently h′=hP. If P=−P and h′=hP,a is reductive by (iv), and a=∑α∈Psα, so a=[a,a] and a is semi-simple.
Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.