Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Engel, the trace criterion, and Killing nondegeneracy

Statement

Let V be a finite-dimensional complex vector space. If a Lie subalgebra LEnd(V) consists entirely of nilpotent operators and V0, it has a common nonzero annihilated vector; it admits a basis in which all its operators are strictly upper triangular. If instead L satisfies trV(xy)=0 for all x[L,L], yL, then L is solvable.

For every finite-dimensional complex semisimple Lie algebra, the Killing form B is symmetric, invariant and nondegenerate. All these assertions are choice-free, including the zero Lie algebra.

Facts & Assumptions

Given: The finite-dimensional complex Lie and trace conventions of Finite semisimple Lie algebras and the symmetric adjoint action.

[F1]

A finite-dimensional endomorphism decomposes into the kernels of the irreducible powers in its minimal polynomial by Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels.

[F2]

Finitely many residues at pairwise comaximal polynomial ideals are interpolated by Chinese remainder theorem for pairwise comaximal ideals.

[F3]

Every nonconstant complex polynomial has a complex root by Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root; finite division then splits it into linear factors.

Proof

1.1

If aq=0 on V, the commuting operators of left and right multiplication by a on End(V) give (ada)m(T)=j=0m(1)j(mj)amjTaj. For m2q1 every summand is zero. Hence ada is nilpotent on any invariant subspace or quotient, in particular on a quotient of subalgebras stable under its action.

givenalgebra
1.2

For a finite-dimensional Lie algebra g, trace cyclicity proves symmetry of B. Jacobi and trace cyclicity also give B([x,y],z)=tr([adx,ady]adz)=tr(adx[ady,adz])=B(x,[y,z]). Consequently its radical J={x:B(x,g)=0} is an ideal: B([a,x],y)=B(x,[a,y])=0 for xJ.

givenalgebra
2.1

We record a finite spectral construction. By F3 and F1, an operator x on a nonzero V has a direct-sum decomposition V=λVλ with xVλ=λid+nλ, each nλ nilpotent. Define b to act on Vλ by the scalar λ. For a map in Hom(Vμ,Vλ), adx equals (λμ)id plus the difference of commuting nilpotent left and right actions. Its nilpotent part has exponent at most N=2dimV, by the same binomial expansion as in step 1.1. For every distinct difference a=λμ, F2 supplies a polynomial R(z) with R(z)a(mod(za)N). These ideals are pairwise comaximal: distinct linear factors generate the unit ideal, and expanding a sufficiently high power of such a unit expression proves the same for their Nth powers. Therefore R(adx) acts on this Hom space by λμ, exactly adb. The difference zero is among the interpolation nodes, so R(0)=0. Thus adb=R(adx),R(0)=0. Also tr(bx)=λ(dimVλ)λ2, since each nilpotent block has trace zero.

F1F2F3givenstep 1.1algebra
2.2

Prove the common-zero-vector assertion by induction on dimL, for all finite-dimensional nonzero representation spaces on which every operator is nilpotent. The zero algebra is immediate. Choose a proper subalgebra HL of maximal dimension. For aH, step 1.1 makes its adjoint action on L/H nilpotent. Its image is a Lie algebra of dimension at most dimH<dimL, so the induction hypothesis gives a nonzero coset x+H annihilated by every aH. Hence [H,x]H, and H+Cx is a subalgebra strictly containing H. Maximality forces L=H+Cx and makes H a codimension-one ideal.

step 1.1givenalgebra
3.1

The induction hypothesis applied to H on V makes K={v:Hv=0} nonzero. It is x-invariant because for aH, a(xv)=x(av)+[a,x]v=0. The nilpotent restriction of x to K has a nonzero kernel: take the last nonzero vector in the finite power string of any nonzero vector of K. This vector is killed by both x and H, hence by L, completing the induction. Apply the same common-vector result to successive quotients of V to obtain a finite invariant flag with zero action on each one-dimensional quotient. Lifting a basis of that flag gives strict upper triangularity. A product of dimV strictly upper triangular operators is zero; expanding iterated brackets into products shows this algebra, and every subalgebra of it, is solvable (indeed nilpotent).

step 2.2givenalgebra
3.2

Now suppose the trace-zero hypothesis holds and fix x[L,L]. Use the operator b and polynomial R from step 2.1. Write x=j[yj,zj] with yj,zjL, a finite sum by the definition of the derived subspace. Cyclicity of finite matrix trace gives tr(bx)=jtr([b,yj]zj)=jtr(R(adx)(yj)zj)=0. Indeed [L,L] is an ideal by Jacobi, and R(0)=0 implies R(adx)(yj)[L,L], so each last trace vanishes by the hypothesis. Step 2.1 now gives a sum of nonnegative real numbers λ(dimVλ)λ2=0. Each λ is zero, so x is nilpotent on V.

step 2.1givenalgebra
4.1

Thus every element of [L,L] is a nilpotent operator. Step 3.1 makes this derived algebra solvable. If its derived series vanishes after m steps, that of L vanishes after m+1, proving the trace criterion. If V=0, then L=0 and the same conclusion is immediate without spectral decomposition.

step 3.1step 3.2givenalgebra
5.1

Suppose g is semisimple. For x,yJ, the adjoint actions preserve J and act by zero on g/J. Computing trace in a basis extending one of J gives BJ(x,y)=Bg(x,y)=0. Thus L=adJ(J)End(J) satisfies step 4.1's trace hypothesis and is solvable. Its kernel in J is the center, which is abelian; explicitly, if DmL=0 then DmJ lies in that center and Dm+1J=0. Hence J is a solvable ideal of g and is zero by semisimplicity. This proves nondegeneracy. For g=0 the unique form has zero radical. Every induction, basis, polynomial interpolation and eigenvalue factorization above is finite; no algebraic closure or arbitrary-index selection is taken, so no AC is used.

step 4.1step 1.2F1F2F3givenalgebra

Depends on

Used by

Dependency tree · two levels

17 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