How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Cartan's solvability criterion
Statement
Let be finite-dimensional over a characteristic-zero field. Then is solvable if and only if .
More generally, a finite-dimensional linear Lie algebra is solvable if for all and ; when is solvable, these traces do vanish.
Facts & Assumptions
Given: Finite-dimensional vector spaces and Lie algebras over a field of characteristic zero.
Every finite-dimensional representation of a solvable algebra over an algebraically closed characteristic-zero field is simultaneously upper triangularizable (Simultaneous triangularization of solvable representations).
If every adjoint operator of a finite-dimensional algebra is nilpotent, that algebra is nilpotent (Engel's theorem).
An algebra is solvable exactly when its derived algebra is nilpotent in the linear situation used here (Solvability criterion via the derived algebra).
Solvable ideals and solvable quotients give solvable extensions (Subalgebras, quotients, and extensions of solvable Lie algebras).
Finite-dimensional traces are cyclic (For and , ).
Every finite-dimensional endomorphism over an algebraically closed field has Jordan canonical form (Every finite-dimensional endomorphism over an algebraically closed field has Jordan form).
The Killing form is the trace form of the adjoint representation (Killing form).
Proof
Suppose first that is solvable. Choose bases of and , and let be the subfield generated over by the finitely many structure constants and matrix entries. The resulting -form is solvable because its derived series becomes that of after the faithful scalar extension . The finitely generated field embeds in . Over , [L1] gives a basis in which is upper triangular and its derived algebra is strictly upper triangular. Thus for all and . These finitely many bilinear identities hold over and hence after extension to .
We prove the converse first under the stronger hypothesis for every . Choose bases and let be the characteristic-zero subfield generated by the finitely many matrix entries of a basis of and its structure constants. The strong trace hypothesis is determined by the finitely many pairs of basis vectors, so it persists after extending the resulting -form to . Solvability over descends because every derived term commutes with scalar extension. We may therefore carry out the strong converse over .
Over , fix . By [L6], choose a Jordan basis on and write , where is diagonal, is block-nilpotent, and they commute. The commuting left and right multiplication operators on show that the semisimple part of is . Write the diagonal entries of as , and let have diagonal entries . On the generalized eigenspaces of , has eigenvalues . Finite Hermite interpolation on the finitely many differences , taking zero to zero, expresses as a polynomial without constant term in . Since is stable under , it follows that .
Write as a finite sum of commutators. By [L5], . Step 1.3 and the strong trace hypothesis therefore give . In the Jordan basis this trace is , so every and is nilpotent. If on , then the commuting operators on satisfy , because every binomial term contains either or . Restriction to the invariant derived algebra shows that each of its adjoint operators is nilpotent. Hence [L2] makes nilpotent, and [L3] makes solvable.
Under the stated weaker hypothesis, apply steps 1.2–2.1 to the linear Lie algebra : the required strong trace vanishing holds for every pair in it. Its solvability implies solvability of by the derived-series definition. Together with step 1.1 this proves the linear criterion.
Apply the linear criterion to . Its derived algebra is , and [L7] says that the trace hypothesis is precisely the asserted Killing-form condition. Hence is solvable. The exact sequence has abelian kernel, so [L4] makes solvable. The reverse direction is step 1.1 for the adjoint representation. The zero algebra makes both conditions vacuous and is solvable.
Depends on
- Killing form
- Simultaneous triangularization of solvable representations
- Engel's theorem
- Solvability criterion via the derived algebra
- Subalgebras, quotients, and extensions of solvable Lie algebras
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- Every finite-dimensional endomorphism over an algebraically closed field has Jordan form
Used by
- Cartan's semisimplicity criterion Theorem
- Second Whitehead lemma Theorem
- Weyl's complete reducibility theorem Theorem
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Milne, Lie Algebras, Theorem 3.17 and Corollary 3.18 (standard reference, not scraped)